Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Wavelength requirements for multicasting in all-optical networks
IEEE/ACM Transactions on Networking (TON)
An Efficient Fault-Tolerant Multicast Routing Protocol with Core-Based Tree Techniques
IEEE Transactions on Parallel and Distributed Systems
Multicasting on the Internet and Its Applications
Multicasting on the Internet and Its Applications
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Multicast routing and wavelength assignment in multihop optical networks
IEEE/ACM Transactions on Networking (TON)
Low-cost, delay-bounded point-to-multipoint communication to support multicasting over WDM networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Light trees: optical multicasting for improved performance in wavelength routed networks
IEEE Communications Magazine
Lightpath (wavelength) routing in large WDM networks
IEEE Journal on Selected Areas in Communications
Performance and resource cost comparisons for the CBT and PIM multicast routing protocols
IEEE Journal on Selected Areas in Communications
A protocol for scalable loop-free multicast routing
IEEE Journal on Selected Areas in Communications
Efficient routing and wavelength assignment for multicast in WDM networks
IEEE Journal on Selected Areas in Communications
IEEE Journal on Selected Areas in Communications
Hi-index | 0.25 |
In this paper, we address the routing and wavelength assignment problem for the core-based tree (CBT) service in a wavelength-division-multiplexing (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 with the constraint of wavelength collision free. To address different objectives, we define and study several subproblems. 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 and the constrained feasibility problems, we prove their NP-completeness and propose two efficient heuristic algorithms. Simulation results show that the proposed heuristic algorithms achieve performance very close to the calculated lower bounds.