IEEE/ACM Transactions on Networking (TON)
SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
IEEE/ACM Transactions on Networking (TON)
Second moment resource allocation in multi-service networks
SIGMETRICS '97 Proceedings of the 1997 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
A central-limit-theorem-based approach for analyzing queue behavior in high-speed networks
IEEE/ACM Transactions on Networking (TON)
A Study of Providing Statistical QoS in a Differentiated Sevices Network
NCA '03 Proceedings of the Second IEEE International Symposium on Network Computing and Applications
Bounds, Approximations & Applications for a Two-Queue GPS System
Bounds, Approximations & Applications for a Two-Queue GPS System
Two different approaches for providing QoS in the Internet backbone
Computer Communications
A network calculus with effective bandwidth
IEEE/ACM Transactions on Networking (TON)
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
This paper proposes an analytical method to evaluate the delay violation probability of traffic flows with statistic al Quality-of-Service (QoS) guarantees in a Generalized Processor Sharing scheduler. The statistical QoS targets, for each service class, are expressed in terms of a delay threshold and delay violation probability. We study both the single node and the end-to-end paths comprising multiple schedulers. Moreover, we assume that traffic admits a linear variance envelope, therefore, we account for Leaky-Bucket-regulated traffic, for general Markov-Modulated Poisson Process sources and Markov-Modulated Fluid Process sources and, more in general, to the wide class of sources for which the variance of the cumulative generated traffic can be upper bounded by a linear function of time. Under these assumptions, we are able to derive an approximation on delay distributions for each class of the GPS scheduler. Moreover, by exploiting a novel framework for the calculation of statistical end-to-end delay bounds (the bounded variance network calculus) we iterate our formulas, derived for the isolated node, to multi-node paths and, in turn, we provide analytical forms for the end-to-end delay. Numerical investigation shows that our approximations are very close to the simulated values.