Exploring the Tabu Search Algorithm as a Graph Coloring Technique for Wavelength Assignment in Optical Networks

被引:0
|
作者
Gomes, Ines [2 ]
Cancela, Luis [1 ,2 ]
Rebola, Joao [1 ,2 ]
机构
[1] Inst Telecomunicacoes, Opt Commun & Photon Grp, Lisbon, Portugal
[2] Inst Univ Lisboa ISCTE IUL, Dept Sci & Informat Technol, Lisbon, Portugal
来源
PROCEEDINGS OF THE 10TH INTERNATIONAL CONFERENCE ON PHOTONICS, OPTICS AND LASER TECHNOLOGY (PHOTOPTICS) | 2021年
关键词
Graph Coloring; Greedy; Optical Networks; Tabu Search; Wavelength Assignment;
D O I
10.5220/0010910000003121
中图分类号
O43 [光学];
学科分类号
070207 ; 0803 ;
摘要
The aim of this work is to study the Tabu Search algorithm as a graph coloring technique for wavelength assignment in optical networks, a crucial function in optical network planning. The performance of the Tabu Search is assessed in terms of the number of wavelengths and computation time and is compared with the one of the most common Greedy algorithm. It is concluded that for real networks with a large number of nodes and a higher variance node degree of the path graph relatively to its average node degree value, the Greedy algorithm is preferable to the Tabu Search algorithm since it returns the same number of colors of Tabu Search, but in a shorter computation time.
引用
收藏
页码:59 / 68
页数:10
相关论文
共 50 条
  • [1] A tabu search heuristic for the routing and wavelength assignment problem in multigranular optical networks
    Jean-Marc Hyppolite
    Philippe Galinier
    Samuel Pierre
    Photonic Network Communications, 2008, 15 : 123 - 130
  • [2] A tabu search heuristic for the routing and wavelength assignment problem in multigranular optical networks
    Hyppolite, Jean-Marc
    Galinier, Philippe
    Pierre, Samuel
    PHOTONIC NETWORK COMMUNICATIONS, 2008, 15 (02) : 123 - 130
  • [3] A tabu search heuristic for the routing and wavelength assignment problem in optical networks
    Dzongang, C
    Galinier, P
    Pierre, S
    IEEE COMMUNICATIONS LETTERS, 2005, 9 (05) : 426 - 428
  • [4] Graph Coloring Tabu Search for Project Scheduling
    Zufferey, Nicolas
    ADVANCED COMPUTATIONAL METHODS FOR KNOWLEDGE ENGINEERING, 2015, 358 : 107 - 118
  • [5] INFORMED REACTIVE TABU SEARCH FOR GRAPH COLORING
    Porumbel, Daniel Cosmin
    Hao, Jin-Kao
    Kuntz, Pascale
    ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2013, 30 (04)
  • [6] A tabu search algorithm for static routing and wavelength assignment problem
    Wang, Y
    Cheng, TH
    Lim, MH
    IEEE COMMUNICATIONS LETTERS, 2005, 9 (09) : 841 - 843
  • [7] Improvement of routing and wavelength assignment in WDM networks using tabu search
    Khyda, DO
    Chamberland, S
    Pierre, S
    CCECE 2003: CANADIAN CONFERENCE ON ELECTRICAL AND COMPUTER ENGINEERING, VOLS 1-3, PROCEEDINGS: TOWARD A CARING AND HUMANE TECHNOLOGY, 2003, : 765 - 768
  • [8] Use of tabu search in the logical topology design of wavelength routed optical networks
    Achan, K
    Aneja, Y
    Bandyopadhyay, S
    HIGH PERFORMANCE COMPUTING SYSTEMS AND APPLICATIONS, 2003, 727 : 129 - 143
  • [9] A heuristic algorithm based on tabu search for routing and wavelength assignment in multicast multi-wavelength multi-fiber networks
    Weesapen, K.
    Munjirungkoon, A.
    Prommak, C.
    Wuttisittikulkij, L.
    2006 IEEE SARNOFF SYMPOSIUM, 2006, : 363 - +
  • [10] A heuristics based wavelength assignment algorithm in wavelength routed all optical networks
    Qin, Y
    Li, B
    IEICE TRANSACTIONS ON COMMUNICATIONS, 2003, E86B (08) : 2334 - 2340