Hardness and approximation of traffic grooming

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4835 LNCS, Issue , 2007, Pages 561-573

  Amini, Omid ^a,b   Pérennes, Stéphane ^a   Sau, Ignasi ^a,c  

^a UNIVERSITY OF NICE SOPHIA ANTIPOLIS   (France)

^b ECOLE POLYTECHNIQUE   (France)

^c UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Approximation algorithms; APX hardness; Inapproximability; Optical networks; PTAS; SONET ADM; Traffic grooming

Indexed keywords

APPROXIMATION ALGORITHMS; BANDWIDTH; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING; TOPOLOGY; WAVELENGTH DIVISION MULTIPLEXING;

APX-HARDNESS; INAPPROXIMABILITY; PTAS; SONET ADM; TRAFFIC GROOMING;

TELECOMMUNICATION TRAFFIC;

EID: 38149090975     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-77120-3_49     Document Type: Conference Paper

References (21)

1. Amini, O., Pérennes, S., Sau, I.: Hardness and Approximation of Traffic Grooming. Research Report 6236, INRIA, Accessible from 3rd author's homepage (2007)
2. Andersen, R.: Finding large and small dense subgraphs. Submitted for publication (arXiv:cs/0702032v1) (February 2007)
3. Bermond, J.-C., Coudert, D.
4. Bermond, J.-C., Coudert, D., Muñoz, X., Sau, I.: Traffic Grooming in Bidirectional WDM Ring Networks. In : IEEE-LEOS ICTON / COST 293 GRAAL, vol. 3, pp. 19-22 (2006)
5. Chiu, A., Modiano, E. : Traffic grooming algorithms for reducing electronic multiplexing costs in WDM ring networks. IEEE/OSA Journal of Lightwave Technology 18(1), 2-12 (2000)
6. Chow, T., Lin, P. : The ring grooming problem. Networks 44, 194-202 (2004)
7. Demaine, E., Hajiaghayi, M.T., Kawarabayashi, K.C. : Algorithmic graph minor theory : Decomposition, approximation and coloring. In : 46th Annual IEEE Symposium on Fondations of Computer Science (FOCS), pp. 637-646 (2005)
8. Dutta, R., Rouskas, G. : On Optimal Traffic Grooming in WDM Rings. In : Proceedings of ACM Sigmetrics/Performance, pp. 164-174, Cambridge (2001)
9. Dutta, R., Rouskas, N. : Traffic grooming in WDM networks : Past and future. IEEE Network 16(6), 46-56 (2002)
10. Epstein, L., Levin, A. : Better Bounds for Minimizing SONET ADMs. In : Persiano, G., Solis-Oba, R. (eds.) WAOA 2004. LNCS, vol. 3351, pp. 281-294. Springer, Heidelberg (2005)
11. Feige, U., Peleg, D., Kortsarz, G. : The Dense k-Subgraph Problem. Algorithmica 29(3), 410-421 (2001)
12. Flammini, M., Moscardelli, L., Shalom, M., Zaks, S. : Approximating the traffic grooming problem. In : Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol. 3827, pp. 915-924. Springer, Heidelberg (2005)
13. Gerstel, O., Ramaswami, R., Sasaki, G.: Cost Effective Traffic Grooming in WDM Rings. In : Proceedings of INFOCOM, San Francisco, pp. 69-77 (1998)
14. Holyer, I. : The NP-Completeness of Some Edge-Partition Problems. SIAM Journal on Computing 10(4), 713-717 (1981)
15. Huang, S., Dutta, R., Rouskas, G.N. : Traffic Grooming in Path, Star, and Tree Networks : Complexity, Bounds, and Algorithms. IEEE Journal on Selected Areas in Communications 24(4), 66-82 (2006)
16. Kann, V. : Maximum bounded 3-dimensional matching is MAX SNP-complete. Information Processing Letters 37, 27-35 (1991)
17. Khot, S. : Ruling out PTAS for graph min-bisection, densest subgraph and bipartite clique. In : FOCS, pp. 136-145 (2004)
18. Modiano, E., Lin, P. : Traffic grooming in WDM networks. IEEE Communications Magazine 39(7), 124-129 (2001)
19. Shalom, M., Unger, W., Zaks, S. : On the Complexity of the Traffic Grooming Problem in Optical Networks
20. Suzuki, A., Tokuyama, T.: Dense subgraph problem revisited. In : Joint Workshop "New Horizons in Computing" and "Statistical Mechanical Approach to Probabilistic Information Processing", Japan (July 2005)
21. Zhu, K., Mukherjee, B. : A review of traffic grooming in WDM optical networks: Architectures and challenges. Optical Networks 4(2), 55-64 (2003)