کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
10333932 | 689865 | 2011 | 18 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Stabilization of max-min fair networks without per-flow state
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله

چکیده انگلیسی
Let a flow be a sequence of packets that are sent from a source computer to a destination computer. In this paper, we consider the fair allocation of bandwidth to each flow in a computer network. We focus on max-min fairness, which assigns to each flow the largest possible bandwidth that avoids affecting other flows. What distinguishes our approach is that routers only maintain a constant amount of state, i.e., no per-flow state is maintained. This is consistent with trends in the Internet (such as the proposed Differentiated Services Internet architecture). In addition, to provide a high degree of fault-tolerance, we ensure our approach is self-stabilizing, that is, it returns to a normal operating state after a finite sequence of faults.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Theoretical Computer Science - Volume 412, Issue 40, 16 September 2011, Pages 5562-5579
Journal: Theoretical Computer Science - Volume 412, Issue 40, 16 September 2011, Pages 5562-5579
نویسندگان
Jorge A. Cobb, Mohamed G. Gouda,