Paper Info
Title
A novel multicast routing algorithm in sparse splitting WDM network with power attenuation constraint
Abstract
With the increasing requirement for communication bandwidth, all-optical network has been more and more important owning to its large traffic capability. Multicasting is an important technology in wavelength division multiplexing (WDM) optical network, and has been studied in many works. In this paper, we consider the multicasting technology on all-optical metropolitan area network (MAN) with maximum power attenuation constraint. The objective is to minimize total cost of a multicasting request. This problem is NP-hard. We propose a heuristic, named Power-Constraint Fix-Destination-Path (PC-FDP) algorithm, to solve this maximal power-loss constrained minimizing cost multicasting problem. It means that, during the process of building a multicasting tree, when a destination is reached and its power satisfies the constraint, the path from source to it would be fixed in the tree. Simulation results show that, all multicasting trees building the proposed algorithm satisfy the power constraint, with slight increasing of the total cost.
Year
DOI
Venue
2010
10.1007/s11107-009-0218-6
Photonic Network Communications
Keywords
Field
DocType
Multicast,RWA algorithm,WDM,Light forest,Power attenuation constraints
Wavelength-division multiplexing,Heuristic,Computer science,Computer network,Metropolitan area network,Multicast,Attenuation,Maximum power principle,Total cost,Routing algorithm,Distributed computing
Journal
Volume
Issue
ISSN
19
2
1572-8188(Series Online ISSN)1387-974X(Series Print ISSN)
Citations 
PageRank 
References 
5
0.47
9
Authors
4
Name
Order
Citations
PageRank
Jianping Wang1182.71
Junling Yuan2166.52
Xianwei Zhou326345.66
Xiaosong Yu43012.92