A dynamic heuristic algorithm for minimum cost multicast routing in OTN network

Author

Fang, Chao ; Chen, Xue

Author_Institution

State Key Lab. of Inf. Photonics & Opt. Commun., Beijing Univ. of Posts & Telecommun., Beijing, China

fYear

2011

fDate

21-23 Oct. 2011

Firstpage

1

Lastpage

5

Abstract

It is important to support the multicast in the OTN network since multicast services are becoming more and more popular. To support multicast in a cost-effective way, the multicast of OTN should be realized in electronic domain based on ODU-level rather than optical domain in our point of view. In order to implement dynamic multicast routing in OTN, a new minimum cost tree heuristic algorithm is brought forward by us, which takes account of delay constraint and load balancing. The simulation results show that the proposed multicast routing algorithm has a high performance of load balancing in constructing delay-constrained low-cost dynamic multicast tree with a very low time complexity.

Keywords

communication complexity; multicast communication; optical communication; resource allocation; telecommunication network routing; trees (mathematics); ODU-level; OTN multicast service; OTN network; delay constraint; delay-constrained low cost dynamic multicast tree; dynamic heuristic algorithm; dynamic multicast routing; electronic domain; load balancing; minimum cost multicast routing algorithm; minimum cost tree heuristic algorithm; optical domain; time complexity; Algorithm design and analysis; Bandwidth; Complexity theory; Delay; Heuristic algorithms; Load management; Routing; OTN; delay constraint; dynamic multicast; electronic domain; load balancing; minimum cost tree;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Photonics and Optical Communications (IPOC), 2011 International Conference on

Conference_Location

Jurong West

Print_ISBN

978-1-4673-0713-0

Electronic_ISBN

978-1-4673-0711-6

Type

conf

DOI

10.1109/IPOC.2011.6122857

Filename

6122857