Fair queueing algorithm with rate independent delay for ATM networks
Research output: Journal Publications and Reviews (RGC: 21, 22, 62) › 21_Publication in refereed journal › peer-review
Author(s)
Related Research Unit(s)
Detail(s)
Original language | English |
---|---|
Pages (from-to) | 19-20 |
Journal / Publication | Electronics Letters |
Volume | 35 |
Issue number | 1 |
Publication status | Published - 7 Jan 1999 |
Link(s)
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. © IEE 1999.
Citation Format(s)
Fair queueing algorithm with rate independent delay for ATM networks. / Ho, S.; Chan, S.; Ko, K. T.
In: Electronics Letters, Vol. 35, No. 1, 07.01.1999, p. 19-20.Research output: Journal Publications and Reviews (RGC: 21, 22, 62) › 21_Publication in refereed journal › peer-review