榕树网络的时空结合分析

O. Zadedyurina, Y. Ofek, A. Pattavina
{"title":"榕树网络的时空结合分析","authors":"O. Zadedyurina, Y. Ofek, A. Pattavina","doi":"10.1109/HPSR.2009.5307425","DOIUrl":null,"url":null,"abstract":"This paper1analyzes the blocking probability of multistage Banyan networks in a combined space and time domain. The analytical solution provides unique tradeoff among various parameters and the corresponding blocking probability. Specifically, this work presents combinatorial based approaches to analyze Banyan in the time domain, which can easily be extended to the WDM domain. The analytical results show that adding time drastically reduces the blocking of (space optimal) Banyan networks. This is significant in general, and in particular, in the optical domain, where the cost of each switching element is high.","PeriodicalId":251545,"journal":{"name":"2009 International Conference on High Performance Switching and Routing","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Combined space and time analysis of Banyan networks\",\"authors\":\"O. Zadedyurina, Y. Ofek, A. Pattavina\",\"doi\":\"10.1109/HPSR.2009.5307425\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper1analyzes the blocking probability of multistage Banyan networks in a combined space and time domain. The analytical solution provides unique tradeoff among various parameters and the corresponding blocking probability. Specifically, this work presents combinatorial based approaches to analyze Banyan in the time domain, which can easily be extended to the WDM domain. The analytical results show that adding time drastically reduces the blocking of (space optimal) Banyan networks. This is significant in general, and in particular, in the optical domain, where the cost of each switching element is high.\",\"PeriodicalId\":251545,\"journal\":{\"name\":\"2009 International Conference on High Performance Switching and Routing\",\"volume\":\"22 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-06-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 International Conference on High Performance Switching and Routing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HPSR.2009.5307425\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Conference on High Performance Switching and Routing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HPSR.2009.5307425","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文分析了多阶段榕树网络在空间和时间联合域的阻塞概率。解析解提供了各参数之间的独特权衡和相应的阻塞概率。具体来说,这项工作提出了基于组合的方法来分析时域中的Banyan,这可以很容易地扩展到WDM域。分析结果表明,增加时间可以显著降低(空间最优)榕树网络的阻塞。这在一般情况下是很重要的,特别是在每个开关元件的成本很高的光学领域。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Combined space and time analysis of Banyan networks
This paper1analyzes the blocking probability of multistage Banyan networks in a combined space and time domain. The analytical solution provides unique tradeoff among various parameters and the corresponding blocking probability. Specifically, this work presents combinatorial based approaches to analyze Banyan in the time domain, which can easily be extended to the WDM domain. The analytical results show that adding time drastically reduces the blocking of (space optimal) Banyan networks. This is significant in general, and in particular, in the optical domain, where the cost of each switching element is high.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Beyond single-box SW router architectures Empowering Chord DHT overlays Optimal capacity allocation for load balanced shortest path routing FlashLook: 100-Gbps hash-tuned route lookup architecture A novel traffic engineering method using on-chip diorama network on dynamically reconfigurable processor DAPDNA-2
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1