首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Blocking probability analysis of pruned optical banyan networks on vertical stacking scheme with extra banyan planes
Authors:MdMamun-ur-Rashid Khandker  Susumu Horiguchi
Institution:a Dept. of Applied Physics and Electronic Engineering, University of Rajshahi, Nator Road, Rajshahi 6205, Bangladesh
b Graduate School of Information Sciences, Tohoku University, Sendai 980-8579, Japan
Abstract:Vertically stacked pruned optical banyan networks with extra planes (in short, EP-VSOB networks) have lower switch count and optimal time complexity (O(log2 N)) for routing N input requests. However, blocking probability is relatively higher than that of a VSOB networks using regular banyan planes. In the EP-VSOB architecture, the number of pruned planes has always been considered as View the MathML source, and a few extra planes (regular banyan) have been added with these pruned planes. In this paper we present the results of blocking analysis of a more generalized architecture in which the number of pruned planes can be 2x, where x ? 0 in addition to the variable extra planes. This generalization helps us make a compromise between different constraints and performance metrics. Our simulation results show that for some given performance requirements (e.g. cost, speed or blocking probability) we can choose a network that has lower switch count compared to View the MathML source-plane pruned crosstalk-free optical banyan networks. For example, to ensure blocking probability <0.02, previously we would chose a pruned network of 32 pruned planes and 1 extra planes (a regular banyan); however, our simulations results show that a network of 16 pruned planes and 2 extra planes is enough to ensure the same performance. It is notable that, the hardware cost decreases by 28.65% in this new combination of pruned and extra planes. We believe our results will provide more flexibility in choosing a particular EP-VSOB network satisfying given requirements.
Keywords:Vertically stacked banyan networks  Crosstalk  Rearrangeable nonblocking  Self-routing  Plane fixed routing algorithm
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号