In this paper we present and analyze a class of tree algorithms with variable message length. First we analyze the algorithm according to which a message, consisting of a number of packets, is transmitted continuously after the successful transmission of its first packet, referred to as the tree algorithm with variable message length. The analysis of the algorithm is presented for the two cases of small number of users and of large number of users. In both cases the analysis shows a considerable improvement for the maximum throughput, which gets larger as the average message length increases. Second, we present the reservation tree algorithm, R-Tree, which uses &test& packets instead of the message's first packet to resolve the collision among users. The R-Tree maximum throughput approaches one as the average message length increases, which for single packet messages can be a maximum throughput of 0.776 for infinite number of users.
在本文中,我们提出并分析了一类具有可变消息长度的树算法。首先,我们分析一种算法,根据该算法,在成功传输第一个数据包后,将连续传输包含多个数据包的消息,这就是消息长度可变的树算法。针对用户数量少和用户数量大的两种情况,对该算法进行了分析。在这两种情况下,分析均显示出最大吞吐量方面的显着改进,随着平均消息长度的增加,该最大值会变得更大。其次,我们提出了保留树算法R-Tree,它使用&test&数据包而不是消息的第一个数据包来解决用户之间的冲突。随着平均消息长度的增加,R-Tree的最大吞吐量接近1,对于单个分组消息,对于无限数量的用户,最大吞吐量可以达到0.776。 P>
Electrical Engineering Department, City College of New York, New York, N.Y.;
机译:基于增强消息的随机可变长度密钥加密算法(E-MRVLK)
机译:基于消息的随机可变长度密钥加密算法
机译:基于消息的随机可变长度密钥加密算法科学出版物
机译:基于WDM的本地光波网络的可变长度消息调度算法
机译:对多播路由算法进行性能评估以权衡路径长度和带宽消耗,并对协议进行性能评估以减少消息传递开销。
机译:L树:一种基于局部学习的树归纳算法进行图像分类
机译:基于消息的随机可变长度密钥加密算法
机译:消息传递体系结构中搜索树的算法