Advertisement

An algorithm for cost-delay balanced trees and its application to wide area network multicast

  • Pavlin Ivanov Radoslavov
  • Takehiro Tokuda
Session C-1: Internet and Protocols
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1274)

Abstract

We present a distributed algorithm for creation of a multicast communication tree based on data-flow discovery. Each receiver chooses its preferable Quality of Service (QoS), namely cheaper cost or shorter delay. For shorter delay QoS, the algorithm uses the shortest path from the receiver to the sender. If a receiver prefers cheaper cost QoS, then the algorithm tries to find an already existing data flow within the receiver's area

Using a parameter we can control the size of the search area so that we can produce a cost/delay optimized communication tree. First we present the flat network version of the algorithm where we use local broadcast to find an already existing data flow. The simulation shows that we can save up to 30% of the tree cost compared to the Shortest Path Tree (SPT). Secondly we present the hierarchical version of our algorithm. We use a Multicast Registration Server tree to search for an existing data flow and to reduce the amount of broadcasted messages

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Ballardie, T., Francis, P. and Crowcroft, J.: Core Based Trees, in Proceedings of the ACM SIGCOMM San Francisco, 1993Google Scholar
  2. 2.
    Deering, S., Estrin, D., Farinacci, D., Jacobson, V., Liu, Ching-Gung, and Wei, L.: An Architecture for Wide-Area Multicast Routing, Proceedings of SIGCOMM'94, October 1994, pp 126–135.Google Scholar
  3. 3.
    Macedonia, M.R. and Brutzman, D.P.: MBone Provides Audio and Video Across the Internet, IEEE Computer, April 1994, pp. 30–36.Google Scholar
  4. 4.
    Miller, R.E. and Thacher, J.W., Reducibility among combinatorial problems, in Complexity of Computer Communications, R. M. Karp, Ed. New York: Plenum, 1972, pp. 85–103.Google Scholar
  5. 5.
    Takahashi, H. and Matsuyama, A., An approximate solution for the Steiner problem in graphs, Mathematica Japonica, Vol. 24, No. 6, 1980, pp. 573–577.Google Scholar
  6. 6.
    Waitzman, D., Partridge, C., and Deering, S., Distance Vector Multicast Routing Protocol, RFC 1075, November 1988Google Scholar
  7. 7.
    Waxman, B.M.: Routing of Multipoint Connections, IEEE Journal on Selected Areas in Communications, Vol.6, No.9, December 1988, pp. 1617–1622.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Pavlin Ivanov Radoslavov
    • 1
  • Takehiro Tokuda
    • 2
  1. 1.Department of Computer ScienceUniversity of Southern CaliforniaLos Angeles
  2. 2.Department of Computer ScienceTokyo Institute of TechnologyTokyoJapan

Personalised recommendations