ICN-Oriented Mobility Support Method for Dynamic Allocation of Mobile Data Flows

Abstract

Information-centric networking (ICN) is a promising solution that can meet the challenges of IP-based networks. ICN adopts the solution of separating name and address to solve the dual semantics problem of IP addresses, which has natural advantages in supporting mobility. These mobility support methods in ICN have realized route optimization to a certain extent. In fact, due to these methods not considering the real-time network environment, such as the bandwidth of the switching path and the characteristics of different mobile data flows, these approaches adopt the same routing optimization solution for all data flows generated by mobile users, resulting in a single switching path. The bandwidth of a single switching path may not meet the transmission requirements of mobile data flows, which will greatly affect the performance of mobile users. Therefore, how to efficiently allocate switching paths for multiple mobile data flows generated by mobile users is an urgent problem in ICN mobility support. In this paper, we first propose a mobility support method for dynamically allocating mobile data flows (DAFM) based on the ICN mobility support architecture and model the mobile data flow allocation problem as a late-binding node selection problem. We then propose a double-constraints heuristic algorithm (DCHA) based on the Moser algorithm. By simultaneously adjusting the bandwidth resource constraints of the switching path and the space resource constraints of the Mobility Flow Table (MFT), we achieve late-binding node selection to minimize average packet delay. Finally, experimental results show that our proposal can achieve mobility support. Under the guarantee of a low-latency Name Resolution System (NRS), our method outperforms other methods in terms of average packet delay, packet loss rate, and handover delay.

A Method for 5G–ICN Seamless Mobility Support Based on Router Buffered Data

“…Average packet delay: Referring to [41], the average packet delay is the average difference between the time the UE receives a packet at its new location after moving and the time the Content Server sends the packet.…”