A performance model for concurrent message transfer on Playthrough rings

IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution? Pub Date : 1988-03-27 DOI:10.1109/INFCOM.1988.12910

C. B. Silio, H. Ghafir

{"title":"A performance model for concurrent message transfer on Playthrough rings","authors":"C. B. Silio, H. Ghafir","doi":"10.1109/INFCOM.1988.12910","DOIUrl":null,"url":null,"abstract":"The authors present analytical models to approximate average message queueing time, service time, and token round trip time on ring topology local area networks that use a Playthrough protocol. Playthrough's data-link-layer protocol uses a continually circulating control token, source removed update control messages, and destination-removed data messages to achieve concurrent transfer of multiple messages of arbitrary length. The models of data-message service time and token round trip time are used in a queueing system model for average message waiting time in this class of multiserver circuit-switched ring. The collection of analytical models is shown to adequately approximate simulated queueing times for messages transmitted using a shortest-outbound-distance-first queueing discipline. This analysis differs from earlier approximations in that it includes the effects of both bridge traffic and downstream blocking traffic on the waiting times experienced by messages arriving at an arbitrary node.<<ETX>>","PeriodicalId":436217,"journal":{"name":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INFCOM.1988.12910","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 6

Abstract

The authors present analytical models to approximate average message queueing time, service time, and token round trip time on ring topology local area networks that use a Playthrough protocol. Playthrough's data-link-layer protocol uses a continually circulating control token, source removed update control messages, and destination-removed data messages to achieve concurrent transfer of multiple messages of arbitrary length. The models of data-message service time and token round trip time are used in a queueing system model for average message waiting time in this class of multiserver circuit-switched ring. The collection of analytical models is shown to adequately approximate simulated queueing times for messages transmitted using a shortest-outbound-distance-first queueing discipline. This analysis differs from earlier approximations in that it includes the effects of both bridge traffic and downstream blocking traffic on the waiting times experienced by messages arriving at an arbitrary node.<>

查看原文本刊更多论文

在通关环上并发消息传输的性能模型

作者提出了分析模型，以近似平均消息排队时间，服务时间和令牌往返时间在环形拓扑局域网使用透玩协议。Playthrough的数据链路层协议使用连续循环的控制令牌、源删除的更新控制消息和目的地删除的数据消息来实现任意长度的多条消息的并发传输。在这类多服务器电路交换环的平均消息等待时间的排队系统模型中，采用了数据消息服务时间和令牌往返时间模型。分析模型的集合显示可以充分近似模拟使用出站距离最短优先排队原则传输的消息的排队时间。这种分析不同于先前的近似，因为它包括桥接流量和下游阻塞流量对到达任意节点的消息所经历的等待时间的影响。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?

自引率

0.00%

发文量