By Topic

High-performance variable-length packet scheduling algorithm for IP 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

2 Author(s)
Sung-Ho Moon ; Dept. of Electron. Eng. & Comput. Sci., KAIST, Daejeon, South Korea ; Dan Keun Sung

A high-performance variable-length packet scheduling algorithm is proposed for efficiently accommodating IP traffic in input. queued crossbar switches. It uses a rotating priority(round-robin) arbitration and a masking operation for variable-length packets. This algorithm achieves 100% throughput with a single iteration for uniform IP traffic and performs better in terms of packet latency and similar cell latency, compared with the well-known iSLIP cell-level scheduling algorithm

Published in:

Global Telecommunications Conference, 2001. GLOBECOM '01. IEEE  (Volume:4 )

Date of Conference:

2001