Exploring core based tree (CBT) in WDM networks

• Published in: 7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings pp. 489 - 494
• Main Authors: Jianping Wang, Xiangtong Qi, Mei Yang, Biao Chen
• Format: Conference Proceeding
• Language: English
• Published: Los Alamitos CA IEEE 2004; IEEE Computer Society Press
• Subjects: Applied sciences; Bandwidth; Computer science; Computer science; control theory; systems; Computer systems and distributed systems. User interface; Costs; Exact sciences and technology; Heuristic algorithms; Intelligent networks; Logical, boolean and switching functions; Scalability; Software; Theoretical computing; Wavelength assignment; Wavelength division multiplexing; Wavelength routing; WDM networks; Lower bound; Network flow; Frequency allocation; Wavelength division multiplexing; Routing; Modeling; Wavelength; Core based tree; Flow models; Distributed algorithm; Heuristic method; Feasibility; Collision avoidance; Optical arrays; Multicast; NP complete problem
• ISBN: 9780769521350; 0769521355
• ISSN: 1087-4089
• DOI: 10.1109/ISPAN.2004.1300526

In this paper, we explore the routing and wavelength assignment problem for the CBT service in a WDM network where k sources need to send data to a common core node. We formally model the problem as a problem of finding k shortest lightpaths from sources to the core subject to the constraint of wavelength collision free. We define and study several subproblems, each addressing a different objective. For the feasibility and the minimum total cost problems of k shortest lightpaths, we show how the classical network flow algorithms can be modified and applied efficiently on the network flow model constructed on the transformed wavelength graph. For the minimum max-cost problem, we prove its NP-completeness and propose two efficient heuristic algorithms. Simulation results show that the proposed heuristic algorithms perform very close to the calculated lower bounds.