Theoretical Computer Science
Information Sciences: an International Journal
Multi-layer MPLS network design: The impact of statistical multiplexing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Approximating the traffic grooming problem in tree and star networks
Journal of Parallel and Distributed Computing
On hierarchical traffic grooming in WDM networks
IEEE/ACM Transactions on Networking (TON)
Grooming of Dynamic Traffic in WDM Tree Networks Using Genetic Algorithms
ISNN 2009 Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part II
Hardness and approximation of traffic grooming
Theoretical Computer Science
On the complexity of the traffic grooming problem in optical networks
FUN'07 Proceedings of the 4th international conference on Fun with algorithms
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
Hardness and approximation of traffic grooming
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Traffic grooming: a changing role in green optical networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
WDM network traffic grooming using clusters
HONET'09 Proceedings of the 6th international conference on High capacity optical networks and enabling technologies
Approximation algorithms for many-to-many traffic grooming in WDM mesh networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Photonic Network Communications
Design and provisioning of WDM networks with many-to-many traffic grooming
IEEE/ACM Transactions on Networking (TON)
Distributed dynamic grooming routing and wavelength assignment in WDM optical mesh networks
Photonic Network Communications
Approximation algorithms for grooming in optical network design
Theoretical Computer Science
Two-layer mesh network optimization based on inter-layer decomposition
Photonic Network Communications
Survivable impairment-aware traffic grooming in WDM rings
Proceedings of the 23rd International Teletraffic Congress
Traffic grooming in star networks via matching techniques
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
Placing regenerators in optical networks to satisfy multiple sets of requests
IEEE/ACM Transactions on Networking (TON)
Approximation algorithms for many-to-many traffic grooming in optical WDM networks
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
We consider the problem of traffic grooming in WDM path, star, and tree networks. Traffic grooming is a variant of the well-known logical topology design, and is concerned with the development of techniques for combining low speed traffic components onto high speed channels in order to minimize network cost. Our contribution is two-fold. In the first part of the paper we present a wealth of results which settle the complexity of traffic grooming in path and star networks, by proving that a number of variants of the problem are computationally intractable. Since routing and wavelength assignment in these two topologies is trivial, these results demonstrate that traffic grooming is itself an inherently difficult problem. Our results have implications for ring and other more general topologies, which we explore. In the second part we design practical grooming algorithms with provable properties. Specifically, for all three topologies, we obtain a series of lower and upper bounds which are increasingly tighter but have considerably higher computational requirements; the series of upper bounds forms an algorithm for the traffic grooming problem with strong performance guarantees. We also present corresponding heuristics with good performance. Our work is a first step towards a formal and systematic approach to the grooming problem in general topologies that builds upon results and algorithms for more elementary networks