Computer Networks: The International Journal of Computer and Telecommunications Networking
A novel generic graph model for traffic grooming in heterogeneous WDM mesh networks
IEEE/ACM Transactions on Networking (TON)
A network flow approach for static and dynamic traffic grooming in WDM networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Information Sciences: an International Journal
Traffic Grooming in Unidirectional WDM Rings with Bounded Degree Request Graph
Graph-Theoretic Concepts in Computer Science
On hierarchical traffic grooming in WDM networks
IEEE/ACM Transactions on Networking (TON)
Grooming of non-uniform traffic on unidirectional and bidirectional rings
Computer Communications
Clustering for hierarchical traffic grooming in large scale mesh WDM networks
ONDM'07 Proceedings of the 11th international IFIP TC6 conference on Optical network design and modeling
Hierarchical logical topology in WDM ring networks with limited ADMs
NETWORKING'08 Proceedings of the 7th international IFIP-TC6 networking conference on AdHoc and sensor networks, wireless networks, next generation internet
Power efficient traffic grooming in optical WDM networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Approximation algorithms for traffic grooming in WDM rings
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Distributed dynamic grooming routing and wavelength assignment in WDM optical mesh networks
Photonic Network Communications
Traffic grooming in WDM ring networks to minimize the maximum electronic port cost
Optical Switching and Networking
| Hi-index | 0.07 |
We consider the problem of designing a virtual topology to minimize electronic routing, that is, grooming traffic, in wavelength routed optical rings. The full virtual topology design problem is NP-hard even in the restricted case where the physical topology is a ring, and various heuristics have been proposed in the literature for obtaining good solutions, usually for different classes of problem instances. We present a new framework which can be used to evaluate the performance of heuristics and which requires significantly less computation than evaluating the optimal solution. This framework is based on a general formulation of the virtual topology problem, and it consists of a sequence of bounds, both upper and lower, in which each successive bound is at least as strong as the previous one. The successive bounds take larger amounts of computation to evaluate, and the number of bounds to be evaluated for a given problem instance is only limited by the computational power available. The bounds are based on decomposing the ring into sets of nodes arranged in a path and adopting the locally optimal topology within each set. While we only consider the objective of minimizing electronic routing in this paper, our approach to obtaining the sequence of bounds can be applied to many virtual topology problems on rings. The upper bounds we obtain also provide a useful series of heuristic solutions