不同虫洞路由方案的比较

Yen-Wen Lu, K. Bagchi, J. Burr, A. Peterson
{"title":"不同虫洞路由方案的比较","authors":"Yen-Wen Lu, K. Bagchi, J. Burr, A. Peterson","doi":"10.1109/MASCOT.1994.284404","DOIUrl":null,"url":null,"abstract":"Wormhole routing is an attractive scheme for large multicomputer networks. The authors include several such representative schemes and make performance comparisons via simulation on an N/spl times/N torus with nearest neighbor connections. A systematic performance scheme is followed, which shows that among all these 6 algorithms, worm1, a hill-climbing version, has a better performance. worm1, in addition, is simpler in structure and easier to implement.<<ETX>>","PeriodicalId":288344,"journal":{"name":"Proceedings of International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems","volume":"133 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1994-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"A comparison of different wormhole routing schemes\",\"authors\":\"Yen-Wen Lu, K. Bagchi, J. Burr, A. Peterson\",\"doi\":\"10.1109/MASCOT.1994.284404\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Wormhole routing is an attractive scheme for large multicomputer networks. The authors include several such representative schemes and make performance comparisons via simulation on an N/spl times/N torus with nearest neighbor connections. A systematic performance scheme is followed, which shows that among all these 6 algorithms, worm1, a hill-climbing version, has a better performance. worm1, in addition, is simpler in structure and easier to implement.<<ETX>>\",\"PeriodicalId\":288344,\"journal\":{\"name\":\"Proceedings of International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems\",\"volume\":\"133 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1994-01-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MASCOT.1994.284404\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MASCOT.1994.284404","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

摘要

对于大型多计算机网络来说,虫洞路由是一种很有吸引力的方案。作者列举了几种具有代表性的方案,并通过在N/spl次/N环面上的最近邻连接进行了性能比较。给出了系统的性能方案,结果表明,在这6种算法中,爬坡版本的worm1具有较好的性能。此外,wor1在结构上更简单,更容易实现。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A comparison of different wormhole routing schemes
Wormhole routing is an attractive scheme for large multicomputer networks. The authors include several such representative schemes and make performance comparisons via simulation on an N/spl times/N torus with nearest neighbor connections. A systematic performance scheme is followed, which shows that among all these 6 algorithms, worm1, a hill-climbing version, has a better performance. worm1, in addition, is simpler in structure and easier to implement.<>
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信