Analysis and Simulation of a Fair Queueing Algorithm

DMCA

Analysis and Simulation of a Fair Queueing Algorithm (1989)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Alan Demers , Srinivasan Keshav , Scott Shenker

Citations:

1266 - 39 self

BibTeX

@MISC{Demers89analysisand,
    author = {Alan Demers and Srinivasan Keshav and Scott Shenker},
    title = {Analysis and Simulation of a Fair Queueing Algorithm},
    year = {1989}
}

OpenURL

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.

Keyphrases

abstract analysis fair queueing algorithm several important advantage datagram network congestion control ill-behaved source usual first-come-first-serve fair allocation full share

DMCA