Application of acyclic coloring in wavelength assignment problem for butterfly and Benes network

被引:3
作者
Navis, V. Vinitha [1 ]
Greeni, A. Berin [1 ]
机构
[1] Vellore Inst Technol, Sch Adv Sci, Chennai 600127, India
来源
SADHANA-ACADEMY PROCEEDINGS IN ENGINEERING SCIENCES | 2023年 / 48卷 / 03期
关键词
Acyclic coloring; routing; wavelength assignment; butterfly network; Benes network;
D O I
10.1007/s12046-023-02164-6
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
The routing and wavelength assignment problem is crucial because it increases the efficiency of wavelength-routed all-optical networks built on the Wavelength Division Multiplexing approach. Given the physical network topology, the problem aims to establish routes for the connection requests and assign to each of them, a wavelength in accordance with the wavelength continuity and distinct wavelength constraints. In order to fulfill all requests, it is important to use the fewest possible wavelengths. This work proposes a novel method for determining the wavelength by employing acyclic coloring to determine the routing.
引用
收藏
页数:10
相关论文
共 30 条
[1]   Algorithmic aspects of acyclic edge colorings [J].
Alon, N ;
Zaks, A .
ALGORITHMICA, 2002, 32 (04) :611-614
[2]   On the number of simple cycles in planar graphs [J].
Alt, H ;
Fuchs, U ;
Kriegel, K .
COMBINATORICS PROBABILITY & COMPUTING, 1999, 8 (05) :397-405
[3]   All-to-all wavelength-routing in all-optical compound networks [J].
Amar, D ;
Raspaud, A ;
Togni, O .
DISCRETE MATHEMATICS, 2001, 235 (1-3) :353-363
[4]   APPLICATIONS OF GRAPH-THEORY IN CHEMISTRY [J].
BALABAN, AT .
JOURNAL OF CHEMICAL INFORMATION AND COMPUTER SCIENCES, 1985, 25 (03) :334-343
[5]  
Beineke L. W., 1973, Discrete Mathematics, V5, P15, DOI 10.1016/0012-365X(73)90023-X
[6]   Wavelength assignment for realizing parallel FFT on regular optical networks [J].
Chen, Yawen ;
Shen, Hong ;
Liu, Fangai .
JOURNAL OF SUPERCOMPUTING, 2006, 36 (01) :3-16
[7]   Routing and wavelength assignment for hypercube in array-based WDM optical networks [J].
Chen, Yawen ;
Shen, Hong .
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2010, 70 (01) :59-68
[8]   A new bound on the acyclic edge chromatic number [J].
Fialho, Paula M. S. ;
de Lima, Bernardo N. B. ;
Procacci, Aldo .
DISCRETE MATHEMATICS, 2020, 343 (11)
[9]  
Fiamik J., 1978, Math. Slovaca, V28, P139
[10]   New acyclic and star coloring algorithms with application to computing hessians [J].
Gebremedhin, Assefaw H. ;
Tarafdar, Arijit ;
Manne, Fredrik ;
Pothen, Alex .
SIAM JOURNAL ON SCIENTIFIC COMPUTING, 2007, 29 (03) :1042-1072