A Study on Algorithm for the Wavelength and Routing Assignment Problem on All - optical Tree Networks 


Vol. 7,  No. 12, pp. 3952-3963, Dec.  2000
10.3745/KIPSTE.2000.7.12.3952


PDF
  Abstract

This paper considers the WRA(Wavelength and Routing Assignment) problem on all-optical tree networks using WDM(Wavelength Division Multiplexing). Each link between a pair of request nodes on all optical networks is assigned different wavelengths because of technical constraint. On the basis of this, we give an polynomial time algorithm to assign wavelengths to the all paths of a arbitrary tree network using divide and conquer method. The time complexity of this algorithm is , in which Q is the request nodes for all-to-all communication in a tree topology and R is the maximum number of wavelength. Also we implemented our algorithm using C in Pentium - 233MHz and analyzed performance results.

  Statistics
  Cite this article

[IEEE Style]

S. S. Kim, S. S. Yeo, S. K. Kim, "A Study on Algorithm for the Wavelength and Routing Assignment Problem on All - optical Tree Networks," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 7, no. 12, pp. 3952-3963, 2000. DOI: 10.3745/KIPSTE.2000.7.12.3952.

[ACM Style]

Soon Seok Kim, Sang Su Yeo, and Sung Kwon Kim. 2000. A Study on Algorithm for the Wavelength and Routing Assignment Problem on All - optical Tree Networks. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 7, 12, (2000), 3952-3963. DOI: 10.3745/KIPSTE.2000.7.12.3952.

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