Scalable and Cost Efficient Maximum Concurrent Flow over IoT using Reinforcement Learning

The Internet of Things (IoT) is a network of billion of objects. Data streaming over IoT network is a tedious task that requires intelligent flow management and steering. In this paper, we propose a Distributed Maximum Concurrent Flow (DMCF) algorithm to solve the problem of distributing massive IoT video/data to large consumers over IP/data-centric networks. We propose two approaches based on graph theories, and using reinforcement learning techniques. The proposed approaches are implemented and evaluated over different complex graphs. Results show that in large graphs, reinforcement learning methods outperform classical graph theoretic ones.

[1]  Ying-Chang Liang,et al.  Applications of Deep Reinforcement Learning in Communications and Networking: A Survey , 2018, IEEE Communications Surveys & Tutorials.

[2]  Jian Wang,et al.  Cartesian core routing and cartesian border gateway design , 2006, 4th Annual Communication Networks and Services Research Conference (CNSR'06).

[3]  George Karakostas,et al.  Faster approximation schemes for fractional multicommodity flow problems , 2008, TALG.

[4]  Tomasz Radzik.  Fast deterministic approximation for the multicommodity flow problem , 1995, SODA '95.

[5]  Andrew V. Goldberg.  A Natural Randomization Strategy for Multicommodity Flow and Related Algorithms , 1992, Inf. Process. Lett..

[6]  Hossam Afifi,et al.  Drone-Assisted Cellular Networks: A Multi-Agent Reinforcement Learning Approach , 2019, ICC 2019 - 2019 IEEE International Conference on Communications (ICC).

[7]  Mohsen Guizani,et al.  Internet of Things Mobility Over Information-Centric/Named-Data Networking , 2020, IEEE Internet Computing.

[8]  Weifa Liang,et al.  Routing Cost Minimization and Throughput Maximization of NFV-Enabled Unicasting in Software-Defined Networks , 2018, IEEE Transactions on Network and Service Management.

[9]  Quan Z. Sheng,et al.  Dissemination of Internet of Things Streams in a Real-time Linked Dataspace , 2020, Real-time Linked Dataspaces.

[10]  Jochen Könemann,et al.  Faster and simpler algorithms for multicommodity flow and other fractional packing problems , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[11]  Yu Zhang,et al.  Routing Optimization of Small Satellite Networks based on Multi-commodity Flow , 2017, EAI Endorsed Trans. Ambient Syst..

[12]  Samer Salam,et al.  IoT Protocol Stack: A Layered View , 2017 .

[13]  Mohamed F. Younis,et al.  Inter-WBANs interference mitigation using orthogonal walsh hadamard codes , 2016, 2016 IEEE 27th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC).

[14]  Senlin Luo,et al.  Reputation-Based Blockchain for Secure NDN Caching in Vehicular Networks , 2018, 2018 IEEE Conference on Standards for Communications and Networking (CSCN).

[15]  Fillia Makedon,et al.  Fast Approximation Algorithms for Multicommodity Flow Problems , 1995, J. Comput. Syst. Sci..

[16]  Lisa Fleischer,et al.  Approximating Fractional Multicommodity Flow Independent of the Number of Commodities , 2000, SIAM J. Discret. Math..

[17]  K. R. Venugopal,et al.  Network optimizations in the Internet of Things: A review , 2019, Engineering Science and Technology, an International Journal.

[18]  Gary L. Miller,et al.  Flow in Planar Graphs with Multiple Sources and Sinks , 1995, SIAM J. Comput..

[19]  Mesud Hadzialic,et al.  Internet of Things (IoT): A review of enabling technologies, challenges, and open research issues , 2018, Comput. Networks.

[20]  Ahmed E. Kamal,et al.  Scalable and Cost Efficient Algorithms for Virtual CDN Migration , 2016, 2016 IEEE 41st Conference on Local Computer Networks (LCN).

[21]  Walid Ben-Ameur,et al.  Efficient algorithms for the maximum concurrent flow problem , 2015, Networks.

[22]  Neal E. Young,et al.  Randomized rounding without solving the linear program , 1995, SODA '95.

[23]  Abdul Rehman,et al.  Quickest Path Selection Towards the Destination in Urban Environment , 2019, 2019 Eleventh International Conference on Ubiquitous and Future Networks (ICUFN).

[24]  Antonio F. Gómez-Skarmeta,et al.  Evaluation and recommendations on IPv6 for the Internet of Things , 2015, 2015 IEEE 2nd World Forum on Internet of Things (WF-IoT).

[25]  Farhad Shahrokhi,et al.  The maximum concurrent flow problem , 1990, JACM.

[26]  Aleksander Madry,et al.  Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms , 2010, STOC '10.

[27]  Samer Salam,et al.  Internet of Things From Hype to Reality , 2017 .

[28]  Philip N. Klein,et al.  Faster Approximation Algorithms for the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts , 1994, SIAM J. Comput..