Routing with Maximum Edge Disjoint Paths and Wavelength Assignment with Path Conflict Graph 


Vol. 30,  No. 7, pp. 417-426, Jul.  2005


PDF Full-Text
  Abstract

Routing and wavelength assignment problem is one of the most important issues in optical transport networks based on wavelength division multiplexing(WDM) technique. In this paper, we propose a novel approach using path conflict graphs and an algorithm for finding all edge disjoint paths. And then we compare the performance of the proposed algorithm with that of bounded greedy approach for EDP(BGAforEDP). The proposed one outperforms up to about 20% in the fixed traditional topology(NSFNET) and about 32% in random topologies over the BGA for EDP algorithm.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

D. H. Kim, M. Y. Chung, T. Lee, H. Choo, "Routing with Maximum Edge Disjoint Paths and Wavelength Assignment with Path Conflict Graph," The Journal of Korean Institute of Communications and Information Sciences, vol. 30, no. 7, pp. 417-426, 2005. DOI: .

[ACM Style]

Duk Hun Kim, Min Young Chung, Tae-Jin Lee, and Hyunseung Choo. 2005. Routing with Maximum Edge Disjoint Paths and Wavelength Assignment with Path Conflict Graph. The Journal of Korean Institute of Communications and Information Sciences, 30, 7, (2005), 417-426. DOI: .

[KICS Style]

Duk Hun Kim, Min Young Chung, Tae-Jin Lee, Hyunseung Choo, "Routing with Maximum Edge Disjoint Paths and Wavelength Assignment with Path Conflict Graph," The Journal of Korean Institute of Communications and Information Sciences, vol. 30, no. 7, pp. 417-426, 7. 2005.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880