کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
453328 694789 2006 23 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
A minimum interference routing algorithm with reduced computational complexity
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر شبکه های کامپیوتری و ارتباطات
پیش نمایش صفحه اول مقاله
A minimum interference routing algorithm with reduced computational complexity
چکیده انگلیسی

Minimum interference routing algorithms are designed to reduce rejections of future requests for the establishment of Label Switched Paths (LSPs) but make no assumption about specific patterns of arrival request. This paper introduces a novel minimum interference routing algorithm, Light Minimum Interference Routing (LMIR), which is based on a new approach to the identification of critical links. This approach reduces the computational complexity involved in finding a path for the establishment of an LSP. The LMIR is shown to have the same precision as existing algorithms but with less computational complexity.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computer Networks - Volume 50, Issue 11, 10 August 2006, Pages 1710–1732
نویسندگان
, , ,