Computing path blocking probabilities for traffic splitting in optical hybrid switching networks

2012 ◽  
Author(s):  
Onur Alparslan ◽  
Shin'ichi Arakawa ◽  
Masayuki Murata
Keyword(s):  
Switching Networks ◽  
Traffic Splitting ◽  
Blocking Probabilities ◽  
Hybrid Switching

On Blocking Probabilities for Switching Networks

1977 ◽  
Vol 56 (8) ◽  
pp. 1431-1446 ◽  
Author(s):  
F. R. K. Chung ◽  
F. K. Hwang
Keyword(s):  
Switching Networks ◽  
Blocking Probabilities

Analysis and Design of Hybrid Switching Networks

1981 ◽  
Vol 29 (9) ◽  
pp. 1290-1300 ◽  
Author(s):  
I. Gitman ◽  
Wen-Ning Hsieh ◽  
B. Occhiogrosso
Keyword(s):  
Switching Networks ◽  
Analysis And Design ◽  
Hybrid Switching

Perturbation theory approach for a class of hybrid switching networks with small transit flows

1990 ◽  
Vol 22 (1) ◽  
pp. 211-229 ◽  
Author(s):  
M. Ya. Kelbert ◽  
R. P. Kopeika ◽  
R. N. Shamsiev ◽  
Yu. M. Sukhov
Keyword(s):  
Perturbation Theory ◽  
High Temperature ◽  
Existence And Uniqueness ◽  
Stationary Regime ◽  
Infinite Graphs ◽  
Circuit Switching ◽  
Low Density ◽  
Theory Approach ◽  
Switching Networks ◽  
Hybrid Switching

A method originating from statistical mechanics (low-density and high-temperature expansions) is used to prove the existence and uniqueness of a stationary regime for switching networks on finite or infinite graphs. The main assumption is that the message (customer) flows circulating through the network are ‘localized' in the sense that, for any message, the probability of having a long path is rapidly decreasing (and, moreover, a path of a ‘typical' message consists of one line). The switching rule combines message-switching and circuit-switching principles. The stationary regime for the network under consideration may be treated as a ‘small perturbation' of the ‘idealized' regime in the totally decoupled network where all the messages have single line paths.

Perturbation theory approach for a class of hybrid switching networks with small transit flows

1990 ◽  
Vol 22 (01) ◽  
pp. 211-229 ◽  
Author(s):  
M. Ya. Kelbert ◽  
R. P. Kopeika ◽  
R. N. Shamsiev ◽  
Yu. M. Sukhov
Keyword(s):  
Perturbation Theory ◽  
High Temperature ◽  
Existence And Uniqueness ◽  
Stationary Regime ◽  
Infinite Graphs ◽  
Circuit Switching ◽  
Low Density ◽  
Theory Approach ◽  
Switching Networks ◽  
Hybrid Switching

A method originating from statistical mechanics (low-density and high-temperature expansions) is used to prove the existence and uniqueness of a stationary regime for switching networks on finite or infinite graphs. The main assumption is that the message (customer) flows circulating through the network are ‘localized' in the sense that, for any message, the probability of having a long path is rapidly decreasing (and, moreover, a path of a ‘typical' message consists of one line). The switching rule combines message-switching and circuit-switching principles. The stationary regime for the network under consideration may be treated as a ‘small perturbation' of the ‘idealized' regime in the totally decoupled network where all the messages have single line paths.

scholarly journals Cross-Point Comparison of Multistage Non-Blocking Technologies

2018 ◽  
Vol 7 (3.2) ◽  
pp. 703
Author(s):  
Muhammad Zulfin ◽  
S Suherman ◽  
Rahmad Fauzi ◽  
M Razali ◽  
Maksum Pinem
Keyword(s):  
Computer Network ◽  
Computer Hardware ◽  
Input Output ◽  
Switching Networks ◽  
Cross Point ◽  
One Stage ◽  
Blocking Probabilities ◽  
Switch Element ◽  
Routing Control ◽  
Destination Address

Multistage switching networks play important role in communication and computer network. They make communication nodes connect to each other. In computer hardware switches connect processors and memories. Initially, switches are arranged as one stage interconnection. As clients are growing, multistage is a must. The finding Clos multistage switching initiated multistage technologies. Benes improves Clos by reducing number of cross-points by using a 2 x 2 switch element and call re-routing. Batcher improves the technology by other way which is sorting destination address. Banyan is then joined to Batcher to simplify routing control. This paper analyses the number of cross-point required in Clos, Benes and Batcher Banyan to accomplish multistage switching architecture of 16, 64, 256, 1024 and 2048 input/output ports. As results, Clos cross-point is in averages 495.24% higher than Benes and 160.30% higher than Batcher Banyan. Clos blocking probabilities are closed to zero. Benes blocking probabilities are conditionally zero. Batcher Banyan blocking probabilities are zero.  

Sign in / Sign up

Export Citation Format

Share Document