By Topic

Core-stateless Fair Bandwidth Allocation for Guaranteed Services, Part II: Proportional Allocation of Excess Bandwidth

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Yan Qin ; Dept. of Comput. Sci. & Technol., Tsinghua Univ., Beijing ; Yong Xiang ; Meilin Shi

Maintaining scheduling parameters only in each packet's header make it difficult for core-stateless networks to provide deterministic (zero loss) fair bandwidth allocation to each flow. Based on VCSGR, this paper presents a new algorithm, called FVCSGR (fair-VCSGR). In a network of FVCSGR, the arriving traffic of each flow is divided at the ingress node into a set of layers according to its reserved rate. Every packet is marked at an ingress node with a layer label and two virtual delay vectors: the basic vector and the fair vector. The basic vector which comes from VCSGR is used to provide accurate basic bandwidth guarantees and the same upper bound on end-to-end delay as its GR counterpart. On the other hand, the fair vector is used with layer label to guarantee proportional fair bandwidth allocation. We show that the out-of-order problem originated from layer scheduling can be restricted within a narrow range

Published in:

Computational Engineering in Systems Applications, IMACS Multiconference on

Date of Conference:

4-6 Oct. 2006