A multi-mode identification network addressing method and system based on coordinate mapping

Abstract

The invention is applicable to the field of network technology improvement, and provides a multi-mode identification network addressing method based on coordinate mapping, including: S1. By assigning three-dimensional spherical coordinates to each node in the network, The modular identification network is mapped into a three-dimensional hyperbolic space; S2, the sender of the message attaches the node coordinates of its destination to each segment of the message; S3, the routing node calculates the destination and each segment when forwarding the message. The hyperbolic distance between adjacent nodes, and the smallest one is selected as the forwarding object. The algorithm relies on less global information, and the calculation is simple, which is easy to complete locally, thereby improving the adaptability to large-scale networks.

Description

technical field [0001] The invention belongs to the field of network technology improvement, and in particular relates to a multi-mode identification network addressing method and system based on coordinate mapping. Background technique [0002] The multi-mode identification network is a new type of open network architecture proposed in response to the inherent defects of the existing Internet control capabilities such as excessive concentration and lack of international multilateral co-management and co-governance. network environment. For example, if a content network is deployed in a traditional network, if data can shuttle between the two networks, a multi-mode network environment consisting of two network systems and co-addressed by content identifiers and address identifiers will be formed. By utilizing the advantages of different networks to work together, the multi-mode identification network can improve the basic transmission capacity of the current Internet, enhan...

AI Technical Summary

Problems solved by technology

[0007] However, hyperbolic routing also has its drawbacks: compared with traditional routing protocols based on the shortest path algorithm, the forwarding path greedily selected by hyperbolic routing has a larger transmission delay, which is not only due to the inherent disadvantages of the greedy strategy, but also It is also due to the fact that most of the existing hyperbolic mapping algorithms do not consider network delays

[0013] Although this method has a significant reduction in delay, for short-term transmissions, the number of delay samples obtained by probing is not enough to optimize the forwarding path

At the same time, the method cannot optimize worst-case scenarios (i.e., paths whose delays are much greater than the theoretical optimum)

Images