Access the full text.
Sign up today, get DeepDyve free for 14 days.
Institute of Electrical Engineers
R. Cormack, H. Larson (1973)
Introduction to the Theory of Statistics
R. Prasad, Tero Ojanperä (1998)
An overview of CDMA evolution toward wideband CDMAIEEE Communications Surveys & Tutorials, 1
V. Nicola, P. Shahabuddin, P. Heidelberger, P. Glynn (1993)
Fast simulation of steady-state availability in non-Markovian highly dependable systemsFTCS-23 The Twenty-Third International Symposium on Fault-Tolerant Computing
J. Wolfowitz, A. Mood (1951)
An Introduction to the Theory of StatisticsNature, 87
(1996)
Optimization of stationary behavior
W. Gilks, S. Richardson, D. Spiegelhalter (1997)
Markov Chain Monte Carlo in PracticeTechnometrics, 39
P. Glynn, W. Whitt (1992)
The Asymptotic Efficiency of Simulation EstimatorsOper. Res., 40
M. Neuts (1982)
Matrix-geometric solutions in stochastic models - an algorithmic approach
D. Pallant, P. Taylor (1995)
Modeling Handovers in Cellular Mobile Networks with Dynamic Channel AllocationOper. Res., 43
S. Zachary, I. Ziedins (2009)
Loss networks
D. Cox, D. Reudink (1973)
Increasing Channel Occupancy in Large-Scale Mobile Radio Systems: Dynamic Channel REassignmentIEEE Trans. Commun., 21
(2000)
ACM Transactions on Modeling and Computer Simulation
F. Kelly (1980)
Reversibility and Stochastic Networks
S. Asmussen, Hanne Nielsen (1995)
Ruin probabilities via local adjustment coefficientsJournal of Applied Probability, 32
G. Choudhury, K. Leung, W. Whitt (1994)
An algorithm to compute blocking probabilities in multi-rate multi-class multi-resource loss modelsFifth IEEE International Workshop on Computer-Aided Modeling, Analysis, and Design of Communication Links and Networks
(1991)
1997.Simulation, 2nd ed
Everitt D. (1983)
Analysis of multicellular mobile radiotelephone systems with lossBrit. Telecom Technol. J., 1
P. Lassila, J. Virtamo (1998)
Efficient Monte Carlo Simulation of Product Form Systems
K. Ross, Jie Wang (1992)
Monte Carlo Summation Applied to Product-Form Loss NetworksProbability in the Engineering and Informational Sciences, 6
Paul-Andre Raymond (1991)
Performance analysis of cellular networksIEEE Trans. Commun., 39
P. Shahabuddin (1994)
Importance sampling for the simulation of highly reliable Markovian systemsManagement Science, 40
M. Reiser, S. Lavenberg (1980)
Mean-Value Analysis of Closed Multichain Queuing NetworksJ. ACM, 27
(1997)
Wideband Direct Sequence CDMA (WCDMA) Part 1: System Description and Performance Evaluation
William Lee (1989)
Mobile Cellular Telecommunications Systems
Alexopoulos C. (1998)
Output data analysis. In Handbook of Simulation, J. Banks, Ed. Wiley, New York, NYChap., 7
William Lee (1995)
Mobile Cellular Telecommunications
M. Mouly, M. Pautet, T. Haug (1992)
The GSM System for Mobile Communications
Sheldon Ross (1982)
Stochastic Processes
P. L'Ecuyer, Y. Champoux (1996)
Importance sampling for large atm-type queueing networksProceedings Winter Simulation Conference
S. Lam (1977)
Queuing Networks with Population Size ConstraintsIBM J. Res. Dev., 21
K. Ross, D. Tsang, Jie Wang (1994)
Monte Carlo summation and integration applied to multiclass queuing networksJ. ACM, 41
Cheng-Shang Chang, P. Heidelberger, P. Shahabuddin (1995)
Fast simulation of packet loss rates in a shared buffer communications switchACM Trans. Model. Comput. Simul., 5
Z. Dziong, James Roberts (1987)
Congestion Probabilities in a Circuit-Switched Integrated Services NetworkPerform. Evaluation, 7
Michael Devetslkiotls, Keith Townsend (1993)
Statistical optimization of dynamic importance sampling parameters for efficient simulation of communication networksIEEE/ACM Trans. Netw., 1
(1983)
Analysis of multicellular mobile radiotele
P. Vakili (1991)
Using a standard clock technique for efficient simulationOper. Res. Lett., 10
M. Mandjes (1997)
Fast simulation of blocking probabilities in loss networksEuropean Journal of Operational Research, 101
J. Zahorjan, D. Eager, Hisham Sweillam (1988)
Accuracy, Speed, and Convergence of Approximate Mean Value AnalysisPerform. Evaluation, 8
S. Chib, E. Greenberg (1995)
Understanding the Metropolis-Hastings AlgorithmThe American Statistician, 49
E. Pinsky, A. Conway (1992)
Computational algorithms for blocking probabilities in circuit-switched networksAnnals of Operations Research, 35
P. Bratley, B. Fox, L. Schrage (1983)
A guide to simulation
F. Vázquez-Abad, P. LeQuoc (2001)
Sensitivity analysis for ruin probabilities: canonical risk modelJournal of the Operational Research Society, 52
V. Nicola, Marvin Nakayama, P. Heidelberger, A. Goyal (1993)
Fast Simulation of Highly Dependable Systems with General Failure and Repair ProcessesIEEE Trans. Computers, 42
P. Lassila, J. Virtamo (2000)
Nearly optimal importance sampling for Monte Carlo simulation of loss systemsACM Trans. Model. Comput. Simul., 10
A. Unwin (1980)
Reversibility and Stochastic NetworksJournal of the Operational Research Society, 31
S. Redl, M. Oliphant, Mathias Weber, Matthias Weber (1995)
An introduction to GSM
David Everitt (1994)
Traffic engineering of the radio interface for cellular mobile networksProc. IEEE, 82
(1995)
Complexity properties of steady-state rare events simulation in ququeing models
(1998)
Output data analysis. chapter 7
J. Sadowsky (1991)
Large deviations theory and efficient simulation of excessive backlogs in a GI/GI/m queueIEEE Transactions on Automatic Control, 36
F. Vázquez-Abad, L. Andrew (2000)
Filtered Gibbs sampler for estimating blocking probabilities in WDM optical networks
(2002)
ACM Journal Name
R. Boucherie, M. Mandjes (1998)
Estimation of performance measures for product form cellular mobile communications networksTelecommunication Systems, 10
D. Mitra, J. Morrison (1994)
Erlang capacity and uniform approximations for shared unbuffered resourcesIEEE/ACM Trans. Netw., 2
R. Nelson (1993)
The mathematics of product form queuing networksACM Comput. Surv., 25
John Odentrantz (2000)
Markov Chains: Gibbs Fields, Monte Carlo Simulation, and QueuesTechnometrics, 42
S. Ross (1975)
Introduction to probability modelsTechnometrics, 40
(1999)
A new combinatorial approach to the stat
(1972)
Dynamic channel assignment scheme in large cellular-structured mobile communication systems
J. Yates (1997)
Performance Analysis of Dynamically-Reconfigurable Wavelength-Division Multiplexed Networks
(1992)
Probability. Classics in Applied Mathematics. SIAM
Jianqiang Hu (1995)
Parallel simulation of DEDS via event synchronizationDiscrete Event Dynamic Systems, 5
P. Heidelberger, P. Shahabuddin, V. Nicola (1994)
Bounded relative error in estimating transient measures of highly dependable non-Markovian systemsACM Trans. Model. Comput. Simul., 4
Blocking probabilities in cellular mobile communication networks using dynamic channel assignment are hard to compute for realistic sized systems. This computational difficulty is due to the structure of the state space, which imposes strong coupling constraints amongst components of the occupancy vector. Approximate tractable models have been proposed, which have product form stationary state distributions. However, for real channel assignment schemes, the product form is a poor approximation and it is necessary to simulate the actual occupancy process in order to estimate the blocking probabilities.Meaningful estimates of the blocking probability typically require an enormous amount of CPU time for simulation, since blocking events are usually rare. Advanced simulation approaches use importance sampling (IS) to overcome this problem. In this article, we study two regimes under which blocking is a rare event: low-load and high cell capacity. Our simulations use the standard clock (SC) method. For low load, we propose a change of measure that we call static ISSC , which has bounded relative error. For high capacity, we use a change of measure that depends on the current state of the network occupancy. This is the dynamic ISSC method. We prove that this method yields zero variance estimators for single clique models, and we empirically show the advantages of this method over naïve simulation for networks of moderate size and traffic loads.
ACM Transactions on Modeling and Computer Simulation (TOMACS) – Association for Computing Machinery
Published: Jan 1, 2002
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.