Fair queueing algorithm with rate independent delay for ATM networks

Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review

1 Scopus Citations
View graph of relations


Related Research Unit(s)


Original languageEnglish
Pages (from-to)19-20
Journal / PublicationElectronics Letters
Issue number1
Publication statusPublished - 7 Jan 1999


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. © IEE 1999.