Distributed center-location algorithms: proposals and comparisons

  • Authors:

  • David G. Thaler;Chinya V. Ravishankar

  • Affiliations:

  • Electrictal Engineering and Computer Science Department, The University of Michigan, Ann Arbor, Michigan;Electrictal Engineering and Computer Science Department, The University of Michigan, Ann Arbor, Michigan

  • Venue:
  • INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
  • Year:
  • 1996

  • New Center Location Algorithms for Shared Multicast Trees

    NETWORKING '02 Proceedings of the Second International IFIP-TC6 Networking Conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; and Mobile and Wireless Communications

Quantified Score

Hi-index 0.00

Visualization

Abstract

Recent multicast routing protocol proposals such as PIM and CBT have been based on the notion of groupshared 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. While PIM and CBT provisionally use administrative selection of centers or trivial heuristics for locating the center of a group, they do not preclude the use of other methods as long as they provide an ordered list of centers. Other previously proposed heuristics typically require knowledge of the complete network topology, a requirement which tis 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, dudy various heuristics for automating center selection, and examine their applicability to real-world networks. We also propose several new algorithms whach we feel to be more practical than existing methods. We present simulation results showing that of the methods potentially feasible in the Internet Multicast Backbone, ours offer the best results in terms of cost and delay.