Abstract
With the advent of multimedia applications, the support of on-line multicasting with quality of service (QoS) guarantees has gained considerable attention in the field of communication networks and distributed systems. The objective of this paper is to investigate on-line QoS-based routing and path establishment schemes to support point-to-multipoint connections in wide area networks. We propose SELDOM, a Simple and Efficient Low-cost Delay-bounded Online Multicasting scheme to support on-line multicasting. The scheme is particularly tailored to networks in which group membership changes frequently.
The approach taken by the scheme is unique in the sense that, given a set of QoS requirement specifications of each multicast node and the current status of the network links, SELDOM finds a minimum cost multicast tree that meets these QoS specifications of the supported group members. The scheme handles join requests dynamically by determining the least cost path which satisfies the required delay bounds to which the new group member is to be attached. On the other hand, to handle a leave request, the scheme seeks to limit the rearrangement required in order to reduce the disturbance such a request may cause to current members of the group. The worst time complexity of SELDOM is O(n 2).
The original version of this chapter was revised: The copyright line was incorrect. This has been corrected. The Erratum to this chapter is available at DOI: 10.1007/978-0-387-35388-3_42
Chapter PDF
Similar content being viewed by others
References
Tawfig Alrabiah and Taieb Znati. Low-cost, bounded-delay multicast routing for qos-based networks. Technical Report, TR-98–3, November 1997.
Tawfig Alrabiah and Taieb Znati. A simulation framework for the analysis of multicast tree algorithms. The 30th Annual Simulation Symposium, 30: 196–205, April 1997.
T. Ballardie, P. Francis, and J. Crowcroft. Core-based trees (cgt) an architecture for scalable inter-domain multicast routing. Computer Communcation Review, 23 (4): 85–95, 1993.
F. Bauer and A. Varma. Aries: A rearrangeable inexpensive edge-based on-line steiner algorithm. IEEE Journal on Selected Areas in Communications, 15 (3): 382–397, April 1997.
E. W. Dijkstra. A note on two problems in connection with graphs. Numeriskche Mathematik, 1: 269–271, 1959.
Matthew Doar and Ian Leslie. How bad is naive multicast routing. Proceedings of IEEE INFOCOM, San Francisco, CA: 82–93, April 1993.
D. Estrin, D. Farinacci, A. Helmy, D. Thaler, S. Deering, M. Handley, V. Jacobson, C. Liu, P. Sharma, and L. Wei. Protocol independent multicast-sparse mode (PIM-SM): Protocol specification. Internet RFC 2117, http://ds.internic.net/rfc/rfc2117.txt, June 1997.
S. L. Hakimi. Steiner’s problem in graphs and its implications. Networks, 1: 113–133, November 1971.
Makoto Imase and Bernard Waxman. Dynamic steiner tree problem. SIAM Journal of Discrete Math., 4 (3): 369–384, August 1991.
James Kadirire. Minimizing packet copies in multicast routing by exploiting geographic spread. SIGCOMM Communication Review, 24 (3): 47–62, July 1994.
James Kadirire and Graham Knight. Comparison of dynamic multi-cast routing algorithms for wide-area packet switched (asynchronous transfer mode) networks. IEEE INFOCOM, Boston, 19: 212–218, April 1995.
V. Kompella, J. Pasquale, and G. Polyzos. Multicast routing for multimedia communication. IEEE/ACM Transactions on Networking, 1 (3): 286–292, June 1993.
J. Moy. Multicast routing extensions for OSPF. Communications of the ACM, 37 (8): 61–66, August 1994.
T. Pusateri. Distance vector multicast routing protocol. Internet Draft, February 1997.
Q. Sun and H. Langendoerfer. Efficient multicast routing for delay sensitive applications. Proceedings of Second Workshop Protocols Multimedia Systems (PROMS’95), pages 452–458, April 1995.
H. Takahashi and A. Matsuyama. An approximate solution for the steiner problem in graphs. Mathematica Japonica, 24: 573–577, 1980.
Bernard M. Waxman. Routing of multipoint connections. IEEE Journal on Selected Areas in Communications, 6 (9): 1611–1622, December 1988.
Bernard M. Waxman. Performance evaluation of multipoint routing algorithms. IEEE INFOCOM, pages 980–986, 1993.
Pawel Winter. Steiner problem in networks: A survey. Networks, 17: 129–167, 1987.
Pawel Winter and J. MacGregor Smith. Path-distance heuristics for the steiner problem in undirected networks. Algorithmica, 7: 309–327, 1992.
Q. Zhu, Mehrdad Parsa, and J. Garcia-Luna-Aceves. A source-based algorithm for delay-constrained minimum-cost multicasting. In Proc. IEEE INFOCOM 95, pages 377–385, 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 IFIP International Federation for Information Processing
About this chapter
Cite this chapter
Alrabiah, T., Znati, T.F. (1998). SELDOM: A Simple and Efficient Low-cost, Delay-bounded Online Multicasting. In: van As, H.R. (eds) High Performance Networking. HPN 1998. IFIP — The International Federation for Information Processing, vol 8. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-35388-3_6
Download citation
DOI: https://doi.org/10.1007/978-0-387-35388-3_6
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-5397-4
Online ISBN: 978-0-387-35388-3
eBook Packages: Springer Book Archive