改进了通关戒指的服务时间模型

H. Ghafir, C. B. Silio, M. Sui, E. Wasser
{"title":"改进了通关戒指的服务时间模型","authors":"H. Ghafir, C. B. Silio, M. Sui, E. Wasser","doi":"10.1109/CNS.1988.4982","DOIUrl":null,"url":null,"abstract":"Models are presented for message service time on playthrough rings, a class of multiserver computer communication subnetworks that uses circuit-switching on a ring topology. The playthrough protocol uses a perpetually circulating control token, source-removed update control messages, and destination removed data messages to provide concurrent transfer of multiple messages of arbitrary length on a single ring. Data messages share ring bandwidth with and are frequently interrupted at source transmitters by update control messages associated with other concurrent message transfers and the circulating token. The rate of interruptions to message service varies according to message outbound distance from source to destination. The authors use the concept of service completion time in a queuing system that experiences preemptive-resume interruption to predict mean and variance of message service time on playthrough rings for messages with geometrically distributed lengths. The models' predictions are validated using simulation data. These models are suited for use in analytical models for approximating queuing and total transfer times for messages.<<ETX>>","PeriodicalId":112149,"journal":{"name":"[1988] Proceedings. Computer Networking Symposium","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"An improved model for service time on playthrough rings\",\"authors\":\"H. Ghafir, C. B. Silio, M. Sui, E. Wasser\",\"doi\":\"10.1109/CNS.1988.4982\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Models are presented for message service time on playthrough rings, a class of multiserver computer communication subnetworks that uses circuit-switching on a ring topology. The playthrough protocol uses a perpetually circulating control token, source-removed update control messages, and destination removed data messages to provide concurrent transfer of multiple messages of arbitrary length on a single ring. Data messages share ring bandwidth with and are frequently interrupted at source transmitters by update control messages associated with other concurrent message transfers and the circulating token. The rate of interruptions to message service varies according to message outbound distance from source to destination. The authors use the concept of service completion time in a queuing system that experiences preemptive-resume interruption to predict mean and variance of message service time on playthrough rings for messages with geometrically distributed lengths. The models' predictions are validated using simulation data. These models are suited for use in analytical models for approximating queuing and total transfer times for messages.<<ETX>>\",\"PeriodicalId\":112149,\"journal\":{\"name\":\"[1988] Proceedings. Computer Networking Symposium\",\"volume\":\"7 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1988-04-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1988] Proceedings. Computer Networking Symposium\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CNS.1988.4982\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1988] Proceedings. Computer Networking Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CNS.1988.4982","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

摘要

本文提出了直通环上消息服务时间的模型,直通环是一种多服务器计算机通信子网,在环形拓扑上使用电路交换。playthrough协议使用永久循环的控制令牌、删除源的更新控制消息和删除目的地的数据消息,以在单个环上提供任意长度的多条消息的并发传输。数据消息与源发送器共享环带宽,并经常被与其他并发消息传输和循环令牌相关联的更新控制消息中断。消息服务的中断率根据消息从源到目的地的出站距离而变化。作者在经历抢占恢复中断的排队系统中使用服务完成时间的概念来预测具有几何分布长度的消息在播放环上的消息服务时间的均值和方差。利用仿真数据验证了模型的预测结果。这些模型适合在分析模型中使用,用于近似消息的排队时间和总传输时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An improved model for service time on playthrough rings
Models are presented for message service time on playthrough rings, a class of multiserver computer communication subnetworks that uses circuit-switching on a ring topology. The playthrough protocol uses a perpetually circulating control token, source-removed update control messages, and destination removed data messages to provide concurrent transfer of multiple messages of arbitrary length on a single ring. Data messages share ring bandwidth with and are frequently interrupted at source transmitters by update control messages associated with other concurrent message transfers and the circulating token. The rate of interruptions to message service varies according to message outbound distance from source to destination. The authors use the concept of service completion time in a queuing system that experiences preemptive-resume interruption to predict mean and variance of message service time on playthrough rings for messages with geometrically distributed lengths. The models' predictions are validated using simulation data. These models are suited for use in analytical models for approximating queuing and total transfer times for messages.<>
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信