Heuristic Gradient based Multicast routing policy for dynamic network

Author

Wang, Hui ; He, Junfeng ; Li, Tao ; Zhang, Shuo ; Sun, Zhigang

Author_Institution

Sch. of Comput., Nat. Univ. of Defense Technol., Changsha, China

fYear

2011

fDate

26-28 July 2011

Firstpage

4936

Lastpage

4939

Abstract

IP multicast technology is employed in many distributed real-time applications such as IPTV services, live video-teleconferences, etc. In this paper, we formulate the Gradient based Multicast Policy problem, and propose a heuristic gradient based multicast routing algorithm. In the algorithm, routing policy is adaptive to the network states based on the gradient and multicast group members can join or leave a multicast session dynamically. Simulation results show that our algorithm can not only reduce the probability of congestion during the routing but also have low total cost of the multicast tree.

Keywords

IP networks; IPTV; multicast communication; telecommunication network routing; teleconferencing; trees (mathematics); IP multicast technology; IP network; IPTV services; dynamic network; gradient based multicast policy problem; heuristic gradient based multicast routing; multicast session; multicast tree; video-teleconferences; Bandwidth; Distributed algorithms; Heuristic algorithms; IPTV; Routing; Steiner trees; Streaming media; Distributed routing algorithm; Heuristic; IPTV; Multicast; Steiner Tree;

fLanguage

English

Publisher

ieee

Conference_Titel

Multimedia Technology (ICMT), 2011 International Conference on

Conference_Location

Hangzhou

Print_ISBN

978-1-61284-771-9

Type

conf

DOI

10.1109/ICMT.2011.6001679

Filename

6001679