Combinatorics

Graph

Topology (electrical circuits)

Computer network

Mathematics

Hypercube

Structural engineering

Hamiltonian path

Hamiltonian path problem

Distributed computing

Mathematical optimization

Connection (principal bundle)

Engineering

Hamiltonian (control theory)

Parallel computing

Network topology

Geometry

Computer science

Theoretical computer science

Node (physics)

Computers, materials & continua/Computers, materials & continua (Print)

Many routing protocols, such as distance vector and link-state protocols are used for finding the best paths in a network. To find the path between the source and destination nodes where every node is visited once with no repeats, Hamiltonian and Hypercube routing protocols are often used. Nonetheless, these algorithms are not designed to solve the problem of a node failure, where one or more nodes become faulty. This paper proposes an efficient modified Fault-free Hamiltonian Cycle based on the Hypercube Topology (FHCHT) to perform a connection between nodes when one or more nodes become faulty. FHCHT can be applied in a different environment to transmit data with a high-reliability connection by finding an alternative path between the source and destination nodes when some nodes fail. Moreover, a proposed Hamiltonian Near Cycle (HNC) scheme has been developed and implemented. HNC implementation results indicated that FHCHT produces alternative cycles relatively similar to a Hamiltonian Cycle for the Hypercube, complete, and random graphs. The implementation of the proposed algorithm in a Hypercube achieved a 31% and 76% reduction in cost compared to the complete and random graphs, respectively.

A Fault-Handling Method for the Hamiltonian Cycle in the Hypercube Topology