A Self-Clocked Fair Queueing Scheme for Broadband Applications

A n eficient fair queueing scheme which is feasible for broadband implementation is proposed and its performance is analyzed. We define fairness in a selfcontained manner, eliminating the need for the hypothetical fluid-flow reference system used in the present state of art and thereby removing the associated computational complexity. The scheme is based on the adoption of an internally generated virtual time as the index of work progress, hence the name self-clocked fair queueing. We prove that the scheme possesses the desired fairness property and is nearly optimal, in the sense that the maximum permissible disparity among the normalized services offered to the backlogged sessions is newer more than two times the corresponding figure in any packet-based queueing system.

• Type: Conference
• Year: 1994
• Where: INFOCOM
• Authors: S. Jamaloddin Golestani
• Keywords: Communications, Fair Queueing Scheme, Hypothetical Fluid-flow Reference, INFOCOM 1994, Self-clocked Fair Queueing