Design of multi-path data routing algorithm based on network reliability

Authors:
Mou Dasgupta;G. P. Biswas
Affiliations:
Department of Computer Science & Engineering, Indian School of Mines, Dhanbad 826 004, India;Department of Computer Science & Engineering, Indian School of Mines, Dhanbad 826 004, India
Venue:
Computers and Electrical Engineering
Year:
2012

Citing 6
Cited 3

Data networks

Data networks
Application-Aware Routing Protocol

ISCC '97 Proceedings of the 2nd IEEE Symposium on Computers and Communications (ISCC '97)
Multi-path TCP: a joint congestion control and routing scheme to exploit path diversity in the internet

IEEE/ACM Transactions on Networking (TON)
Always acyclic distributed path computation

IEEE/ACM Transactions on Networking (TON)
Transit portal: BGP connectivity as a service

Proceedings of the ACM SIGCOMM 2010 conference
Wide-area route control for distributed services

USENIXATC'10 Proceedings of the 2010 USENIX conference on USENIX annual technical conference

Performance analysis of ARQ cooperative diversity system with multiple two-hop relays over Rayleigh fading channels

Computers and Electrical Engineering
Delivery reliability of computer networks for data transmission within the permitted packet error rate and latency

Computers and Electrical Engineering
Fault-tolerant routing mechanism based on network coding in wireless mesh networks

Journal of Network and Computer Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Data routing through an interconnected network is important and this paper addresses the design of a multi-path data routing algorithm based on network reliability. Generally, multiple routes for a given source-terminal pair exist in a data network and the best possible route based on network metrics like hop-count, delay, traffic, queue, etc. is selected by a routing algorithm. Since network reliability incorporates all these metrics, the routing decision based on reliability seems to be the best possible option and a distributed routing algorithm based on the source-terminal (s-t) path reliability has been proposed in this work. Each node in the proposed routing generates an adjacency matrix of a network graph by periodically exchanging connection information with the adjacent nodes and selects multiple routes based on reliability of the paths. We propose an implementation of a two-path routing algorithm that instead of one includes two next-hop nodes in each node's routing table. An example is given for further illustration of the proposed algorithm.