Faulty links optimization for hypercube networks via stored and forward one-bit round robin routing algorithm

Syed S. Rizvi, Adil Sheikh, Aasia Riasat

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

Abstract

Extensive research and studies have shown that the hypercube network is one of the most widely used techniques to build high performance parallel computers and it offers strong hierarchical structure with high symmetry properties. However, the performance of hypercube networks is mainly dependent on the link consistency between the nodes. Due to unexpected links failure and low connectivity, neither the hardware schemes nor point to point and multistage routing algorithms can be used without adding extra links. This paper presents a new stored and forward one-bit round robin routing algorithm that can efficiently send and receive messages between the nodes even in the presence of faulty links. In addition, we also examine and simulate the data throughput and hot spot properties of a hypercube network. Simulation results demonstrate that the proposed routing algorithm improves the overall performance of hypercube network by means of load-scalability that not only reduces the average waiting time per output queue but also increases the total data throughput even in the presence of faulty nodes.

Original languageEnglish (US)
Title of host publicationNovel Algorithms and Techniques in Telecommunications and Networking
Pages281-286
Number of pages6
DOIs
StatePublished - Dec 1 2010
Event2008 International Conference on Telecommunications and Networking, TeNe 2008, Part of the International Joint Conferences on Computer, Information, and Systems Sciences, and Engineering, CISSE 2008 -
Duration: Dec 5 2008Dec 13 2008

Other

Other2008 International Conference on Telecommunications and Networking, TeNe 2008, Part of the International Joint Conferences on Computer, Information, and Systems Sciences, and Engineering, CISSE 2008
Period12/5/0812/13/08

Fingerprint

Hypercube networks
Routing algorithms
Throughput
performance
hardware
Scalability
Hardware
simulation

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Communication

Cite this

Rizvi, S. S., Sheikh, A., & Riasat, A. (2010). Faulty links optimization for hypercube networks via stored and forward one-bit round robin routing algorithm. In Novel Algorithms and Techniques in Telecommunications and Networking (pp. 281-286) https://doi.org/10.1007/978-90-481-3662-9-48
Rizvi, Syed S. ; Sheikh, Adil ; Riasat, Aasia. / Faulty links optimization for hypercube networks via stored and forward one-bit round robin routing algorithm. Novel Algorithms and Techniques in Telecommunications and Networking. 2010. pp. 281-286
@inproceedings{42c3276ece12439d9ed78ca2c6e94c58,
title = "Faulty links optimization for hypercube networks via stored and forward one-bit round robin routing algorithm",
abstract = "Extensive research and studies have shown that the hypercube network is one of the most widely used techniques to build high performance parallel computers and it offers strong hierarchical structure with high symmetry properties. However, the performance of hypercube networks is mainly dependent on the link consistency between the nodes. Due to unexpected links failure and low connectivity, neither the hardware schemes nor point to point and multistage routing algorithms can be used without adding extra links. This paper presents a new stored and forward one-bit round robin routing algorithm that can efficiently send and receive messages between the nodes even in the presence of faulty links. In addition, we also examine and simulate the data throughput and hot spot properties of a hypercube network. Simulation results demonstrate that the proposed routing algorithm improves the overall performance of hypercube network by means of load-scalability that not only reduces the average waiting time per output queue but also increases the total data throughput even in the presence of faulty nodes.",
author = "Rizvi, {Syed S.} and Adil Sheikh and Aasia Riasat",
year = "2010",
month = "12",
day = "1",
doi = "10.1007/978-90-481-3662-9-48",
language = "English (US)",
isbn = "9789048136612",
pages = "281--286",
booktitle = "Novel Algorithms and Techniques in Telecommunications and Networking",

}

Rizvi, SS, Sheikh, A & Riasat, A 2010, Faulty links optimization for hypercube networks via stored and forward one-bit round robin routing algorithm. in Novel Algorithms and Techniques in Telecommunications and Networking. pp. 281-286, 2008 International Conference on Telecommunications and Networking, TeNe 2008, Part of the International Joint Conferences on Computer, Information, and Systems Sciences, and Engineering, CISSE 2008, 12/5/08. https://doi.org/10.1007/978-90-481-3662-9-48

Faulty links optimization for hypercube networks via stored and forward one-bit round robin routing algorithm. / Rizvi, Syed S.; Sheikh, Adil; Riasat, Aasia.

Novel Algorithms and Techniques in Telecommunications and Networking. 2010. p. 281-286.

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

TY - GEN

T1 - Faulty links optimization for hypercube networks via stored and forward one-bit round robin routing algorithm

AU - Rizvi, Syed S.

AU - Sheikh, Adil

AU - Riasat, Aasia

PY - 2010/12/1

Y1 - 2010/12/1

N2 - Extensive research and studies have shown that the hypercube network is one of the most widely used techniques to build high performance parallel computers and it offers strong hierarchical structure with high symmetry properties. However, the performance of hypercube networks is mainly dependent on the link consistency between the nodes. Due to unexpected links failure and low connectivity, neither the hardware schemes nor point to point and multistage routing algorithms can be used without adding extra links. This paper presents a new stored and forward one-bit round robin routing algorithm that can efficiently send and receive messages between the nodes even in the presence of faulty links. In addition, we also examine and simulate the data throughput and hot spot properties of a hypercube network. Simulation results demonstrate that the proposed routing algorithm improves the overall performance of hypercube network by means of load-scalability that not only reduces the average waiting time per output queue but also increases the total data throughput even in the presence of faulty nodes.

AB - Extensive research and studies have shown that the hypercube network is one of the most widely used techniques to build high performance parallel computers and it offers strong hierarchical structure with high symmetry properties. However, the performance of hypercube networks is mainly dependent on the link consistency between the nodes. Due to unexpected links failure and low connectivity, neither the hardware schemes nor point to point and multistage routing algorithms can be used without adding extra links. This paper presents a new stored and forward one-bit round robin routing algorithm that can efficiently send and receive messages between the nodes even in the presence of faulty links. In addition, we also examine and simulate the data throughput and hot spot properties of a hypercube network. Simulation results demonstrate that the proposed routing algorithm improves the overall performance of hypercube network by means of load-scalability that not only reduces the average waiting time per output queue but also increases the total data throughput even in the presence of faulty nodes.

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

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

U2 - 10.1007/978-90-481-3662-9-48

DO - 10.1007/978-90-481-3662-9-48

M3 - Conference contribution

AN - SCOPUS:84878956685

SN - 9789048136612

SP - 281

EP - 286

BT - Novel Algorithms and Techniques in Telecommunications and Networking

ER -

Rizvi SS, Sheikh A, Riasat A. Faulty links optimization for hypercube networks via stored and forward one-bit round robin routing algorithm. In Novel Algorithms and Techniques in Telecommunications and Networking. 2010. p. 281-286 https://doi.org/10.1007/978-90-481-3662-9-48