首页> 外文期刊>IEEE/ACM Transactions on Networking >Approximate performance analysis of real-time traffic over heavily loaded networks with timed token protocols
【24h】

Approximate performance analysis of real-time traffic over heavily loaded networks with timed token protocols

机译:具有定时令牌协议的重载网络上实时流量的近似性能分析

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

摘要

This paper studies timed token protocols with respect to real-time packet traffic in local area networks (LANs), such as FDDI and token bus, employed in distributed control systems. Typically, in such systems, three classes of packet traffic are encountered. The first class consists of packets cyclically generated by data acquisition tasks. The second traffic class is represented by packets generated in a random manner by control tasks and sporadic events. Finally, the third traffic class represents nonreal-time packet streams such as, for example, file transfers. To evaluate protocol performance, three performance measures are taken into account with respect to randomly generated real-time traffic: the mean waiting time, the blocking probability, and the probability that accepted packets will wait for service no longer than a specified time limit. In order to determine the last performance measure, a two-moment approximation of the waiting time distribution is applied. All three performance measures are evaluated at the beginning of the heavy network load region. Two examples of numerical calculations compared with computer simulations done for FDDI-II and token bus networks are given.
机译:本文针对分布式控制系统中使用的诸如FDDI和令牌总线之类的局域网(LAN)中的实时数据包流量研究了定时令牌协议。通常,在这样的系统中,遇到三类分组业务。第一类包括由数据采集任务循环生成的数据包。第二业务量类别由控制任务和偶发事件以随机方式生成的数据包表示。最后,第三通信量类别表示非实时数据包流,例如文件传输。为了评估协议性能,针对随机生成的实时流量考虑了三种性能度量:平均等待时间,阻塞概率以及接受的数据包等待服务的时间不超过指定时间限制的概率。为了确定最后的性能指标,应用了等待时间分布的两步近似值。在繁重的网络负载区域的开始对这三个性能指标进行评估。给出了两个与FDDI-II和令牌总线网络进行的计算机仿真比较的数值计算示例。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号