An efficient routing algorithm for mesh-hypercube (M-H) networks

Syed S. Rizvi, Khaled M. Elleithy, Aasia Riasat

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

This paper presents an efficient routing algorithm for the Mesh-Hypercube (M-H) network. The M-H network is one of the new interconnection networking techniques use to build high performance parallel computers. The combination of M-H networks offers high connectivity among multiple nodes, fault-tolerance, and load scalability. However, the performance of M-H networks may degrade significantly in the presence of frequent link or node failures. When a link or node failure occurs, neither the hardware schemes nor point to point and multistage routing algorithms can be used without adding extra links. This paper presents an efficient single bit store and forward (SBSF) routing algorithm for M-H network that based on the round robin scheduling algorithm. Simulation and numerical results suggest that the proposed routing algorithm improves the overall performance of M-H network by both reducing the transmission delay and increasing the total data throughput even in the presence of faulty nodes.

Original languageEnglish (US)
Title of host publicationProceedings of the 2008 International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA 2008
Pages69-75
Number of pages7
StatePublished - Dec 1 2008
Event2008 International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA 2008 - Las Vegas, NV, United States
Duration: Jul 14 2008Jul 17 2008

Publication series

NameProceedings of the 2008 International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA 2008

Other

Other2008 International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA 2008
CountryUnited States
CityLas Vegas, NV
Period7/14/087/17/08

Fingerprint

Hypercube networks
Routing algorithms
Fault tolerance
Scheduling algorithms
Scalability
Throughput
Hardware

All Science Journal Classification (ASJC) codes

  • Computational Theory and Mathematics
  • Computer Science Applications
  • Hardware and Architecture
  • Electrical and Electronic Engineering

Cite this

Rizvi, S. S., Elleithy, K. M., & Riasat, A. (2008). An efficient routing algorithm for mesh-hypercube (M-H) networks. In Proceedings of the 2008 International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA 2008 (pp. 69-75). (Proceedings of the 2008 International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA 2008).
Rizvi, Syed S. ; Elleithy, Khaled M. ; Riasat, Aasia. / An efficient routing algorithm for mesh-hypercube (M-H) networks. Proceedings of the 2008 International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA 2008. 2008. pp. 69-75 (Proceedings of the 2008 International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA 2008).
@inproceedings{5b8efe1f167c42df92d69a3569023fcb,
title = "An efficient routing algorithm for mesh-hypercube (M-H) networks",
abstract = "This paper presents an efficient routing algorithm for the Mesh-Hypercube (M-H) network. The M-H network is one of the new interconnection networking techniques use to build high performance parallel computers. The combination of M-H networks offers high connectivity among multiple nodes, fault-tolerance, and load scalability. However, the performance of M-H networks may degrade significantly in the presence of frequent link or node failures. When a link or node failure occurs, neither the hardware schemes nor point to point and multistage routing algorithms can be used without adding extra links. This paper presents an efficient single bit store and forward (SBSF) routing algorithm for M-H network that based on the round robin scheduling algorithm. Simulation and numerical results suggest that the proposed routing algorithm improves the overall performance of M-H network by both reducing the transmission delay and increasing the total data throughput even in the presence of faulty nodes.",
author = "Rizvi, {Syed S.} and Elleithy, {Khaled M.} and Aasia Riasat",
year = "2008",
month = "12",
day = "1",
language = "English (US)",
isbn = "1601320841",
series = "Proceedings of the 2008 International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA 2008",
pages = "69--75",
booktitle = "Proceedings of the 2008 International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA 2008",

}

Rizvi, SS, Elleithy, KM & Riasat, A 2008, An efficient routing algorithm for mesh-hypercube (M-H) networks. in Proceedings of the 2008 International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA 2008. Proceedings of the 2008 International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA 2008, pp. 69-75, 2008 International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA 2008, Las Vegas, NV, United States, 7/14/08.

An efficient routing algorithm for mesh-hypercube (M-H) networks. / Rizvi, Syed S.; Elleithy, Khaled M.; Riasat, Aasia.

Proceedings of the 2008 International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA 2008. 2008. p. 69-75 (Proceedings of the 2008 International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA 2008).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - An efficient routing algorithm for mesh-hypercube (M-H) networks

AU - Rizvi, Syed S.

AU - Elleithy, Khaled M.

AU - Riasat, Aasia

PY - 2008/12/1

Y1 - 2008/12/1

N2 - This paper presents an efficient routing algorithm for the Mesh-Hypercube (M-H) network. The M-H network is one of the new interconnection networking techniques use to build high performance parallel computers. The combination of M-H networks offers high connectivity among multiple nodes, fault-tolerance, and load scalability. However, the performance of M-H networks may degrade significantly in the presence of frequent link or node failures. When a link or node failure occurs, neither the hardware schemes nor point to point and multistage routing algorithms can be used without adding extra links. This paper presents an efficient single bit store and forward (SBSF) routing algorithm for M-H network that based on the round robin scheduling algorithm. Simulation and numerical results suggest that the proposed routing algorithm improves the overall performance of M-H network by both reducing the transmission delay and increasing the total data throughput even in the presence of faulty nodes.

AB - This paper presents an efficient routing algorithm for the Mesh-Hypercube (M-H) network. The M-H network is one of the new interconnection networking techniques use to build high performance parallel computers. The combination of M-H networks offers high connectivity among multiple nodes, fault-tolerance, and load scalability. However, the performance of M-H networks may degrade significantly in the presence of frequent link or node failures. When a link or node failure occurs, neither the hardware schemes nor point to point and multistage routing algorithms can be used without adding extra links. This paper presents an efficient single bit store and forward (SBSF) routing algorithm for M-H network that based on the round robin scheduling algorithm. Simulation and numerical results suggest that the proposed routing algorithm improves the overall performance of M-H network by both reducing the transmission delay and increasing the total data throughput even in the presence of faulty nodes.

UR - http://www.scopus.com/inward/record.url?scp=62749181099&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=62749181099&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:62749181099

SN - 1601320841

SN - 9781601320841

T3 - Proceedings of the 2008 International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA 2008

SP - 69

EP - 75

BT - Proceedings of the 2008 International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA 2008

ER -

Rizvi SS, Elleithy KM, Riasat A. An efficient routing algorithm for mesh-hypercube (M-H) networks. In Proceedings of the 2008 International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA 2008. 2008. p. 69-75. (Proceedings of the 2008 International Conference on Parallel and Distributed Processing Techniques and Applications, PDPTA 2008).