Bounding the Blocking Probabilities in Multirate CDMA Networks Supporting Elastic Services

Several previous contributions have proposed calculation methods that can be used to determine the steady state (and from it the blocking probabilities) of code-division multiple-access (CDMA) systems. This present work extends the classical Kaufman-Roberts formula such that it becomes applicable in...

Full description

Saved in:
Bibliographic Details
Published in:IEEE/ACM transactions on networking 2007-08, Vol.15 (4), p.944-956
Main Authors: Fodor, G., Telek, M.
Format: Article
Language:English
Subjects:
Asynchronous transfer mode
Bit rate
CDMA networks
elastic traffic
Equations
Kaufman- Roberts formula
Multiaccess communication
Probability
reversible Markov chains
soft blocking
State-space methods
Steady-state
Telecommunication traffic
Traffic control
Upper bound
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Several previous contributions have proposed calculation methods that can be used to determine the steady state (and from it the blocking probabilities) of code-division multiple-access (CDMA) systems. This present work extends the classical Kaufman-Roberts formula such that it becomes applicable in CDMA systems in which elastic services with state-dependent instantaneous bit rate and average-bit-rate-dependent residency time are supported. Our model captures the effect of soft blocking, that is, an arriving session may be blocked in virtually all system states but with a state dependent probability. The core of this method is to approximate the original irreversible Markov chain with a reversible one and to give lower and upper bounds on the so-called partially blocking macro states of the state space. We employ this extended formula to establish lower and upper bounds on the steady state and the classwise blocking probabilities.
ISSN:1063-6692
1558-2566
1558-2566
DOI:10.1109/TNET.2007.893880