Distributed center-location algorithms

D. Thaler

doi:10.1109/49.564129

1997-04-01

PRE

D. Thaler *

Chinya V. Ravishankar

DOI：10.1109/49.564129

原文链接

原文求助

摘要

En 中文

Recent multicast routing protocol proposals such as protocol independent multicast (PIM) and core-based trees (CBT) have been based on the notion of group-shared trees, Since construction of a minimal-cost tree spanning all members of a group is difficult, they rely on center-based trees and distribute packets from all sources over a single shortest-path tree rooted at some center, PIM and CBT provisionally use administrative selection or simple heuristics for locating the center of a group but do not preclude the use of other methods that provide an ordered list of centers, Other previously proposed heuristics typically require knowledge of the complete network topology, a requirement which is not always practical for a distributed problem such as Internet routing, In this paper we investigate the problem of finding a good center in distributed fashion, study various heuristics for automating center selection, and examine their applicability to real-world networks, We also propose several new algorithms which we feel to be more practical than existing methods, We present simulation results on hierarchical and nonhierarchical networks showing that of the methods potentially feasible in the Internet multicast backbone, ours offer the best results in terms of cost and delay, and they incur low overhead.

Keyword:

communication system routing

layout

multicast channels

multicast communication

networks

trees (graphs)