Fair queueing algorithm with rate independent delayfor ATM networks

7 January 1999

journal article
Published by Institution of Engineering and Technology (IET) in Electronics Letters

Vol. 35 (1) , 19-20
https://doi.org/10.1049/el:19990029

Abstract

A new scheduling algorithm based on self-clocked fair queueing is proposed. The algorithm employs an array of sorting bins for managing the virtual finishing time of connections and uses token buckets as a behaviour-indicator. It remedies the drawbacks of existing fair queueing algorithms and is able to reserve bandwidth to connections while guaranteeing a class-dependent and rate-independent delay for behaving connections.

Keywords

RATE INDEPENDENT DELAY
CLASS DEPENDENT DELAY
ATM NETWORK
BANDWIDTH RESERVATION
SCHEDULING
SELF-CLOCKED FAIR QUEUEING ALGORITHM
CONNECTION FINISHING TIME MANAGEMENT
SORTING BIN ARRAY
TOKEN BUCKET BEHAVIOUR INDICATOR

This publication has 1 reference indexed in Scilit:

Rate-based scheduling discipline forpacket switching networks
Electronics Letters, 1995