Constructing shared-tree for group multicast with QoS constraints

Group multicast refers to the kind of multicast in which every member of a group may transmit data to the group. Several QoS-aware routing algorithms for group multicast proposed previously take into account bandwidth requirement (which is the most important QoS metric to consider for many applications) and build source-based tree for each individual group member. Per-source tree approach has some advantages over shared-tree approach but suffers the drawbacks of higher control overhead and being less scalable especially with group size. In this paper we present an algorithm which builds shared tree for group multicast and can accommodate multiple QoS requirements including bandwidth and inter-member delay. Besides the advantages of having less control overhead and better scalability, our algorithm can support dynamic membership without recomputing the whole tree. The results from simulation experiments for multicast with bandwidth reservation show that our algorithm has similar performance in terms of tree cost and bandwidth utilization compared with two other per-source tree algorithms.

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

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

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

[4]  Dana S. Richards,et al.  Steiner tree problems , 1992, Networks.

[5]  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).

[6]  Udi Manber,et al.  Introduction to algorithms - a creative approach , 1989 .

[7]  Klara Nahrstedt,et al.  An overview of quality of service routing for next-generation high-speed networks: problems and solutions , 1998, IEEE Netw..

[8]  Raphael Rom,et al.  On the Construction of Low Cost Multicast Trees with Bandwidth Reservation , 1998, HPCN Europe.

[9]  Xiaohua Jia,et al.  A group multicast routing algorithm by using multiple minimum Steiner trees , 1997, Comput. Commun..

[10]  Tony Ballardie,et al.  Core Based Trees (CBT version 2) Multicast Routing - Protocol Specification - , 1997, RFC.

[11]  Ning Wang,et al.  On Finding Feasible Solutions to the Group Multicast Routing Problem , 2000, NETWORKING.

[12]  Deborah Estrin,et al.  The PIM architecture for wide-area multicast routing , 1996, TNET.

[13]  Ning Wang,et al.  An efficient algorithm for group multicast routing with bandwidth reservation , 1999, IEEE International Conference on Networks. ICON '99 Proceedings (Cat. No.PR00243).

[14]  Hans Jürgen Prömel,et al.  The Steiner Tree Problem , 2002 .