http://iet.metastore.ingenta.com
1887

Fair queueing algorithm with rate independent delay for ATM networks

Fair queueing algorithm with rate independent delay for ATM networks

For access to this article, please select a purchase option:

Buy article PDF
$19.95
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
Electronics Letters — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

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.

References

    1. 1)
      • Jamaloddin Golestani, S.: `A self-clocked fair queuing scheme for broadband applications', Proc. IEEE INFOCOM, 1994, p. 636–646.
    2. 2)
      • Jong Won Lee , Chong-Kwon Kim , Choong Woong Lee . Rate-based scheduling discipline forpacket switching networks. Electron. Lett. , 1130 - 1131
    3. 3)
      • Rexford, J.L., Greenberg, A.G., Bonomi, F.G.: `Hardware-efficient fair queuingarchitectures for high-speed networks', Proc. IEEE INFOCOM, 1996.
http://iet.metastore.ingenta.com/content/journals/10.1049/el_19990029
Loading

Related content

content/journals/10.1049/el_19990029
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address