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

Izabella Lokshina, Michael R. Bartolacci

Research output: Contribution to journalArticle

6 Citations (Scopus)

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 - Dec 1 2012

Fingerprint

Markov processes
Telecommunication networks
Importance sampling
Entropy
Modeling
Communication networks
Rare events
Wireless communication
Simulation
Markov chain
Buffer
Node

All Science Journal Classification (ASJC) codes

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

Cite this

@article{b86c4cf199e2474babb497e858857aea,
title = "Accelerated rare event simulation with Markov chain modelling in wireless communication networks",
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.",
author = "Izabella Lokshina and Bartolacci, {Michael R.}",
year = "2012",
month = "12",
day = "1",
doi = "10.1504/IJMNDI.2012.054449",
language = "English (US)",
volume = "4",
pages = "185--191",
journal = "International Journal of Mobile Network Design and Innovation",
issn = "1744-2869",
publisher = "Inderscience Enterprises Ltd",
number = "4",

}

TY - JOUR

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

AU - Lokshina, Izabella

AU - Bartolacci, Michael R.

PY - 2012/12/1

Y1 - 2012/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84879349934&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84879349934&partnerID=8YFLogxK

U2 - 10.1504/IJMNDI.2012.054449

DO - 10.1504/IJMNDI.2012.054449

M3 - Article

AN - SCOPUS:84879349934

VL - 4

SP - 185

EP - 191

JO - International Journal of Mobile Network Design and Innovation

JF - International Journal of Mobile Network Design and Innovation

SN - 1744-2869

IS - 4

ER -