Toward statistical QoS guarantees in a differentiated services network

Abstract

In this paper, we propose and analyze a methodology for providing statistical guarantees within the diffserv model in a network, which uses static-priority schedulers. We extend the previous work on statistical delay analysis and develop a method that can be used to derive delay bounds without specific information on flow population. With this new method, we are able to successfully employ a utilization-based admission control approach for flow admission. This approach does not require explicit delay computation at admission time and hence is scalable to large systems. We systematically analyze the performance of our approaches in terms of system utilization. As expected, our experimental data show that statistical services can achieve much higher utilization than deterministic services.

Flow-aware resilient ring: new proposal for metropolitan area networks

“…In particular, FAN is easier to implement and, thanks to implicit flow differentiation, easily conforms to net neutrality paradigms. However, in [16] a new methodology for providing statistical guarantees within the DiffServ model in a network was proposed. In this solution, a utilizationbased admission control scheme was employed for implicit flow admission.…”

A capacity and minimum guarantee-based service class-oriented scheduler for LTE networks

“…Several contributions in LTE scheduling have analyzed relationships between network and scheduling parameters [8][9][10][11][12]. These relationships include best packet scheduler features that may support variety of traffic with different priorities, channel statistics, queue sizes, and traffic loads while improving the QoE for end users.…”

Delay Bound: Fractal Traffic Passes through Network Servers

“…The advantage described by Remarks 13 and 14 is at cost that more resources are required (Zhao [277], Davaril et al [278]). In order to reduce the resource requirements that deterministic queuing analysis demands, stochastic network calculus is considered by computer scientists ( [19,95,128,130,131,243], Jiang et al [279], Starobinski and Sidi [280], Ng et al [281], Borst et al [282], Liu et al [283], Li et al [284], Jiang [285], and Baccarelli et al [286]). In what follows, we present a novel method of stochastic calculus for computing delay of fractal traffic passing through servers.…”

“…Otherwise, the communication is regarded as a failure ( [4,5,10,11], Buttazzo [12], Raha et al [13], Malcolm and Zhao [14], Malcolm et al [15], Budka et al [16], and Liem and Mendiratta [17]). By soft real-time systems, on the other side, we imply that the predetermined time constraint may be statistically violated with a predetermined probability ( [10], Zhao and Chong [18], and Wang et al [19]).…”