کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
452626 694559 2008 12 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
All-to-all disjoint multipath routing using cycle embedding
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر شبکه های کامپیوتری و ارتباطات
پیش نمایش صفحه اول مقاله
All-to-all disjoint multipath routing using cycle embedding
چکیده انگلیسی

In this paper, we evaluate the performance of disjoint multipath routing approaches for all-to-all routing in packet-switched networks with respect to packet overhead, path length, and routing table size. We develop a novel approach based on cycle embedding to obtain two node-disjoint paths between all source–destination pairs with reduced number of routing table entries maintained at a node (hence the reduced lookup time), small average path length, and less packet overhead. We study the trade-off between the number of routing table entries maintained at a node and the average length of the two disjoint paths by: (a) formulating the cycle-embedding problem as an integer linear program; and (b) developing a heuristic. We show that the number of routing table entries at a node may be reduced to at most two per destination using cycle-embedding approach if the average length of the disjoint paths are allowed to exceed the minimum by 25%.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computer Networks - Volume 52, Issue 7, 15 May 2008, Pages 1506–1517
نویسندگان
, ,