Upper Bound on Blocking Probability for Vertically Stacked Optical Banyan Networks with Link Failures and Given Crosstalk Constraint
DOI:
https://doi.org/10.3329/jsr.v1i3.1191Keywords:
Banyan networks, blocking probability, vertical stacking, link-failures, crosstalk.Abstract
Vertical stacking of multiple copies of an optical banyan network is a novel scheme for building nonblocking optical switching networks. The resulting network, namely vertically stacked optical banyan (VSOB) network, preserves all the properties of the banyan network, but increases the hardware cost significantly under first order crosstalk-free constraint. However, stringent crosstalk constraint may not always be necessary. Considering the fact that some designer may want to compromise the blocking probability and crosstalk constraint to a certain degree with the hardware cost, blocking behaviour of such VSOB networks have been analyzed to studying network performance and finding a graceful compromise between hardware costs and blocking probability under or without crosstalk constraint. In this paper, we present the simulation results for upper bound on blocking probability of VSOB networks with link failures and given degree of crosstalk constraint. We show how crosstalk adds a new dimension to the performance analysis on a VSOB networks. The simulation results presented in this paper can guide network designer in finding the trade-off among the blocking probability, the degree of crosstalk and the hardware cost in terms of vertical copies of banyan network in the presence of link failures.
Keywords: Banyan networks; Blocking probability; Vertical stacking; Link-failures; Crosstalk.
© 2009 JSR Publications. ISSN: 2070-0237 (Print); 2070-0245 (Online). All rights reserved.
DOI: 10.3329/jsr.v1i3.1191 J. Sci. Res. 1 (3), 484-494 (2009)
Downloads
141
101
Downloads
Published
How to Cite
Issue
Section
License
© Journal of Scientific Research
Articles published in the "Journal of Scientific Research" are Open Access articles under a Creative Commons Attribution-ShareAlike 4.0 International license (CC BY-SA 4.0). This license permits use, distribution and reproduction in any medium, provided the original work is properly cited and initial publication in this journal. In addition to that, users must provide a link to the license, indicate if changes are made and distribute using the same license as original if the original content has been remixed, transformed or built upon.