Competitive analysis of online traffic grooming in WDM rings

This paper addresses the problem of traffic grooming in wavelength-division multiplexing (WDM) rings where connection requests arrive online. Each request specifies a pair of nodes that wish to communicate and also the desired bandwidth of this connection. If the request is to be satisfied, it must be allocated to one or more wavelengths with sufficient remaining capacity. We consider three distinct profit models specifying the profit associated with satisfying a connection request. We give results on offline and online algorithms for each of the three profit models. We use the paradigm of competitive analysis to theoretically analyze the quality of our online algorithms. Finally, experimental results are given to provide insight into the performance of these algorithms in practice.

[1]  Arun K. Somani,et al.  Analysis of optical networks with heterogeneous grooming architectures , 2004, IEEE/ACM Transactions on Networking.

[2]  Kai-Yeung Siu,et al.  Online routing and wavelength assignment in single-hub WDM rings , 2000, IEEE Journal on Selected Areas in Communications.

[3]  Stefano Leonardi,et al.  On-Line Routing in All-Optical Networks , 1997, Theor. Comput. Sci..

[4]  Chunming Qiao,et al.  Maximizing Throughput for Optical Burst Switching Networks , 2004, INFOCOM.

[5]  Biswanath Mukherjee,et al.  Dynamic traffic grooming in WDM mesh networks using a novel graph model , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

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

[7]  Bala Kalyanasundaram,et al.  An optimal deterministic algorithm for online b-matching , 1996, Theor. Comput. Sci..

[8]  Rudra Dutta,et al.  Research Problems in Dynamic Traffic Grooming in Optical Net works , 2004 .

[9]  Thomas H. Cormen,et al.  Introduction to algorithms [2nd ed.] , 2001 .

[10]  Andreas Tuchscherer.  Dynamical Configuration of Transparent Optical Telecommunication Networks , 2004, OR.

[11]  Jian-Qiang Hu.  Traffic grooming in wavelength-division-multiplexing ring networks: a linearprogramming solution , 2002 .

[12]  Allan Borodin,et al.  Online computation and competitive analysis , 1998 .

[13]  Clifford Stein,et al.  Introduction to Algorithms, 2nd edition. , 2001 .

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

[15]  Yossi Azar,et al.  Throughput-competitive on-line routing , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[16]  Aranyak Mehta,et al.  AdWords and Generalized On-line Matching , 2005, FOCS.

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

[18]  Mario Martinelli,et al.  Optical Network Survivability: Protection Techniques in the WDM Layer , 2002, Photonic Network Communications.

[19]  Farid Farahmand,et al.  Efficient online traffic grooming algorithms in WDM mesh networks with drop-and-continue node architecture , 2004, First International Conference on Broadband Networks.

[20]  George N. Rouskas,et al.  Traffic grooming in path, star, and tree networks: complexity, bounds, and algorithms , 2003, IEEE Journal on Selected Areas in Communications.

[21]  Richard M. Karp,et al.  An optimal algorithm for on-line bipartite matching , 1990, STOC '90.

[22]  Amos Fiat,et al.  Competitive non-preemptive call control , 1994, SODA '94.

[23]  Joseph Naor,et al.  Online Primal-Dual Algorithms for Maximizing Ad-Auctions Revenue , 2007, ESA.

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