UPM Institutional Repository

Introduction and analysis of optimal routing algorithm in Benes networks


Citation

Karimi, Abbas and Aghakhani, Kiarash and Manavi, Seyed Ehsan and Zarafshan, Faraneh and Syed Mohamed, Syed Abdul Rahman Al-Haddad (2014) Introduction and analysis of optimal routing algorithm in Benes networks. Procedia Computer Science, 42. pp. 313-319. ISSN 1877-0509

Abstract

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.


Download File

Full text not available from this repository.

Additional Metadata

Item Type: Article
Divisions: Faculty of Engineering
DOI Number: https://doi.org/10.1016/j.procs.2014.11.068
Publisher: Elsevier
Keywords: Benes network; Interconnection networks; Matrix-based algorithm; Robotics; Routing algorithm
Depositing User: Nurul Ainie Mokhtar
Date Deposited: 10 Dec 2015 00:51
Last Modified: 08 Jan 2016 08:37
Altmetrics: http://www.altmetric.com/details.php?domain=psasir.upm.edu.my&doi=10.1016/j.procs.2014.11.068
URI: http://psasir.upm.edu.my/id/eprint/34250
Statistic Details: View Download Statistic

Actions (login required)

View Item View Item