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...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE internet of things journal Jg. 7; H. 2; S. 1451 - 1463
Hauptverfasser:	Zhang, Yu, An, Xuming, Yuan, Mengze, Bu, Xiangyuan, An, Jianping
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Piscataway IEEE 01.02.2020 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!