Fair queueing algorithm with rate independent delay for ATM networks

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