An improved multicast routing algorithm in sparse splitting optical networks

Author

Wang, Jianping ; Yu, Xiaosong ; Yuan, Junling ; Wu, Zhijun ; Wu, Qiwu

Author_Institution

Department of Communication Engineering, School of Information Engineering, University of Science and Technology Beijing, China, 100083

Volume

2009-Supplement

fYear

2009

fDate

2-6 Nov. 2009

Firstpage

1

Lastpage

8

Abstract

The constructing of multicast light-trees in WDM network with sparse splitting has been proven to be an NP-complete problem. The Member-Only (MO) algorithm provides the best links stress and wavelength usage, and the Distance Priority (DP) algorithm reduces the diameter of tree and average delay, which are sensitive in multicast applications. In order to diminish the diameter of tree and average delay further while maintaining the same link stress and average cost, we present an algorithm called Nearest Connector First Heuristic (NCFH) in this paper. Simulation results show that the proposed algorithm achieves a good performance.

Keywords

Costs; Multicast algorithms; NP-complete problem; Optical fiber networks; Optical wavelength conversion; Propagation delay; Routing; Stress; WDM networks; Wavelength division multiplexing; Average cost; Average delay; Diameter of tree; Light-tree construction; Link stress; Multicast routing; Optical network; RWA algorithm; Sparse light splitting; WDM;

fLanguage

English

Publisher

ieee

Conference_Titel

Communications and Photonics Conference and Exhibition (ACP), 2009 Asia

Conference_Location

Shanghai, China

Print_ISBN

978-1-55752-877-3

Electronic_ISBN

978-1-55752-877-3

Type

conf

Filename

5405387