A hybrid approach to quality of service multicast routing in high speed networks

Multimedia services envisaged for high speed networks may have large numbers of users, require high volumes of network resources and have real-time delay constraints. For these reasons, several multicast routing heuristics that use two link metrics have been proposed with the objective of minimising multicast tree cost while maintaining a bound on delay. Previous evaluation work has compared the relative average performance of some of these heuristics and concludes that they are generally efficient. This thesis presents a detailed analysis and evaluation of these heuristics which illustrate that in some situations their average performance is prone to wide variance for a particular multicast in a specific network. It concludes that the efficiency of an heuristic solution depends on the topology of both the network and the multicast, which is difficult to predict. The integration of two heuristics with Dijkstras shortest path tree algorithm is proposed, to produce a hybrid that consistently generates efficient multicast solutions for all possible multicast groups in any network. The evaluation results show good performance over a wide range of networks (flat and hierarchical) and multicast groups, within differing delay bounds. The more efficient the multicast tree is, the less stable it will be as multicast group membership changes. An efficient heuristic is extended to ensure multicast tree stability where multicast group membership is dynamic. This extension decreases the efficiency of the heuristics solutions, although they remain significantly cheaper than the worst case, a shortest delay path tree. This thesis also discusses how the hybrid and the extended heuristic might be applied to multicast routing protocols for the Internet and ATM Networks. Additionally, the behaviour of the heuristics is examined in networks that use a single link metric to calculate multicast trees and concludes one of the heuristics may be of benefit in such networks.

[1]  David R. Oran,et al.  OSI IS-IS Intra-domain Routing Protocol , 1990, RFC.

[2]  Eric C. Rosen,et al.  The New Routing Algorithm for the ARPANET , 1980, IEEE Trans. Commun..

[3]  Stephen E. Deering,et al.  Multicast routing in datagram internetworks and extended LANs , 1990, TOCS.

[4]  Dave Katz,et al.  Cisco Systems' Tag Switching Architecture Overview , 1997, RFC.

[5]  Ariel Orda,et al.  QoS Routing Mechanisms and OSPF Extensions , 1999, RFC.

[6]  John Crawford,et al.  Low Cost Quality of Service Multicast Routing in High Speed Networks , 1997 .

[7]  Joan Aldous,et al.  Networks and algorithms - an introductory approach , 1993 .

[8]  Robert Metcalfe,et al.  Reverse path forwarding of broadcast packets , 1978, CACM.

[9]  A. Gill Waters.  Multi-party communication over packet networks , 1996 .

[10]  M. Angela Sasse,et al.  Successful multiparty audio communication over the Internet , 1998, CACM.

[11]  Vachaspathi P. Kompella,et al.  Multicast routing algorithms for multimedia traffic , 1993 .

[12]  David D. Clark,et al.  The design philosophy of the DARPA internet protocols , 1988, SIGCOMM '88.

[13]  Tony Ballardie,et al.  A New Approach to Multicast Communication in a Datagram Internetwork , 1995 .

[14]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[15]  John Moy,et al.  Multicast Extensions to OSPF , 1994, RFC.

[16]  Ron Widyono.  The Design and Evaluation of Routing Algorithms for Real-time Channels , 1994 .

[17]  K. Bharath-Kumar,et al.  Routing to Multiple Destinations in Computer Networks , 1983, IEEE Trans. Commun..

[18]  Philip Almquist,et al.  Type of Service in the Internet Protocol Suite , 1992, RFC.

[19]  William Stallings,et al.  ISDN and Broadband ISDN , 1992 .

[20]  D. Estrin,et al.  The Trade o s of Multicast Trees and Algorithms , 1994 .

[21]  Aurel A. Lazar,et al.  Joint scheduling and admission control for ATS-based switching nodes , 1992, SIGCOMM '92.

[22]  BERNARD M. WAXMAN,et al.  Routing of multipoint connections , 1988, IEEE J. Sel. Areas Commun..

[23]  Tony Ballardie,et al.  Core based trees , 1993 .

[24]  A. Gibbons.  Algorithmic Graph Theory , 1985 .

[25]  D. W. Wall.  Mechanisms for broadcast and selective broadcast , 1980 .

[26]  Ian M. Leslie,et al.  How bad is naive multicast routing? , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[27]  D. Estrin,et al.  RSVP: a new resource reservation protocol , 1993, IEEE Communications Magazine.

[28]  John Matthew Simon Doar.  Multicast in the Asynchronous Transfer Mode Environment , 1993 .

[29]  John Moy,et al.  OSPF Version 2 , 1998, RFC.

[30]  William C. Fenner.  Internet Group Management Protocol, Version 2 , 1997, RFC.

[31]  G.R. Redinbo.  Computer networks and their protocols , 1981, Proceedings of the IEEE.

[32]  A. Gill Waters.  A new heuristic for ATM multicast routing , 1994 .

[33]  Jon Crowcroft,et al.  Quality-of-Service Routing for Supporting Multimedia Applications , 1996, IEEE J. Sel. Areas Commun..

[34]  R.G. Herrtwich,et al.  HeiTP-a transport protocol for ST-II , 1992, [Conference Record] GLOBECOM '92 - Communications for Global Users: IEEE.

[35]  A. Orda,et al.  QoS routing mechanisms and OSPF extensions , 1997, GLOBECOM 97. IEEE Global Telecommunications Conference. Conference Record.

[36]  Quan Sun,et al.  Efficient Multicast Routing for Delay-Sensitive Applications , 1995 .

[37]  Keith W. Ross,et al.  Multiservice Loss Models for Broadband Telecommunication Networks , 1997 .

[38]  John Beidler,et al.  Data Structures and Algorithms , 1996, Wiley Encyclopedia of Computer Science and Engineering.

[39]  George C. Polyzos,et al.  Multicast routing for multimedia communication , 1993, TNET.

[40]  Deborah Estrin,et al.  An architecture for wide-area multicast routing , 1994, SIGCOMM.

[41]  John Crawford,et al.  An Heuristic for Lower Cost Multicast Routing in the Internet. , 1996 .