.png){kind=icon}
Return
Design of multi-path data routing algorithm based on network reliability
.png){kind=icon}
OA
AI
DOI：10.1016/j.compeleceng.2012.04.013.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. (C) 2012 Elsevier Ltd. All rights reserved.
Keywords:
STABILITY
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.9
Papers:
6.7K
Citations:
1.3W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSave no more
no more