Concurrent Multipath Routing Optimization in Named Data Networks

To achieve maximum throughput in named data networking (NDN) with consideration of fairness among each source-sink pair, we model the routing problem in NDN as a mixed-integer maximum concurrent flow problem. Taking advantage of the smart forwarding framework in NDN, we obtain an approximate optimal...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE internet of things journal Ročník 7; číslo 2; s. 1451 - 1463
Hlavní autori: Zhang, Yu, An, Xuming, Yuan, Mengze, Bu, Xiangyuan, An, Jianping
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Piscataway IEEE 01.02.2020
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:
Algorithms
Approximation algorithms
Caching
Complexity
Complexity theory
Computer simulation
Flooding
Heuristic algorithms
Heuristic methods
Internet of Things
Maximum concurrent flow problem (MCFP)
named data networking (NDN)
Optimization
randomized rounding
Rounding
Route planning
Routing
Shortest-path problems
Simulation
Throughput
ISSN:2327-4662, 2327-4662
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:To achieve maximum throughput in named data networking (NDN) with consideration of fairness among each source-sink pair, we model the routing problem in NDN as a mixed-integer maximum concurrent flow problem. Taking advantage of the smart forwarding framework in NDN, we obtain an approximate optimal routing and forwarding solution with our improved Fleischer and random rounding (FRR) algorithm. We analyze the complexity of the Fleischer algorithm more comprehensively and give the best scaling method to achieve the least iterations. In addition, we further reduce the complexity of the Fleischer algorithm so that it iterates only once, thus getting a heuristic algorithm which is called multicommodity multipath (MCMP). Using ndnSIM-based simulation, we compare our proposed routing algorithms with the existing routing algorithms, including flooding, k-shortest path, and best single path routing, and the simulation results prove that FRR and MCMP can outperform other algorithms both in throughput and latency, and it can also be concluded that the best number of paths for k-shortest path routing should be close to and less than the average node degree of the network. For studying routing optimization with caching, we conduct simulations with different in-network cache capacity and different caching policies. The simulation results show that although the LRU can achieve the best performance under the same cache capacity, the cache capacity plays a decisive role. All routing algorithms produce better performance with caching, but the FRR still achieves the best performance, and follows by MCMP.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2327-4662
2327-4662
DOI:10.1109/JIOT.2019.2955139