By Topic

Performance of fast routing algorithm for Vertically Stacked Optical Banyan networks with link failures and given crosstalk constraint

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

2 Author(s)
Sultana, B. ; Dept. of Appl. Phys. & Electron. Eng., Univ. of Rajshahi, Rajshahi ; Khandker, M.R.

For faster connection establishment, previously proposed Pruned Vertically Stacked Optical Banyan (P-VSOB) networks used plane fixed routing (PFR) algorithm, and has O(log2N) routing complexity. Blocking probability has also been analyzed for these kinds of networks with given amount of crosstalk. In EP-VSOB networks, a few regular banyan planes are added with the PVSOB networks. Necessary routing algorithm, namely, PFR_LS and PFR_RS show that this switching network can reduce the blocking probability to very low value while keeping the hardware cost almost the same as that of PVSOB networks. Both these algorithm also have the time complexity O(log2N). This paper deals with the blocking behavior of EP-VSOB (Extended pruned VSOB) networks having link-failures and allows crosstalk constraint. Our simulation results show that crosstalk adds a new dimension to the performance analysis of practical EP-VSOB networks where some links are failed. The results show that if we allow some CSEs to the network then blocking probability decreases to low value for both PFR_LS and PFR_RS algorithm. The results also show that the blocking probability of the EP-VSOB networks does not always increase with the increase of link-failures; blocking probability decreases for certain range of link-failures, and then increases again.

Published in:

Computer and Information Technology, 2008. ICCIT 2008. 11th International Conference on

Date of Conference:

24-27 Dec. 2008