Introduction and analysis of optimal routing algorithm in Benes networks

In a total grouping of dynamic interconnection networks, safe and quick routing is so important. The Benes network is one of the dynamic interconnection networks that are good for telephone networks, multi-processor systems, parallel computers, ATM switches and Navigation and radio communication between robots. In this paper, two models of Benes routing algorithm is introduced then compare them with looping; Hassan-Jose and fast algorithms in the speed of running time and implementation then introduce the optimum algorithm.

[1]  Abraham Waksman,et al.  A Permutation Network , 1968, JACM.

[2]  J. van Loon.  Network , 2006 .

[3]  Hasan Çam,et al.  Work-Efficient Routing Algorithms for Rearrangeable Symmetrical Networks , 1999, IEEE Trans. Parallel Distributed Syst..

[4]  Ming-Feng Lu,et al.  A strictly nonblocking network based on nonblocking 4×4 optical switches , 2012, Opt. Switch. Netw..

[5]  Abdul Rahman Ramli,et al.  A New Fuzzy Approach for Dynamic Load Balancing Algorithm , 2009, ArXiv.

[6]  Si-Qing Zheng,et al.  Fast reconfiguration algorithms for time, space, and wavelength dilated optical Benes networks , 2007, Int. J. Parallel Emergent Distributed Syst..

[7]  Kyungsook Y. Lee,et al.  A New Benes Network Control Algorithm , 1987, IEEE Trans. Computers.

[8]  L. P. Zu,et al.  Two expansible multistage interconnection networks , 1994, Proceedings of 1994 International Conference on Parallel and Distributed Systems.

[9]  M. Iqbal Saripan,et al.  A preliminary study on ancestral voting algorithm for availability improvement of mutual exclusion in partitioned distributed systems , 2011 .

[10]  Abbas Karimi,et al.  A Novel Clustering Algorithm for Mobile Ad Hoc Networks Based on Determination of Virtual Links' Weight to Increase Network Stability , 2014, TheScientificWorldJournal.

[11]  John A. Chandy,et al.  2-Dilated flattened butterfly: A nonblocking switching topology for high-radix networks , 2011, Comput. Commun..

[12]  D. C. Opferman,et al.  On a class of rearrangeable switching networks part I: Control algorithm , 1971 .

[13]  Sourav Mukhopadhyay,et al.  Matrix-Based Nonblocking Routing Algorithm for Beneš Networks , 2009, 2009 Computation World: Future Computing, Service Computation, Cognitive, Adaptive, Content, Patterns.

[14]  Nabanita Das,et al.  O(n) routing in rearrangeable networks , 2000, J. Syst. Archit..

[15]  Tsun-Yee Yan,et al.  Network-Control Algorithm , 1989 .

[16]  Xu Jia,et al.  Adaptive Spray Routing For Opportunistic Networks , 2013 .

[17]  Abdulaziz S. Almazyad.  Optical omega networks with centralized buffering and wavelength conversion , 2011, J. King Saud Univ. Comput. Inf. Sci..