Admission Control for ATM Networks

Hsu, Ivy; Walrand, Jean

doi:10.1007/978-1-4757-2418-9_21

Cited by 24 publications

(8 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…An efficient approximate convolution algorithm is presented in [17]. We can also obtain an accurate approximation for the right-hand side of (15) The LD approximation is known to be very accurate [1], [4], [18], [9], [19] and is also computationally very efficient. We use the LD approximation for the numerical studies in this paper.…”

Section: Regulated Traffic and The Qos Requirementmentioning

confidence: 99%

“…The goal has been to develop traffic management schemes that allow for high link utilizations while simultaneously guaranteeing that the QoS requirements of the ongoing connections are met. It is generally agreed that high link utilizations can only be achieved by allowing traffic to be statistically multiplexed, i.e., by allowing each connection's traffic to have a small amount of loss and exploiting the statistical independence of the connections' traffic [1] [2][3] [4]. It is also the view of many researchers that QoS can only be guaranteed by requiring the traffic to be regulated (e.g., by leaky buckets) at the edges of the network [5][6] [7][8] [9][10] [11].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Guaranteeing statistical QoS to regulated traffic: the single node case

Reisslein¹,

Ross

Rajagopal³

1999

IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer A

View full text Add to dashboard Cite

Abstract-Multimedia traffic can typically tolerate some loss but has rigid delay constraints. A natural QoS requirement for a multimedia connection is a prescribed bound on the the fraction of traffic that exceeds an end-to-end delay limit. We propose and analyze a traffic management scheme which guarantees QoS to multimedia traffic while simultaneously allowing for a large connection-carrying capacity. We study our traffic management scheme in the context of a single node. In order for the node to guarantee QoS, each connection's traffic is regulated. In order to support many connections, the link statistically multiplexes the connections' traffic. The scheme consists of (i) cascaded leaky-buckets for traffic regulation, (ii) smoothers at the ingresses, and (iii) bufferless statistical multiplexing within the node. For this scheme we show that loss probabilities are minimized with simple one-buffer smoothers which operate at specific minimum rates. We also show that the worst-case input traffic is extremal on-off traffic for all connections. These two results lead to a straightforward scheme for guaranteeing QoS to regulated traffic. Using MPEG video traces, we present numerical results which demonstrate the methodology. Finally, we compare the bufferless scheme with buffered statistical multiplexing.

show abstract

Section: Regulated Traffic and The Qos Requirementmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Guaranteeing statistical QoS to regulated traffic: the single node case

Reisslein¹,

Ross

Rajagopal³

1999

IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer A

View full text Add to dashboard Cite

show abstract

“…connection admission control algorithms) coupled with resource reservation protocols (e.g. RMD and RSVP) [2][3][4][5].…”

Section: Introductionmentioning

confidence: 99%

Parsimonious estimates of bandwidth requirement for quality of service packet networks

Bı́ró

Gulyás

Martinecz

2005

Performance Evaluation

View full text Add to dashboard Cite

“…There has been much research in determining the equivalent or eective bandwidth (EBW) needs of multiplexed sources [9,14,16,19,22,36] for CAC purposes. They are based on some probabilistic representation of the trac sources so as to determine whether the QoS can be satis®ed for a set of sources and a given shared bandwidth.…”

Section: Introductionmentioning

confidence: 99%