Distributed quality of service multicast routing with multiple metrics for receiver initiated joins

This paper describes a novel method of building multicast trees for real time traffic with quality of service constraints. There is a wide range of heuristics to calculate the optimal multicast distribution trees with bounds on the maximum delay from the source to all members. However these heuristics require all the members to be known in advance and assume the existence of a centralized service. We present a heuristic-best cost individual join (BCIJ)-that joins members one by one, randomly to the existing tree. The method does not need previous knowledge of the group members. Trees are dynamically built when each member arrives in the group. A distributed method-multiple metric broadcast (MMB)-for nodes to obtain the best valid path to the existing tree is also presented. MMB is inspired by reverse path forwarding and broadcasts queries to the network that reach existing on-tree members. These reply with the best valid paths to the joining member. The member then selects the best path. This avoids the use of any centralized service and the need for link-state information to be available in any node. The evaluation presented shows that the BCIJ produces trees with better cost than existing centralized heuristics and that MMB does not have a major effect on the network if the group participation is sufficiently large.

[1]  A. Gill Waters Multicast Provision for High Speed Networks , 1992, HPN.

[2]  Mario Gerla,et al.  Receiver-initiated multicasting with multiple QoS constraints , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[3]  Stephen E. Deering,et al.  Distance Vector Multicast Routing Protocol , 1988, RFC.

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

[5]  M. Faloutsos,et al.  QoSMIC: quality of service sensitive multicast Internet protocol , 1998, SIGCOMM '98.

[6]  D. Estrin,et al.  The MASC/BGMP architecture for inter-domain multicast routing , 1998, SIGCOMM '98.

[7]  Eric S. Crawley,et al.  A Framework for QoS-based Routing in the Internet , 1998, RFC.

[8]  Satish K. Tripathi,et al.  Quality of service based routing: a performance perspective , 1998, SIGCOMM '98.

[9]  Horst Hodel,et al.  Policy tree multicast routing: an extension to sparse mode source tree delivery , 1998, CCRV.

[10]  Kevin Watkins Discrete Event Simulation in C , 1993 .

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

[12]  Whay C. Lee,et al.  Topology aggregation for hierarchical routing in ATM networks , 1995, CCRV.

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

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

[15]  Jon Crowcroft,et al.  Building shared trees using a one-to-many joining mechanism , 1997, CCRV.

[16]  John Moy,et al.  Multicast routing extensions for OSPF , 1994, CACM.

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

[18]  Hans Eriksson,et al.  MBONE: the multicast backbone , 1994, CACM.

[19]  Ronny Vogel,et al.  QoS-Based Routing of Multimedia Streams in Computer Networks , 1996, IEEE J. Sel. Areas Commun..

[20]  Paul Francis,et al.  Core based trees (CBT) , 1993, SIGCOMM '93.

[21]  Mark Handley,et al.  Protocol Independent Multicast{Sparse Mode (PIM-SM): Motivation and Architecture , 1997 .