{"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}
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.<>