Low Complexity Routing Algorithm for Rearrangeable Switching Networks

2013 ◽  
Author(s):  
A. Chakrabarty ◽  
M. Collier
Keyword(s):  
Routing Algorithm ◽  
Low Complexity ◽  
Switching Networks

Adaptive Routing Strategy for Large Scale Rearrangeable Symmetric Networks

2010 ◽  
Vol 2 (2) ◽  
pp. 53-63 ◽  
Author(s):  
Amitabha Chakrabarty ◽  
Martin Collier ◽  
Sourav Mukhopadhyay
Keyword(s):  
Large Scale ◽  
Blocking Probability ◽  
Routing Algorithm ◽  
Adaptive Routing ◽  
Low Complexity ◽  
Deterministic Algorithms ◽  
Routing Strategy ◽  
The Status ◽  
Extensive Computation ◽  
Symmetric Networks

This paper proposes an adaptive unicast routing algorithm for large scale symmetric networks comprising 2 × 2 switch elements such as Bene?s networks. This algorithm trades off the probability of blocking against algorithm execution time. Deterministic algorithms exploit the rearrangeability property of Bene?s networks to ensure a zero blocking probability for unicast connections, at the expense of extensive computation. The authors’ algorithm makes its routing decisions depending on the status of each switching element at every stage of the network, hence the name adaptive routing. This method provides a low complexity solution, but with much better blocking performance than random routing algorithms. This paper presents simulation results for various input loads, demonstrating the tradeoffs involved.

Sign in / Sign up

Export Citation Format

Share Document