Queueing Analysis of a Distributed Explicit Rate Allocation Algorithm for ABR Services

  • Authors:
  • Nasir Ghani;Jon W. Mark

  • Affiliations:
  • -;-

  • Venue:
  • INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
  • Year:
  • 1997

Quantified Score

Hi-index 0.00

Visualization

Abstract

Approximate queueing analysis of a distributed explicit rate allocation algorithm for the flow control of available bit rate (ABR) service, which captures the effect of bandwidth-delay, is described. Attention is focused on bounding the worst case transient queueing behaviour in a strictly-ABR environment with persistent start-up sources. At each switch, RM cells are enqueued using a buffer separate from the data cells, and are served with a higher priority than data cells. Both single and multiple node network cases are treated for connections with differing delays. The approximate analysis shows relatively good agreement with simulation results for single node networks, but gives looser estimates for the multiple node case.