Stochastic fairness queueing

A class of algorithms called stochastic fairness queuing is presented. The algorithms are probabilistic variants of fairness queuing. They do not require an exact mapping and thus are suitable for high-speed software or firmware implementation. The algorithms span a broad range of CPU, memory, and f...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: McKenney, P.E.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:A class of algorithms called stochastic fairness queuing is presented. The algorithms are probabilistic variants of fairness queuing. They do not require an exact mapping and thus are suitable for high-speed software or firmware implementation. The algorithms span a broad range of CPU, memory, and fairness tradeoffs. It is shown that the worst-case execution-speed stochastic fairness queuing is faster than the best-case execution speed of all of the implementations of fair queuing presented. This advantage is larger for protocols with longer addresses, e.g. the ISO protocol suite.< >
DOI:10.1109/INFCOM.1990.91316