Optimal Wavelength Assignment Algorithms for Permutation Traffic in Multi-Fiber WDM Ring Networks*

George Washington University, Washington, Washington, D.C., United States
Photonic Network Communication (Impact Factor: 0.79). 12/2001; 4(1):37-46. DOI: 10.1023/A:1012998604387


Permutation traffic occurs in a number of networking applications. In this paper, the problem of wavelength assignment for permutation traffic in multi-fiber WDM rings with and without wavelength conversion is considered. We focus on a special class of permutation traffic and analyze the bounds on the number of wavelengths required to establish the connections. Lower bounds and optimal algorithms are presented for all the cases. The results indicate that a small number of fibers is sufficient to provide most of the benefits that wavelength conversion provides for this class of permutation traffic.

  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: All-optical network provede unlimited for bandwidth, the very low bit error rate, and the transparency to IP. Optical networks promise to be the next generation networks that can meet the higher bandwidth demands. However, the number of wavelengths is often not large enough to help a large amount of nodes. The blocking by wavelength contention can be reduced by wavelength conversion, which can't perfectly resolve all situations. Because of that, a lot of groups have proposed unique wavelength assingment algorithms and protocols. Most schemes don't support the priority concepts. This paper describes the unique priority scheme based on the throughput. In this paper, we apply our priority scheme to SWAP(Simple Wavelength Assignment Protocol) and show the performance of the proposed priority scheme. Our proposed priority scheme can be a better solution to solve an important problem about the blocking by wavelength contention into WDM optical networks.
    Preview · Article · Jan 2003
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we study multi-fiber optical networks with wavelength division multiplexing (WDM). We extend the definition of the well-known Wavelength Assignment Problem (WAP) to the case of k fibers per link and w wavelengths per fiber, generalization that we will call (k,w)-WAP. We develop a new model for the (k,w)-WAP based on conflict hypergraphs. Furthermore, we consider two natural optimization problems that arise from the (k,w)-WAP: minimizing the number of fibers k given a number of wavelengths w, on one hand, and minimizing w given k, on the other. We develop and analyze the practical performance of two methodologies based on hypergraph coloring.
    Full-text · Article · Sep 2003 · Telecommunication Systems