Optimal cost-sensitive distributed minimum spanning tree algorithm

Abstract

In a network of asynchronous processors, the cost to send a message can differ significantly from one communication link to another. Assume that associated with each link is a positive weight representing the cost of sending one message along the link and the cost of an algorithm executed on a weighted network is the sum of the costs of all messages sent during its execution. We present a distributed Minimum Cost Spanning tree algorithm that is optimal with respect to this cost measure.