【24h】

ON THE ATM ADAPTATION LAYER

机译:在ATM适配层上

获取原文

摘要

The impact of the Convergence Sublayer Protocol Data Unit (CS_PDU) size on the end-to-end network delay in a B-ISDN environment is investigated in this paper. Cell loss probabilities are assumed to be bursty and when a cell loss occurs a retransmission is assumed to happen at the CS_PDU level. The cell loss probability is assumed to be such that there are two different probabilities for cell loss. Typically the cell loss probability is very small, in a real ATM network 10-9 or better.There are however instances when the cell loss probability will be significantly higher due to network congestion, such as buffer overflow, say a cell loss probability of 10-3. An ATM network, for simplicity consisting of one single link, has been simulated and the simulation results indicate that it is possible to select a CS_PDU size that will minimize the end-to-end delay. The ATM network has also been analyzed by using mathematical modeling technique. Our first mathematical analysis approach assumed naively a Poisson arrival ss. The resulting closed queueing.network was solved approximately and an expression for the end-to-end delay as a function of the CS_PDU size was obtained. It was then shown that the delay is optimized for a particular CS_PDU size. For high speed networks, burstiness is a very important factor for system end-to-end delay and thus a Poisson arrival process is not a reasonable assumption, furthermore batch arrivals of CS_PDU should also be considered. It is found that queueing models are IBP[x]/GEO/1/K and IBP[x]/D/1/K systems. Numerical results for queue length distributions and system end-to-end delays for both queueing systems have been obtained and are used to obtain the optimal CS_PDU size.
机译:本文研究了融合子层协议数据单元(CS_PDU)大小对B-ISDN环境中端到端网络延迟的影响。假设信元丢失概率是突发性的,并且当发生信元丢失时,假定重传发生在CS_PDU级别。假定信元丢失概率为使得存在两种不同的信元丢失概率。通常,在真实的ATM网络10-9或更高的情况下,信元丢失概率非常小。但是,在某些情况下,由于网络拥塞(例如缓冲区溢出),信元丢失概率会大大提高,例如,信元丢失概率为10 -3。为了简化起见,已经模拟了一个ATM网络,该网络由一个单链路组成,并且模拟结果表明可以选择CS_PDU大小,以最小化端到端延迟。还已经通过使用数学建模技术对ATM网络进行了分析。我们的第一个数学分析方法幼稚地假设了Poisson到达ss。近似解决了所得的封闭排队网络,并获得了端到端延迟随CS_PDU大小变化的表达式。然后表明,延迟针对特定的CS_PDU大小进行了优化。对于高速网络,突发性是系统端到端延迟的一个非常重要的因素,因此泊松到达过程不是一个合理的假设,此外,还应考虑CS_PDU的批量到达。发现排队模型是IBP [x] / GEO / 1 / K和IBP [x] / D / 1 / K系统。已经获得了两个排队系统的队列长度分布和系统端到端延迟的数值结果,并用于获得最佳CS_PDU大小。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号