Wavelength assignment algorithm to reduce discontinuity of virtual Links in dynamic WDM network 


Vol. 13,  No. 2, pp. 167-170, Apr.  2006
10.3745/KIPSTC.2006.13.2.167


PDF
  Abstract

Most wavelength assignment algorithms assume that every node has infinite ADMs and I/O blocking is excluded. Furthermore wavelengths continue to occur intermittently in the network using existing algorithms. This can result in increased link blocking under dynamic traffic circumstances. In addition, it can create time-complexity problems such as O(W?N3) in the worst case scenario. In this paper, we propose a new wavelength assignment algorithm which has time-complexity of O(W?N2) and considers both I/O and link blocking. The basic idea is to maximize the number of links where wavelengths will be assigned continuously after present assignment. As a result, the number of intermittent wavelengths is minimized, and blocking probabilities are decreased.

  Statistics
  Cite this article

[IEEE Style]

S. Y. You and S. C. Kim, "Wavelength assignment algorithm to reduce discontinuity of virtual Links in dynamic WDM network," The KIPS Transactions:PartC, vol. 13, no. 2, pp. 167-170, 2006. DOI: 10.3745/KIPSTC.2006.13.2.167.

[ACM Style]

Seung Yeon You and Sung Chun Kim. 2006. Wavelength assignment algorithm to reduce discontinuity of virtual Links in dynamic WDM network. The KIPS Transactions:PartC, 13, 2, (2006), 167-170. DOI: 10.3745/KIPSTC.2006.13.2.167.

Forms

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)

Old Journals

Indexing

All publications of TKIPS is indexed in DOI, EBSCO, Google Scholar, Crossref, and CrossCheck.

TKIPS is also selected as the Journal for Accreditation by NRF (National Research Foundation of Korea).

Related Journals