Approximating the traffic grooming problem in tree and star networks

We consider the problem of grooming paths in all-optical networks with tree topology so as to minimize the switching cost, measured by the total number of used ADMs. We first present efficient approximation algorithms with approximation factor of 2ln(@d@?g)+o(ln(@d@?g)) for any fixed node degree bound @d and grooming factor g, and 2lng+o(lng) in unbounded degree directed trees, respectively. In the attempt to extend our results to general undirected trees, we completely characterize the complexity of the problem in star networks by providing polynomial time optimal algorithms for g@?2 and proving the intractability of the problem for any fixed g>2. While for general topologies, the problem was known to be NP-hard g not constant, the complexity for fixed values of g was still an open question.

[1]  David Hung-Chang Du,et al.  Distributed computing with high-speed optical networks , 1993, Computer.

[2]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems , 1973, STOC.

[3]  H. Scott Hinton,et al.  Architectural considerations for photonic switching networks , 1988, IEEE J. Sel. Areas Commun..

[4]  Shmuel Zaks,et al.  Approximating the Traffic Grooming Problem , 2005, ISAAC.

[5]  David Coudert,et al.  Traffic grooming on the path , 2005, Theor. Comput. Sci..

[6]  Shmuel Zaks,et al.  On the Complexity of the Traffic Grooming Problem in Optical Networks , 2007, FUN.

[7]  Chunming Qiao,et al.  Fiber-Optic Communication Networks , 2008, Wiley Encyclopedia of Computer Science and Engineering.

[8]  Shmuel Zaks,et al.  A 10/7 + /spl epsi/ approximation for minimizing the number of ADMs in SONET rings , 2004, First International Conference on Broadband Networks.

[9]  David Coudert,et al.  Traffic grooming in unidirectional WDM ring networks using design theory , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[10]  Charles A. Brackett,et al.  Dense Wavelength Division Multiplexing Networks: Principles and Applications , 1990, IEEE J. Sel. Areas Commun..

[11]  András Sárközy,et al.  Numbers, information and complexity , 2000 .

[12]  Stewart D. Personick,et al.  Review of Fundamentals of Optical Fiber Systems , 1983, IEEE J. Sel. Areas Commun..

[13]  P. Hell,et al.  Graph Problems Arising from Wavelength-Routing in All-Optical Networks , 2004 .

[14]  Peng-Jun Wan,et al.  Traffic partition in WDM/SONET rings to minimize SONET ADMs , 2001, Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001.

[15]  Peng-Jun Wan,et al.  Traffic Partition in WDM/SONET Rings to Minimize SONET ADMs , 2002, J. Comb. Optim..

[16]  George N. Rouskas,et al.  Traffic Grooming in Star Networks , 2004 .

[17]  Leah Epstein,et al.  Better Bounds for Minimizing SONET ADMs , 2004, WAOA.

[18]  R. Ramaswami,et al.  Multiwavelength lightwave networks for computer communication , 1993, IEEE Communications Magazine.

[19]  Shmuel Zaks,et al.  Lightpath arrangement in survivable rings to minimize the switching cost , 2002, IEEE J. Sel. Areas Commun..

[20]  George N. Rouskas,et al.  Traffic grooming in path, star, and tree networks: complexity, bounds, and algorithms , 2006, IEEE J. Sel. Areas Commun..

[21]  A.L. Chiu,et al.  Traffic grooming algorithms for reducing electronic multiplexing costs in WDM ring networks , 2000, Journal of Lightwave Technology.

[22]  George N. Rouskas,et al.  Traffic Grooming in WDM Ring Networks with the Min-Max Objective , 2004, NETWORKING.

[23]  Ralf Klasing,et al.  Methods and Problems of Wavelength-Routing in All-Optical Networks , 1998 .

[24]  Luisa Gargano,et al.  Routing in All-Optical Networks: Algorithmic and Graph-Theoretic Problems , 2000 .

[25]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[26]  Peng-Jun Wan,et al.  Minimizing electronic line terminals for automatic ring protection in general WDM optical networks , 2002, IEEE J. Sel. Areas Commun..

[27]  Ori Gerstel,et al.  Wavelength assignment in a WDM ring to minimize cost of embedded SONET rings , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[28]  Ori Gerstel,et al.  Cost effective traffic grooming in WDM rings , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.