Guaranteeing statistical QoS to regulated traffic: the multiple node case

Reisslein, Martin; Ross, Keith W.; Rajagopal, S.

doi:10.1109/cdc.1998.760733

Cited by 18 publications

(15 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A recent trend on achieving multiplexing gain relies on the assumptions that connections (flows) are statistically independent and smoothed by deterministic regulators at the connections input to the network since statistical characterization of traffic sources is not often reliable [4], [23]. Not surprisingly, this exactly resembles our case.…”

Section: Simulationmentioning

confidence: 68%

“…In fact, many of the results derived in those will, therefore, be valid in our case too. One interesting result [23] is: by statistically multiplexing rate controlled (at edge) traffic in the core network the number of accepted connections can be three times higher than that of Generalized Processor Sharing [20], [21] or any other deterministic service discipline [9].…”

Section: Simulationmentioning

confidence: 99%

See 1 more Smart Citation

A range-based SLA and edge driven virtual core provisioning in DiffServ-VPNs

Khalil

Braun

Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks

View full text Add to dashboard Cite

We recently proposed a range-based Service Level Agreement (SLA) [15] approach and edge provisioning in DiffServ capable Virtual Private Networks (VPNs) to customers that are unable or unwilling to predict load between VPN endpoints exactly. With range-based SLAs customers specify their requirements as a range of quantitative values rather than a single one. Various suitable policies and algorithms dynamically provision and allocate resources at the edges for VPN connections. However, we also need to provision the interior nodes of a transit network to meet the assurances offered at the boundaries of the network. Although a deterministic guaranteed service (single quantitative value approach) provides the highest level of QoS guarantees, it leaves a significant portion of network resources on the average unused. In this paper, we show that with range-based SLAs providers have the flexibility to allocate bandwidth that falls between a lower and upper bound of the range only, and therefore, take advantage of this to make multiplexing gain in the core that is usually not possible with a deterministic approach. But dynamic and frequent configurations of an interior device is not desired as this will lead to scalability problems and also defeats the purpose of the DiffServ architecture which suggests to drive all the complexities towards edges. We, therefore, propose virtual core provisioning that only requires a capacity inventory of interior devices to be updated based on VPN connection acceptance, termination or modification at the edges.

show abstract

Section: Simulationmentioning

confidence: 68%

Section: Simulationmentioning

confidence: 99%

A range-based SLA and edge driven virtual core provisioning in DiffServ-VPNs

Khalil

Braun

Proceedings LCN 2001. 26th Annual IEEE Conference on Local Computer Networks

View full text Add to dashboard Cite

show abstract

“…These or similar assumptions are used in many recent works on statistical QoS [3,10,12,17,18,20,25,26,31,32,33]. The assumptions are very general.…”

Section: Regulated Adversarial Trafficmentioning

confidence: 99%

“…Recent research on statistical QoS has attempted to exploit statistical multiplexing gain by taking advantage of knowledge about deterministic bounds on arrivals from individual flows, with limited knowledge about their statistical properties [3,10,12,17,18,20,25,26,31,32,33]. Under a very general set of traffic assumptions, which are sometimes referred to as 'regulated adversarial traffic,' one merely assumes that (1) traffic arrivals from a flow are constrained by a deterministic regulator, e.g., a leaky bucket, and (2) traffic arrivals from different flows are statistically independent.…”

Section: Amentioning

confidence: 99%

“…The lossless multiplexer presented in [32] bears similarity to our design for class-level aggregation in Section 3, but assumes that routes are such that traffic arrivals at core nodes from different flows are always independent. We relax this assumption in our work, and instead, enforce independence by adding appropriate mechanisms within the network.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Tradeoffs in designing networks with end-to-end statistical QoS guarantees

Liebeherr

Patek

Yilmaz

2000 Eighth International Workshop on Quality of Service. IWQoS 2000 (Cat. No.00EX400)

View full text Add to dashboard Cite

Recent research on statistical multiplexing has provided many new insights into the achievable multiplexing gain in QoS networks, however, generally only in terms of the gain experienced at a single switch. Evaluating the statistical multiplexing gain in a general network remains a difficult challenge. In this paper we describe two distinct network designs for statistical end-to-end delay guarantees, referred to as class-level aggregation and path-level aggregation, and compare the achievable statistical multiplexing gain. Each of the designs presents a particular trade-off between the attainable statistical multiplexing gain and the ability to support delay guarantees. The key characteristic of both designs is that they do not require, and instead, intentionally avoid, consideration of the correlation between flows at multiplexing points inside the network. Numerical examples are presented for a comparison of the two designs. The presented class-level aggregation design is shown to yield very high achievable link utilizations while simultaneously achieving desired statistical guarantees on delay.

show abstract

Measurement‐based admission control for bufferless multiplexers

Reisslein

2001

Int J Communication

View full text Add to dashboard Cite

In this paper we study measurement-based admission control for bufferless multiplexing, which is very attractive for real-time traffic. We first discuss a novel large deviations (LD) approach to measurement-based admission control. We then provide an extensive review of the existing literature on measurement-based admission control. We conduct simulation studies with traces of MPEG 1 encoded movies to compare the performance of the admission rules in the literature with that of our large deviations approach. We demonstrate that our LD approach achieves higher link utilizations. Finally, we compare the performance of measurement-based admission control with that of traditional admission control, which relies on a priori traffic descriptors. Our numerical work indicates that measurement-based admission control achieves significant gains in link utilizations over traditional admission control

show abstract

Guaranteeing statistical QoS to regulated traffic: the multiple node case

Cited by 18 publications

References 15 publications

A range-based SLA and edge driven virtual core provisioning in DiffServ-VPNs

A range-based SLA and edge driven virtual core provisioning in DiffServ-VPNs

Tradeoffs in designing networks with end-to-end statistical QoS guarantees

Measurement‐based admission control for bufferless multiplexers

Contact Info

Product

Resources

About