Title :
Stochastic fairness queueing
Author :
McKenney, Paul E.
Author_Institution :
SRI Int., Menlo Park, CA, USA
Abstract :
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
Keywords :
protocols; queueing theory; stochastic processes; CPU; ISO protocol suite; algorithms; high speed firmwave; high-speed software; memory; stochastic fairness queuing; Bandwidth; Computer networks; High-speed networks; Insulation; Microprogramming; Network topology; Round robin; Software algorithms; Stochastic processes; Telecommunication traffic;
Conference_Titel :
INFOCOM '90, Ninth Annual Joint Conference of the IEEE Computer and Communication Societies. The Multiple Facets of Integration. Proceedings, IEEE
Conference_Location :
San Francisco, CA
Print_ISBN :
0-8186-2049-8
DOI :
10.1109/INFCOM.1990.91316
