Accelerated rare event simulation with Markov chain modelling in wireless communication networks

Izabella Lokshina, Michael R. Bartolacci

Research output: Contribution to journalArticle

7 Scopus citations

Abstract

The paper recommends an effective approach to estimate probability of buffer overflow in wireless communication networks. The buffer overflow probability in queuing systems is defined as a rare event and can be estimated using rare event simulation with Markov chains. Two-node queuing networks are considered in this paper; and an event of buffer overflow at the second node is studied. Two efficient rare event simulation algorithms, based on the importance sampling and cross-entropy methods, are developed and applied to accelerate the overflow probability simulation with Markov chain modelling. Numerical examples and simulation results are provided.

Original languageEnglish (US)
Pages (from-to)185-191
Number of pages7
JournalInternational Journal of Mobile Network Design and Innovation
Volume4
Issue number4
DOIs
StatePublished - 2012

All Science Journal Classification (ASJC) codes

  • Software
  • Management Information Systems
  • Computer Networks and Communications
  • Artificial Intelligence

Fingerprint Dive into the research topics of 'Accelerated rare event simulation with Markov chain modelling in wireless communication networks'. Together they form a unique fingerprint.

  • Cite this