双向总线网络信道复用多址协议

IEEE International Conference on Communications, Including Supercomm Technical Sessions Pub Date : 1990-04-16 DOI:10.1109/ICC.1990.117352

W. C. Lee, P. Humblet

{"title":"双向总线网络信道复用多址协议","authors":"W. C. Lee, P. Humblet","doi":"10.1109/ICC.1990.117352","DOIUrl":null,"url":null,"abstract":"A novel contention-free multiple-access protocol for bidirectional-passive bus packet networks is proposed. One version has a simple fixed-assignment transmission scheduling similar to that of the time-division multiple-access protocol, except that left-going and right-going packets may be transmitted only in alternate rounds. Another version employs a simple reservation scheme to provide demand-assignment transmission scheduling. In either instance the protocol may offer a maximum throughput exceeding one packet per packet transmission time under appropriate conditions, where throughput is defined as the number of distinct packets transmitted successfully per packet transmission time. This is possible through channel reuse as explained.<<ETX>>","PeriodicalId":126008,"journal":{"name":"IEEE International Conference on Communications, Including Supercomm Technical Sessions","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Channel reuse multiple access protocol for bidirectional bus networks\",\"authors\":\"W. C. Lee, P. Humblet\",\"doi\":\"10.1109/ICC.1990.117352\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A novel contention-free multiple-access protocol for bidirectional-passive bus packet networks is proposed. One version has a simple fixed-assignment transmission scheduling similar to that of the time-division multiple-access protocol, except that left-going and right-going packets may be transmitted only in alternate rounds. Another version employs a simple reservation scheme to provide demand-assignment transmission scheduling. In either instance the protocol may offer a maximum throughput exceeding one packet per packet transmission time under appropriate conditions, where throughput is defined as the number of distinct packets transmitted successfully per packet transmission time. This is possible through channel reuse as explained.<<ETX>>\",\"PeriodicalId\":126008,\"journal\":{\"name\":\"IEEE International Conference on Communications, Including Supercomm Technical Sessions\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1990-04-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE International Conference on Communications, Including Supercomm Technical Sessions\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICC.1990.117352\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE International Conference on Communications, Including Supercomm Technical Sessions","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICC.1990.117352","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

针对双向无源总线分组网络，提出了一种新的无争用多址协议。一个版本具有类似于时分多址协议的简单的固定分配传输调度，除了左向和右向的数据包只能在交替的轮中传输。另一个版本采用简单的保留方案来提供需求分配传输调度。在任何一种情况下，在适当的条件下，协议都可以提供超过每个数据包传输时间一个数据包的最大吞吐量，其中吞吐量定义为每个数据包传输时间成功传输的不同数据包的数量。如前所述，这可以通过通道重用实现

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

查看原文本刊更多论文

Channel reuse multiple access protocol for bidirectional bus networks

A novel contention-free multiple-access protocol for bidirectional-passive bus packet networks is proposed. One version has a simple fixed-assignment transmission scheduling similar to that of the time-division multiple-access protocol, except that left-going and right-going packets may be transmitted only in alternate rounds. Another version employs a simple reservation scheme to provide demand-assignment transmission scheduling. In either instance the protocol may offer a maximum throughput exceeding one packet per packet transmission time under appropriate conditions, where throughput is defined as the number of distinct packets transmitted successfully per packet transmission time. This is possible through channel reuse as explained.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

IEEE International Conference on Communications, Including Supercomm Technical Sessions

自引率

0.00%

发文量