Abstract
One major objective in WDM network design is to develop a logical topology and a routing scheme over the topology that minimizes the congestion of the network. This combined topology design and traffic grooming problem becomes computationally intractable, even for moderate sized networks. One standard approach is to decouple the problem of logical topology design and the problem of routing over the logical topology. Heuristics for finding the logical topology exist and a straight-forward linear program (LP), based on the node-arc formulation is normally used to solve the routing problem over a given logical topology. However, the traffic grooming problem is in itself an inherently difficult problem, and standard LP formulations are not able to solve this problem for large networks. In this paper,we have introduced a novel approach for traffic grooming, over a given logical topology, using the concept of approximation algorithms. This technique allows us to efficiently route traffic for practical sized networks and obtain solutions, which are guaranteed to be within a specified bound of the optimal solution. Simulation results from different networks demonstrate that approximation algorithms can be used to quickly generate “near-optimal” solutions to the traffic routing problem in WDM networks.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
B. Mukherjee, “Optical Communication Networks”, McGraw-Hill, 1997.
R. Ramaswami and K. Sivarajan, “Optical Networks: A Practical Perspective”, Morgan-Kaufmann, 2002.
T. Stern and K. Bala, “Multiwavelength Optical Networks: A Layered Approach,” Addison-Wesley, 1999.
I. Chlamtac, A. Ganz, and G. Karmi, “Lightpath communications: An approach to high bandwidth optical WAN’s,” IEEE Transactions on Communications, vol. 40, no. 7, pp. 1171–1182, July 1992.
R. Dutta and G. Rouskas, “Traffic grooming in WDM networks: past and future,” IEEE Network, vol. 16, no. 6., pp. 46–56, Nov. 2002.
B. Chen, G. Rouskas, and R. Dutta, “A framework of hierarchical traffic grooming in WDM networks of General topology”, IEEE/Create-Net Broadnets05, pp. 167–176, Oct. 2005.
G. N. Rouskas and R. Dutta, “Design of logical topologies for wavelength routed networks”, Optical WDM Networks: Principles and Practice, Ed: K. Sivalingam and S. Subramanian, Kluwer, pp.79–102, 2000.
S. Huang and R. Dutta, “Research problems in dynamic traffic grooming in optical networks”, Broadnets04, Oct. 2004.
J. Hu, “Traffic grooming in wavelength-division-multiplexing ring networks: A linear programming solution”, Journal of Optical Networking, Vol. 1, no. 11, pp.397–408, Nov. 2002.
J. Q. Hu and B. Leida, “Traffic grooming, routing, and wavelength assignment in optical WDM mesh networks”, IEEE INFOCOM, pp. 495–501, Mar. 2004.
J. Fang and A.K. Somani, “Enabling subwavelength level traffic grooming in survivable WDM optical network design”, IEEE Globecom, pp. 2761–2766, Dec. 2003.
J-Q. Hu and E. Modiano, “Exact ILP solution for the Grooming problem in WDM ring networks,” Optical WDM Networks: Principles and Practice, vol. II, Kluwer, 2004.
K. Zhu and B. Mukherjee, “Traffic grooming in an optical WDM mesh network,” IEEE JSAC, vol. 20, no. 1, pp.122–133, Jan. 2002.
R. Dutta, S. Huang, and G. Rouskas, “On optimal traffic grooming in elemental network topologies”, Opticomm, pp. 13–24, Oct. 2003.
R. Ramaswami and K.N. Sjvarajan, “Design of logical topologies for wavelength-routed optical networks”, IEEE Journal on on Selected Areas in Communications, vol. 14, no. 5, pp. 840–851, June 1996.
J. Tomlin, “Minimum-cost multicommodity network flows”, Operations Research, vol. 14, no. 1, pp. 45–51, Jan. 1966.
R. Dutta, and G. N. Rouskas, “A survey of virtual topology design algorithms for wavelength routed optical networks”, Optical Networks Magazine, vol. 1, no. 1, pp. 73–89, Jan. 2000.
R. Krishnaswamy and K. Sivarajan, “Design of logical topologies: a linear formulation for wavelength routed optical networks with no wavelength changers”, IEEE/ACM Trans. on Networking, vol. 9, no. 2, pp. 186–198, Apr. 2001.
E. Leonadi, M. Mellia, and M. A. Marsan, “Algorithms for the logical topology design in WDM all-optical networks”, Optical Networks Magazine, pp. 35–46, Jan. 2000.
K. Lee and M. A. Shayman, “Optical network design with optical constraints in IP over WDM Networks,” ICCCN 2004.
K. Lee and M. A. Shayman, “Rollout algorithms for logical topology design and traffic grooming in multihop WDM networks,” IEEE Globecom 05, pp. 2113–2117, 2005.
H. Zang, J. P. Jue, and B. Mukherjee, “A review of routing and wavelength assignment approaches for wavelength- routed optical WDM networks”, Optical Networks Magazine, pp. 47–60, Jan. 2000.
B. Jaumard, C. Meyer, and B. Thiongane, X. Yu, “ILP Formulations and Optimal Solutions for the RWA Problem”, IEEE Globecom, pp. 1918–1924, 2004.
H. Qin, Z. Liu, S. Zhang, and A. Wen, “Outing and wavelength ssignment based on genetic algorithm,” IEEE Communications Letters, vol. 6, no. 10, pp 455–457, Oct. 2002.
A. Katangur, Y. Pan, and M. Fraser, “Simulated annealing routing and wavelength lower bounds estimation on wavelength-division multiplexing optical multistage networks”, Optical Engineering, vol. 43, no. 5, pp. 1080–1091, May 2004.
C. Dzongang, P. Galinier, and S. Pierre, “A tabu search heuristic for the routing and wavelength assignment problem in optical networks”, IEEE Communications Letters, vol. 9, no. 5, pp. 426–428, May 2005.
Revindra K. Ahuja, Thomas L. Magnanti, and James B. OrLin, “Network flows”, Prentice-Hall, Inc., 1993.
A. Ali, D. Barnett, and K. Farhangian, “Multicommodity network problems: Applications and computations,” IIE Transactions, vol. 16, no. 2, pp. 127–134, 1984.
B. Awerbuch and T. Leighton, “Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks”, Proceedings of the Twenty-sixth Annual ACM Symposium on Theory of Computing, May 1994.
F. Hillier and G. Lieberman, “Introduction to operations research”, McGraw-Hill, 2001.
N. Garg and J. Konemann, “Faster and simpler algorithms for multicommodity flow and other fractional packing problems,” In 39th Annual IEEE Symnposium on Foundations of Computer Science, pp. 300–309, 1998.
N. Young, “Randomized rounding without solving the linear program. In ACM/SIAM[1], pp. 170–178.
L. K. Fleischer, “Approximating fractional multicommodity flow independent of the number of commodities”, Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999.
R. Floyd, “Algorithm 97, shortest path,” Communications ACM, vol. 5, p. 345, 1962.
R. K. Ahuja, O. K. Mehlhorn, and R. J. Tarjan, “Faster algorithms for the shortest path problem,” Journal of ACM, vol. 37, no. 2, pp. 213–223, 1990.
Y. Lu, “Approximation algorithms for optimal routing in wavelength routed WDM networks,” Computer Science, University of Windsor, Masters Thesis, 2004.
M. Hou, “Heuristics for WDM path protection”, Computer Science, University of Windsor, Master thesis, 2003.
J. M. Valero de Carvalho, “Using extra dual cuts to accelerate convergence in column generation”, INFORMS Journal of Computing, vol. 17, no. 2, pp. 175–182, Spring 2005.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer Science+Business Media B.V.
About this chapter
Cite this chapter
Aneja, Y., Jaekel, A., Bandyopadhyay, S., Lu, Y. (2009). Efficient Traffic Grooming Scheme for WDM Network. In: Ma, M. (eds) Current Research Progress of Optical Networks. Springer, Dordrecht. https://doi.org/10.1007/978-1-4020-9889-5_9
Download citation
DOI: https://doi.org/10.1007/978-1-4020-9889-5_9
Publisher Name: Springer, Dordrecht
Print ISBN: 978-1-4020-9888-8
Online ISBN: 978-1-4020-9889-5
eBook Packages: EngineeringEngineering (R0)