Method for implementing self-organizing network

Abstract

The invention discloses a method for self-organizing network, comprising the steps of: according to the networks' physical topological structures dividing them into different layers self-organizing network groups; confirming the corresponding stage number of assemblages of the said different layers self-organizing networks, each assemblage corresponds to a logical namespace Hash loop; adjusting the structures of the Hash loop dynamically when network nodes join in or quit out of the self-organizing network to realize re-organizing of networks. The Hash loops are built on the internet's physical topological structures for storing data and route inquiring, utilizing the network proximity and localized characters of nodes, networks' routing characters become better and the efficiency of inquiring become higher; by using hash routing algorithm based on DHT, all the merits of the routing protocol of the structural P2P overlay networks,

Description

technical field [0001] The invention relates to the technical field of the Internet, in particular to a realization method of an ad hoc network applied in the Internet. Background technique [0002] The Internet is a computer interaction network, also known as the Internet. It is a huge global computer network system that connects tens of thousands of computer networks and tens of millions of hosts around the world, contains countless information resources, and provides information services to the whole world. Self-organizing network technology is a hot technology in the field of NGN (Next Generation Network) technology research. In the self-organizing network, the activities of each node do not require human intervention. They can quickly and automatically form a network, and can quickly recover and rebuild the network when the network topology changes. Figure 1 is a schematic diagram of the timeline of the network self-organization process. Network self-organization The ...

AI Technical Summary

Problems solved by technology

However, because these P2P calculation models do not consider the actual topology of the Internet network, even two adjacent nodes in the actual topology may have to go through a long search path to obtain data due to the result of hashing. For example, the network statistical survey results show that the system uses the Hash algorithm to map the node IP address to the node Id number (Identifier), resulting in two nodes that are very close in the Hash ring but may be far apart in the actual network topology ; In the actual network, the nodes that are far apart may become two very close points in the Hash ring after Hash algorithm mapping

The above problems greatly reduce the query efficiency and performance of the P2P computing mode in actual network applications. For example, two points with very close physical distances may need to go around a large circle in the Internet to reach each other.

Images