重路由榕树网络

S. Urushidani, H. Imagawa, K. Yukimatsu
{"title":"重路由榕树网络","authors":"S. Urushidani, H. Imagawa, K. Yukimatsu","doi":"10.1109/ISS.1990.765803","DOIUrl":null,"url":null,"abstract":"This paper proposes a high-through put selfrouting switch for ATM switching systems. The throughput of this switch is not decreased by internal contention. This is accomplished by using a rerouting algorithm which makes use of many embedded banyan networks and special routing information called remaining judgement times. This switch also has by-pass links for output lines and uses output buffers, which enhance switch performance by handling external contention among by-pass links and through the use of rerouting algorithms. A short-cut algorithm that improves throughput by employing the concept of the remaining judgement times is also presented. Analysis of switch throughput shows that it increases with the number of extra stages and can attain very high throughput levels.","PeriodicalId":277204,"journal":{"name":"International Symposium on Switching","volume":"51 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1990-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"The rerouting banyan network\",\"authors\":\"S. Urushidani, H. Imagawa, K. Yukimatsu\",\"doi\":\"10.1109/ISS.1990.765803\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes a high-through put selfrouting switch for ATM switching systems. The throughput of this switch is not decreased by internal contention. This is accomplished by using a rerouting algorithm which makes use of many embedded banyan networks and special routing information called remaining judgement times. This switch also has by-pass links for output lines and uses output buffers, which enhance switch performance by handling external contention among by-pass links and through the use of rerouting algorithms. A short-cut algorithm that improves throughput by employing the concept of the remaining judgement times is also presented. Analysis of switch throughput shows that it increases with the number of extra stages and can attain very high throughput levels.\",\"PeriodicalId\":277204,\"journal\":{\"name\":\"International Symposium on Switching\",\"volume\":\"51 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1990-05-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Symposium on Switching\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISS.1990.765803\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Symposium on Switching","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISS.1990.765803","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

提出了一种用于ATM交换系统的高通放自路由交换机。该交换机的吞吐量不会因内部争用而降低。这是通过使用重路由算法来实现的,该算法利用了许多嵌入式榕树网络和称为剩余判断时间的特殊路由信息。该交换机还具有用于输出线路的旁路链路,并使用输出缓冲区,这通过处理旁路链路之间的外部争用和使用重路由算法来提高交换机性能。提出了一种利用剩余判断时间的概念提高吞吐量的捷径算法。对交换机吞吐量的分析表明,它随着额外级数的增加而增加,可以达到非常高的吞吐量水平。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
The rerouting banyan network
This paper proposes a high-through put selfrouting switch for ATM switching systems. The throughput of this switch is not decreased by internal contention. This is accomplished by using a rerouting algorithm which makes use of many embedded banyan networks and special routing information called remaining judgement times. This switch also has by-pass links for output lines and uses output buffers, which enhance switch performance by handling external contention among by-pass links and through the use of rerouting algorithms. A short-cut algorithm that improves throughput by employing the concept of the remaining judgement times is also presented. Analysis of switch throughput shows that it increases with the number of extra stages and can attain very high throughput levels.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信