Guaranteeing statistical QoS to regulated traffic: the single node case

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

doi:10.1109/infcom.1999.751661

Cited by 26 publications

(18 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Reisslein, Ross, and Rajagopal 32 ,33 analyze the multiplexing gain of regulated adversarial tra c for a particular switch architecture, called bu erless multiplexer, where arriving tra c on a ow is shaped at a dedicated bu er for this ow. The output rate of each bu er is set to a xed rate, such that no tra c experiences a violation of its delay bound in the bu er.…”

Section: Related Workmentioning

confidence: 99%

Statistical service assurances for traffic scheduling algorithms

Boorstyn

Burchard

Liebeherr

et al. 2000

IEEE J. Select. Areas Commun.

118

View full text Add to dashboard Cite

Abstract| Network services for the most demanding advanced networked applications which require absolute, perow service assurances can be deterministic or statistical. By exploiting statistical properties of tra c, statistical assurances can extract more capacity from a network than deterministic assurances. In this work we consider statistical service assurances for tra c scheduling algorithms. We present functions, so-called e ective envelopes, which are, with high certainty, upper bounds of multiplexed tra c. E ective envelopes can be used to obtain bounds on the amount of tra c on a link that can be provisioned with statistical service assurances. We show that our bounds can be applied to a variety o f p a c ket scheduling algorithms. In fact, one can reuse existing admission control functions for scheduling algorithms with deterministic assurances. We present n umerical examples which compare the number of ows with statistical assurances that can be admitted with our e ective e n velope approach to those achieved with existing methods.

show abstract

Section: Related Workmentioning

confidence: 99%

Statistical service assurances for traffic scheduling algorithms

Boorstyn

Burchard

Liebeherr

et al. 2000

IEEE J. Select. Areas Commun.

118

View full text Add to dashboard Cite

show abstract

“…The adversarial admission rule assumes that each connection transmits worst-case on}o! tra$c [2,5], that is, connection j transmits at rate c* H with probability H /c* H and is silent with probability 1! H /c* H .…”

Section: Determine the Capacity Jmentioning

confidence: 99%

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

“…Moreover, the implementation complexity of PGPS must be resolved before it can be used for highspeed networks like ATM [9]. Reisslein et al [21], [22] also showed that statistical delay guarantee for multiplexed real-time streams can be achieved in multihop networks by employing cascaded leaky-bucket regulators, which adds to the complexity of switches.…”

Section: Introductionmentioning

confidence: 99%

Real-time transport of MPEG video with a statistically guaranteed loss ratio in ATM networks

Kweon

Shin

2001

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

AbstractÐUnlike deterministic real-time communication in which excessive resources may be required for ªabsoluteº performance guarantees, statistical real-time communication seeks to achieve both probabilistic performance guarantees and efficient resource sharing. This paper presents a framework for statistical real-time communication in ATM networks, providing delay-guaranteed transport of MPEG-coded video traffic with a statistically-guaranteed cell-loss ratio. Delay-guaranteed communication is achieved with a modified version of Traffic-Controlled Rate-Monotonic Priority Scheduling (TCRM). A set of statistical real-time channels that share similar traffic characteristics are multiplexed into a common macrochannel. Those statistical real-time channels which are multiplexed together share the resources of a macrochannel, and individual statistical real-time channels are given timeliness and probabilistic cellloss guarantees. A macrochannel is serviced by the modified TCRM which improves link utilization and makes channel management simpler. Based on the analysis of an wahaIax queueing system, we propose a procedure for determining the transmission capacity of a macrochannel necessary to statistically guarantee a cell-loss ratio bound. Our extensive trace-driven simulation has shown the superiority of the proposed framework to the other approaches. The overall cell-loss ratios for multihop statistical real-time channels are shown to be smaller than the predetermined bounds, thus verifying our analytical results.

show abstract

Guaranteeing statistical QoS to regulated traffic: the single node case

Cited by 26 publications

References 27 publications

Statistical service assurances for traffic scheduling algorithms

Statistical service assurances for traffic scheduling algorithms

Measurement‐based admission control for bufferless multiplexers

Real-time transport of MPEG video with a statistically guaranteed loss ratio in ATM networks

Contact Info

Product

Resources

About