Simulation study of maximal delays in various link scheduling algorithms

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.