(Enter summary)
Abstract: This paper presents the budgeted-weighted-round-robin
(BWRR) algorithm for scheduling the transmission of hardreal
-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... (Update)
Cited by: More
Scheduling and Buffer Management for Soft-Real-Time - Vbr Traffic In
(Correct)
Scheduling Real-Time Messages In Packet-Switched Networks - Philp (1997)
(Correct)
Active bibliography (related documents): More All
0.0: Real-time Communication in Packet-Switched Networks - Aras, Kurose, Reeves.. (1994)
(Correct)
0.0: Two Issues in Reservation Establishment - Shenker, Breslau (1995)
(Correct)
0.0: On the Use of Quality of Service in IP over ATM - Mah (1995)
(Correct)
Similar documents based on text:
0.0: Unknown -
(Correct)
Related documents from co-citation: More All
2: Real-Time Communication in an Internetwork
- Ferrari - 1992
2: Cycle time properties of the FDDI token ring protocol (context) - Sevcik, Johnson - 1987
2: A framing strategy for congestion management (context) - Golestani - 1991
BibTeX entry: (Update)
I. R. Philp and J. W. S. Liu. End-to-end scheduling in real-time packet switched networks. To appear in International Conference on Network Protocols, Oct. 1996. http://citeseer.ist.psu.edu/741214.html More
@misc{ philp96endtoend,
author = "I. Philp and J. Liu",
title = "End-to-end scheduling in real-time packet switched networks",
text = "I. R. Philp and J. W. S. Liu. End-to-end scheduling in real-time packet
switched networks. To appear in International Conference on Network Protocols,
Oct. 1996.",
year = "1996",
url = "citeseer.ist.psu.edu/741214.html" }
Citations (may not include all citations):
1312
A generalized processor sharing approach to flow control in .. (context) - Parekh, Gallager - 1993
790
Analysis and simulation of a fair queueing algorithm (context) - Demers, Keshav et al. - 1989
559
A scheme for real-time channel establishment in wide-area ne..
- Ferrari, Verma - 1990
389
Virtual Clock: A new traffic control algorithm for packet sw.. (context) - Zhang - 1990
186
Rate controlled servers for very high speed networks
- Kalmanek, Kanakia et al. - 1990
179
Comparison of rate-based service disciplines
- Zhang, Keshav - 1991
146
Rate controlled static-priority queueing
- Zhang, Ferrari - 1993
117
Real-time communication in packet switched networks
- Aras, Kurose et al. - 1994
91
Delay jitter control for real-time communication in a packet..
- Verma, Zhang et al. - 1991
85
A framing strategy for congestion management (context) - Golestani - 1991
14
Fast switching and fair control of congested flow in broadba.. (context) - Katevenis - 1987
14
A scheduling discipline andadmission control policy for Xune..
- Saran, Keshav et al. - 1994
Documents on the same site (http://www-rtsl.cs.uiuc.edu/papers/index.html): More
Methods for Validating Real-Time Constraints - Liu, Ha (1995)
(Correct)
ICS: A System For Imprecise Computations - Hull, Liu (1993)
(Correct)
Probabilistic Analysis And Scheduling Of Critical Soft Real-Time.. - Gardner (1999)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC