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

Full description

Saved in:

Bibliographic Details
Published in:	IEEE internet of things journal Vol. 7; no. 2; pp. 1451 - 1463
Main Authors:	Zhang, Yu, An, Xuming, Yuan, Mengze, Bu, Xiangyuan, An, Jianping
Format:	Journal Article
Language:	English
Published:	Piscataway IEEE 01.02.2020 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!