کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
482877 | 1446222 | 2006 | 14 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Routing and wavelength assignment by partition colouring
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Routing and wavelength assignment by partition colouring Routing and wavelength assignment by partition colouring](/preview/png/482877.png)
چکیده انگلیسی
The problem of routing and wavelength assignment in all-optical networks may be solved by a combined approach involving the computation of alternative routes for the lightpaths, followed by the solution of a partition colouring problem in a conflict graph. A new tabu search heuristic is also proposed for the partition colouring problem, which may be viewed as an extension of the graph colouring problem. Computational experiments are reported, showing that the tabu search heuristic outperforms the best heuristic for partition colouring by approximately 20% in the average and illustrating that the new approach for the problem of routing and wavelength assignment is more robust than a well established heuristic for this problem.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 171, Issue 3, 16 June 2006, Pages 797–810
Journal: European Journal of Operational Research - Volume 171, Issue 3, 16 June 2006, Pages 797–810
نویسندگان
Thiago F. Noronha, Celso C. Ribeiro,