DocumentCode :
3037749
Title :
A heuristic algorithm for minimum cost multicast routing in OTN network
Author :
Fang, Chao ; Feng, Chunfang ; Chen, Xue
Author_Institution :
Key Lab. of Inf. Photonics & Opt. Commun., Beijing Univ. of Posts & Telecommun., Beijing, China
fYear :
2010
fDate :
14-15 May 2010
Firstpage :
1
Lastpage :
5
Abstract :
It is important to support the multicast in the OTN network since multicast services are becoming more popular and multicasting will result in the improvement of resource utilization rate. 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 multicast routing in OTN, a new minimum cost tree heuristic algorithm is brought forward by us, which takes account of path sharing and load balancing. The simulation results show that the proposed multicast routing algorithm can achieve the preferable performance.
Keywords :
multicast communication; optical fibre networks; resource allocation; telecommunication network routing; trees (mathematics); ODU-level; OTN network; load balancing; minimum cost multicast routing; minimum cost tree heuristic algorithm; multicast services; path sharing; resource utilization rate; Bandwidth; Costs; Heuristic algorithms; Internet; Multicast algorithms; Optical network units; Optical transmitters; Routing; Telecommunication traffic; WDM networks; OTN; Optical Channel Data Unit; electronic domain; minimum cost tree; multicast;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Wireless and Optical Communications Conference (WOCC), 2010 19th Annual
Conference_Location :
Shanghai
Print_ISBN :
978-1-4244-7597-1
Type :
conf
DOI :
10.1109/WOCC.2010.5510670
Filename :
5510670
Link To Document :
بازگشت