OSA's Digital Library

Journal of Optical Communications and Networking

Journal of Optical Communications and Networking

  • Editors: K. Bergman and O. Gerstel
  • Vol. 5, Iss. 8 — Aug. 1, 2013
  • pp: 825–835

Traffic Grooming in Optical Networks: Decomposition and Partial Linear Programming (LP) Relaxation

Hui Wang and George N. Rouskas  »View Author Affiliations

Journal of Optical Communications and Networking, Vol. 5, Issue 8, pp. 825-835 (2013)

View Full Text Article

Enhanced HTML    Acrobat PDF (368 KB)

Browse Journals / Lookup Meetings

Browse by Journal and Year


Lookup Conference Papers

Close Browse Journals / Lookup Meetings

Article Tools



We consider the traffic grooming problem, a fundamental network design problem in optical networks. We review a typical integer linear program formulation considered in the literature, and we identify two challenges related to this formulation in terms of scalability and wavelength fragmentation. We then propose a new (to our knowledge) solution approach that decomposes the traffic grooming problem into two subproblems that are solved sequentially: 1) the virtual topology and traffic routing (VTTR) subproblem, which does not take into account physical topology constraints, and 2) the routing and wavelength assignment subproblem, which reconciles the virtual topology determined by VTTR with the physical topology. The decomposition is exact when the network is not wavelength limited. We also propose an algorithm that uses a partial linear programming relaxation technique driven by lightpath utilization information to solve the VTTR subproblem efficiently. Our approach delivers a desirable tradeoff between running time and quality of the final solution.

© 2013 Optical Society of America

OCIS Codes
(060.1155) Fiber optics and optical communications : All-optical networks
(060.4256) Fiber optics and optical communications : Networks, network optimization

ToC Category:
Research Papers

Original Manuscript: February 12, 2013
Revised Manuscript: May 17, 2013
Manuscript Accepted: June 3, 2013
Published: July 15, 2013

Hui Wang and George N. Rouskas, "Traffic Grooming in Optical Networks: Decomposition and Partial Linear Programming (LP) Relaxation," J. Opt. Commun. Netw. 5, 825-835 (2013)

Sort:  Author  |  Year  |  Journal  |  Reset  


  1. F. Farahmand, X. Huang, and J. P. Jue, “Efficient online traffic grooming algorithms in WDM mesh networks with drop-and-continue node architecture,” in Proc. Broadnets, Oct. 2004, pp. 180–189.
  2. J. Q. Hu and B. Leida, “Traffic grooming, routing, and wavelength assignment in optical WDM mesh networks,” in Proc. IEEE INFOCOM, Mar. 2004, pp. 495–501.
  3. S. Huang and R. Dutta, “Research problems in dynamic traffic grooming in optical networks,” in Proc. First Workshop on Traffic Grooming, Apr. 2004.
  4. H. Zhu, H. Zang, K. Zhu, and B. Mukherjee, “A novel generic graph model for traffic grooming in heterogeneous WDM mesh networks,” IEEE/ACM Trans. Netw., vol.  11, no. 2, pp. 285–299, Apr. 2003. [CrossRef]
  5. S. Huang, R. Dutta, and G. N. Rouskas, “Traffic grooming in path, star, and tree networks: Complexity, bounds, and algorithms,” IEEE J. Sel. Areas Commun., vol.  24, no. 4, pp. 66–82, Apr. 2006. [CrossRef]
  6. R. Dutta and G. N. Rouskas, “Traffic grooming in WDM networks: Past and future,” IEEE Network, vol.  16, no. 6, pp. 46–56, Nov./Dec. 2002.
  7. K. Zhu and B. Mukherjee, “Traffic grooming in an optical WDM mesh network,” IEEE J. Sel. Areas Commun., vol.  20, no. 1, pp. 122–133, Jan. 2002. [CrossRef]
  8. A. L. Chiu and E. Modiano, “Traffic grooming algorithms for reducing electronic multiplexing costs in WDM ring networks,” J. Lightwave Technol., vol.  18, no. 1, pp. 2–12, Jan. 2000. [CrossRef]
  9. V. R. Konda and T. Y. Chow, “Algorithm for traffic grooming in optical networks to minimize the number of transceivers,” in IEEE Workshop on High Performance Switching and Routing, 2001, pp. 218–221.
  10. R. Dutta and G. N. Rouskas, “On optimal traffic grooming in WDM rings,” IEEE J. Sel. Areas Commun., vol.  20, no. 1, pp. 110–121, Jan. 2002. [CrossRef]
  11. E. Yetginer and G. N. Rouskas, “Power efficient traffic grooming in optical WDM networks,” in Proc. IEEE GLOBECOM, Dec. 2009.
  12. B. Chen, G. N. Rouskas, and R. Dutta, “On hierarchical traffic grooming in WDM networks,” IEEE/ACM Trans. Netw., vol.  16, no. 5, pp. 1226–1238, Oct. 2008. [CrossRef]
  13. K. Zhu and B. Mukherjee, “A review of traffic grooming in WDM optical networks: Architectures and challenges,” Opt. Netw. Mag., vol.  4, no. 2, pp. 55–64, Mar./Apr. 2003.
  14. W. Yao, G. Sahin, M. Li, and B. Ramamurthy, “Analysis of multi-hop traffic grooming in WDM mesh networks,” in Proc. Broadnets, Boston, MA, Oct. 2005, pp. 165–174.
  15. X. Munoz and I. Sau, “Traffic grooming in unidirectional WDM rings with bounded degree request graph,” in Graph-Theoretic Concepts in Computer Science (Lecture Notes in Computer Science, Vol. 5344). Springer, 2008, pp. 300–311.
  16. M. Dawande, R. Gupta, S. Naranpanawe, and C. Sriskandarajah, “A traffic-grooming algorithm in wavelength-routed optical networks,” INFORMS J. Comput., vol.  19, no. 4, pp. 565–574, 2007. [CrossRef]
  17. B. Vignac, B. Jaumard, and F. Vanderbeck, “A hierarchical optimization approach to optical network design where traffic grooming and routing is solved by column generation,” in Proc. INOC, Apr. 2009.
  18. J.-F. P. Labourdette and A. S. Acampora, “Logically rearrangeable multihop lightwave networks,” IEEE Trans. Commun., vol.  39, no. 8, pp. 1223–1230, Aug. 1991. [CrossRef]
  19. E. Yetginer, Z. Liu, and G. N. Rouskas, “Fast exact ILP decompositions for ring RWA,” J. Opt. Commun. Netw., vol.  3, no. 7, pp. 577–586, July 2011. [CrossRef]
  20. Z. Liu and G. N. Rouskas, “A fast path-based ILP formulation for offline RWA in mesh optical networks,” in Proc. IEEE GLOBECOM, Dec. 2012.
  21. Z. Liu and G. N. Rouskas, “Link selection algorithms for link-based ILPs and applications to RWA in mesh networks,” in Proc. ONDM, Apr. 2013.

Cited By

Alert me when this paper is cited

OSA is able to provide readers links to articles that cite this paper by participating in CrossRef's Cited-By Linking service. CrossRef includes content from more than 3000 publishers and societies. In addition to listing OSA journal articles that cite this paper, citing articles from other participating publishers will also be listed.

Next Article »

OSA is a member of CrossRef.

CrossCheck Deposited