Name
Abstract | ||
|---|---|---|
In this paper, we design an LAP based routing algorithm in General Networks (GN) to solve the problem of information consistency of the full network under OSPF with the following operations: (i) decomposing GN into one or more Single-link Networks (SNs) with the approach of depth-first walk, (ii) re-composting the SNs to a network with regular topology structure by adding links, (iii) searching the undirected complete graph of three nodes round by round until it converges to a simple network topology based on region binding, and (iv) processing different converged network topologies with different LAP based routing algorithms. The proposed algorithm is compared with Dijkstra algorithm over some random network topologies. Simulation results show that the proposed algorithm can solve the problem of information consistency of the full network under OSPF and has better performance than Dijkstra algorithm. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1109/ICPADS.2016.0045 | 2016 IEEE 22nd International Conference on Parallel and Distributed Systems (ICPADS) |
Keywords | Field | DocType |
general networks,information consistency,limitation arrangement principle,region binding,OSPF | Open Shortest Path First,Complete graph,Random graph,Computer science,Network topology,Theoretical computer science,Network Convergence,Distributed computing,Routing algorithm,Dijkstra's algorithm | Conference |
ISSN | ISBN | Citations |
1521-9097 | 978-1-5090-5382-7 | 0 |
PageRank | References | Authors |
0.34 | 10 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jianhui Lv | 1 | 45 | 7.63 |
| Xingwei Wang | 2 | 1025 | 154.16 |
| Min Huang | 3 | 423 | 71.49 |
| Fuliang Li | 4 | 18 | 7.12 |
| Keqin Li | 5 | 2778 | 242.13 |
| Hui Cheng | 6 | 105 | 6.37 |