首页> 外文期刊>IEEE/ACM Transactions on Networking >Sizing exit buffers in ATM networks: an intriguing coexistence of instability and tiny cell loss rates
【24h】

Sizing exit buffers in ATM networks: an intriguing coexistence of instability and tiny cell loss rates

机译:调整ATM网络中出口缓冲区的大小:不稳定和微小信元丢失率的有趣共存

获取原文
获取原文并翻译 | 示例
           

摘要

This paper deals with the sizing of end buffers in ATM networks for sessions subject to constant bit rate (CBR) traffic. Our objective is to predict the cell-loss rate at the end buffer as a function of the system parameters. We introduce the D+G/D/1 queue as a generic model to represent exit buffers in telecommunications networks under constant rate traffic, and use it to model the end buffer. This is a queue whose arrival rate is equal to its service rate and whose arrivals are generated at regular intervals and materialize after a generally distributed random amount of time. We reveal that under the infinite buffer assumption, the system possesses rather intriguing properties: on the one hand, the system is unstable in the sense that the buffer content is monotonically nondecreasing as a function of time. On the other hand, the likelihood that the buffer contents will exceed certain level B by time t diminishes with B. Improper simulation of such systems may therefore lead to false results. We turn to analyze this system under finite buffer assumption and derive bounds on the cell-loss rates. The bounds are expressed in terms of simple formulae of the system parameters. We carry out the analysis for two major types of networks: (1) datagram networks, where the packets (cells) traverse the network via independent paths and (2) virtual circuit networks, where all cells of a connection traverse the same path. Numerical, examination of ATM-like examples show that the bounds are very good for practical prediction of cell loss and the selection of buffer size.
机译:本文讨论了在ATM网络中用于受恒定比特率(CBR)流量限制的会话的末端缓冲区的大小。我们的目标是根据系统参数来预测末端缓冲区的单元丢失率。我们将D + G / D / 1队列作为通用模型引入,以表示恒定速率流量下电信网络中的出口缓冲区,并使用它来建模结束缓冲区。这是一个队列,其到达率等于其服务率,并且其到达是按规则的时间间隔生成的,并在通常分布的随机时间后实现。我们揭示了在无限缓冲区假设下,系统具有相当吸引人的特性:一方面,在缓冲区内容随时间单调不变的意义上,系统是不稳定的。另一方面,缓冲区内容在时间t之前将超过特定级别B的可能性随B减小。因此,此类系统的不正确模拟可能会导致错误的结果。我们转向在有限缓冲区假设下分析此系统,并得出单元丢失率的界限。界限以系统参数的简单公式表示。我们对两种主要类型的网络进行了分析:(1)数据报网络,其中数据包(单元)通过独立路径穿越网络;以及(2)虚拟电路网络,其中连接的所有单元都穿越同一路径。对类似ATM的示例进行的数值研究表明,边界对于实际的单元丢失预测和缓冲区大小的选择非常有用。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号