Routing and Wavelength Assignment in Optical WDM Networks with Maximum Quantity of Edge Disjoint Paths 


Vol. 11,  No. 5, pp. 677-682, Oct.  2004
10.3745/KIPSTC.2004.11.5.677


PDF
  Abstract

In the present paper routing and wavelength assignment (RWA) in optical WDM networks is considered. Previous techniques based on the combination of integer linear programming and graph coloring are complex and require extensive use of heuristics. Such methods are mostly slow and sometimes impossible to get results due to infeasibility. An alternative approach applied to RWA employs on the greedy algorithm for obtaining the maximum edge disjoint paths. Even though this approach is fast, it produces a solution for any connection request, which is very far from the optimal utilization of wavelengths. We propose a novel algorithm, which is based on the maximum flow technique to obtain the maximum quantity of edge, disjoint paths. Here we compare the offered method with previous maximum edge disjoint paths algorithms applied to the RWA.

  Statistics
  Cite this article

[IEEE Style]

H. S. Choo, S. T. Chung, S. C. Lee, "Routing and Wavelength Assignment in Optical WDM Networks with Maximum Quantity of Edge Disjoint Paths," The KIPS Transactions:PartC, vol. 11, no. 5, pp. 677-682, 2004. DOI: 10.3745/KIPSTC.2004.11.5.677.

[ACM Style]

Hyun Seung Choo, Sung Taek Chung, and Sung Chang Lee. 2004. Routing and Wavelength Assignment in Optical WDM Networks with Maximum Quantity of Edge Disjoint Paths. The KIPS Transactions:PartC, 11, 5, (2004), 677-682. DOI: 10.3745/KIPSTC.2004.11.5.677.

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