کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
463631 697162 2011 7 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
A hierarchical Path Computation Element (PCE)-based k-random-paths routing algorithm in multi-domain WDM networks
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر شبکه های کامپیوتری و ارتباطات
پیش نمایش صفحه اول مقاله
A hierarchical Path Computation Element (PCE)-based k-random-paths routing algorithm in multi-domain WDM networks
چکیده انگلیسی

We propose an inter-domain routing algorithm for multi-domain wavelength-division multiplexing (WDM) mesh networks. On the basis of the hierarchical Path Computation Element (PCE) architecture, the proposed algorithm introduces a kk random path strategy in the parent PCE to adjust the algorithm optimization level. Simulation results indicate that the proposed algorithm outperforms previous schemes in terms of blocking probability and resource utilization, while preventing the increase in PCEP signaling overhead.


► In this study an inter-domain routing algorithm is proposed for multi-domain WDM mesh networks.
► The proposed algorithm introduces a kk random path strategy in the parent PCE to adjust the algorithm optimization level.
► The proposed algorithm outperforms previous schemes in terms of blocking probability and resource utilization while not increasing the PCEP signaling overhead.
► The result of the proposed algorithm approximates the global optimal path when load balance is considered.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Optical Switching and Networking - Volume 8, Issue 4, December 2011, Pages 235–241
نویسندگان
, , , , , ,