# ICN-Oriented Mobility Support Method for Dynamic Allocation of Mobile Data Flows
## 1 Introduction
Network congestion will lead to increased packet delay and a large amount of packet loss, which will greatly affect the performance of low-latency mobile applications and make mobile user experiences worse. How to provide customized switching paths for multiple data flows is the focus of this paper. Therefore, how to design and support the dynamic allocation of mobile data flows is the key problem to solve when optimizing routes for ICN mobility support, which has important practical significance for improving performance for mobile users and balancing network loads. In this paper, to solve the aforementioned problems faced by the route optimization of ICN mobility support, we focus on designing a mobility support method for dynamically allocating mobile data flows to ensure user experiences are not affected by poor performance. The main contributions of this paper are as follows:  
1. We propose a mobility support method for dynamically allocating mobile data flows (DAFM) based on ICN mobility support architecture. The proposed approach realizes the dynamic allocation of switching paths for mobile data flows through directed propagation and processing of Mobile Path Notifications (MPNs) and Mobile Path Updates (MPUs). Unlike other anchorless approaches, our proposal avoids a bottleneck in the single switching path. Dynamic allocation of mobile flows will improve packet forwarding and load balancing and ultimately improve performance for mobile users. 2. We model the mobile data flow assignment problem as a dynamic selection problem of a set of routers, which play the role of a late-binding node for a given set of flows. The selection of late-binding nodes should be optimal to minimize packet delay and balance the load between routers. 3. We prove that the problem of assigning routers to different flows is NP-hard, and we propose a heuristic algorithm to resolve it. This algorithm improves the Moser [28]algorithm. By simultaneously adjusting the bandwidth resource constraints of the switching path and the space resource constraints of the Mobile Flow Table (MFT), it realizes late-binding node selection to minimize average packet delay. 4. We develop and implement the proposed mobility support method in Mininet [29] and compare it with the existing anchorless approaches of MAP-ME [20] and the OPT [21]. Experimental results show that our proposal outperforms other methods in terms of average packet delay, packet loss rate, and handover delay under the guarantee of a low-latency Name Resolution System (NRS). The structure of this paper is as follows. In Section 2, we discuss the related work on mobility support. In Section 3, we provide details of the proposed dynamic allocation of mobile data flows and build a model of late-binding node selection using minimized average packet delay as the optimization target. In Section 4, we propose the details of the late-binding node selection algorithm. In Section 5, we describe the experimental simulation and provide analysis of the results. Finally, in Section 6, we conclude this paper and discuss our plans for future work.