Paper Info
Title
End-to-End Scheduling in Real-Time Packet-Switched Networks
Abstract
This paper presents the budgeted-weighted-round-robin (BWRR) algorithm for scheduling the transmission of hard-real-time messages in a packet-switched network. The BWRR algorithm provides a bound on the worst case delay of a message through the network. In addition, with the BWRR algorithm, the necessary buffer space at each switch is predictable and can be fixed at system configuration time. The per switch delay and required buffer space provided by the BWRR algorithm are significantly less than those provided by previous methods. The BWRR algorithm has a simple hardware implementation and admission test, and it does not require a global clock or any explicit flow control messages. It can achieve high utilization of the network under most practical scenarios and reacts predictably under transient overloads.
Year
DOI
Venue
1996
10.1109/ICNP.1996.564891
ICNP
Keywords
Field
DocType
admission test,worst case delay,hard-real-time message,global clock,explicit flow control message,necessary buffer space,real-time packet-switched networks,required buffer space,packet-switched network,end-to-end scheduling,switch delay,bwrr algorithm,real time systems,flow control,packet switching,real time,scheduling,end to end delay,weighted round robin,packet switched network
End-to-end delay,Worst case delay,Scheduling (computing),Computer science,End-to-end principle,System configuration,Computer network,Real-time computing,Flow control (data),Packet switching,Packet switched,Distributed computing
Conference
ISBN
Citations 
PageRank 
0-8186-7453-9
6
0.52
References 
Authors
10
2
Name
Order
Citations
PageRank
Ian R. Philp1101.23
Jane W.-S. Liu21399337.97