Multi-service multi-path routing optimization method in named data network

Abstract

The invention discloses a multi-service multi-path routing optimization method in a named data network, which divides the services in the NDN network into delay-sensitive services and bandwidth-sensitive services; edge nodes mark the corresponding differentiated service code point values ​​to the services of interest packets In the type field; route selection and forwarding of the interest packet; after the content publisher receives the interest packet, it generates a corresponding data packet, and updates the core node’s Pheromone concentration. The invention can classify multi-services in the network, and use ant colony optimization to optimize and select routes for different types of services according to their measurement requirements, so as to well support NDN network QoS and realize differentiated services.

Description

technical field [0001] The invention relates to the technical field of computer network data routing optimization, in particular to a routing optimization method supporting multiple services and multiple paths in a named data network (NDN). Background technique [0002] NDN (Named Data Networking) is a network system with named data as the main communication object, and it is a special case of information-centric network. In NDN, by naming the data and communicating according to the name information of the data packet, the current network communication method based on the IP address is changed, and it is particularly outstanding in terms of robustness and scalability compared to the TCP / IP network. The communication in NDN is driven by the content requester, that is, the content requester first needs to send a data request, and the content publisher then sends the corresponding data to the content requester according to the data request. NDN contains two formats of packets,...

AI Technical Summary

Problems solved by technology

The shortest path routing method can find an optimal path with the lowest delay for delay-sensitive services, but this may not be the best path for bandwidth-sensitive services; similarly, the widest bandwidth routing method can provide bandwidth-sensitive services Find an optimal path with the largest average available bandwidth, but the delay of this path may be large for delay-sensitive services

Therefore, for an NDN network that will carry multiple services, the above algorithm cannot select different paths for forwarding according to the different QoS (Quality of Service) requirements of multiple services, which greatly limits the applicability of these routing methods

Images