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
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)
IEEE/ACM Transactions on Networking (TON)
Performance and stability of communication networks via robust exponential bounds
IEEE/ACM Transactions on Networking (TON)
SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
Effective bandwidths for multiclass Markov fluids and other ATM sources
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Statistical Analysis of Generalized Processor Sharing Scheduling Discipline
Statistical Analysis of Generalized Processor Sharing Scheduling Discipline
Performance bounds in communication networks with variable-rate links
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Latency-rate servers: a general model for analysis of traffic scheduling algorithms
IEEE/ACM Transactions on Networking (TON)
Parametric Design Synthesis of Distributed Embedded Systems
IEEE Transactions on Computers
Optimal Call Admission Control under Generalized Processor Sharing Scheduling
IWQoS '01 Proceedings of the 9th International Workshop on Quality of Service
The Coexistence of Multicast and Unicast over a GPS Capable Network
ICN '01 Proceedings of the First International Conference on Networking-Part 1
Optimal call admission control on a single link with a GPS scheduler
IEEE/ACM Transactions on Networking (TON)
Computer Networks: The International Journal of Computer and Telecommunications Networking
A calculus for stochastic QoS analysis
Performance Evaluation
Waiting times for M/M systems under state-dependent processor sharing
Queueing Systems: Theory and Applications
Computer Networks: The International Journal of Computer and Telecommunications Networking
A measurement-based loss scheduling scheme
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
Sharp bounds in stochastic network calculus
Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems
Hi-index | 0.00 |
In this paper, we consider the problem of providing statistical guarantees (for example, on the tail distribution of delay) under the Generalized Processor Sharing (GPS) scheduling discipline. This work is motivated by, and is an extension of, Parekh and Gallager's deterministic study of GPS scheduling discipline with leaky-bucket token controlled sessions [PG93a,b, Parekh92]. Using the exponentially bounded burstiness (E.B.B.) process model introduced in [YaSi93a] as a source traffic characterization, we establish results that extend the deterministic study of GPS: for a single GPS server in isolation, we present statistical bounds on the tail distributions of backlog and delay for each session. In the network setting, we show that networks belonging to a broad class of GPS assignments, the so-called Consistent Relative Session Treatment (CRST) GPS assignments, are stable in a stochastic sense. In particular, we establish simple bounds on the tail distribution of backlog and delay for each session in a Rate Proportional Processor Sharing (RPPS) GPS network with arbitrary topology.