A fault-tolerant communication scheme for regular cluster networks

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

Abstract

Large cluster systems with thousands of nodes have become a cost-effective alternative to traditional supercomputers. In these systems cluster nodes are interconnected using high-degree switches. Regular direct network topologies including tori (k-ary n-cubes) and meshes are among adapted choices for interconnecting these high-degree switches. We propose a general faulttolerant routing scheme applicable for regular direct interconnection networks satisfying some interconnection conditions. The scheme is based on the availability of efficiently identifiable disjoint routes between network nodes. The proposed scheme is first presented in general terms for any interconnection topology satisfying the presented connectivity conditions. The scheme is then illustrated on two examples of interconnection topologies namely the binary hypercube and the k-ary n-cube.

Original languageEnglish
Title of host publicationProceedings of the Sixth IASTED International Conference on Communications, Internet, and Information Technology, CIIT 2007
Pages147-152
Number of pages6
Publication statusPublished - 2007
Event6th IASTED International Conference on Communications, Internet, and Information Technology, CIIT 2007 - Banff, AB, Canada
Duration: Jul 2 2007Jul 4 2007

Other

Other6th IASTED International Conference on Communications, Internet, and Information Technology, CIIT 2007
CountryCanada
CityBanff, AB
Period7/2/077/4/07

Fingerprint

Topology
Communication
Switches
Supercomputers
Availability
Costs

Keywords

  • Cluster systems
  • Fault-tolerant routing
  • Interconnection networks
  • Network management

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Software

Cite this

Day, K., Arafeh, B., & Touzene, A. (2007). A fault-tolerant communication scheme for regular cluster networks. In Proceedings of the Sixth IASTED International Conference on Communications, Internet, and Information Technology, CIIT 2007 (pp. 147-152)

A fault-tolerant communication scheme for regular cluster networks. / Day, Khaled; Arafeh, Bassel; Touzene, Abderezak.

Proceedings of the Sixth IASTED International Conference on Communications, Internet, and Information Technology, CIIT 2007. 2007. p. 147-152.

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

Day, K, Arafeh, B & Touzene, A 2007, A fault-tolerant communication scheme for regular cluster networks. in Proceedings of the Sixth IASTED International Conference on Communications, Internet, and Information Technology, CIIT 2007. pp. 147-152, 6th IASTED International Conference on Communications, Internet, and Information Technology, CIIT 2007, Banff, AB, Canada, 7/2/07.
Day K, Arafeh B, Touzene A. A fault-tolerant communication scheme for regular cluster networks. In Proceedings of the Sixth IASTED International Conference on Communications, Internet, and Information Technology, CIIT 2007. 2007. p. 147-152
Day, Khaled ; Arafeh, Bassel ; Touzene, Abderezak. / A fault-tolerant communication scheme for regular cluster networks. Proceedings of the Sixth IASTED International Conference on Communications, Internet, and Information Technology, CIIT 2007. 2007. pp. 147-152
@inproceedings{a365c5ff70c643b6a72fc9cfac5fe85f,
title = "A fault-tolerant communication scheme for regular cluster networks",
abstract = "Large cluster systems with thousands of nodes have become a cost-effective alternative to traditional supercomputers. In these systems cluster nodes are interconnected using high-degree switches. Regular direct network topologies including tori (k-ary n-cubes) and meshes are among adapted choices for interconnecting these high-degree switches. We propose a general faulttolerant routing scheme applicable for regular direct interconnection networks satisfying some interconnection conditions. The scheme is based on the availability of efficiently identifiable disjoint routes between network nodes. The proposed scheme is first presented in general terms for any interconnection topology satisfying the presented connectivity conditions. The scheme is then illustrated on two examples of interconnection topologies namely the binary hypercube and the k-ary n-cube.",
keywords = "Cluster systems, Fault-tolerant routing, Interconnection networks, Network management",
author = "Khaled Day and Bassel Arafeh and Abderezak Touzene",
year = "2007",
language = "English",
isbn = "9780889866744",
pages = "147--152",
booktitle = "Proceedings of the Sixth IASTED International Conference on Communications, Internet, and Information Technology, CIIT 2007",

}

TY - GEN

T1 - A fault-tolerant communication scheme for regular cluster networks

AU - Day, Khaled

AU - Arafeh, Bassel

AU - Touzene, Abderezak

PY - 2007

Y1 - 2007

N2 - Large cluster systems with thousands of nodes have become a cost-effective alternative to traditional supercomputers. In these systems cluster nodes are interconnected using high-degree switches. Regular direct network topologies including tori (k-ary n-cubes) and meshes are among adapted choices for interconnecting these high-degree switches. We propose a general faulttolerant routing scheme applicable for regular direct interconnection networks satisfying some interconnection conditions. The scheme is based on the availability of efficiently identifiable disjoint routes between network nodes. The proposed scheme is first presented in general terms for any interconnection topology satisfying the presented connectivity conditions. The scheme is then illustrated on two examples of interconnection topologies namely the binary hypercube and the k-ary n-cube.

AB - Large cluster systems with thousands of nodes have become a cost-effective alternative to traditional supercomputers. In these systems cluster nodes are interconnected using high-degree switches. Regular direct network topologies including tori (k-ary n-cubes) and meshes are among adapted choices for interconnecting these high-degree switches. We propose a general faulttolerant routing scheme applicable for regular direct interconnection networks satisfying some interconnection conditions. The scheme is based on the availability of efficiently identifiable disjoint routes between network nodes. The proposed scheme is first presented in general terms for any interconnection topology satisfying the presented connectivity conditions. The scheme is then illustrated on two examples of interconnection topologies namely the binary hypercube and the k-ary n-cube.

KW - Cluster systems

KW - Fault-tolerant routing

KW - Interconnection networks

KW - Network management

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

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

M3 - Conference contribution

SN - 9780889866744

SP - 147

EP - 152

BT - Proceedings of the Sixth IASTED International Conference on Communications, Internet, and Information Technology, CIIT 2007

ER -