Batcher banyan network with cell copy preparation stages for multicast switching

Author(s):  
S. Takagi ◽  
Y. Tanaka ◽  
H. Tominaga
Keyword(s):  
2008 ◽  
Vol 1 (1) ◽  
pp. 43-54
Author(s):  
Basra Sultana ◽  
Mamun-ur-Rashid Khandker

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


1993 ◽  
Vol 29 (1) ◽  
pp. 62-63 ◽  
Author(s):  
Y.S. Youn ◽  
C.K. Un
Keyword(s):  

1994 ◽  
Vol 17 (10) ◽  
pp. 750-757 ◽  
Author(s):  
Seung-Woo Seo ◽  
Tse-yun Feng

2007 ◽  
Vol 19 (6) ◽  
pp. 390-392 ◽  
Author(s):  
Ying Zha ◽  
De-Gui Sun ◽  
Tie-Gen Liu ◽  
Ying Zhang ◽  
Xiaoqi Li ◽  
...  

2014 ◽  
Vol 23 (12) ◽  
pp. 120309 ◽  
Author(s):  
Chang-Hua Zhu ◽  
Yan-Hong Meng ◽  
Dong-Xiao Quan ◽  
Nan Zhao ◽  
Chang-Xing Pei

2002 ◽  
Vol 03 (01n02) ◽  
pp. 49-65 ◽  
Author(s):  
NADER F. MIR

A thorough routing analysis of a switching network called the spherical switching network for high-speed applications is presented in this paper. The spherical switching network has a cyclic, regular, and highly expandable structure with a simple self-routing scheme. The network is constructed with fixed-size switch elements regardless of the size of the network. Each switch element consists of a carefully-selected sized 9 input/output crossbar and a local controller. One of the nine pairs of links is external and carries the external traffic, and the other eight pairs are internal. The contention resolution in each switch element is based on deflection of losing packets and incremental priority of packets. The switch elements do not utilize any buffering within the network. The analysis shows that this network clearly outperforms typical interconnection networks currently being deployed in practical switches and routers such as Banyan network. In order to keep the number of deflections low, each incoming external link is connected to a buffer with flow control capabilities. Due to the special arrangement of interconnections in the network, a much larger number of shortest paths between each pair of source/destination exists. The related analysis for finding the number of hops and shortest paths appear in this paper.


Sign in / Sign up

Export Citation Format

Share Document