Routing and wavelength assignment by partition colouring

European Journal of Operational Research

Volumn 171, Issue 3, 2006, Pages 797-810

  Noronha, Thiago F ^a   Ribeiro, Celso C ^a  

^a PONTIFICAL CATHOLIC UNIVERSITY OF RIO DE JANEIRO   (Brazil)

Author keywords

Heuristics; Optical networks; Partition colouring; Routing; Tabu search; Wavelength assignment; WDM

Indexed keywords

COMPUTATION THEORY; GRAPH THEORY; HEURISTIC METHODS; OPTICAL PROPERTIES; PROBLEM SOLVING;

OPTICAL NETWORKS; PARTITION COLORING; ROUTING; TABU SEARCH; WAVELENGTH ASSIGNMENT;

WAVELENGTH DIVISION MULTIPLEXING;

EID: 31144448616     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2004.09.007     Document Type: Article

References (15)

1. R.M. Aiex, M.G.C. Resende, and C.C. Ribeiro Probability distribution of solution time in GRASP: An experimental investigation Journal of Heuristics 8 2002 343 373
2. M. Alanyali, and E. Ayanoglu Provisioning algorithms for WDM optical networks IEEE/ACM Transactions on Networking 7 1999 767 778
3. C.R. Aragon, D.S. Johnson, A. McGeoch, and C. Schevon Optimization by simulated annealing: An experimental evaluation: Part II, graph coloring and number partitioning Operations Research 39 1991 378 406
4. D. Banerjee, and B. Mukherjee Practical approach for routing and wavelength assignment in large wavelength routed optical networks IEEE Journal on Selected Areas in Communications 14 1995 903 908
5. D. Brelaz New methods to color the vertices of a graph Communications of the ACM 22 1979 251 256
6. J.S. Choi, N. Golmie, F. Lapeyrere, F. Mouveaux, D. Su, A functional classification of routing and wavelength assignment schemes in DWDM networks: static case, in: Proceedings of the 7th International Conference on Optical Communication and Networks, 2000, pp. 1109-1115.
7. T. Erlebach, and K. Jansen The complexity of path coloring and call scheduling Theoretical Computer Science 255 2001 33 50
8. P. Festa, P.M. Pardalos, M.G.C. Resende, and C.C. Ribeiro Randomized heuristics for the MAX-CUT problem Optimization Methods and Software 7 2002 1033 1058
9. F. Glover, and M. Laguna Tabu Search 1997 Kluwer
10. E. Hyytiã, and J. Virtamo Wavelength assignment and routing in WDM networks Nordic Teletrafic Seminar 14 1998 31 40
11. J.M. Kleinberg, Approximation algorithms for disjoint paths problems, Ph.D. Thesis, MIT, Cambridge, MA, 1996.
12. G. Li, R. Simha, The partition coloring problem and its application to wavelength routing and assignment, in: Proceedings of the First Workshop on Optical Networks, 2000.
13. P. Manohar, D. Manjunath, and R.K. Shevgaonkar Routing and wavelength assignment in optical networks from edge disjoint path algorithms IEEE Communications Letters 5 2002 211 213
14. M.G.C. Resende, and C.C. Ribeiro A GRASP with path-relinking for private virtual circuit routing Networks 41 2003 104 114
15. J. Yoo, S. Banerjee, Design, analysis, and implementation of wavelength-routed all-optical networks: Routing and wavelength assignment approach. IEEE Communications Surveys Broadband Networks Area, 1997. Also available from: < http://home.att.net/~sbanerjee/papers/YoBa97.pdf> (last visited on May 20, 2004).