Please use this identifier to cite or link to this item:
|Scopus||Web of Science®||Altmetric|
|Title:||Blocking probability of vertically stacked optical banyan networks under random routing|
|Citation:||Proceedings of the Global Telecommunications Conference, 2003 (GLOBECOM '03), San Francisco, USA, pp. 2493-2497|
|Conference Name:||Global Telecommunications Conference (2003 : San Francisco, USA)|
|Xiaohong Jiang; Hong Shen; Horiguchi, S.|
|Abstract:||Vertical stacking of optical banyan networks is an attractive scheme for building nonblocking (crosstalk-free) optical switching networks. The resulting networks, namely vertically stacked optical banyan (VSOB) networks, preserve all the good properties of banyan networks, but increase the hardware cost significantly. In this paper, we study the blocking probabilities of VSOB networks under random routing strategy, and develop a model to compute the blocking probabilities with respect to the number of planes in the networks. Our model calculates the blocking probabilities stage by stage recursively, and it depicts accurately the blocking behaviors of VSOB networks under random routing. The proposed model is significant because it reveals the inherent relationships between blocking probability and network hardware cost in terms of the number of planes, and provides network developers a quantitative guidance to find a desirable tradeoff between blocking probability and hardware cost. An important conclusion drawn from our work that has practical applications is that the hardware cost of a VSOB network can be reduced dramatically if a predictable and almost negligible non-zero blocking probability is allowed.|
|Appears in Collections:||Computer Science publications|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.