ICN Multipath Data Scheduling Method Based on Hash Boundary
Using multipath communication in Information Centric Networking(ICN)can improve network bandwidth utilization and data transmission reliability.A key factor in ensuring the performance of ICN multipath transmission is the effective scheduling of traffic on available network paths.However,different paths have different link states and the link states of these paths can change rapidly due to traffic fluctuations.Therefore,this article proposes a hash boundary-based ICN multipath data scheduling scheme to achieve efficient path weight distribution updating and accurate traffic splitting on a small time scale.The scheme achieves uneven traffic splitting and reduces the cost of updating path weight distribution by associating a hash boundary with each path.Experimental results show that the the average data chunk transmission completion time of the proposed scheme is reduced by more than 12%compared with other mul-tipath data scheduling schemes such as ECMP in the scenario of dynamic change of path link states.