Introduction and Analysis of Optimal Routing Algorithm in Benes Networks
Abbas Karimi, Kiarash Aghakhani, Seyed Ehsan Manavi, Faraneh Zarafshan, S. A. R. Al-Haddad · Procedia Computer Science · 2014
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-José and fast algorithms in the speed of running time and implementation then introduce the optimum algorithm.