Cart (Loading....) | Create Account
Close category search window
 

Lower-Bound on Blocking Probability of General Banyan-based Photonic Switches with Zero First-Order Switching-Element-Crosstalk

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Chen Yu ; Graduate Sch. of Inf. Sci., Tohoku Univ., Sendai ; Xiaohong Jiang ; Horiguchi, S. ; Minyi Guo

The horizontally expanded and vertically stacked photonic banyan (HVPB) is a general architecture for building banyan-based photonic switches. Blocking behavior analysis is an effective approach to studying network performance and finding a graceful compromise among hardware cost, network depth, and blocking probability. In this paper, we analyze the blocking probability of a HVPB network under the constraint of zero first-order switching-element-crosstalk and develop its lower bound with respect to the number of planes (stacked copies) and number stages in the network. Extensive simulation on a network simulator with both random routing and packing strategy has shown that the blocking probabilities of both strategies are nicely bounded by our lower bound, and the blocking probability of packing strategy actually matches the lower-bound. The proposed lower-bound is significant because it provides network designers an effective tool to estimate the minimum blocking probability they can expect from a HVPB architecture regardless what kind of routing strategy to be adopted. In particular, the proposed bound can be used to efficiently estimate the blocking probability of HVPB networks adopting packing routing strategy, in which the inherent relationship and tradeoff among blocking probability, network hardware cost in terms of the number of planes, and network depth can be explored

Published in:

Communications, 2005 Asia-Pacific Conference on

Date of Conference:

5-5 Oct. 2005

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.