Queueing analysis of a distributed explicit rate allocation algorithm for ABR services

An 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, resource management (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