Scheduled System Maintenance:
On Monday, April 27th, IEEE Xplore will undergo scheduled maintenance from 1:00 PM - 3:00 PM ET (17:00 - 19:00 UTC). No interruption in service is anticipated.
By Topic

Mean starting potential fair queuing for high-speed packet 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)
Dong-Yong Kwak ; Network Technol. Lab., Electron. & Telecommun. Res. Inst., Daejeon, South Korea ; Nam-Seok Ko ; Hong-Shik Park

This paper proposes an efficient fair queuing algorithm, called mean starting potential fair queuing (MSPFQ), which has O(l) complexity for the virtual time computation while it has delay and fairness properties similar to starting-potential fair queueing (SPFQ). The key idea of MSPFQ algorithm is that it recalibrates the system virtual time to the mean value of the minimum possible virtual start times of HOL packets in each backlogged session. Through analysis and simulation, this paper shows that the proposed algorithm has good delay and fairness properties.

Published in:

Global Telecommunications Conference, 2003. GLOBECOM '03. IEEE  (Volume:5 )

Date of Conference:

1-5 Dec. 2003