A green intelligent routing algorithm supporting flexible QoS for many-to-many multicast

The tremendous energy consumption attributed to the Information and Communication Technology (ICT) field has become a persistent concern during the last few years, attracting significant academic and industrial efforts. Networks have begun to be improved towards being “green”. Considering Quality of Service (QoS) and power consumption for green Internet, a Green Intelligent flexible QoS many-to-many Multicast routing algorithm (GIQM) is presented in this paper. In the proposed algorithm, a Rendezvous Point Confirming Stage (RPCS) is first carried out to obtain a rendezvous point and the candidate Many-to-many Multicast Sharing Tree (M2ST); then an Optimal Solution Identifying Stage (OSIS) is performed to generate a modified M2ST rooted at the rendezvous point, and an optimal M2ST is obtained by comparing the original M2ST and the modified M2ST. The network topology of Cernet2, GéANT and Internet2 were considered for the simulation of GIQM. The results from a series of experiments demonstrate the good performance and outstanding power-saving potential of the proposed GIQM with QoS satisfied

Abstract

www.elsevier.com/locate/jpdc A distributed multicast routing algorithm for real-time applications in wide area networks � Tzu-Lun Huang a, ∗ , D.T. Lee b,

A Distributed Multicast Routing Algorithm for Real-Time Applications in Wide Area Networks

The problem of constructing a minimal cost multicast routing tree (MRT) with delay constraints in wide area networks (WAN) is considered. A new distributed token-passing based algorithm that constructs a sub-optimal MRT satisfying given delay constraints for all members in the multicast group is presented. In contrast with the previous works by Jia [A distributed algorithm of delay-bounded multicast routing for multimedia applications in wide area networks, IEEE/ACM Trans. Network. 6 (1998) 828–837] and several others [Y. Im, Y. Lee, S. Wi, Y. Choi, Delay constrained distributed multicast routing algorithm, Comput. Comm. 20 (1997) 60–66; X. Jia, Y. Zhang, N. Pissinou, K. Makki, A distributed multicast routing protocol for real-time multicast applications, Comput. Networks 31 (1999) 101–110; Q. Sun, H. Langendorfer, A distributed delay-constrained dynamic multicast routing algorithm, Telecommun. Systems 11 (1999) 47–58], in which cycles may occur, we show that the multicast routing network produced by our algorithm is indeed a tree, namely, cycle free. Also the success rate of our algorithm to find a feasible solution, if one exists, is guaranteed to be 100%, while Jia’s algorithm is not. Furthermore, our algorithm is fault tolerant and can also adapt to cases where the multicast group members are allowed to join or leave the multicast session dynamically. Simulations have been conducted and the results show that the MRT generated by our algorithm has better performance compared to previous methods

A Distributed Multicast Routing Algorithm for Real-Time Applications in Wide Area Networks

[[sponsorship]]資訊科學研究所,資訊科技創新研究中心[[note]]已出版;有審查制度;具代表