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)
Performance bonds for flow control protocols
IEEE/ACM Transactions on Networking (TON)
Differentiated Services with Statistical Real-Time Guarantees in Static-Priority Scheduling Networks
RTSS '01 Proceedings of the 22nd IEEE Real-Time Systems Symposium
A network calculus with effective bandwidth
IEEE/ACM Transactions on Networking (TON)
Application of network calculus to guaranteed service networks
IEEE Transactions on Information Theory
Scaling properties of statistical end-to-end bounds in the network calculus
IEEE Transactions on Information Theory
Quality of service guarantees in virtual circuit switched networks
IEEE Journal on Selected Areas in Communications
Closed-form analysis of end-to-end network delay with Markov-modulated Poisson and fluid traffic
Computer Communications
End-to-end delay approximation in cascades of generalized processor sharing schedulers
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Performance evaluation of bandwidth allocation in ATM networks
International Journal of Business Information Systems
| Hi-index | 0.00 |
This paper, proposes an analytical method for the resource allocation and admission control of traffic flows with statistical Quality-of-Service (QoS) guarantees in a Static Priority service discipline, in the case of both isolated nodes and end-to-end paths comprising multiple schedulers. The statistical QoS targets for each service class are expressed in terms of a delay bound and delay violation probability. Moreover, we assume that traffic admits a linear variance envelope; therefore, the method accounts for Leaky-Bucket-regulated traffic, for general Markov-Modulated Poisson Process sources and Markov-Modulated Fluid Process sources and, 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, the resource allocation problem is solved analytically by deriving the closed-form expression of the minimum capacity to be allocated in the network in order to guarantee concurrently the QoS of all traffic flows across all service priorities. Moreover, the closed-form analytical solution of the admission control problem is obtained by deriving the expression of the maximum number of flows that is possible to accept, in all priority levels, knowing the link capacity, with differentiated statistical QoS constraints on delay for each priority level. Furthermore, by exploiting the bounded-variance network calculus, a novel framework for the calculation of statistical end-to-end delay bounds, we iterate our formulas, derived for the isolated node, to multi-node paths and, in turn, we provide analytical closed forms for the performance evaluation of end-to-end delay.