Traffic Grooming in Wavelength Routed Path Networks

HUANG, SHU. Traffic Grooming in Wavelength Routed Path Networks. (Under the direction of Assistant Professor Rudra Dutta). Recent increase in bandwidth and development of wavelength routing techniques has prompted the study of traffic grooming in wide area wavelength routed optical networks. These networks are widely expected to form the high speed high performance backbone networks of the future. We have studied the grooming problem as applied to the path network, where the physical topology of fibers simply forms a path. Path networks are important in themselves, because they arise naturally in different realistic scenarios, but also because they are simple elemental topologies which can contribute to the understanding of more complex topologies. We show that the problem of traffic grooming is NP-Complete in both unidirectional and bidirectional path networks under the objective of minimizing network-wide amount of electronic switching, whether bifurcation of traffic components into integral subcomponents is allowed or not. These results are somewhat surprising in such a simple topology as the path, and underline the inherent complexity of the grooming problem. Our results have implications for grooming problems with other topologies, which we explore. We also explore the approximability of the problem in path networks. We prove that there is no such a polynomial approximation algorithm that it can guarantee an approximation ratio less than infinity, unless P = NP . We propose a heuristic approach to solve the problem practically. Our approach is loosely based on the idea of flow deviation. After defining the deviation framework in the context of our problem, we show that it is a family of algorithms rather than a single one, the different members of the family obtained by choosing different candidate approaches to two key subtasks. Some of these members possess practically important performance guarantees, which we define. We present numerical results obtained by applying our technique to traffic instances of various patterns to validate our theoretical claims. Traffic Grooming in Wavelength Routed Path Networks

[1]  Biswanath Mukherjee,et al.  Optical Communication Networks , 1997 .

[2]  Ori Gerstel,et al.  Combined WDM and SONET network design , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

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

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

[5]  Jian-Qiang Hu,et al.  Optimal traffic grooming for wavelength-division-multiplexing rings with all-to-all uniform traffic , 2002 .

[6]  Peng-Jun Wan,et al.  Grooming of arbitrary traffic in SONET/WDM BLSRs , 2000, IEEE Journal on Selected Areas in Communications.

[7]  Xiang-Yang Li,et al.  Practical traffic grooming scheme for single-hub SONET/WDM rings , 2000, WCC 2000 - ICCT 2000. 2000 International Conference on Communication Technology Proceedings (Cat. No.00EX420).

[8]  Eytan Modiano,et al.  Reducing electronic multiplexing costs in SONET/WDM rings with dynamically changing traffic , 2000, IEEE Journal on Selected Areas in Communications.

[9]  Chunming Qiao,et al.  An effective and comprehensive approach for traffic grooming and wavelength assignment in SONET/WDM rings , 2000, TNET.

[10]  Imrich Chlamtac,et al.  Lightpath communications: an approach to high bandwidth optical WAN's , 1992, IEEE Trans. Commun..

[11]  Daniel Bienstock,et al.  Asymptotic analysis of the flow deviation method for the maximum concurrent flow problem , 2002, Math. Program..

[12]  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.

[13]  Haruko Okamura,et al.  Multicommodity flows in planar graphs , 1981, J. Comb. Theory, Ser. B.

[14]  Ehab S. Elmallah,et al.  Multicommodity flows in simple multistage networks , 1995, Networks.

[15]  Moon-Gil Yoon.  Traffic grooming and light-path routing in WDM ring networks with hop-count constraint , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[16]  A. Tucker,et al.  Coloring a Family of Circular Arcs , 1975 .

[17]  Biswanath Mukherjee,et al.  Traffic grooming in an optical WDM mesh network , 2002, IEEE J. Sel. Areas Commun..

[18]  Peter Winkler,et al.  Ring routing and wavelength translation , 1998, SODA '98.

[19]  Jian Wang,et al.  Improved approaches for cost-effective traffic grooming in WDM ring networks: ILP formulations and single-hop and multihop connections , 2001 .

[20]  George N. Rouskas,et al.  On optimal traffic grooming in WDM rings , 2002, IEEE J. Sel. Areas Commun..

[21]  Jiann-Liang Chen,et al.  Traffic grooming in WDM networks using genetic algorithm , 1999, IEEE SMC'99 Conference Proceedings. 1999 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.99CH37028).

[22]  George N. Rouskas,et al.  A Survey of Virtual Topology Design Algorithms for Wavelength Routed Optical Networks , 1999 .

[23]  Thomas Erlebach.  Scheduling connections in fast networks , 1999 .

[24]  V. R. Konda,et al.  Algorithm for traffic grooming in optical networks to minimize the number of transceivers , 2001, 2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552).

[25]  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.

[26]  Kumar N. Sivarajan,et al.  Optical Networks: A Practical Perspective , 1998 .