By Topic

Virtual Delay Vector Based Core-Stateless Packet Scheduling Algorithm

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

There is an increasing need for scalability in high-speed networks. The core-stateless approaches based on DPS (dynamic packet state) technique offer great promise in terms of both scalability and fine-grained service guarantees. But, such core-stateless schemes proposed in the literature can not provide accurate rate guarantee to flows due to the loss of a large part of per-flow state. In this paper, we propose a novel virtual delay vector based core stateless packet scheduling algorithm, called VCSVC(G) (vector core-stateless virtual clock algorithm with parameter G), that provides delay guarantee same as virtual clock as well as rate guarantee similar to virtual clock. This algorithm uses virtual delay vector and partial average techniques to achieve balance between the upper bound on the length of virtual delay vector, G, and the accuracy of rate guarantee. Hence, it can meet a wide range of QoS requirements by setting the parameter G appropriately

Published in:

Networking and Services, 2006. ICNS '06. International conference on

Date of Conference:

16-18 July 2006