Efficient implementations of heuristics for routing and wavelength assignment

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5038 LNCS, Issue , 2008, Pages 169-180

  Noronha, Thiago F ^a   Resende, Mauricio G C ^b   Ribeiro, Celso C ^c  

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

^b AT AND T LABS RESEARCH   (United States)

^c FLUMINENSE FEDERAL UNIVERSITY   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER NETWORKS; EVOLUTIONARY ALGORITHMS; FIBER OPTIC NETWORKS; FIBER OPTICS; HEURISTIC METHODS; HEURISTIC PROGRAMMING; METROPOLITAN AREA NETWORKS; MULTIPLEXING; MULTIPLEXING EQUIPMENT; NETWORK PROTOCOLS; NUCLEAR PROPULSION; NUMERICAL METHODS; SET THEORY; TELECOMMUNICATION SYSTEMS; WASTEWATER; WAVELENGTH DIVISION MULTIPLEXING;

CURRENT STATE; EXPERIMENTAL ALGORITHMS; HEIDELBERG (CO); INTERNATIONAL (CO); LIGHTPATHS (LP); NP-HARD; OPTICAL NETWORKS; ROUTING AND WAVELENGTH ASSIGNMENT (RWA); RUNNING TIMES; SPRINGER (CO); TEST BEDS; WAVELENGTH DIVISION MULTIPLEXING (WDM);

WAVELENGTH;

EID: 45449120256     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-68552-4_13     Document Type: Conference Paper

References (13)

1. Alvim, A.C.F., Ribeiro, C.C., Glover, F., Aloise, D.J.: A hybrid improvement heuristic for the one-dimensional bin packing problem. Journal of Heuristics 10, 205-229 (2004)
2. Bannerjee, D., Mukherjee, B.: Practical approach for routing and wavelength assignment in large wavelength routed optical networks. IEEE Journal on Selected Areas in Communications 14, 903-908 (1995)
3. Choi, J.S., Golmie, N., Lapeyrere, F., Mouveaux, F., Su, D.: 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, Paris, pp. 1109-1115 (2000)
4. Erlebach, T., Jansen, K.: The complexity of path coloring and call scheduling. Theoretical Computer Science 255, 33-50 (2001)
5. Hyytiä, E., Virtamo, J.: Wavelength assignment and routing in WDM networks. In: Fourteenth Nordic Teletraffic Seminar, Copenhagen, pp. 31-40 (1998)
6. Jaumard, B.: Network and traffic data sets for optical network optimization (last visited on January 3th, 2008), http://users.encs.concordia. ca/~bjaumard
7. Li, G., Simha, R.: The partition coloring problem and its application to wavelength routing and assignment. In: Proceedings of the First Workshop on Optical Networks, Dallas (2000)
8. Manohar, P., Manjunath, D., Shevgaonkar, R.K.: Routing and wavelength assignment in optical networks from edge disjoint path algorithms. IEEE Communications Letters 5, 211-213 (2002)
9. Noronha, T.F., Ribeiro, C.C.: Routing and wavelength assignment by partition coloring. European Journal of Operational Research 171, 797-810 (2006)
10. Ramalingam, G., Reps, T.W.: An incremental algorithm for a generalization of the shortest-path problem. Journal of Algorithms 21, 267-305 (1996)
11. Schrage, L.: A more portable Fortran random number generator. ACM Transactions on Mathematical Software 5, 132-138 (1979)
12. Skorin-Kapov, N.: Routing and wavelength assignment in optical networks using bin packing based algorithms. European Journal of Operational Research 177, 1167-1179 (2007)
13. Zang, H., Jue, J.P., Mukherjee, B.: A review of routing and wavelength assignment approaches for wavelength-routed optical WDM networks. Optical Networks Magazine 1, 47-60 (2000)