一种用于时效性消息传输的带宽分配方案

S. Mukherjee, D. Saha, M. Saksena, S. Tripathi
{"title":"一种用于时效性消息传输的带宽分配方案","authors":"S. Mukherjee, D. Saha, M. Saksena, S. Tripathi","doi":"10.1109/REAL.1993.393516","DOIUrl":null,"url":null,"abstract":"We study the problem of transmitting time constrained synchronous messages in a slotted ring based local area network, carrying synchronous and asynchronous traffic. A bandwidth allocation scheme for synchronous messages is developed on top of a media access control protocol that assigns preemptive priority to synchronous traffic over asynchronous traffic. We derive sufficient conditions for schedulability of time critical synchronous messages and show that the scheme achieves high levels of schedulable utilization. A slot access protocol is proposed for synchronous streams that implements the allocation scheme with minimal additional overhead and loss of schedulable utilization. The protocol is distributed in the sense that any node can locally determine if it can use a slot, without exchanging any explicit messages with other nodes.<<ETX>>","PeriodicalId":198313,"journal":{"name":"1993 Proceedings Real-Time Systems Symposium","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"26","resultStr":"{\"title\":\"A bandwidth allocation scheme for time constrained message transmission on a slotted ring LAN\",\"authors\":\"S. Mukherjee, D. Saha, M. Saksena, S. Tripathi\",\"doi\":\"10.1109/REAL.1993.393516\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We study the problem of transmitting time constrained synchronous messages in a slotted ring based local area network, carrying synchronous and asynchronous traffic. A bandwidth allocation scheme for synchronous messages is developed on top of a media access control protocol that assigns preemptive priority to synchronous traffic over asynchronous traffic. We derive sufficient conditions for schedulability of time critical synchronous messages and show that the scheme achieves high levels of schedulable utilization. A slot access protocol is proposed for synchronous streams that implements the allocation scheme with minimal additional overhead and loss of schedulable utilization. The protocol is distributed in the sense that any node can locally determine if it can use a slot, without exchanging any explicit messages with other nodes.<<ETX>>\",\"PeriodicalId\":198313,\"journal\":{\"name\":\"1993 Proceedings Real-Time Systems Symposium\",\"volume\":\"40 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1993-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"26\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"1993 Proceedings Real-Time Systems Symposium\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/REAL.1993.393516\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"1993 Proceedings Real-Time Systems Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/REAL.1993.393516","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 26

摘要

研究了在带同步和异步业务的开槽环局域网中传输时间约束的同步消息的问题。在媒体访问控制协议的基础上,开发了一种同步消息的带宽分配方案,该协议将优先级分配给同步流量,而不是异步流量。我们给出了时间关键同步消息可调度性的充分条件,并表明该方案实现了高水平的可调度利用率。提出了一种针对同步流的时隙访问协议,该协议实现了以最小的额外开销和可调度利用率损失为代价的分配方案。该协议是分布式的,任何节点都可以在本地确定它是否可以使用一个插槽,而无需与其他节点交换任何显式消息。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A bandwidth allocation scheme for time constrained message transmission on a slotted ring LAN
We study the problem of transmitting time constrained synchronous messages in a slotted ring based local area network, carrying synchronous and asynchronous traffic. A bandwidth allocation scheme for synchronous messages is developed on top of a media access control protocol that assigns preemptive priority to synchronous traffic over asynchronous traffic. We derive sufficient conditions for schedulability of time critical synchronous messages and show that the scheme achieves high levels of schedulable utilization. A slot access protocol is proposed for synchronous streams that implements the allocation scheme with minimal additional overhead and loss of schedulable utilization. The protocol is distributed in the sense that any node can locally determine if it can use a slot, without exchanging any explicit messages with other nodes.<>
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信