An optimal inherently stabilizing 2-neighborhood crash resilient protocol for secure and reliable routing in hypercube networks

Mehmet Hakan Karaata, Ozgur Sinanoglu, Bader AlBdaiwi

Research output: Contribution to journalArticle

Abstract

Many fundamental problems in the area of distributed systems such as security, reliable routing, network survivability and broadening available bandwidth can be addressed through the use of disjoint paths between communication endpoints. Therefore, distributed solutions to the disjoint paths problem are of crucial importance to these fundamental problems. Disjoint paths naturally exist in traditional networks; however, these networks provide no guarantees regarding the presence and the number of available disjoint paths. On the other hand, network topologies structured based on Caley graphs such as hypercube, star networks and their variations possess many desirable properties related to disjoint paths. Therefore, it is anticipated that backbones of future networks will be structured following some Caley graph topologies. In this paper, we present a simple novel stabilizing and inherently stabilizing algorithm to route messages over all node-disjoint paths of optimal length from one non-faulty process to another in at most n+1 rounds in an n-dimensional hypercube network in the presence of crash failures. The proposed algorithm can tolerate up to 2 n-⌈log (n+1)⌉ process/link failures in the network and a maximum of ⌊(L-2)/3⌋ process/link failures on each disjoint path, where L is the number of processes on a disjoint path and the distance between any two failed processes/links is at least three. The proposed algorithm tolerates a large number of process and link failures, while delivering all n messages over optimal-length disjoint paths in the presence of maximum permissible process/link failures on each path. This is achieved by a simple uniform distributed algorithm using only local knowledge of failure locations.

Original languageEnglish (US)
Pages (from-to)578-589
Number of pages12
JournalComputer Journal
Volume55
Issue number5
DOIs
StatePublished - May 1 2012

Fingerprint

Hypercube networks
Topology
Network routing
Parallel algorithms
Stars
Bandwidth
Communication

Keywords

  • crash failures
  • fault-tolerance
  • Hamming distance
  • hypercube networks
  • inherent stabilization
  • node-disjoint paths
  • stabilization
  • transient faults

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

An optimal inherently stabilizing 2-neighborhood crash resilient protocol for secure and reliable routing in hypercube networks. / Karaata, Mehmet Hakan; Sinanoglu, Ozgur; AlBdaiwi, Bader.

In: Computer Journal, Vol. 55, No. 5, 01.05.2012, p. 578-589.

Research output: Contribution to journalArticle

@article{4b7c0c17916947bd853828c712ee9fc1,
title = "An optimal inherently stabilizing 2-neighborhood crash resilient protocol for secure and reliable routing in hypercube networks",
abstract = "Many fundamental problems in the area of distributed systems such as security, reliable routing, network survivability and broadening available bandwidth can be addressed through the use of disjoint paths between communication endpoints. Therefore, distributed solutions to the disjoint paths problem are of crucial importance to these fundamental problems. Disjoint paths naturally exist in traditional networks; however, these networks provide no guarantees regarding the presence and the number of available disjoint paths. On the other hand, network topologies structured based on Caley graphs such as hypercube, star networks and their variations possess many desirable properties related to disjoint paths. Therefore, it is anticipated that backbones of future networks will be structured following some Caley graph topologies. In this paper, we present a simple novel stabilizing and inherently stabilizing algorithm to route messages over all node-disjoint paths of optimal length from one non-faulty process to another in at most n+1 rounds in an n-dimensional hypercube network in the presence of crash failures. The proposed algorithm can tolerate up to 2 n-⌈log (n+1)⌉ process/link failures in the network and a maximum of ⌊(L-2)/3⌋ process/link failures on each disjoint path, where L is the number of processes on a disjoint path and the distance between any two failed processes/links is at least three. The proposed algorithm tolerates a large number of process and link failures, while delivering all n messages over optimal-length disjoint paths in the presence of maximum permissible process/link failures on each path. This is achieved by a simple uniform distributed algorithm using only local knowledge of failure locations.",
keywords = "crash failures, fault-tolerance, Hamming distance, hypercube networks, inherent stabilization, node-disjoint paths, stabilization, transient faults",
author = "Karaata, {Mehmet Hakan} and Ozgur Sinanoglu and Bader AlBdaiwi",
year = "2012",
month = "5",
day = "1",
doi = "10.1093/comjnl/bxr095",
language = "English (US)",
volume = "55",
pages = "578--589",
journal = "Computer Journal",
issn = "0010-4620",
publisher = "Oxford University Press",
number = "5",

}

TY - JOUR

T1 - An optimal inherently stabilizing 2-neighborhood crash resilient protocol for secure and reliable routing in hypercube networks

AU - Karaata, Mehmet Hakan

AU - Sinanoglu, Ozgur

AU - AlBdaiwi, Bader

PY - 2012/5/1

Y1 - 2012/5/1

N2 - Many fundamental problems in the area of distributed systems such as security, reliable routing, network survivability and broadening available bandwidth can be addressed through the use of disjoint paths between communication endpoints. Therefore, distributed solutions to the disjoint paths problem are of crucial importance to these fundamental problems. Disjoint paths naturally exist in traditional networks; however, these networks provide no guarantees regarding the presence and the number of available disjoint paths. On the other hand, network topologies structured based on Caley graphs such as hypercube, star networks and their variations possess many desirable properties related to disjoint paths. Therefore, it is anticipated that backbones of future networks will be structured following some Caley graph topologies. In this paper, we present a simple novel stabilizing and inherently stabilizing algorithm to route messages over all node-disjoint paths of optimal length from one non-faulty process to another in at most n+1 rounds in an n-dimensional hypercube network in the presence of crash failures. The proposed algorithm can tolerate up to 2 n-⌈log (n+1)⌉ process/link failures in the network and a maximum of ⌊(L-2)/3⌋ process/link failures on each disjoint path, where L is the number of processes on a disjoint path and the distance between any two failed processes/links is at least three. The proposed algorithm tolerates a large number of process and link failures, while delivering all n messages over optimal-length disjoint paths in the presence of maximum permissible process/link failures on each path. This is achieved by a simple uniform distributed algorithm using only local knowledge of failure locations.

AB - Many fundamental problems in the area of distributed systems such as security, reliable routing, network survivability and broadening available bandwidth can be addressed through the use of disjoint paths between communication endpoints. Therefore, distributed solutions to the disjoint paths problem are of crucial importance to these fundamental problems. Disjoint paths naturally exist in traditional networks; however, these networks provide no guarantees regarding the presence and the number of available disjoint paths. On the other hand, network topologies structured based on Caley graphs such as hypercube, star networks and their variations possess many desirable properties related to disjoint paths. Therefore, it is anticipated that backbones of future networks will be structured following some Caley graph topologies. In this paper, we present a simple novel stabilizing and inherently stabilizing algorithm to route messages over all node-disjoint paths of optimal length from one non-faulty process to another in at most n+1 rounds in an n-dimensional hypercube network in the presence of crash failures. The proposed algorithm can tolerate up to 2 n-⌈log (n+1)⌉ process/link failures in the network and a maximum of ⌊(L-2)/3⌋ process/link failures on each disjoint path, where L is the number of processes on a disjoint path and the distance between any two failed processes/links is at least three. The proposed algorithm tolerates a large number of process and link failures, while delivering all n messages over optimal-length disjoint paths in the presence of maximum permissible process/link failures on each path. This is achieved by a simple uniform distributed algorithm using only local knowledge of failure locations.

KW - crash failures

KW - fault-tolerance

KW - Hamming distance

KW - hypercube networks

KW - inherent stabilization

KW - node-disjoint paths

KW - stabilization

KW - transient faults

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

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

U2 - 10.1093/comjnl/bxr095

DO - 10.1093/comjnl/bxr095

M3 - Article

AN - SCOPUS:84860666496

VL - 55

SP - 578

EP - 589

JO - Computer Journal

JF - Computer Journal

SN - 0010-4620

IS - 5

ER -