By Topic

On a packet scheduling mechanism for supporting delay sensitive applications on high speed networks

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)
Altintas, O. ; Comput. Technol. Labs., UNCL, Tokyo, Japan ; Atsumi, Y. ; Yoshida, T.

Supporting delay-sensitive applications over packet switched networks is a major challenge in networking. Packet scheduling is one of the mechanisms to be employed for this purpose in the network nodes (routers and switches) in a high-speed networking environment. In this paper we propose a new time-based packet scheduling algorithm. Our algorithm calculates and keeps an index for each flow in order to keep track of instantaneous bursts. With this approach, packet drops from queues of flows with small bandwidth shares can be partly prevented. Our algorithm can be considered as a slightly complicated version of WRR with improved delay characteristics. We first give an overview of packet scheduling and next describe the operation of our algorithm. We then provide preliminary simulation results showing the delay performance of the proposed algorithm under various traffic loads and show that the proposed algorithm has a better delay performance

Published in:

Information, Communications and Signal Processing, 1997. ICICS., Proceedings of 1997 International Conference on  (Volume:3 )

Date of Conference:

9-12 Sep 1997