Queueing analysis of delay constrained voice traffic in a packet switching system

Yuan, Chunmiao; Silvester, J.A.

doi:10.1109/49.32336

Cited by 35 publications

(4 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As usual, we assume Poisson arrivals and exponential holding times with and being the arrival rates for full-and half-rate calls, respectively, and and the holding times for the full-and half-rate calls, respectively. We use standard Markov chain techniques (e.g., [2], [15]- [17]) to obtain numerical solutions for the loss probabilities for each of the schemes. We also classify the schemes according to the most efficient numerical method required to obtained the loss probabilities.…”

Section: The Modelmentioning

confidence: 99%

Performance between circuit allocation schemes for half- and full-rate connections in GSM

Ivanovich

Zukerman

Fitzpatrick

et al. 1998

IEEE Trans. Veh. Technol.

View full text Add to dashboard Cite

Section: The Modelmentioning

confidence: 99%

Performance between circuit allocation schemes for half- and full-rate connections in GSM

Ivanovich

Zukerman

Fitzpatrick

et al. 1998

IEEE Trans. Veh. Technol.

View full text Add to dashboard Cite

“…From the network's point of view, this provides the most regulated load with minimum aggregated peak rate. In [20], it is assumed that the cell generation time from a source is uniformly distributed over the frame. The worst case would be all frames starting in synchrony.…”

Section: Multiple On/off Sourcesmentioning

confidence: 99%

“…The mean buffer occupancy in these cases maybeuseless. To find the queue size distribution in a finite queueing system, in most cases, one has to solve a very large set of linear balance equations [20]. The computational complexity is directly proportional to the buffer capacity.…”

Section: Introductionmentioning

confidence: 99%

Finite buffer discrete-time queues with multiple Markovian arrivals and services in ATM networks

Zhang

1992

[Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications

View full text Add to dashboard Cite

This paper presents an efficient computational procedure to calculate the queue size distribution in a finite buffer queueing system with a number of independent sources. Each source is characterized by a finite state discrete-time Markov chain. Explicit expression for the queue size distribution is obtained directly. The method is based on computing the modified spectral expansion of the state distribution of the system. This representation requires evaluating the roots of the entire system characteristic function and solving a set of linear system equations. If the arrival process is composed of multiple on/off sources, by using a decomposition technique the problem of finding the roots becomes simple. The computational complexity is independent of the buffer capacity. Exact results show that the cell loss probability depends only on the ratio of the buffer capacity to burst length. Approximation expression for the cell loss probability based on asymptotic analysis is also presented. Numerical results show that the approximation is accurate, especially when the system load is heavy. The effect of burst length on the cell loss probability is investigated. Keeping the burst length fixed, the cell loss probability mainly depends on the the ratio of the number of sources to the inter-cell spacing. The results can be used in call admission and congestion control. The exact analysis can be used off-line to verify the accuracy of some simple approximation method (instead of using simulation).

show abstract

“…One of the characteristics inherent in real time service is that it requires a finite cell delay and it can tolerate a very small portion of cell loss. Thus, the major QoS measures for it in high speed networks are the cell delay time and the cell loss rate [Ferrari(1990), Li(1989), Towsley(1993), Yuan(1989)]. If there exists a priority in a cell, the partial loss rate of high priority (HP) and low priority (LP) cell can be another QoS measure [Awater(1991)].…”

Section: Introductionmentioning

confidence: 99%

A new method for assessing the performances in ATM networks

Lee

1998

Performance of Information and Communication Systems

View full text Add to dashboard Cite

The authors present a new approach to evaluating the performances in ATM networks. First, we present a typical model for the ATM output multiplexer with a threshold in the queue and the priority in the bursty incoming cells. Secondly, we describe a basic concept for defining the penalty functions for the expected performance based on the status of the buffer occupancy. Finally, we present the results of numerical experiments for the proposed method, and discuss the implication.

show abstract

Queueing analysis of delay constrained voice traffic in a packet switching system

Cited by 35 publications

References 5 publications

Performance between circuit allocation schemes for half- and full-rate connections in GSM

Performance between circuit allocation schemes for half- and full-rate connections in GSM

Finite buffer discrete-time queues with multiple Markovian arrivals and services in ATM networks

A new method for assessing the performances in ATM networks

Contact Info

Product

Resources

About