Distributed Approximation Allocation Resources Algorithm for Connecting Groups
This paper presents a distributed algorithm to allocate resources (links of a network) for interconnecting machines (forming a group) spread in a network. This is what we call a connection structure for this group of machines. An important innovative feature of our construction method is that we prove (not just simulate on particular and restricted cases) the fact that this structure has good properties in terms of, simultaneously, induced distances (for latency considerations) and cost (for cost considerations). Hence, we propose a distributed multicriteria approximation algorithm.
KeywordsShort Path Approximation Algorithm Span Tree Approximation Ratio Steiner Tree
Unable to display preview. Download preview PDF.
- 1.Irlande, A., König, J.C., Laforest, C.: Construction of low-cost and low-diameter steiner trees for multipoint groups. In: Flammini, M., Nardelli, G.P.E., Spirakis, P. (eds.) Procedings of Sirocco 2000, pp. 197–210. Carleton Scientific (2000)Google Scholar
- 5.Khuller, S., Raghavachari, B., Young, N.: Balancing minimum spanning trees and shortest-path trees. Algorithmica (14), 305–321 (1995)Google Scholar
- 6.Laforest, C.: A good balance between weigth and distances for multipoint trees. In: 6th International Conference On Principles Of DIstributed Systems (OPODIS) (2002)Google Scholar
- 8.Wu, B., Chao, K., Tang, C.: Approximation algorithms for the shortest total path length spanning tree problem. Discrete applied mathematics (105), 239–273 (2000)Google Scholar