NDLI: Algorithms to accelerate rare event simulation with Markov chain modeling in wireless telecommunications networks

Content Provider	IEEE Xplore Digital Library
Author	Lokshina, I.
Copyright Year	2011
Description	Author affiliation: Management, Marketing and Information Systems, SUNY Oneonta, Oneonta, NY 13820 (Lokshina, I.)
Abstract	The paper recommends an effective approach to estimate probability of buffer overflow in wireless telecommunications 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. Probability of a rare event that the content of the second buffer would exceed some high level L, starting from a certain state, is analyzed. The approach is based on Markov additive representation of the buffer processes, leading to exponential change of measure, which is used in an Importance sampling method. The examples, considered in this paper, confirm that when the first buffer is finite, the relative error is bound independent of some high level L. However, when the first buffer is infinite, a natural extension of exponential change of measure for finite buffer case is proposed. The relative error is shown to be bound independent of L only when at the second node is a bottleneck, i.e. buffer overflow may occur. However, when at the first node is a bottleneck, experimental results confirm that the relative error is linearly bound to the level L. 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 modeling in wireless telecommunications networks. Numerical examples and simulation results are provided.
Starting Page	1
Ending Page	6
File Size	609686
Page Count	6
File Format	PDF
ISBN	9781457701627
ISSN	19345070
e-ISBN	9781457701610
DOI	10.1109/WTS.2011.5960826
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2011-04-13
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Wireless communication Monte Carlo methods Additives Markov processes Telecommunications Buffer overflow Acceleration
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Recurrence times of buffer overflows in Jackson networks

Analysis and estimation of overflow probability in Jackson queueing networks

Adaptive Monte Carlo methods for rare event simulations

Markov chain Monte Carlo for risk measures

Modeling and simulation of handover priority schemes for broadband wireless networks

Application of rare event techniques to trace driven simulation

Fast simulation of packet loss rates in communication networks with priorities

Optimal rare event Monte Carlo for Markov modulated regularly varying random walks

A rational approximation approach to rare event probability estimation for high-performance systems

Algorithms to accelerate rare event simulation with Markov chain modeling in wireless telecommunications networks

Similar Documents

Recurrence times of buffer overflows in Jackson networks

Analysis and estimation of overflow probability in Jackson queueing networks

Adaptive Monte Carlo methods for rare event simulations

Markov chain Monte Carlo for risk measures

Modeling and simulation of handover priority schemes for broadband wireless networks

Application of rare event techniques to trace driven simulation

Fast simulation of packet loss rates in communication networks with priorities

Optimal rare event Monte Carlo for Markov modulated regularly varying random walks

A rational approximation approach to rare event probability estimation for high-performance systems

Algorithms to accelerate rare event simulation with Markov chain modeling in wireless telecommunications networks