Setwise and filtered gibbs samplers for teletraffic analysis

A setwise Gibbs sampler (SGS) method is developed to simulate stationary distributions and performance measures of network occupancy of Baskett-Chandy-Muntz-Palacios (BCMP) telecommunication models. It overcomes the simulation difficulty encountered in applying the standard Gibbs sampler to closed BCMP networks with constant occupancy constraints. We show Markov chains induced by SGS converge to the target stationary distributions. This article also investigates the filtered Gibbs sampler (FGS) as an efficient method for estimating various network performance measures. It shows that FGS's efficiency is considerable, but may be improperly overestimated. A more conservative performance estimator is then presented.

[1]  Peter G. Taylor,et al.  A convolution algorithm for calculating exact equilibrium distributions in resource allocation problems with moderate user interference , 1994, IEEE Trans. Commun..

[2]  Stan Zachary,et al.  Distributed admission control , 2000, IEEE Journal on Selected Areas in Communications.

[3]  Lachlan L. H. Andrew,et al.  Filtered Gibbs sampler for estimating blocking in product form networks , 2002 .

[4]  Lorne G. Mason,et al.  Decentralized Adaptive Flow Control of High-Speed Connectionless Data Networks , 1999, Oper. Res..

[5]  K. G. Ramakrishnan,et al.  Optimization and Design of Network Routing Using Refined Asymptotic Approximations , 1999, Perform. Evaluation.

[6]  Faming Liang,et al.  Markov Chain Monte Carlo: Innovations And Applications , 2006 .

[7]  John Odentrantz,et al.  Markov Chains: Gibbs Fields, Monte Carlo Simulation, and Queues , 2000, Technometrics.

[8]  Jorma T. Virtamo,et al.  Nearly optimal importance sampling for Monte Carlo simulation of loss systems , 2000, TOMC.

[9]  M. Reiser,et al.  A Queueing Network Analysis of Computer Communication Networks with Window Flow Control , 1979, IEEE Trans. Commun..

[10]  Rudolf Mathar,et al.  Theory of maximum packing and related channel assignment strategies for cellular radio networks , 1998, Math. Methods Oper. Res..

[11]  Jorma Virtamo,et al.  Variance reduction in Monte Carlo simulation of product form systems , 1998 .

[12]  S. Walker.  Invited comment on the paper "Slice Sampling" by Radford Neal , 2003 .

[13]  Jeffrey P. Buzen,et al.  Computational algorithms for closed queueing networks with exponential servers , 1973, Commun. ACM.

[14]  Radford M. Neal.  Slice Sampling , 2003, The Annals of Statistics.

[15]  Scott Jordan.  A continuous state space model of multiple service, multiple resource communication networks , 1995, IEEE Trans. Commun..

[16]  Michael Pinedo,et al.  Queueing networks - customers, signals and product form solutions , 1999, Wiley-Interscience series in systems and optimization.

[17]  Lachlan L. H. Andrew,et al.  Estimation of blocking probabilities in cellular networks with dynamic channel assignment , 2002, TOMC.

[18]  K. Mani Chandy,et al.  Open, Closed, and Mixed Networks of Queues with Different Classes of Customers , 1975, JACM.

[19]  F. Vázquez-Abad,et al.  Filtered and Setwise Gibbs Samplers for Teletraffic Analysis , 2003 .

[20]  Richard J. Boucherie,et al.  Estimation of performance measures for product form cellular mobile communications networks , 1998, Telecommun. Syst..

[21]  Ronald L. Wasserstein,et al.  Monte Carlo: Concepts, Algorithms, and Applications , 1997 .

[22]  Adrian E. Conway,et al.  Hybrid analysis of response time distributions in queueing networks , 1993, IEEE Trans. Commun..

[23]  Jie Wang,et al.  Monte Carlo summation and integration applied to multiclass queuing networks , 1994, JACM.

[24]  Jorma Virtamo,et al.  Efficient Monte Carlo Simulation of Product Form Systems , 1998 .

[25]  Christos Alexopoulos,et al.  Output Data Analysis , 2007 .

[26]  Debasis Mitra,et al.  Erlang capacity and uniform approximations for shared unbuffered resources , 1994, TNET.

[27]  Lachlan L. H. Andrew,et al.  Filtered Gibbs sampler for estimating blocking probabilities in WDM optical networks , 2000, ESM.

[28]  Charles Knessl,et al.  Asymptotic Approximations and Bottleneck Analysis in Product Form Queueing Networks with Large Populations , 1998, Perform. Evaluation.

[29]  Kin K. Leung,et al.  An inversion algorithm to compute blocking probabilities in loss networks with state-dependent rates , 1995, TNET.

[30]  Frank P. Kelly,et al.  Effective bandwidths at multi-class queues , 1991, Queueing Syst. Theory Appl..

[31]  Peter G. Taylor,et al.  Modeling Handovers in Cellular Mobile Networks with Dynamic Channel Allocation , 1995, Oper. Res..

[32]  A. U.S.,et al.  Generalised Gibbs sampler and multigrid Monte Carlo for Bayesian computation , 2000 .

[33]  Keith W. Ross,et al.  Multiservice Loss Models for Broadband Telecommunication Networks , 1997 .

[34]  W. Gilks.  Markov Chain Monte Carlo , 2005 .

[35]  Frank W. J. Olver,et al.  Asymptotic approximations , 2010, NIST Handbook of Mathematical Functions.

[36]  Ward Whitt,et al.  Effective bandwidths with priorities , 1998, TNET.