Analysis and simulation of a fair queueing algorithm

A. Demers,S. Keshav,S. Shenker

Published 1989 in Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication

ABSTRACT

We discuss gateway queueing algorithms and their role in controlling congestion in datagram networks. A fair queueing algorithm, based on an earlier suggestion by Nagle, is proposed. Analysis and simulations are used to compare this algorithm to other congestion control schemes. We find that fair queueing provides several important advantages over the usual first-come-first-serve queueing algorithm: fair allocation of bandwidth, lower delay for sources using less than their full share of bandwidth, and protection from ill-behaved sources.

PUBLICATION RECORD

  • Publication year

    1989

  • Venue

    Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication

  • Publication date

    1989-08-01

  • Fields of study

    Computer Science

  • Identifiers
  • External record

    Open on Semantic Scholar

  • Source metadata

    Semantic Scholar

CITATION MAP

EXTRACTION MAP

CLAIMS

  • No claims are published for this paper.

CONCEPTS

  • No concepts are published for this paper.

REFERENCES

Showing 1-18 of 18 references · Page 1 of 1

CITED BY

Showing 1-100 of 3298 citing papers · Page 1 of 33