End-to-End Scheduling in Real-Time Packet-Switched Networks

Authors:
Ian R. Philp;Jane W. S. Liu
Affiliations:
-;-
Venue:
ICNP '96 Proceedings of the 1996 International Conference on Network Protocols (ICNP '96)
Year:
1996

Citing 0
Cited 6

Time-shift scheduling—fair scheduling of flows in high-speed networks

IEEE/ACM Transactions on Networking (TON)
Real-Time Traffic Scheduling and Routing in Packet-Switched Networks Using a Least-Laxity-First Strategy

Journal of VLSI Signal Processing Systems
Concurrent Scheduling: Efficient Heuristics for Online Large-Scale Data Transfers in Distributed Real-Time Environments

IEEE Transactions on Parallel and Distributed Systems
A new scalable service discipline for real-time traffic: The framed-deadline scheduler

Computer Communications
Frame-counter scheduler: A novel QoS scheduler for real-time traffic

Computer Communications
A multi-classes-based algorithm to provide flexible QoS services in B3G networks

WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing

Quantified Score

Hi-index	0.00

Visualization

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.