Message Delay Analysis for Polling and Token Multiple-Access Schemes for Local Communication Networks
Message Delay Analysis for Polling and Token Multiple-Access Schemes for Local Communication Networks
复制标题
DOI：
10.1109/jsac.1983.1145983
复制
发表时间：
1983-11
期刊：
影响因子：
--
通讯作者：
L. D. Moraes;I. Rubin
中科院分区：
文献类型：
--
作者：
L. D. Moraes;I. Rubin
两个有效的轮询（令牌）计划，它提供了多址协调局域网，进行了描述，分析和比较。这里描述的两个多址轮询协议利用门控和穷举规则来排序在每个终端处缓冲的消息的传输。在上述原则下运行的轮询方案的延迟吞吐量性能的行为。网络终端被建模为独立的源，根据更新过程生成消息。在推导实际消息延迟时，采用了一种离散化理论方法。两种方案的行为。几个比较。当我们将网络流量完全平衡的情况下的平均消息等待时间与相同流量主要来自单个节点的情况进行比较时，会得到有趣的结果。后一种情况会出现，例如，m个网络采用网关。
Two efficient polling (token) schemes, which provide multiaccess coordination for local area networks, are described, analyzed, and compared. The two multiple-access polling protocols described here utilize gated and exhaustive disciplines in ordering the transmission of the messages buffered at each terminal. The delay-throughput performance behavior of polling schemes operating under the above mentioned disciplines is derived. Network terminals are modeled as independent sources, which generate messages in accordance with a renewal process. A queueing theoretic approach is employed in deriving the actual message delay. behavior of both schemes. Several comparisons are presented. Interesting results are obtained when we compare the average message waiting times in the case when the network traffic is completely balanced with the ease when this same traffic is mostly due to a single node. The latter case would arise, for example, m networks employing gateways.