多个交换机连接令牌传递环网

J. Yu, Wen-Tsuen Chen
{"title":"多个交换机连接令牌传递环网","authors":"J. Yu, Wen-Tsuen Chen","doi":"10.1109/LCN.1991.208107","DOIUrl":null,"url":null,"abstract":"A pairwise switch-connection mechanism for interconnecting multiple token passing ring networks is proposed. The total number of internetwork packet store-and-forwards occurring at the bridges can be significantly reduced under the new switching method. A simple scheduling algorithm is developed to guarantee non-overlapped pairwise connection among the interconnected ring networks. Easy network access can be achieved through the use of different types of free tokens and local timers. Only simple table look-up operation is needed for the internetwork address translation. Therefore, the internetwork packets can be routed efficiently. Finally, simulation results are provided to show the fair network throughput under such switch-connection approach.<<ETX>>","PeriodicalId":163373,"journal":{"name":"[1991] Proceedings 16th Conference on Local Computer Networks","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The multiple switch-connected token passing ring networks\",\"authors\":\"J. Yu, Wen-Tsuen Chen\",\"doi\":\"10.1109/LCN.1991.208107\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A pairwise switch-connection mechanism for interconnecting multiple token passing ring networks is proposed. The total number of internetwork packet store-and-forwards occurring at the bridges can be significantly reduced under the new switching method. A simple scheduling algorithm is developed to guarantee non-overlapped pairwise connection among the interconnected ring networks. Easy network access can be achieved through the use of different types of free tokens and local timers. Only simple table look-up operation is needed for the internetwork address translation. Therefore, the internetwork packets can be routed efficiently. Finally, simulation results are provided to show the fair network throughput under such switch-connection approach.<<ETX>>\",\"PeriodicalId\":163373,\"journal\":{\"name\":\"[1991] Proceedings 16th Conference on Local Computer Networks\",\"volume\":\"25 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-10-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1991] Proceedings 16th Conference on Local Computer Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LCN.1991.208107\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1991] Proceedings 16th Conference on Local Computer Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LCN.1991.208107","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

提出了一种用于多个令牌传递环网互连的双交换连接机制。在新的交换方法下,发生在网桥上的网际数据包存储和转发的总数可以显著减少。提出了一种简单的调度算法,以保证环形互连网络之间的成对连接不重叠。通过使用不同类型的免费令牌和本地计时器,可以实现轻松的网络访问。网络地址转换只需要简单的查表操作。从而提高网络间报文的路由效率。最后给出了仿真结果,表明在这种交换连接方式下,网络吞吐量是合理的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
The multiple switch-connected token passing ring networks
A pairwise switch-connection mechanism for interconnecting multiple token passing ring networks is proposed. The total number of internetwork packet store-and-forwards occurring at the bridges can be significantly reduced under the new switching method. A simple scheduling algorithm is developed to guarantee non-overlapped pairwise connection among the interconnected ring networks. Easy network access can be achieved through the use of different types of free tokens and local timers. Only simple table look-up operation is needed for the internetwork address translation. Therefore, the internetwork packets can be routed efficiently. Finally, simulation results are provided to show the fair network throughput under such switch-connection approach.<>
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信