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
The first author is grateful to INES Corporation, Japan for supporting his work as a graduate student at Tokyo Institute of Technology.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Ballardie, T., Francis, P. and Crowcroft, J.: Core Based Trees, in Proceedings of the ACM SIGCOMM San Francisco, 1993
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.
Macedonia, M.R. and Brutzman, D.P.: MBone Provides Audio and Video Across the Internet, IEEE Computer, April 1994, pp. 30–36.
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.
Takahashi, H. and Matsuyama, A., An approximate solution for the Steiner problem in graphs, Mathematica Japonica, Vol. 24, No. 6, 1980, pp. 573–577.
Waitzman, D., Partridge, C., and Deering, S., Distance Vector Multicast Routing Protocol, RFC 1075, November 1988
Waxman, B.M.: Routing of Multipoint Connections, IEEE Journal on Selected Areas in Communications, Vol.6, No.9, December 1988, pp. 1617–1622.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ivanov Radoslavov, P., Tokuda, T. (1997). An algorithm for cost-delay balanced trees and its application to wide area network multicast. In: Masuda, T., Masunaga, Y., Tsukamoto, M. (eds) Worldwide Computing and Its Applications. WWCA 1997. Lecture Notes in Computer Science, vol 1274. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63343-X_55
Download citation
DOI: https://doi.org/10.1007/3-540-63343-X_55
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63343-3
Online ISBN: 978-3-540-69430-4
eBook Packages: Springer Book Archive