Queueing Delays in Rate Controlled Networks

TitleQueueing Delays in Rate Controlled Networks
Publication TypeTechnical Report
Year of Publication1992
AuthorsBanerjea, A., & Keshav S.
Other Numbers720
Abstract

This paper addresses the problem of finding the worst case end-to-end delay and buffer occupancy bounds in networks of rate-controlled, non-work conserving servers.The calculations are based on a simple fluid model, but care is taken so that the computed delay and buffer occupancy values are upper bounds on actual values. A simple algorithm is presented to perform these calculations in linear time.Simulation results compare the computed worst case delays with the actual delays obtained on some simple network topologies. The algorithm is found to predict node delays well for bursty input traffic, but poorly for smooth input traffic. Buffer requirements are predicted well in both cases.

URLhttp://www.icsi.berkeley.edu/ftp/global/pub/techreports/1992/tr-92-015.pdf
Bibliographic Notes

ICSI Technical Report TR-92-015

Abbreviated Authors

A. Banerjea and S. Keshav

ICSI Publication Type

Technical Report