WO2012003623A1

WO2012003623A1 - Resource information processing method based on peer-to-peer network, peer-to-peer network and node

Info

Publication number: WO2012003623A1
Application number: PCT/CN2010/074992
Authority: WO
Inventors: 彭永林; 陶全军; 张永辉; 裘晓峰; 雷震宇; 张春红; 李漓春; 王岩; 弭伟
Original assignee: 中兴通讯股份有限公司
Priority date: 2010-07-05
Filing date: 2010-07-05
Publication date: 2012-01-12

Abstract

Provided is a resource information processing method based on a peer-to-peer (P2P) network. The method includes: a node of the P2P network has a domain identifier which is the same as that of the resource information saved by the node of the P2P network, wherein the domain identifier is determined according to the geographical location information of the node or resource information and the different domain identifiers correspond to different geographical location ranges. The method also includes: the node receives an operation request sent by the request side, wherein the operation request carries the geographical location information of the resource information to be operated; the node determines the domain identifier of the resource information according to the geographical location information in the operation request; if the node determines the domain identifier of the resource information to be operated is different from that of the node, it forwards the operation request to the node in the external domain, otherwise, it performs the intra-domain processing. The present invention also discloses a corresponding P2P network and node. The present invention can improve the system performance.

Description

Resource information processing method based on peer-to-peer network, peer-to-peer network and node

Technical field

The present invention relates to a peer-to-peer network, and in particular, to a resource information processing method based on a peer-to-peer network, a peer-to-peer network, and a node.

Background technique

Peer to Peer (P2P) network, as the overlay network of the existing Internet (Internet), shares computer resources and services through peer-to-peer exchange between systems to achieve distributed, reliable, scalable, and Robust web application model. It breaks the traditional client/server (C/S) model, and the status of each node in the network is equal. Each node acts as a server, serving other nodes, and also enjoying the services provided by other nodes.

With the rapid development of the Internet and broadband access networks, P2P technology has been widely applied and researched, especially the distributed architecture based on Distributed Hash Table (DHT) and Overlay Network. P2P networks (ie DHT networks) have received extensive attention in the industry.

The DHT network mainly uses distributed hash table technology to organize nodes in the network (that is, user hosts or servers that are added to the P2P network). DHT is a huge hash table that is maintained by a large number of nodes across a wide area. The hash table is divided into discontinuous blocks, each node is assigned to a hash block of its own and becomes the manager of this hash block. By encrypting the hash function, an object's name or keyword is mapped to a 128-bit or 160-bit hash value. The DHT class structure can adapt to the dynamic join/exit of nodes, and has good scalability, robustness, uniformity of node ID assignment and self-organization ability. DHT can provide accurate discovery because the overlapping network uses a deterministic topology. As long as the destination node exists in the network, DHT can always find it, and the accuracy of the discovery is guaranteed. The most classic cases are Tapestry, Pastry, Chord and CAN.

The following uses Chord as an example to illustrate the implementation of a typical DHT network. Figure 1 shows the network topology of Chord. The Chord project was born at the Massachusetts Institute of Technology in the United States. Its goal is to provide a distributed resource discovery service suitable for P2P environments, which uses the DHT technology to make discovery fingers The object only needs to maintain a routing table of O(logN) length. 0 ( ) is a token indicating space complexity, and N is the total number of nodes in the network. In this network, the node assigns a unique node identifier (Node ID) in a certain way, the resource object generates a unique resource identifier (Object ID) through the hash operation, and the resource will be stored in the node ID equal to it. Or on a similar node. When you need to find the resource, you can use the same method to locate the node that stores the resource. Therefore, Chord's main contribution is to propose a distributed lookup protocol that maps the specified key (Key) to the corresponding node (Node). The complexity of the route lookup of the typical DHT network mentioned above generally increases with the number of network nodes, generally O(log N), where N is the maximum number of nodes in the network. There is also a class of routing algorithm based on constant routing complexity 0 ( 1 ) DHT in DHT network. The routing complexity of this kind of DHT algorithm does not change with the maximum number of nodes in the network, and its corresponding routing complexity is a constant. , that is, the number of hops needed to find is a constant. Now some researchers of structured overlay networks propose structured overlay network protocols that can complete message routing within one or two hops, including Kelips algorithm and One-ho algorithm.

The following is a brief introduction to the Kelips algorithm. This algorithm divides all nodes into k groups (the affinity group), and the nodes are mapped to the k integers from 0 to k-1 through the hash function. All files are also mapped to the k integers through the hash function. The inner node remains fully connected and is routed through a broadcast algorithm (Gossip).

Referring to Figure 2, each node, such as node 110, maintains three tables, an Affinity Group View, an Inter-Group Routing Table, and a Filetuples.

Affinity Group View stores the routing information of all nodes in the same group of nodes. Each entry contains the ID of the node (the IP and port number of the node), the round-trip time (rtt) to the node, and Timing time (heartbeat count, used for routing table updates).

Contacts stores routing information from nodes to other groups. Each entry contains a group number (0 to k-1), a sequence of nodes connecting the groups, and an rtt, heartbeat count to each of the nodes.

Filetuples stores the file index of all file index information in this group. Each entry in the table contains the file name (filename), and the nodes that store the file indexes, that is, the master nodes of these files, and the nodes to these master nodes. Heartbeat count.

From the structure of the above three tables, it can be concluded that the size of the node routing table is 0 (D. The nodes in the network are fully connected with each node in the group (that is, each node saves the routing information of all other nodes in the group), and keeps in contact with the partial node sequences of other groups. The resource can be realized through this route design. The complexity of the lookup is 0 (1), which is not related to the number of nodes in the network. First, the file to be searched is mapped out of the group number. If the group number is its own group, the node where the file is stored is directly found; if it is not its own group number, the file storage can be found by finding the node of the corresponding group by looking up the contacts table. Node. Therefore, it can be seen that the search hop count of this routing algorithm is 2, which is also 0 (1).

The scalability, reliability, maintainability, and discovery algorithms of the current DHT network are very good, and are also commonly used in actual networks. However, since the storage, query, and transmission of user data in a general DHT network are randomly performed, the transmission mode may occupy the bandwidth of any one of the network nodes or the egress, and the exchange between each node is completely disordered. A Beijing user may exchange file fragments with users in Guangzhou, or exchange with a user who is far away in the United States. Obviously, disorderly exchanges lead to unnecessary cross-regional or even cross-border traffic transmission, which consumes expensive domestic and international bandwidth resources, and this search also generates large routing hops and delays, which is costly. In addition, the Kelips algorithm in this paper only groups the network with a simple HASH algorithm. This also has the above problem of resource exchange disorder in the group. In addition, its routing maintenance overhead is very large, and Gossip is used in the route maintenance algorithm. Broadcast algorithm, this algorithm is relatively simple, but has a certain degree of blindness, so it will bring a lot of redundant messages, which greatly affects the performance of the system. Summary of the invention

The technical problem to be solved by the present invention is to provide a resource information processing method based on a peer-to-peer network and a peer-to-peer network to improve system performance.

To solve the above technical problem, the present invention provides a resource information processing method based on a peer-to-peer network, where a node of the peer-to-peer network has a domain identifier, and has the same domain identifier as the resource information saved by the node of the peer-to-peer network. The domain identifier is determined according to the geographical location information of the node or the resource information, and the different domain identifiers correspond to different geographical location ranges, and the method further includes:

Receiving, by the node, an operation request sent by the requesting party, where the operation request carries the geographical location information of the resource information to be operated; Determining, by the node, the domain identifier of the resource information according to the geographical location information in the operation request;

If the node determines that the domain identifier of the resource information to be operated is different from the domain identifier of the node, the node forwards the operation request to the outbound domain node, otherwise the node performs intra-domain processing.

The requesting party is an external service processing point, and the operation request sent by the external service processing point further carries the feature information of the resource information to be operated,

Before the step of performing the domain identifier determination, the method further includes: first determining, according to the feature information of the resource information, a resource identifier of the resource information,

In the step of forwarding the operation request to the outbound domain node, the operation request forwarded by the node to the outbound domain node carries a global identifier consisting of the domain identifier and the resource identifier of the resource information.

After the step of forwarding the operation request to the outbound domain node, the method further includes: the outer domain node performing intra-domain processing according to the global identifier.

The step of processing in the intra-domain includes: determining, by the node, the intra-domain node corresponding to the resource information according to the resource identifier of the resource information, the intra-domain routing table and the intra-domain resource information storage rule saved by the node, if the intra-domain node If the current node is the current node, the operation is performed according to the operation request; if the intra-domain node is another node in the domain, the operation request is forwarded to other nodes in the domain, and the forwarded operation request includes the global identifier of the resource information, and the intra-domain route The table includes routing information of other nodes in the domain that have a connection relationship with the node and a corresponding node identifier, and the node identifier is determined according to the feature information of the node.

The feature information of the node refers to an IP address, a network card number, or a machine serial number of the node, where the node identifier is obtained by using a hash algorithm; and the location information of the resource information is the resource information provider or a corresponding resource. The geographic location information to which the resource information belongs; the characteristic information of the resource information refers to a resource name or content, and the resource identifier is obtained by using a hash algorithm; the intra-domain resource storage rule is a distributed hash table DHT used in the domain. Algorithm determined.

In order to solve the above technical problem, the present invention further provides a node of a peer-to-peer network, where the node of the peer-to-peer network has a domain identifier, and the domain identifier is determined according to the location information of the node, and different domain identifiers are different. a location range, the node includes a receiving module, an identification determining module, a processing module, and a storage module connected to the processing module; The receiving module is configured to: receive an operation request of the requesting party, where the operation request includes location information of a resource message, a package, and a location;

The identifier determining module is configured to: determine a domain identifier of the resource information according to the geographic location information in the operation request;

The processing module is configured to: determine whether the domain identifier of the resource information to be operated is the same as the domain identifier of the node, and if not, forward the operation request to the outbound domain node, otherwise perform intra-domain processing.

The storage module is configured to: save resource information, and the resource information saved by the node has the same domain identifier as the node.

The operation request is sent by the external service processing point to the node, and the operation request further carries the feature information of the resource information to be operated.

The identifier determining module is further configured to: determine, according to the feature information of the resource information, a resource identifier of the resource information,

The processing module is configured to: the operation request forwarded by the outbound domain node carries a global identifier consisting of the domain identifier and the resource identifier of the resource information;

The processing module is further configured to: receive an operation request sent by another node of the peer-to-peer network, and the operation request sent by the other node of the peer-to-peer network carries the global identifier of the resource information to be operated.

The storage module is further configured to: store an intra-domain routing table, where the intra-domain routing table includes routing information of other nodes in the domain that have a connection relationship with the node, and a corresponding node identifier, where the node identifier is according to characteristics of the node Information determined;

The processing module is configured to: perform intra-domain processing according to the following: to determine, according to the resource identifier of the resource information, the intra-domain routing table, and the intra-domain resource information storage rule, the intra-domain node corresponding to the resource information, if If the node is the current node, the operation is performed according to the operation request; if the node in the domain is another node in the domain, the operation request is forwarded to other nodes in the domain, and the operation request forwarded to other nodes in the domain includes the global identifier of the resource information. symbol.

The feature information of the node refers to an IP address, a network card number, or a machine serial number of the node, where the node identifier is obtained by using a hash algorithm; and the geographical location information of the resource information is the resource identifier. The location information of the resource provider or the corresponding resource itself; the feature information of the resource information refers to a resource name or content, and the resource identifier is obtained by using a hash algorithm; and the resource storage rule in the domain is used by the domain The distributed hash table DHT algorithm is determined.

In order to solve the above technical problem, the present invention further provides a node of another peer-to-peer network, where the node of the peer-to-peer network has a domain identifier, and the resource information saved by the node has the same domain identifier as the node, and the node The domain identifier is determined according to the location information of the node, and the different domain identifiers correspond to different geographical location ranges, and the resource information has a global identifier, including a domain identifier and a resource identifier, and the domain identifier is according to the resource identifier. Determining the geographical location information of the information, the resource identifier is determined according to the feature information of the resource information,

The node is configured to: process the resource information according to a global identifier of the resource information.

The feature information of the node refers to an IP address, a network card number, or a machine serial number of the node, where the node identifier is obtained by using a hash algorithm; and the location information of the resource information is the resource information provider or a corresponding resource. The geographical location information to which the resource information belongs; the characteristic information of the resource information refers to a resource name or content, and the resource identifier is obtained by using a hash algorithm.

The present application also discloses a corresponding peer-to-peer network, including any of the above nodes.

Compared with the prior art, the resource information processing method and the peer-to-peer network of the present invention divide the peer-to-peer network into different domains according to the geographical location information, and the different domains correspond to different domain identifiers, and are determined by the geographical location information according to the resource information. The domain identifier saves the resource information on the node with the same domain identifier, which reduces the number of hops and delays required for resource information insertion or query operations, and reduces traffic transmission between different regions, thus effectively saving network bandwidth. BRIEF abstract

Figure 1 shows the topology of Chord;

Figure 2 is a schematic diagram of a routing table stored in a node of the Kelips algorithm;

3 is a schematic diagram of a resource information processing method based on a peer-to-peer network according to the present invention;

4 is a schematic diagram of a node global identifier and a resource global identifier according to the present invention; FIG. 5 is a schematic diagram of content to be stored in a network node according to the present invention; FIG.

6 is a schematic diagram of a P2P network architecture based on an application example of the present invention;

FIG. 7 is a schematic diagram of an application example 1 of the present invention for querying and querying user data of the domain;

8 is a schematic diagram of querying external domain user data according to an application example 2 of the present invention;

FIG. 9 is a block diagram showing the structure of a node in a peer-to-peer network according to the present invention.

Preferred embodiment of the invention

The main idea of the resource information processing method based on the peer-to-peer network (hereinafter referred to as P2P network) and the peer-to-peer network is that the entire peer-to-peer network is divided into several domains according to geographical locations, and each domain has a corresponding domain identifier. That is, the different domain identifiers correspond to different geographical location ranges; the resource information saved by the nodes in the domain has the same domain identifier as the node, and the domain identifier of the node is determined according to the geographical location information of the node, and different domain identifiers Corresponding to different geographical location ranges, the resource information has a global identifier, including a domain identifier and a resource identifier, where the domain identifier is determined according to the geographical location information of the resource information, and the resource identifier is based on the feature information of the resource information. It is determined that the node performs corresponding processing on the resource information according to the global identifier of the resource information. The invention can reduce the number of route hops and delays required for node and resource information query, and reduce traffic transmission between different regions, thereby effectively saving network bandwidth.

Specifically, in the present invention, the entire P2P network is divided into several domains, and the domain division is performed according to the geographical location, and each domain has a unique domain identifier (referred to as a domain ID) corresponding thereto; the geographical location on which the geographical division is based The information may be the administrative area division of the node or the user, or the division of the operator area. The domain division and the number of domains in the entire P2P network can be determined according to actual conditions.

The domain ID, that is, the domain ID, can be generated according to different principles. Generally, it is a centralized unified static allocation, or it can be dynamically generated by the corresponding server (that is, the domain ID of the node is unchanged during its lifetime), but the domain ID is required to be global. Uniquely, the number of bits of the domain ID is globally uniform, but its length is variable according to the expected maximum domain size.

The nodes in the peer-to-peer network determine the domain to which the node belongs according to its geographical location information. Each node has a global identifier, which is a unique identifier of the node in the entire network, including the domain identifier and the node identifier. All nodes in the domain have the same domain ID. The obtaining of the geographical location information of the node can be statically allocated or obtained by other means outside the P2P system, and the nodes with similar geographical proximity are guaranteed to belong to the same domain.

The node identifier (referred to as the node ID) is obtained by hashing the feature information of the node. The feature information of the node refers to the unique information of the node, such as an IP address, a network card number, or a machine serial number. The selection of the hash algorithm may be Arbitrary;

The global identifier of the node includes the domain identifier and the node identifier. For example, the domain ID is prefixed and the node ID is generated by the suffix.

As shown in FIG. 3, for the operation request of the external service processing point, the resource information processing method of the present invention based on the peer-to-peer network (hereinafter referred to as P2P network) includes:

Step 301: The node receives an operation request sent by an external service processing point, where the operation request includes geographical location information and feature information of the resource information to be operated.

Step 302: The node determines the domain identifier of the resource information according to the geographical location information in the operation request, and determines the resource identifier of the resource information according to the feature information in the operation request; the domain identifier of the resource information (referred to as the domain ID) It is determined according to the geographical location information of the resource information and the domain identifier mapping relationship table; the geographical location information of the resource information is the geographical location information of the resource information provider or the corresponding resource itself; the geographical location information is obtained statically It is allocated or obtained by other means than the P2P system, and the resource information with similar geographical locations belongs to the same domain.

The resource ID of the resource information is obtained by performing a hash algorithm on the feature information of the resource, and the feature information of the resource is information that can identify the resource, such as the specific content of the resource, the name of the user, the name of the user data, and the like, and the hash. The choice of algorithm can be arbitrary.

The domain identifier and the resource identifier of the resource information constitute a global identifier of the resource information, as shown in FIG.

Step 303: If the node determines that the domain identifier of the resource information to be operated is different from the domain identifier of the node, the node forwards the operation request to the outbound domain node, otherwise performs intra-domain processing.

The operation request forwarded by the outbound domain node carries a global identifier consisting of the domain identifier and the resource identifier of the resource information.

The intra-domain processing is performed as follows: the node determines, according to the resource identifier of the resource information, the intra-domain routing table and the intra-domain resource information storage rule, If the intra-domain node is the current node, the operation is performed according to the operation request; if the intra-domain node is another node in the domain, the operation request is forwarded to other nodes in the domain, including the global identifier of the resource information. .

To illustrate how a node handles an operation request, the following information is stored on the node:

As shown in FIG. 5, the nodes in the peer-to-peer network store the intra-domain routing table and the domain identifier mapping relationship table, the extra-domain routing table, and the resource information table. Of course, the node may further include other information, which may be determined according to requirements. The necessary information is listed.

The intra-domain routing table embodies the routing relationship between the current node and the nodes in other domains. The intra-domain nodes are obtained according to a certain DHT algorithm. They can be constructed using Tapestry, Pastry, Chord or one-hop DHT. The DHT algorithm can be different;

What is said here is the DHT algorithm used in each domain, which involves the generation and maintenance of the internal routing table in each domain, and does not involve the maintenance of inter-domain routes.

The extra-domain routing table includes all out-of-domain node information that has a connection relationship with the current node, such as the mapping between the global identifier of the out-of-domain node and the IP address of the node; the extra-domain routing table reflects the routing relationship between the current node and some nodes of other foreign domains, according to The out-of-domain routing table, the current node can contact the foreign domain. The intra-domain and out-of-domain routing tables of each node are dynamically updated, and intra-domain routing updates and out-of-domain routing updates are independent processes.

The resource information table is the resource information saved by the node. If the node is the home subscriber server HSS, the resource information stored in the HSS is user subscription data, and the resource information table includes a mapping relationship between the resource global identifier and the resource content. The resource global identifier includes a domain identifier of the resource information and a resource identifier (referred to as a resource ID). For example, the domain ID is used as a prefix, and the resource ID is generated as a suffix, as shown in FIG. 4 .

The node and resource information in the entire P2P network respectively have a unique node global identifier and a resource global identifier, wherein the node global identifier and the resource global identifier are of equal length (determined by the storage characteristics of the resources in the DHT). Node (or resource information) global identifier is used throughout the pair The node (or resource information) is uniquely identified within the network.

The resource information is stored on a node according to a certain storage rule. The storage rule is determined according to a corresponding distributed hash table DHT algorithm in the domain, and the resource information is stored in a node whose global identifier is closest to the global identifier of the resource. The insertion or query of the resource information is also performed according to the DHT algorithm in the domain.

The node determines the intra-domain node corresponding to the resource information according to the resource identifier of the resource information, the intra-domain routing table, and the intra-domain resource information storage rule.

The present invention is further described below in conjunction with specific application examples:

As shown in Figure 6, the network divides the entire network into several domains (here, four) according to the geographical area of the nodes. The figure indicates the DHT algorithm used in the domain, where the domain 1, 3 uses the Chord algorithm. Domains 2 and 4 use the One-hop DHT algorithm. For the domain, without loss of generality, only the nodes in the domain 2 and the foreign domain nodes are listed in the figure, where each node of the domain 2 and the other 3 One node of the domain keeps in touch, and the nodes of other domains have the same connection with the foreign domain as in the case of domain 2. Both intra-domain and extra-domain routing connections are dynamically updated and can be adapted to changes in network conditions.

In this example, a node refers specifically to a Home Subscriber Server (HSS). See Figure 6 and 7. Each node in the figure is an HSS. The HSS is the primary user database that supports the IMS network entities used to process calls/sessions. It contains user profiles, performs user authentication and authorization, and provides information about the user's physical location. In this embodiment, each HSS (hereinafter referred to as a node) stores user data of a part of the user, and the user data includes the address information of the proxy server (ie, SIP Proxy) that is registered by the user through the SIP protocol.

In this application example, the domain ID of the user data is determined according to the domain to which the user belongs, and the global identifier of the node where the user data is stored is closest to the global identifier of the resource of the user data, and it can be seen that this is satisfied. The node of the rule must be the node of the domain (that is, the domain ID must be the same), and This node is also unique.

The user data is stored according to its resource global identifier in the local domain node with the global identifier equal to or similar to the domain identifier (ie, the domain ID in the node global identifier of the node and the domain ID in the resource global identifier of the user data) On the same), when there are more close nodes, the user data resources need to be saved by the transfer node, which is also the necessary process for the new node to join, which is also the process of routing maintenance of the specific DHT algorithm.

There are 8 nodes in the figure. These nodes are divided into two domains according to the geographical location. The nodes &, b, c, and d belong to domain A, the domain ID of domain A is 001, and the nodes e, f, g, and h belong to domain B. The domain ID of domain B is Oi l (here is expressed in binary). Each node in the figure uses the One-hop DHT algorithm in the domain (that is, each node in the domain maintains a global routing table in the domain to maintain full connectivity with other nodes in the domain), and each node also contains an out-of-domain The routing table, the out-of-domain routing table contains routing information of some nodes of the outer domain. For example, the out-of-domain routing table of the node a only contains the routing information of the node h in the domain B.

Application example 1: User data query in the domain

In Figure 7, user X needs to establish a connection with user Y. User X sends a call request to his SIP Proxy 1. The call request contains the Uniform Resource Indicator (URI) of user Y. In order to complete the request, SIP Proxy 1 You need to find the address of the SIP Proxy currently used by User Y by looking up the user data of User Y. The data query process can be divided into the following steps:

Step 601: SIP Proxyl sends a data query request to the node a to which it is connected, requesting to query the user data of the user Y, and the request includes the URI information of the user Y, such as: Bob@beijing.cn Step 602: Node a according to the query request The URI information of the user Y calculates a resource global identifier of the user data of the user Y;

This resource global identifier can be obtained by: Node a according to User Y's URI: Bob@beijing.cn, , by extracting the domain name part of this URI "beijing.cn", and looking up its own domain name ID mapping table The domain ID of this user is 001, and the user name "Bob" is hashed to obtain the resource ID of 010001010. (In this application example, the number of resource IDs is short, for convenience of explanation, the actual domain ID and resource ID. The number of digits can be as large as, for example, the resource ID is 128 bits, and the domain ID is 9. Bit, can be enough to ensure that the ID after HASH is not repeated), the domain ID and resource ID are combined to get the resource global identifier of this resource (here 001010001010);

Since the domain ID of the required user belongs to the domain but is not responsible for the node a, the node a queries its own intra-domain routing table, and obtains the corresponding node ID of the resource ID (010001011) closest to the requested user resource ID. The IP address of the node c, and sends a data query request to the node c, the request contains a resource global identifier of the data to be searched;

The resource information is stored on the node corresponding to the node ID closest to the resource ID, which is only a specific storage rule of the application instance. Of course, it can also be stored on the node corresponding to the node ID obtained by inverting its ID. This is determined by the DHT algorithm in the domain. The storage of resources and the search of resources are determined by the DHT algorithm.

Step 603: The node c receives the query request, according to the resource global identifier included in the request, the resource is responsible for itself, and finds its own resource information table, and returns the user data of the user Y to the node a;

Step 604: The node a sends the user data of the user Y to the SIP Proxy 1 , and the SIP Proxy 1 can establish a connection with the user Y by using the obtained address information of the SIP Proxy 2 of the user Y. The process of establishing the connection by using the SIP protocol does not belong to The scope of this patent, the specific process can refer to the SIP protocol related content, the figure simply gives the message schematic.

Application Example 2: Out-of-domain user data query

The following describes the situation in which the user X is to establish a connection with the user Z. The user Z is located in the domain B. The SIP proxy 1 needs to query the user data of the user Z to obtain the address information of the SIP proxy registered by the user Z, as shown in FIG. The data query steps are as follows:

Step 701: SIP Proxyl sends a data query request to the node a to which it is connected, requesting to query the user data of the user Z, and the request includes the URI information of the user Z, such as: Alice@Shanghai.cn Step 702: Node a according to the request The URI information of the user Z obtains the resource global identifier of the requested data, and the resource global identifier is generated as above. The result obtained here is 0110101010, the domain ID in the resource global identifier is 011, and the user resource ID is 010100010. Since the domain ID of the required user does not belong to the local domain, the node a queries its own extra-domain routing table, obtains the IP address of the node h with the domain ID 011, and sends a data query request to the node h, and the request includes the required The resource global identifier of the data to be queried

Step 703: The node h receives the query request, knows that the required resource is located in the domain but is not responsible for itself, so it searches its own intra-domain routing table to obtain the node ID closest to the requested user resource ID (here) IP address of node g of 010100010), and send a data query request to node g

Step 704: The node g receives the query request, and finds its own resource information table, and returns the user data of the user Z to the node h;

Step 705: The node h sends the user data of the user Z to the node a;

Step 706: Node a sends the user data of the user Z to the SIP Proxy 1 , and the SIP Proxy 1 can obtain the connection with the user Z after obtaining the required data.

When the query request contains the address information of the node (here, node a) that originally issued the query, steps 704 and 705 can be simplified to step 704;

Step 704': The node g receives the query request, and finds its own resource information table, and directly returns the user data of the user Z to the node a.

By using the above method of the invention, the searching and storing of resources can be well restricted in the domain, thereby reducing the hop count and delay of resource searching, reducing the randomness of disordered switching and resource searching, and reducing unnecessary regions. Inter-discovery and inter-area data transmission, which effectively saves the bandwidth of the network and improves the performance of the network as a whole. The peer-to-peer network implemented by the above method includes a plurality of nodes. As shown in FIG. 9, each node 90 includes a receiving module 91, an identification determining module 92, a processing module 93, and a storage module connected to the processing module. 94, of which

The receiving module 91 is configured to receive a resource information operation request sent by an external service processing point, where the operation request includes geographical location information and feature information of the resource information to be operated; the operation request is an insertion or query request.

The identifier determining module 92 is configured to determine a domain identifier of the resource information according to the geographic location information in the operation request, and is further configured to determine a resource identifier of the resource information according to the feature information of the resource information;

The processing module 93 is configured to determine a domain identifier of the resource information to be operated and the node If the domain identifiers are the same, if they are different, the outer domain node forwards the operation request, which carries the global identifier consisting of the domain identifier and the resource identifier of the resource information; otherwise, it is used for intra-domain processing.

The processing module 93 is further configured to receive an operation request sent by another node of the peer-to-peer network, where the global identifier of the resource information to be operated is carried, where the intra-domain processing is performed according to the resource identifier in the global identifier of the resource information. .

The processing module 93 performs intra-domain processing in this manner: determining, according to the resource identifier of the resource information, the intra-domain routing table, and the intra-domain resource information storage rule, the intra-domain node corresponding to the resource information, if the intra-domain node is current The node operates according to the operation request; if the intra-domain node is another node in the domain, the operation request is forwarded to other nodes in the domain, including the global identifier of the resource information.

The intra-domain routing table is stored in the node, and includes routing information of other nodes in the domain that has a connection relationship with the node and a corresponding node identifier, where the node identifier is determined according to the feature information of the node.

The storage module 94 is configured to save resource information, where the resource information saved by the node has the same domain identifier as the node, and is further configured to store an out-of-domain routing table and an intra-domain routing table, where the out-of-domain routing table includes the node The routing information of the external domain node having the connection relationship and the corresponding node identifier; the intra-domain routing table includes the routing information of the other nodes in the domain and the corresponding node identifier, and the node identifier is determined according to the feature information of the node;

The above is only a special case of the HSS server as a node. The present invention does not limit the type of the node, and may be another server or a user's personal host. The present invention does not limit the type of resource information, and the related operations of other types of data are the same as the principle of this embodiment.

The routing maintenance in the domain is performed by the DHT algorithm corresponding to the domain, and the DHT algorithm used in each domain may be different. When a domain or an out-of-domain node joins or exits, the DHT algorithm used according to this domain is more The new intra-domain routing table; update the extra-domain routing table by initiating a routing update request to the extra-domain node connected to the node, and copy the corresponding extra-domain routing table directly from other nodes in the domain when the extra-domain node is unreachable; The resource information storage rule updates the resource information table.

The resource information storage in the present invention is completely in accordance with the DHT idea. When the data is stored, the resource identifier or the resource index is stored in the corresponding node according to the global identifier of the resource, wherein the resource global identifier adds the domain ID of the resource, thereby Considering the regionality of resource information and reducing the blindness of resource information storage; the resource ID in the resource global identifier is obtained by the hash algorithm, which can ensure the randomness and certainty of resource storage, and also facilitate the positioning of resources. .这种Using this storage method, each node only needs to store part of the resource information or its index information, which saves storage space and query time.

Inserting and querying the global identifier of the resource information makes it easier and faster to locate the domain to which the resource information belongs, and then directly locates the domain where the resource is located for searching, which makes the search faster and reduces the need for resource insertion or query operations. The hop count is limited to the domain query as much as possible. Since the query delay in the domain is much smaller than the inter-domain query, the query delay can be reduced from the above two aspects, and the overall performance of the network is improved. At the same time, the resource search can reduce the number of queries between different regions and effectively save network bandwidth.

INDUSTRIAL APPLICABILITY The resource information processing method and the peer-to-peer network of the present invention divide the peer-to-peer network into different domains according to the geographical location information, and the different domains correspond to different domain identifiers, and the domain identifiers determined by the geographical location information of the resource information will be The resource information is saved on the node with the same domain identifier, thereby reducing the number of route hops and delays required for resource information insertion or query operations, and reducing traffic transmission between different regions, thereby effectively saving network bandwidth.

Claims

Claim

A resource information processing method based on a peer-to-peer network, the method comprising: a node of a peer-to-peer network having a domain identifier, and having the same domain identifier as the resource information held by the node of the peer-to-peer network, the domain identifier It is determined according to the geographical location information of the node or the resource information, and the different domain identifiers correspond to different geographical location ranges, and the method further includes:

Receiving, by the node, an operation request sent by the requesting party, where the operation request carries geographical location information of the resource information to be operated;

Determining, by the node, a domain identifier of the resource information according to geographical location information in the operation request;

2. The method according to claim 1, wherein the requesting party is an external service processing point, and the operation request sent by the external service processing point further carries feature information of the resource information to be operated, and the domain identity determination is performed. Before the steps, the method further includes:

Determining, according to the feature information of the resource information, the resource identifier of the resource information; in the step of forwarding the operation request to the outbound domain node, the operation request forwarded by the node to the outbound domain node carries the domain identifier of the resource information And a global identifier consisting of resource identifiers,

The method according to claim 1 or 2, wherein the step of processing in the intra-domain comprises: determining, by the node, a resource identifier of the resource information, an intra-domain routing table saved by the node, and an intra-domain resource information storage rule The intra-domain node corresponding to the resource information, and

If the node in the domain is the current node, the operation is performed according to the operation request;

If the intra-domain node is another node in the domain, the operation request is forwarded to other nodes in the domain, and the forwarded operation request includes a global identifier of the resource information, where the intra-domain routing table includes a domain that has a connection relationship with the node. The routing information of the other node and the corresponding node identifier, and the node identifier is determined according to the feature information of the node.

4. The method according to claim 3, wherein the feature information of the node refers to an IP address, a network card number or a machine serial number of the node, and the node identifier is obtained by using a hash algorithm; The location information is the location information of the resource information provider or the corresponding resource itself; the feature information of the resource information refers to a resource name or content, and the resource identifier is obtained by using a hash algorithm; Rules are distributed hash tables used within the domain

(DHT) algorithm determined.

A node of a peer-to-peer network, the node of the peer-to-peer network having a domain identifier, the domain identifier is determined according to the location information of the node, and the different domain identifiers correspond to different geographical location ranges, and the node includes a receiving module, an identification determining module, a processing module, and a storage module connected to the processing module; wherein

The receiving module is configured to: receive an operation request of the requesting party, where the operation request includes location information of a resource letter, a package, and a location;

The processing module is configured to: determine whether the domain identifier of the resource information to be operated is the same as the domain identifier of the node, and if not, forward the operation request to the outer domain node, otherwise perform intra-domain processing;

6. The node according to claim 5, wherein

The processing module is further configured to: receive an operation request sent by another node of the peer-to-peer network, and the operation request sent by another node of the peer-to-peer network carries the global identifier of the resource information to be operated Pay.

7. The node according to claim 5 or 6, wherein

The node according to claim 7, wherein the feature information of the node refers to an IP address, a network card number or a machine serial number of the node, and the node identifier is obtained by using a hash algorithm; The location information is the location information of the resource information provider or the corresponding resource itself; the feature information of the resource information refers to a resource name or content, and the resource identifier is obtained by using a hash algorithm; The rules are determined by the distributed hash table DHT algorithm used within the domain.

A node of a peer-to-peer network, the node of the peer-to-peer network having a domain identifier, the resource information saved by the node has the same domain identifier as the node, and the domain identifier of the node is based on the node region The location information is determined, and the different domain identifiers correspond to different geographical location ranges, and the resource information has a global identifier, including a domain identifier and a resource identifier, where the domain identifier is determined according to the geographical location information of the resource information, The resource identifier is determined according to the feature information of the resource information,

The node according to claim 9, wherein the feature information of the node refers to an IP address, a network card number or a machine serial number of the node, and the node identifier is obtained by using a hash algorithm; The location information is the location information of the resource information provider or the corresponding resource itself; the feature information of the resource information refers to the resource name or content, and the resource identifier is Obtained by the hash algorithm.

11. A peer to peer network comprising a node as claimed in any of claims 5-8.

12. A peer to peer network comprising a node as claimed in any of claims 9-10.