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...
Saved in:
Main Authors: | , , , , |
---|---|
Format: | Article |
Published: |
Elsevier
2014
|
Online Access: | http://psasir.upm.edu.my/id/eprint/34250/ http://www.sciencedirect.com/science/article/pii/S1877050914015063 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
id |
my.upm.eprints.34250 |
---|---|
record_format |
eprints |
spelling |
my.upm.eprints.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 |
institution |
Universiti Putra Malaysia |
building |
UPM Library |
collection |
Institutional Repository |
continent |
Asia |
country |
Malaysia |
content_provider |
Universiti Putra Malaysia |
content_source |
UPM Institutional Repository |
url_provider |
http://psasir.upm.edu.my/ |
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. |
format |
Article |
author |
Karimi, Abbas Aghakhani, Kiarash Manavi, Seyed Ehsan Zarafshan, Faraneh Syed Mohamed, Syed Abdul Rahman Al-Haddad |
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 |
author_facet |
Karimi, Abbas Aghakhani, Kiarash Manavi, Seyed Ehsan Zarafshan, Faraneh Syed Mohamed, Syed Abdul Rahman Al-Haddad |
author_sort |
Karimi, Abbas |
title |
Introduction and analysis of optimal routing algorithm in Benes networks |
title_short |
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_sort |
introduction and analysis of optimal routing algorithm in benes networks |
publisher |
Elsevier |
publishDate |
2014 |
url |
http://psasir.upm.edu.my/id/eprint/34250/ http://www.sciencedirect.com/science/article/pii/S1877050914015063 |
_version_ |
1643831097611517952 |
score |
13.1944895 |