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


Sort:  Journal  |  Reset

References

  1. H. J. R. Dutton, Understanding Optical Communications (Prentice Hall, Engelwood Cliffs, N. J., 1998).
  2. B. Mukherjee, Optical Communication Networks (McGraw-Hill, New York, 1998).
  3. R. Ramaswami and K. N. Savarajan, 'Design of logical topology for wavelength routed optical networks,' in IEEE Infocom '95 (Institute of Electrical and Electronics Engineers, New York, 1995).
  4. J. Kuri, N. Puech, M. Gagnaire, and E. Dotaro, 'Routing and wavelength assignment of scheduled lightpath demands in a WDM optical transport network,' in Proceedings on the International Conference on Optical Communications and Networks (Institute of Electrical and Electronics Engineers, New York, 2002), pp. 270-273.
  5. R. Ramaswami and K. N. Savarajan, Optical Networks:  A Practical Perspective (Morgan Kaufmann, Los Altos, Calif., 1998).
  6. J. Kuri, N. Puech, M. Gagnaire, and E. Dotaro, 'Routing foreseeable lightpath demands using a tabu search meta-heuristic,' in Proceedings of GLOBECOM 2002 (Institute of Electrical and Electronics Engineers, New York, 2002).
  7. R. Ramaswami, 'Multiwavelength lightwave networks for computer communications,' IEEE Commun. 31, 78-88 (1993).
  8. R. Ramaswami and K. N. Savarajan, 'Routing and wavelength assignment in all-optical networks,' IEEE/ACM Trans. Network. 3 489-500 (1995).
  9. J. Clausen, 'Branch and bound algorithms-principles and examples' (Department of Computer Science, University of Copenhagen, Copenhagen, Denmark), available online at <a href="http://www.imm.dtu.dk/~jha/">http://www.imm.dtu.dk/~jha/<?Pub Caret?></a>.
  10. F. Glover and M. Laguna, Tabu Search (Kluwer Academic, Dordrecht, The Netherlands, 1997).
  11. P. Klein and N. Young, Approximation Algorithms for Np-Hard Optimization Problems (CRC Press, Boca Raton, Fla., 1999).
  12. D. W. Matula, 'k-Components, clusters, and slicings in graphs,' SIAM (Soc. Ind. Appl. Math.) J. Appl. Math. 22, 459-480 (1972).
  13. F. Glover, E. Taillard, D. de Werra, 'A user's guide to Tabu search,' Ann. Operations Res. 41, 3-28 (1993).

Cited By

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