Core Stateless Fair Bandwidth Allocation for Unicast and Multicast Flows

نویسندگان

  • Albert Banchs
  • Frederic Raspall
  • David Anguera
  • Sebastià Sallent
چکیده

In this paper we aim at developing a solution to fairly allocating bandwidth among unicast and multicast flows. For this purpose, we propose the anycast max-min fairness criterion, which is based on the well known max-min fairness criterion for unicast. We then present an efficient implementation of the proposed criterion: the Multicast Fair Bandwidth Allocation (MFBA) architecture. The MFBA architecture has two key aspects: 1) maintaining per-flow state at core routers is avoided, and 2) layered multicast is supported without the need for signaling. The proposed architecture has been implemented in a Linux PC platform. We report experimental results on the bandwidth allocation and the quality of layered video.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Adaptive CSFQ: A New Fair Queuing Mechanism for SCORE Networks

In stateless core (SCORE) networks, edge routers maintain per-flow state while core routers do not. Core stateless fair queuing (CSFQ) has been proposed for approximating the operation of per-flow queuing techniques in SCORE networks. However, the packet dropping probability offered by CSFQ suits only UDP flows. Thus, CSFQ cannot achieve fair bandwidth allocation for TCP flows. This paper propo...

متن کامل

Fair bandwidth sharing between unicast and multicast flows in best-effort networks

In this paper, we propose a simple scheduler called SBQ (Service-Based Queuing) to share the bandwidth fairly between unicast and multicast flows according to a new definition of fairness referred as the inter-service fairness. We also describe a new active queue management mechanism called MFQ (Multicast Fair Queuing) to fairly share the allowed multicast bandwidth among competing flows in the...

متن کامل

SBQ: A Simple Scheduler for Fair Bandwidth Sharing Between Unicast and Multicast Flows

In this paper, we propose a simple scheduler called SBQ (Service-Based Queuing) to share the bandwidth fairly between unicast and multicast flows according to a new definition of fairness referred as the inter-service fairness. We utilize our recently proposed active queue management mechanism MFQ (Multicast Fair Queuing) to fairly share the bandwidth among all competing flows in the multicast ...

متن کامل

Assuring Fair Allocation of Excess Bandwidth in Reservation Based Core-Stateless Networks

Assuring guaranteed services and providing fair bandwidth sharing are much sought characteristics in the current network architecture research. The IntServ approaches achieve those characteristics but only at the expense of using per-flow states and signaling, which are not scalable and difficult to implement. Alternatively, the stateless approaches proposed up to now are focused either on prov...

متن کامل

Core-Stateless Labeling Fairness: An Integrated Architecture to Approximate Fair Bandwidth Allocations in High Speed Networks

Core-stateless mechanisms achieve better scalability by reducing the complexity of fair queuing, which usually needs to maintain states, manage buffers, and perform flow scheduling on a per-flow basis. However, they require per-packet relabeling in the core routers. In this paper, we propose a core-stateless fair bandwidth allocation scheme without maintaining per flow state in core routers. Fu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002