Initially, a distribution graph is constructed including {HEAD ~ the above mentioned nodes} spanned out by logical links assigned cost values indicating the cost of transferring data between {TAIL ~ the associated adjacent nodes} 
Initially , a distribution graph is constructed including { HEAD ~ the above mentioned nodes } spanned out by logical links assigned cost values indicating the cost of transferring data between { TAIL ~ the associated adjacent nodes }
OTH OTH OTH OTH OTH OTH OTH OTH HEAD HEAD HEAD HEAD HEAD HEAD HEAD HEAD OTH OTH OTH OTH OTH OTH OTH OTH OTH OTH OTH OTH OTH OTH OTH TAIL TAIL TAIL TAIL TAIL TAIL TAIL TAIL