By Topic

Core-stateless Fair Bandwidth Allocation for Guaranteed Services, Part I: End-to-end Precise Basic Bandwidth Guarantees

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

The core-stateless packet scheduling scheme has both scalability and the ability of fine granularity QoS guarantees. However, maintaining scheduling parameters only in the packet header make it difficult for core-stateless networks to provide deterministic (zero loss) fair bandwidth allocation to each flow. To address this problem, we conceptually separate bandwidth allocation into two steps: the allocation of the basic bandwidth that equals to the reserved rate of the flow and the allocation of extra bandwidth. In this paper, we propose a novel virtual delay vector based core-stateless packet scheduling algorithm, called VCSGR (vector-based core-stateless guaranteed rate). We show that a network of servers running such algorithms provides the same end-to-end delay guarantee as a network of corresponding GR servers. Furthermore, VCSGR uses virtual delay vector technique to achieve accurate basic bandwidth guarantee, which is an essential step toward deterministic fair core-stateless packet scheduling algorithms

Published in:

Computational Engineering in Systems Applications, IMACS Multiconference on

Date of Conference:

4-6 Oct. 2006