By Topic

Simulation study of maximal delays in various link scheduling algorithms

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)
Wright, S. ; Fujitsu Network Commun., Rayleigh, NC, USA ; Viniotis, Y.

The paper reports on simulation studies of the maximum delays for several scheduling policies including variants of weighted round robin, fixed priority, and weighted fair queueing. The traffic sources considered were constant bit rate (CBR) and leaky bucket constrained variable bit rate (VBR). The number of sources and the size of the token bucket were varied. In some cases, maximum delay observations exceeded calculated generalized processor sharing (GPS) delay bounds. Over dimensioning of the network resources for VBR traffic was also observed

Published in:

Global Telecommunications Conference, 1998. GLOBECOM 1998. The Bridge to Global Integration. IEEE  (Volume:6 )

Date of Conference:

1998