scholarly journals Tap-and-2-Split Switch Design Based on Integrated Optics for Light-Tree Routing in WDM Networks

2009 ◽  
Vol 27 (13) ◽  
pp. 2506-2517 ◽  
Author(s):  
Gonzalo M. Fernandez ◽  
Carmen Vazquez ◽  
Pedro Contreras Lallana ◽  
David Larrabeiti
Keyword(s):  
Integrated Optics ◽  
Wdm Networks ◽  
Tree Routing ◽  
Switch Design

Survivable and traffic-oblivious routing in WDM networks: valiant load balancing versus tree routing

2009 ◽  
Vol 8 (5) ◽  
pp. 438 ◽  
Author(s):  
Rui Dai ◽  
Lemin Li ◽  
Sheng Wang ◽  
Xiaoning Zhang
Keyword(s):  
Load Balancing ◽  
Wdm Networks ◽  
Tree Routing ◽  
Oblivious Routing

On Number of Planes of Rearrangeably Nonblocking Optical Banyan Networks with Link Failures

2008 ◽  
Vol 1 (1) ◽  
pp. 43-54
Author(s):  
Basra Sultana ◽  
Mamun-ur-Rashid Khandker
Keyword(s):  
Optical Switching ◽  
Blocking Probability ◽  
Link Failure ◽  
Link Failures ◽  
Small Depth ◽  
Internal Link ◽  
Banyan Network ◽  
Minimum Number ◽  
Switch Design ◽  
Banyan Networks

Vertically stacked optical banyan (VSOB) networks are attractive for serving as optical switching systems due to the desirable properties (such as the small depth and self-routing capability) of banyan network structures. Although banyan-type networks result in severe blocking and crosstalk, both these problems can be minimized by using sufficient number of banyan planes in the VSOB network structure. The number of banyan planes is minimum for rearrangeably nonblocking and maximum for strictly nonblocking structure. Both results are available for VSOB networks when there exist no internal link-failures. Since the issue of link-failure is unavoidable, we intend to find the minimum number of planes required to make a VSOB network nonblocking when some links are broken or failed in the structure. This paper presents the approximate number of planes required to make a VSOB networks rearrangeably nonblocking allowing link-failures. We also show an interesting behavior of the  blocking  probability of a faulty VSOB networks that the blocking probability may not  always  increase monotonously with  the  increase  of  link-failures; blocking probability  decreases  for  certain range of  link-failures, and then increases again. We believe that such fluctuating behavior of blocking probability with the increase of link failure probability deserves special attention in switch design.  Keywords: Banyan networks; Blocking probability; Switching networks; Vertical stacking; Link-failures. © 2009 JSR Publications. ISSN: 2070-0237(Print); 2070-0245 (Online). All rights reserved. DOI: 10.3329/jsr.v1i1.1070

Pre-Adjustment Rerouting for Wavelength Defragmentation in Optical Transparent WDM Networks

2015 ◽  
Vol E98.B (10) ◽  
pp. 2014-2021
Author(s):  
Akihiro KADOHATA ◽  
Atsushi WATANABE ◽  
Akira HIRANO ◽  
Hiroshi HASEGAWA ◽  
Ken-ichi SATO
Keyword(s):  
Wdm Networks

Clustering hierarchy tree routing algorithm based on LEACH

2009 ◽  
Vol 28 (10) ◽  
pp. 2594-2596
Author(s):  
Chun-yan SONG ◽  
Hua-zhong ZHANG ◽  
Xiu-yang ZHANG
Keyword(s):  
Routing Algorithm ◽  
Tree Routing
Sign in / Sign up

Export Citation Format

Share Document