OSA's Digital Library

Journal of Optical Communications and Networking

Journal of Optical Communications and Networking

  • Editors: K. Bergman and V. Chan
  • Vol. 3, Iss. 11 — Nov. 1, 2011
  • pp: 891–901

A Near-Optimal Solution Approach for the Multi-hop Traffic Grooming Problem

Ali Balma, Nejib Ben Hadj-Alouane, and Atidel B. Hadj-Alouane  »View Author Affiliations


Journal of Optical Communications and Networking, Vol. 3, Issue 11, pp. 891-901 (2011)
http://dx.doi.org/10.1364/JOCN.3.000891


View Full Text Article

Enhanced HTML    Acrobat PDF (379 KB)





Browse Journals / Lookup Meetings

Browse by Journal and Year


   


Lookup Conference Papers

Close Browse Journals / Lookup Meetings

Article Tools

Share
Citations

Abstract

In this paper we consider a capacity sizing and routing problem in synchronous digital hierarchy/wavelength division multiplexing networks with nodes having switching capabilities. This problem is well known in the literature as the multi-hop traffic grooming problem and is generally formulated as an integer linear program, which is especially hard to solve when the demand channels are unsplittable and nonuniform. To overcome this difficulty we develop a branching strategy, using a lower bound that is close to the optimal solution. We also devise a reformulation which accelerates branch-and-bound-based solvers. The computational results clearly show that our method is effective in reducing execution time as well as memory consumption, in comparison to traditional methods based on branch-and-bound.

© 2011 OSA

OCIS Codes
(060.4254) Fiber optics and optical communications : Networks, combinatorial network design
(060.4256) Fiber optics and optical communications : Networks, network optimization

ToC Category:
Research Papers

History
Original Manuscript: December 8, 2010
Revised Manuscript: August 16, 2011
Manuscript Accepted: September 30, 2011
Published: October 31, 2011

Citation
Ali Balma, Nejib Ben Hadj-Alouane, and Atidel B. Hadj-Alouane, "A Near-Optimal Solution Approach for the Multi-hop Traffic Grooming Problem," J. Opt. Commun. Netw. 3, 891-901 (2011)
http://www.opticsinfobase.org/jocn/abstract.cfm?URI=jocn-3-11-891

You do not have subscription access to this journal. Citation lists with outbound citation links are available to subscribers only. You may subscribe either as an OSA member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Log in to access OSA Member Subscription

You do not have subscription access to this journal. Cited by links are available to subscribers only. You may subscribe either as an OSA member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Log in to access OSA Member Subscription

You do not have subscription access to this journal. Figure files are available to subscribers only. You may subscribe either as an OSA member, or as an authorized user of your institution.

Contact your librarian or system administrator
or
Log in to access OSA Member Subscription

« Previous Article

OSA is a member of CrossRef.

CrossCheck Deposited