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 bet...

Full description

Bibliographic Details
Main Authors: Karimi, Abbas, Aghakhani, Kiarash, Manavi, Seyed Ehsan, Zarafshan, Faraneh, Syed Mohamed, Syed Abdul Rahman Al-Haddad
Format: Article
Published: Elsevier 2014
Online Access:http://psasir.upm.edu.my/id/eprint/34250/
_version_ 1848847718419529728
author Karimi, Abbas
Aghakhani, Kiarash
Manavi, Seyed Ehsan
Zarafshan, Faraneh
Syed Mohamed, Syed Abdul Rahman Al-Haddad
author_facet Karimi, Abbas
Aghakhani, Kiarash
Manavi, Seyed Ehsan
Zarafshan, Faraneh
Syed Mohamed, Syed Abdul Rahman Al-Haddad
author_sort Karimi, Abbas
building UPM Institutional Repository
collection Online Access
description 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.
first_indexed 2025-11-15T09:23:03Z
format Article
id upm-34250
institution Universiti Putra Malaysia
institution_category Local University
last_indexed 2025-11-15T09:23:03Z
publishDate 2014
publisher Elsevier
recordtype eprints
repository_type Digital Repository
spelling upm-342502016-01-08T08:37:20Z http://psasir.upm.edu.my/id/eprint/34250/ Introduction and analysis of optimal routing algorithm in Benes networks Karimi, Abbas Aghakhani, Kiarash Manavi, Seyed Ehsan Zarafshan, Faraneh Syed Mohamed, Syed Abdul Rahman Al-Haddad 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. Elsevier 2014 Article PeerReviewed 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 http://www.sciencedirect.com/science/article/pii/S1877050914015063 10.1016/j.procs.2014.11.068
spellingShingle Karimi, Abbas
Aghakhani, Kiarash
Manavi, Seyed Ehsan
Zarafshan, Faraneh
Syed Mohamed, Syed Abdul Rahman Al-Haddad
Introduction and analysis of optimal routing algorithm in Benes networks
title Introduction and analysis of optimal routing algorithm in Benes networks
title_full Introduction and analysis of optimal routing algorithm in Benes networks
title_fullStr Introduction and analysis of optimal routing algorithm in Benes networks
title_full_unstemmed Introduction and analysis of optimal routing algorithm in Benes networks
title_short Introduction and analysis of optimal routing algorithm in Benes networks
title_sort introduction and analysis of optimal routing algorithm in benes networks
url http://psasir.upm.edu.my/id/eprint/34250/
http://psasir.upm.edu.my/id/eprint/34250/
http://psasir.upm.edu.my/id/eprint/34250/