Call admission control in an ATM network using upper bound of cell loss probability

Saitō, Hiroshi

doi:10.1109/26.163572

Cited by 105 publications

(35 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…For the same reasons, our work differs from existing work on the queues with deterministic input [4,13,14,18,22]. Our work is inspired by studies [15,16] which derived an upper bound of cell-loss ratio to implement call admission control in Asynchronous Transfer Mode (ATM) networks. Our work differs from [15,16] in several aspects.…”

Section: Introductionmentioning

confidence: 88%

Loss bounds for a finite-capacity queue based on interval-wise traffic observation

Shioda

2008

Queueing Syst

View full text Add to dashboard Cite

We study a single-server finite-capacity queue with batch fluid inputs. We assume that the input traffic is observed in an interval-wise basis; that is, along the time axis divided into fixed-length intervals, with the amount of work brought into the queue during each interval sequentially observed. Since the sequence of the amounts of work during respective intervals, which is referred to as the interval-wise input process in this paper, does not reveal complete information about an input process, we cannot be precisely aware of the performance of the queue. Thus, in this paper, we focus on knowing the performance limit of the queue based on the interval-wise input process. In particular, we establish an upper limit of the long-run loss ratio of the workload in the queue. Our results would reveal useful tools to evaluate the performance of queuing systems when information about input processes in a fine timescale is not available.

show abstract

Section: Introductionmentioning

confidence: 88%

Loss bounds for a finite-capacity queue based on interval-wise traffic observation

Shioda

2008

Queueing Syst

View full text Add to dashboard Cite

show abstract

“…Several CAC methods calculate the CLR, use REM, and are traffic-descriptor-based [12][13][14][15][16][17][18][19]. Murase et a1.…”

Section: Brief Overview Of Proposed Methodsmentioning

confidence: 99%

“…Miyao developed a fast algorithm for calculating the aggregate CLR under heterogeneous traffic conditions by using the Chernoff bound [13]. Saito developed a CLR upper-bound formula [14], and Shioda and Saito gave the mathematical proof for it [14,19]. The upper-bound for mula is implemented by using a table to store the marginal distribution of cells arriving within a time window.…”

Section: Brief Overview Of Proposed Methodsmentioning

confidence: 99%

See 1 more Smart Citation

Overview of measurement-based connection admission control methods in ATM networks

Shiomoto

Yamanaka

Takahashi

1999

IEEE Commun. Surv. Tutorials

View full text Add to dashboard Cite

An overview is given of previously-proposed measurement-based connection admission control (CAC) methods. First we address requirements for CAC methods, and then provide a taxonomy for CAC methods. Measurement-based CAC methods are discussed in detail, classified according to the taxonomy, and compared against each other with respect to the requirements. We conclude that measurement-based CAC methods based on effective bandwidth and bufferless models are promising because they do not require complex hardware and are less dependent on assumptions regarding traffic than methods in which the effect of buffer is considered.

show abstract

“…Dynamic CAC was proposed by Saito and Shiomoto [16] in 1991. It monitors the marginal cell arrival distribution and uses the upper-bound CLR formula [15]. Even though it achieves high bandwidth efficiency, it requires a digital signal processor to estimate the distribution and calculate CLR, which increases the equipment cost.…”

Section: Introductionmentioning

confidence: 99%

An admission control scheme based on measurements of instantaneous utilization

Shiomoto

Yamanaka

1998

Electron. Comm. Jpn. Pt. I

View full text Add to dashboard Cite

Call admission control in an ATM network using upper bound of cell loss probability

Cited by 105 publications

References 15 publications

Loss bounds for a finite-capacity queue based on interval-wise traffic observation

Loss bounds for a finite-capacity queue based on interval-wise traffic observation

Overview of measurement-based connection admission control methods in ATM networks

An admission control scheme based on measurements of instantaneous utilization

Contact Info

Product

Resources

About