Inter-class resource sharing using statistical service envelopes

Qiu, Jingyu; Knightly, Edward W.

doi:10.1109/infcom.1999.752160

Cited by 70 publications

(64 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The EBB model, which has been generalized in [3], [6], [24], [26], has been shown to imply delay and backlog bounds at simple traffic multiplexers. In [4], [22], probabilistic arrival envelopes were used to derive schedulability conditions for a variety of scheduling algorithms. The authors of [6], [18] have established a link between envelope functions and the theory of effective bandwidth [14], which estimates bandwidth requirements to satisfy given performance guarantees.…”

Section: Introductionmentioning

confidence: 99%

“…The authors of [6], [18] have established a link between envelope functions and the theory of effective bandwidth [14], which estimates bandwidth requirements to satisfy given performance guarantees. Probabilistic envelope functions that specify the amount of service made available to a flow at a network node have appeared in [12], [18], [22].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Scaling properties of statistical end-to-end bounds in the network calculus

Ciucu

Burchard

Liebeherr

2006

IEEE Trans. Inform. Theory

109

195

View full text Add to dashboard Cite

Abstract-The stochastic network calculus is an evolving new methodology for backlog and delay analysis of networks that can account for statistical multiplexing gain. This paper advances the stochastic network calculus by deriving a network service curve, which expresses the service given to a flow by the network as a whole in terms of a probabilistic bound. The presented network service curve permits the calculation of statistical endto-end delay and backlog bounds for broad classes of arrival and service distributions. The benefits of the derived service curve are illustrated for the exponentially bounded burstiness (EBB) traffic model. It is shown that end-to-end performance measures computed with a network service curve are bounded by O (H log H), where H is the number of nodes traversed by a flow. Using currently available techniques, which compute endto-end bounds by adding single node results, the corresponding performance measures are bounded by O H 3 .

show abstract

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Scaling properties of statistical end-to-end bounds in the network calculus

Ciucu

Burchard

Liebeherr

2006

IEEE Trans. Inform. Theory

109

195

View full text Add to dashboard Cite

show abstract

“…In this paper, we focus on statistical delay bounds [15], commonly defined as the maximum fraction of packets P max exceeding a given end-to-end delay limit d max .…”

Section: Source Traffic Regulation For Guaranteeing Qosmentioning

confidence: 99%

Queuing Performance of Long-Range Dependent Traffic Regulated by Token-Bucket Policers

Bregni

Cioffi

Giacomazzi

2008

IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference

View full text Add to dashboard Cite

 Long-range dependence (LRD) is a widely verified property of Internet traffic, which severely affects network performance yielding longer queuing delays. Token-bucket policers are commonly proposed to enforce the statistical profile of input traffic, but they can hardly reduce LRD and thus can be ineffective to protect service level agreements against LRD increase in input traffic. In this paper, we investigate by simulation the queuing performance in a downstream scheduler of LRD traffic regulated by token-bucket policers. We compare the delay distributions of regulated and unregulated LRD flows. We demonstrate that policers reduce significantly the downstream queuing delay, although they do not alter much the 1/f α spectrum of regulated traffic. We observe also that the policed traffic does not obey a plain fractional Gaussian traffic model: first, it is not Gaussian anymore; moreover, also its third-order two-lags covariance is altered by the policer. Finally, we point out that policers can reduce noticeably the negative impact of traffic LRD increase on queuing delay, although they can diminish actual LRD only slightly.Index Terms  Communication system traffic, fractional noise, Internet, long-range dependence, queuing analysis, traffic control (communication).

show abstract

“…On the largest time scale, dynamic SLA techniques [3], [15] are proposed to adjust long-term bandwidth allocation according to the actual traffic load measured over days or weeks. On the smallest time scale, scheduling algorithms [16], [17] and measurement-based admission control [18], [19] are extensively investigated to utilize the statistical multiplexing gain at the packet-level. In the middle ground, the virtual partitioning (VP) technique [20], [21] has been used in circuit-switched and ATM networks to exploit the statistical multiplexing gain on the time scale of call duration.…”

mentioning

confidence: 99%

Dynamic inter-SLA resource sharing in path-oriented differentiated services networks

Cheng

Zhuang

2006

IEEE/ACM Trans. Networking

View full text Add to dashboard Cite

Abstract-This paper proposes novel resource sharing schemes for differentiated services (DiffServ) networks, to achieve both high resource utilization and quality of service (QoS) guarantee. Service level agreements (SLAs) are negotiated at network boundaries and supported by path-oriented resource mapping within the network. The recently proposed SLA management scheme based on virtual partitioning (Bouillet et al., 2002) allows overloaded SLAs to exploit the spare capacity of underloaded SLAs for efficient resource utilization, however, at the the cost of possible SLA violation of the underloaders. In the bandwidth borrowing scheme proposed here, the dedicated bandwidth for underloaded SLAs is determined and adaptively adjusted at network boundaries according to the actual traffic load and QoS policies; the available spare capacity is then properly distributed to related links for lending to others. On the other hand, the traffic flows admitted with borrowed bandwidth are tagged and may be preempted later when the original bandwidth owner needs to claim back the resources. Through a detailed implementation design and extensive computer simulation results we show that, by bandwidth borrowing, both SLA compliance and high resource utilization can be achieved in various load conditions, with some side benefits such as call-level service differentiation, small admission overhead, and convenience for policy-based management. In addition, we propose a distributed bandwidth pushing scheme that can dynamically adjust the spare bandwidth distribution over the network. Combining bandwidth pushing with bandwidth borrowing, the resource utilization can be further improved.Index Terms-Bandwidth borrowing, DiffServ, inter-SLA resource sharing, resource allocation, service level agreement.

show abstract

Inter-class resource sharing using statistical service envelopes

Cited by 70 publications

References 16 publications

Scaling properties of statistical end-to-end bounds in the network calculus

Scaling properties of statistical end-to-end bounds in the network calculus

Queuing Performance of Long-Range Dependent Traffic Regulated by Token-Bucket Policers

Dynamic inter-SLA resource sharing in path-oriented differentiated services networks

Contact Info

Product

Resources

About