OSA's Digital Library

Journal of Optical Communications and Networking

Journal of Optical Communications and Networking

  • Editor: Richard A. Linke
  • Vol. 2, Iss. 11 — Nov. 3, 2003
  • pp: 379–389

Solving large instances of a routing problem in a WDM transport network by use of a clustering algorithm

Giuseppe Di Lorenzo  »View Author Affiliations


Journal of Optical Networking, Vol. 2, Issue 11, pp. 379-389 (2003)


View Full Text Article

Acrobat PDF (191 KB)





Browse Journals / Lookup Meetings

Browse by Journal and Year


   


Lookup Conference Papers

Close Browse Journals / Lookup Meetings

Article Tools

Share
Citations
  • Export Citation/Save Click for help

Abstract

We investigate the problem of routing a large number of scheduled lightpath demands (SLDs) on a wavelength-division-multiplexing (WDM) transport network. SLDs are connection demands for which the startup and tear-down dates may be planned. Existing SLD routing algorithms are able to process only a limited number of demands. So, to process a large set of SLDs, we adopt a divide-and-reassembly approach. The set of SLDs is partitioned on the physical network into different subsets so that the number of demands of each can be processed with the existing routing algorithms. The solutions of the subsets are then assembled to form a global solution for the original set of SLDs. We evaluate the gain in terms of computation time, obtained by solution of smaller instances of the routing problem, and the performance of this approach in terms of WDM resources devoted to the routing solution on the basis of partitioning the set of demands.

© 2003 Optical Society of America

OCIS Codes
(060.4250) Fiber optics and optical communications : Networks
(200.4650) Optics in computing : Optical interconnects

ToC Category:
RESEARCH PAPERS

History
Original Manuscript: June 9, 2003
Revised Manuscript: June 1, 2003
Published: October 22, 2003

Citation
Giuseppe Di Lorenzo, "Solving large instances of a routing problem in a WDM transport network by use of a clustering algorithm," J. Opt. Netw. 2, 379-389 (2003)
http://www.opticsinfobase.org/jocn/abstract.cfm?URI=jon-2-11-379

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

Next Article »

OSA is a member of CrossRef.

CrossCheck Deposited