Analysis and simulation of a fair queueing algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
A stop-and-go queueing framework for congestion management
SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
Virtual clock: a new traffic control algorithm for packet switching networks
SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
Comparison of rate-based service disciplines
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 2)
On computing per-session performance bounds in high-speed multi-hop computer networks
SIGMETRICS '92/PERFORMANCE '92 Proceedings of the 1992 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
SIGCOMM '92 Conference proceedings on Communications architectures & protocols
IEEE/ACM Transactions on Networking (TON)
SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
An upper bound on delay for the VirtualClock service discipline
IEEE/ACM Transactions on Networking (TON)
A new approach to the control of real-time traffic in packet switching data networks
A new approach to the control of real-time traffic in packet switching data networks
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
Efficient fair queueing using deficit round-robin
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
A schedulability condition for deadline-ordered service disciplines
IEEE/ACM Transactions on Networking (TON)
Determining end-to-end delay bounds in heterogeneous networks
Multimedia Systems - Special issue on the fifth workshop on network and operating system support for digital audio and video 1995 (NOSSDAV)
Time-shift scheduling—fair scheduling of flows in high-speed networks
IEEE/ACM Transactions on Networking (TON)
A dynamic regulation and scheduling scheme for real-time traffic management
IEEE/ACM Transactions on Networking (TON)
Parametric Design Synthesis of Distributed Embedded Systems
IEEE Transactions on Computers
Jitter control in QoS networks
IEEE/ACM Transactions on Networking (TON)
Preserving quality of service guarantees in spite of flow aggregation
IEEE/ACM Transactions on Networking (TON)
Jitter Regulation in an Internet Router with Delay Consideration
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Leap Forward Virtual Clock: A New Fair Queuing Scheme with Guaranteed Delay and Throughput Fairness
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
A theory of multi-channel schedulers for quality of service
Journal of High Speed Networks
Stratified round Robin: a low complexity packet scheduler with bandwidth fairness and bounded delay
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Scheduling for quality of service guarantees via service curves
ICCCN '95 Proceedings of the 4th International Conference on Computer Communications and Networks
The Stratified Round Robin scheduler: design, analysis and implementation
IEEE/ACM Transactions on Networking (TON)
Scalable quality of service across multiple domains
Computer Communications
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
Hi-index | 0.01 |
Leave-in-Time is a new rate-based service discipline for packet-switching nodes in a connection-oriented data network. Leave-in-Time provides sessions with upper bounds on end-to-end delay, delay jitter, buffer space requirements, and an upper bound on the probability distribution of end-to-end delays. A Leave-in-Time session's guarantees are completely determined by the dynamic traffic behavior of that session, without influence from other sessions. This results in the desirable property that these guarantees are expressed as functions derivable simply from a single fixed-rate server (with rate equal to the session's reserved rate) serving only that session. Leave-in-Time has a non-work-conserving mode of operation for sessions desiring low end-to-end delay jitter. Finally, Leave-in-Time supports the notion of delay shifting, whereby the delay bounds of some sessions may be decreased at the expense of increasing those of other sessions. We present a set of admission control algorithms which support the ability to do delay shifting in a systematic way.