Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture
SIAM Journal on Computing
IEEE/ACM Transactions on Networking (TON)
Cost-effective traffic grooming in WDM rings
IEEE/ACM Transactions on Networking (TON)
A 10/7 + " Approximation for Minimizing the Number of ADMs in SONET Rings
BROADNETS '04 Proceedings of the First International Conference on Broadband Networks
Optimal Solution of the Maximum All Request Path Grooming Problem
AICT-ICIW '06 Proceedings of the Advanced Int'l Conference on Telecommunications and Int'l Conference on Internet and Web Applications and Services
Better bounds for minimizing SONET ADMs
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
Traffic grooming in WDM networks
IEEE Communications Magazine
Grooming of arbitrary traffic in SONET/WDM BLSRs
IEEE Journal on Selected Areas in Communications
Traffic grooming in path, star, and tree networks: complexity, bounds, and algorithms
IEEE Journal on Selected Areas in Communications - Part Supplement
Traffic grooming in WDM networks: past and future
IEEE Network: The Magazine of Global Internetworking
Hardness and approximation of traffic grooming
Theoretical Computer Science
Traffic grooming in star networks via matching techniques
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
Optical Switching and Networking
Placing regenerators in optical networks to satisfy multiple sets of requests
IEEE/ACM Transactions on Networking (TON)
Directed acyclic graphs with the unique dipath property
Theoretical Computer Science
Hi-index | 5.23 |
In a WDM network, routing a request consists in assigning it a route in the physical network and a wavelength. If each request uses at most 1/C of the bandwidth of the wavelength, we will say that the grooming factor is C. That means that on a given edge of the network we can groom (group) at most C requests on the same wavelength. With this constraint the objective can be either to minimize the number of wavelengths (related to the transmission cost) or minimize the number of Add Drop Multiplexers (shortly ADM) used in the network (related to the cost of the nodes). We consider here the case where the network is a path on N nodes, PN. Thus the routing is unique. For a given grooming factor C minimizing the number of wavelengths is an easy problem, well known and related to the load problem. But minimizing the number of ADMs is NP-complete for a general set of requests and no results are known. Here we show how to model the problem as a graph partition problem and using tools of design theory we completely solve the case where C=2 and where we have a static uniform all-to-all traffic (one request for each pair of vertices).