James Kadirire
Skip Abstract Section
Abstract
Routing connections in a point-to-point network is typically treated as a shortest path problem in a graph. Nodes represent switching systems, edges represent links and the edge lengths represent the costs associated with using a link. With multicast routing, one is interested in the shortest subtree of the network containing a given set of hosts. This is essentially a Steiner Tree problem in graphs and is known to be NP-complete [Karp]. Traditionally, the multicast routing algorithms proposed for packet switched networks like asynchronous transfer mode (ATM) networks have been aimed at minimising the total link cost of the Steiner tree [Waxman88], [Jaffe83] and do not take the geographical spreading of the connections into account. A dynamic point-to-multipoint routing algorithm is proposed, which takes into account the concept of geographic spread (also defined) of the connections and its performance is evaluated against the KMB near optimal heuristic algorithm for solving the Steiner tree problem [Kou].
- {Ammar} M.H. Ammar, S.Y. Cheung and C. M. Scoglio, Routing Multipoint Connections Using Virtual Paths in ATM Network, IEEE INFOCOM 1993 pp 98-105.Google Scholar
- {Bubenik} R. Bubenik, M. Gaddis and J. DeHart. Communicating With Virtual Paths And Virtual Channels. IEEE INFOCOM 1992. Google ScholarDigital Library
- {Chow} C. Chow. On Multicast Path Finding Algorithms, IEEE INFOCOM, 1991 pp 1274-1283.Google ScholarCross Ref
- {Cidon90} I. Cidon, I. Gopal, A. Segall, Fast Connection Establishment In High Speed Networks. Computer Communications Review Vol. 2, No. 4, Sept. 1990. Google ScholarDigital Library
- {Deering91} S. Deering. Multicast Routing In Datagram Internetwork. PhD Thesis, Stanford Uni. '91. Google ScholarDigital Library
- {Dijkstra} E.W. Dijkstra, A Note On Two Problems In Connexion With Graphs. Numerische Mathematik 1, pp 269-271 (1959).Google Scholar
- {Doar} John Matthew Simon Doar, Multicasting In The Asynchronous Transfer Mode Environment. University Of Cambridge, Computer Laboratory Technical Report No. 298, April 1993.Google Scholar
- {Dreyfus} S.E. Dreyfus and R.A. Wagner. The Steiner Problem In Graphs. Networks 1, pp 195-207 1972.Google ScholarCross Ref
- {Gilbert} E.N. Gilbert, Random Graphs, The Annals Of Mathematical Statistics Vol. 30 1959, pp 1141-4.Google ScholarCross Ref
- {Karp} Richard M. Karp, Reducibility Among Combinatorial Problems, in Complexity Of Computer Computations, edited by R.E. Miller and J.W. Thatcher.Google Scholar
- {Kompella} V.P. Kompella, J.C. Pasquale and G.C. Polyzos. Multicasting For Multimedia Applications. IEEE INFOCOM 1992 pp 2078-2085. Google ScholarDigital Library
- {Kou} L. Kou, G. Markowsky and L. Berman, A Fast Algorithm For Steiner Trees. IBM Thomas J. Watson Research Center, Acta Informatica 15, 141-145 (1981).Google Scholar
- {Kruskal} Joseph B. Kruskal, On The Shortest Spanning Subtree of a Graph and The Travelling Salesman Problem.Google Scholar
- {Jaffe83} K. Bharath-Kumar and J. M. Jaffe. Routing To Multiple Destination In Computer Networks. IEEE Transactions On Communications, VolCOM-31, No. 3, March 1983.Google Scholar
- {Jaffe85} J. M. Jaffe. Distributed Multi-Destination Routing: The Constrainsts Of Local Information. SIAM Journal On Computing Vol. 14 No. 4, November 1985.Google Scholar
- {Jiang} Xiaofeng Jiang, Multipoint Digital Video Communications, University Of Cambridge, Computer Laboratory, Technical Report No. 251, April, 1992 (PhD Thesis).Google Scholar
- {Lee} T.T. Lee Nonblocking Copy Networks For Multicast Packet Switching IEEE Journal On Selected Areas In Communications, Vol 6, No. 9, December 1988.Google Scholar
- {Mizusawa} A. Tanaka and J Mizusawa. Routing Algorithms Of Multiple-Destiantion Telecommunication Services, Electronics Communications In Japan Part 1, Vol 73, No. 7 1990.Google ScholarCross Ref
- {Naeher} Naeher Stefan, Max-Planck-Institut Fuer Informatik, Im Stadtwald, D-66 Saarbruecken, FRG.Google Scholar
- {Ray-Simth83} V.J. Rayward-Smith, The Computation Of Nearly Minimal Steiner Trees In Graphs. Int. J. Math. Educ. Sci. Technol., 1983, vol. 14, No. 1, pp 15-23.Google ScholarCross Ref
- {Ray-Smith86} V.J. Rayward-Smith, On Finding Steiner Vertices, Networks Vol. 16 1986, pp 283-294. Google ScholarDigital Library
- {Segall} A. Segall, T. Barzilai and Y. Ofek. Reliable Multi-User Tree Setup with Local Identifiers. IEEE INFOCOM 1992 pp 2096-2106. Google ScholarDigital Library
- {Takahashi} H. Takahashi and Akira Matsuyama, An Approximate Solution For The Steiner Problem In Graphs. Mathematica Japanica 24, No. 6 1980, pp 573-577.Google Scholar
- {Tanaka} Y. Tanaka and P. C. Huang, Multiple Destination Routing Algorithms, IEICE Trans. Commun., Vol. E76-B, No. 5 May 1993.Google Scholar
- {Tanenbaum} A.S. Tanenbaum Computer Networks, 2nd Edition pp 289-310. Google ScholarDigital Library
- {Tode} Hideki Tode, Y. Sakai, M. Yamamoto, H. Okada and Y. Tezuka. Multicast Routing Algorithm For Nodal Load Balancing. IEEE Infocom 1992, pp 2086-2095. Google ScholarDigital Library
- {Turner} J.S. Turner The Challenge Of Multipoint Communication. Traffic Engineering For ISDN Design and Planning, Elsevier Science Publishers B.V. I.A.C. 1988.Google Scholar
- {Turner86} J.S. Turner New Directions In Communications (Or Which Way To The Information Age). IEEE Communications Magazine, October 1986 Vol. 24, No. 10.Google Scholar
- {Turner88} J.S. Turner, Design Of A Broadband Packet Switching Network, IEEE Transactions On Communications, Vol. 36 No. 6, June 1988.Google ScholarCross Ref
- {Waxman88} Bernard M. Waxman, Routing Of Multipoint Connections. IEEE Journal On Selected Areas In Communications, Vol. 6, No. 9, December 1988.Google Scholar
- {Waxman89} Bernard M. Waxman, Evaluation Of Algorithms For Multipoint Routing, Washington University, Sever Institute Of Technology, August 1989, (PhD Thesis). Google ScholarDigital Library
- {Waxman93} Bernard M. Waxman, Performance Evaluation Of Multipoint Routing Algorithms. IEEE INFOCOM 1993 pp 980-986.Google Scholar
- {Winter} Pawel Winter, Steiner Problem In Networks: A Survey. Networks Vol. 17, 1987 pp 129-167. Google ScholarDigital Library
Index Terms
- Minimising packet copies in multicast routing by exploiting geographic spread
Recommendations
Improving Internet multicast with routing labels
ICNP '97: Proceedings of the 1997 International Conference on Network Protocols (ICNP '97)The IP-multicast architecture is extended with addressing information along multicast routing trees that permits more efficient and sophisticated multicast routing options and encourages communication and cooperation between IP and higher-layer ...
Comments