By Topic

Flow service order: a computationally inexpensive packet scheduling algorithm to support QoS guarantees for real-time traffic

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)
Sanjeev, R.K. ; Technol. Group, Novell Software Dev. India Pvt. Ltd., Bangalore, India ; Seal, K. ; Sitaram, Dinkar

A new strategy for scheduling packets which promises adherence to the quality of service requirements of real-time data (e.g., video) is proposed. We prove that this new algorithm bounds the interpacket delay between two packets. We also arrive at an expression that bounds the average waiting time of a packet. We then show empirical results regarding the performance of our algorithm that we obtained through simulation. A comparison is made between the performance of our algorithm vis-a-vis the previous algorithms

Published in:

ATM, 1999. ICATM '99. 1999 2nd International Conference on

Date of Conference:

1999