Semantic Scholar Open Access 1989 3301 sitasi

Analysis and simulation of a fair queueing algorithm

A. Demers S. Keshav S. Shenker

Lihat Sumber DOI

Abstrak

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.

Topik & Kata Kunci

Computer Science

Penulis (3)

A. Demers

S. Keshav

S. Shenker

Format Sitasi

APA MLA BibTeX

Demers, A., Keshav, S., Shenker, S. (1989). Analysis and simulation of a fair queueing algorithm. https://doi.org/10.1145/75246.75248

Akses Cepat

Lihat di Sumber doi.org/10.1145/75246.75248

Informasi Jurnal

Tahun Terbit: 1989
Bahasa: en
Total Sitasi: 3301×
Sumber Database: Semantic Scholar
DOI: 10.1145/75246.75248
Akses: Open Access ✓