Fast simulation of packet loss rates in a shared buffer communications switch

Author:

Chang Cheng-Shang1,Heidelberger Philip2,Shahabuddin Perwez2

Affiliation:

1. National Tsing Hua University

2. IBM T. J. Watson Research Center

Abstract

This article describes an efficient technique for estimating, via simulation, the probability of buffer overflows in a queueing model that arises in the analysis of ATM (Asynchronous Transfer Mode) communication switches. There are multiple streams of (autocorrelated) traffic feeding the switch that has a buffer of finite capacity. Each stream is designated as being of either high or low priority. When the queue length reaches a certain threshold, only high priority packets are admitted to the switch's buffer. The problem is to estimate the loss rate of high priority packets. An asymptotically optimal importance sampling approach is developed for this rare event simulation problem. In this approach, the importance sampling is done in two distinct phases. In the first phase, an importance sampling change of measure is used to bring the queue length up to the threshold at which low priority packets get rejected. In the second phase a different importance sampling change of measure is used to move the queue length from the threshold to the buffer capacity.

Publisher

Association for Computing Machinery (ACM)

Subject

Computer Science Applications,Modeling and Simulation

Reference41 articles.

1. Risk theory in a Markovian environment;ASMUSSEN S.;Scand. Actuarial J.,1989

2. ASMUSSEN S.1987. Applied Probability and Queues. John Wiley New York. ASMUSSEN S.1987. Applied Probability and Queues. John Wiley New York.

3. Conjugate processes and the simulation of ruin problems;ASMUSSEN S.;Stochastic Process. Appl.,1985

4. BRATLE~ P. FOX B. L. AND SCHRAGE L.E. 1987. A Guide to Simulation 2nd ed. Springer- Verlag New York. BRATLE~ P. FOX B. L. AND SCHRAGE L.E. 1987. A Guide to Simulation 2nd ed. Springer- Verlag New York.

5. BREIMAN L. 1968. Probabihty. Addison-Wesley Reading MA. BREIMAN L. 1968. Probabihty. Addison-Wesley Reading MA.

Cited by 8 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Explainable, Stable, and Scalable Network Embedding Algorithms for Unsupervised Learning of Graph Representations;IEEE Transactions on Computational Social Systems;2022

2. Application of the generalised ballot theorem for evaluation of performance in packet buffers with non-first in first out scheduling;IET Communications;2009

3. An adaptive approach to accelerated evaluation of highly available services;ACM Transactions on Modeling and Computer Simulation;2007-12

4. Perwez Shahabuddin, 1962--2005;ACM Transactions on Modeling and Computer Simulation;2007-04

5. Calculation of confidence intervals for simulation output;ACM Transactions on Modeling and Computer Simulation;2004-10

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3