Routing in DiffServ multicast environment

QOS aware applications have propelled the development of two complementary technologies, Multicasting and Differentiated Services. To provide the required QOS on the Internet, either the bandwidth needs to be increased (Multicasting) or limited bandwidth prioritized among users (DiffServ). Although, the bandwidth on the Internet is continually increasing, the backbone is still insufficient to support QOS without resource allocations. Hence, there is a need to map multicasting in a DiffServ Environment to conserve network bandwidth and to provision this bandwidth in an appropriate fashion. In this regard, two issues have to be addressed. One, the key difference between multicast and DiffServe routing is the structure of the multicast tree. This tree is maintained in multicast aware routers whereas in DiffServe, the core routers maintain no state information regarding the flows. Second, the task of restructuring the multicast tree when members join/leave. Currently, the first issue is addressed by embedding the multicast information within the packet itself as an additional header field. In this paper, we propose a neural network based heuristic approach to address the second problem of routing in a dynamic DiffServe Multicast environment. Many dynamic multicast routing algorithms have been proposed. The greedy algorithm creates a near optimal tree when a node is added but requires many query/reply messages. The PSPT algorithm cannot construct a cost optimal tree. The VTDM algorithm requires the estimated number of nodes that will join and is not flexible. The problem of building an optimal tree to satisfy QOS requirements at minimum cost and taking minimum network resources is NP- complete and none of the above solutions give an optimal solution. We have modeled this combinatorial optimization as a nonlinear programming problem and trained an artificial neural network to solve the problem. The problem is tractable only when the QOS parameters are combined into DiffServe classes because of the flows are short-liv

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

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

[3]  Maria Ramalho,et al.  Intra- and inter-domain multicast routing protocols: A survey and taxonomy , 2000, IEEE Communications Surveys & Tutorials.

[4]  Xiaohua Jia,et al.  A distributed algorithm of delay-bounded multicast routing for multimedia applications in wide area networks , 1998, TNET.

[5]  Bin Wang,et al.  Multicast routing and its QoS extension: problems, algorithms, and protocols , 2000 .

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

[7]  Ariel Orda,et al.  Optimal partition of QoS requirements on unicast paths and multicast trees , 2002, TNET.

[8]  Daniel P. Siewiorek,et al.  On quality of service optimization with discrete QoS options , 1999, Proceedings of the Fifth IEEE Real-Time Technology and Applications Symposium.

[9]  Aaron Striegel,et al.  A scalable approach for DiffServ multicasting , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

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

[11]  Biswanath Mukherjee,et al.  Multicast routing algorithms and protocols: a tutorial , 2000, IEEE Netw..

[12]  Klaus Wehrle,et al.  Group communication in differentiated services networks , 2001, Proceedings First IEEE/ACM International Symposium on Cluster Computing and the Grid.

[13]  Naoki Katoh,et al.  Resource Allocation Problems , 1998 .

[14]  Prasant Mohapatra,et al.  DiffServ-Aware Multicasting , 2004, J. High Speed Networks.

[15]  S. Blake,et al.  IP Multicast in Differentiated Services Networks , 2003 .

[16]  George C. Polyzos,et al.  The multimedia multicasting problem , 1998, Multimedia Systems.

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

[18]  Scott Shenker,et al.  Specification of Guaranteed Quality of Service , 1997, RFC.

[19]  Stephen Grossberg,et al.  Fuzzy ARTMAP: A neural network architecture for incremental supervised learning of analog multidimensional maps , 1992, IEEE Trans. Neural Networks.

[20]  Aaron Striegel,et al.  Dynamic DSCPs for heterogeneous QoS in DiffServ multicasting , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

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

[22]  Murali S. Kodialam,et al.  Resource allocation in a multicast tree , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[23]  Aaron Striegel,et al.  A scalable protocol for member join/leave in DiffServ multicast , 2001, Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks.