[go: up one dir, main page]

WO2011150741A1 - Réseau superposé point à point (p2p), procédé d'exploitation de ressources de données et procédé pour joindre un nouveau nœud de ce réseau - Google Patents

Réseau superposé point à point (p2p), procédé d'exploitation de ressources de données et procédé pour joindre un nouveau nœud de ce réseau Download PDF

Info

Publication number
WO2011150741A1
WO2011150741A1 PCT/CN2011/074167 CN2011074167W WO2011150741A1 WO 2011150741 A1 WO2011150741 A1 WO 2011150741A1 CN 2011074167 W CN2011074167 W CN 2011074167W WO 2011150741 A1 WO2011150741 A1 WO 2011150741A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
domain
resource
overlay network
new
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Ceased
Application number
PCT/CN2011/074167
Other languages
English (en)
Chinese (zh)
Inventor
胡学川
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
ZTE Corp
Original Assignee
ZTE Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by ZTE Corp filed Critical ZTE Corp
Publication of WO2011150741A1 publication Critical patent/WO2011150741A1/fr
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/104—Peer-to-peer [P2P] networks
    • H04L67/1059—Inter-group management mechanisms, e.g. splitting, merging or interconnection of groups
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H04L67/104—Peer-to-peer [P2P] networks
    • H04L67/1044—Group management mechanisms 
    • H04L67/1046—Joining mechanisms

Definitions

  • the present invention relates to the field of communications, and in particular to a P2P overlay network, a data resource operation method thereof, and a new node force input method.
  • BACKGROUND A Distributed Hash Table (DHT) network is an implementation technology of a Point To Point (P2P) network. It uses distributed hash table technology to implement resource storage and lookup.
  • DHT Distributed Hash Table
  • P2P Point To Point
  • It uses distributed hash table technology to implement resource storage and lookup.
  • the entire P2P network is divided into multiple domains, each identified by a unique domain ID. Nodes in the same domain have the same domain ID, and all nodes are identified by a unique node ID.
  • the resource identifier also carries the domain ID to indicate which domain the corresponding resource belongs to, and each resource has a resource ID to uniquely identify.
  • both the node identifier and the resource identifier have a domain.
  • the information, and the domain IDs used in the node identifier and the resource identifier are the same length, and the information represented is the same.
  • each i or resource element i is i or ID, for example, port 3, the identifier of resource X is i or ID (0101) + resource ID (13XX); and the front part of each i or node identifier is also i or ID, for example, the target i of node M is only i or ( 0101 ) + node ID ( 22XX )##
  • the node when the node searches for resources, it first compares the search resource identifiers. Whether the domain ID and the domain ID in the local node ID are equal. If they are equal, the resource being queried is considered to be the domain, and then the resource is searched in the local domain.
  • the resource is considered to be a resource of another domain, and the query message is routed. Go to the domain indicated by the domain ID, and then perform intra-domain lookup to finally find the requested resource.
  • the following describes the resource search in the prior art with reference to Figure 2.
  • Figure 2 it is assumed that there are three domain IDs. 0101, 0201, and 0301.
  • the domain ID included in the resource ID is determined to be in the local domain (the domain ID in the resource identifier is equal to the domain ID of the local node), and the query request is routed to the domain to store the resource.
  • Node M as shown in Figure 2.
  • the L node finds that the queried resource is in domain 0301. It is learned through the routing table that it can be linked to the 0301 domain through the P point (the domain ID in the resource identifier). And the 0301 domain ID is equal), the L node routes the query request to the P node, and the P node determines that the queried resource is in the local domain, and routes the query request to the node N where the resource is saved, and the path is as shown in FIG. 2 .
  • the existing multi-domain architecture cannot be flexibly configured, and reasonable domain planning cannot be performed according to the size of the domain.
  • a primary object of the present invention is to provide a P2P overlay network, a data resource operation method thereof, and a new node join method, to at least solve the above problems.
  • a P2P overlay network including: a plurality of node domains, wherein each node domain is connected to each other, and nodes in each node domain are configured to store data resources of a P2P overlay network, wherein the data resources It is divided into multiple resource domains, and the data resources stored by each node of one node domain belong to the same resource domain.
  • Each of the plurality of resource domains has the same geographical location information.
  • the node domain ID of each node domain contains the resource domain ID of the resource domain to which the data resource stored by the node domain belongs.
  • the plurality of nodes of the P2P overlay network are further configured to store a first correspondence between a domain name of each resource domain in the plurality of resource domains and a resource domain ID.
  • the plurality of nodes of the P2P overlay network are further configured to store a second correspondence between the node domain ID of each node domain in the plurality of node domains and the routing information of the node domain.
  • the node ID of each node contains the node domain ID of the node domain to which the node belongs.
  • the resource identifier of each data resource contains the resource domain ID of the resource domain to which the data resource belongs.
  • a data resource operation method for a P2P overlay network including: an access node of a P2P overlay network receives an operation request sent by a requester, where the operation request is used to request a P2P overlay network The stored data resource performs a predetermined operation; the access node acquires a node domain that stores the data resource; the access node sends the operation request to a node in the node domain that stores the data resource; the node performs the predetermined operation on the data resource .
  • the node domain that the access node acquires the data resource includes: the resource identifier of the data resource that the access node acquires, where the resource identifier includes: a resource domain ID of the resource domain to which the data resource belongs and a resource ID of the data resource in the resource domain;
  • the node matches the resource identifier with the node domain ID of each node domain of the P2P overlay network to obtain the node domain corresponding to the longest matching node domain ID, wherein the node domain ID of each node domain includes: the node domain storage The resource domain ID of the resource domain to which the data resource belongs.
  • the operation request carries the resource identifier of the data resource, and the access node obtains the resource identifier of the data resource, where the access node obtains the resource identifier from the operation request.
  • the operation request carries the name of the data resource and the domain name of the resource domain to which the data resource belongs, and the resource identifier of the access node to obtain the data resource includes: the access node according to the domain name and the resource domain of each resource domain stored in the P2P overlay network.
  • the access node acquires the resource ID in the domain of the data resource according to the name of the data resource; the access node according to the obtained resource domain ID and the domain
  • the resource ID which is the resource identifier of the data resource. If the acquired node domain is the node domain to which the access node belongs, the node that sends the operation request to the node that stores the data resource in the node domain includes: the access node acquires the node that stores the resource data according to a predetermined algorithm; the access node An operation request is sent to the node.
  • the node that sends the operation request to the node that stores the data resource in the node domain includes: the node domain ID of each node domain stored by the access node according to the P2P overlay network and the node
  • the second correspondence of the routing information of the node domain acquires routing information corresponding to the longest matching node domain ID; the access node sends the operation request to the connecting node of the node domain corresponding to the node domain ID according to the routing information; According to a predetermined algorithm, a node storing the resource data is obtained, and an operation request is sent to the node.
  • a new node joining method for a P2P overlay network including: a new node sends a request for a request to join a P2P overlay network to an access node of a P2P overlay network, where The join request message carries the node identifier of the new node; the access node determines the node domain to which the new node belongs according to the node identifier, and sends the join request message to the responsible node of the new node in the node domain, where the responsible node a node whose identifier is the closest to the node identifier of the new node; the responsible node receives the join request message, and returns a response message, and the response message is returned to the new node according to the routing path of the join request message, where the response message carries There is identification information of the responsible node.
  • the node identifier of the new node includes: a node domain ID of the node domain to which the new node belongs and a node ID of the new node in the node domain, and the access node determines, according to the node identifier, the node domain to which the new node belongs: the access node will The node identifier of the new node is matched with the node domain ID of each node domain of the P2P overlay network, and the node domain corresponding to the longest matching node domain ID is determined to be the node domain to which the new node belongs. If the node domain to which the new node belongs is the node domain to which the access node belongs, the access node will join the request message.
  • the responsible node of the new node in the node domain includes: the access node acquires the responsible node of the new node according to a predetermined algorithm; The node forwards the join request message to the responsible node. If the node domain to which the new node belongs is not the node domain to which the access node belongs, the access node will join the request message.
  • the responsible node of the new node in the node domain includes: the node domain ID of each node domain stored by the access node according to the P2P overlay network.
  • the access node Corresponding to the second correspondence between the routing information of the node domain, obtaining routing information corresponding to the longest matching node domain ID; the access node sending the joining request message to the connecting node of the node domain corresponding to the node domain ID according to the routing information
  • the connecting node acquires the responsible node of the new node according to a predetermined algorithm, and sends a join request message to the responsible node.
  • the method further includes: the new node acquiring the node identifier, where the node identifier is allocated by the configuration server of the P2P overlay network or the new node is based on the attribute information thereof. Generated.
  • the method further includes: the new node acquiring the identification information of the responsible node carried in the response message, and performing message interaction with the responsible node according to the identification information.
  • the method further includes: the new node sending an out-of-domain broadcast message to the connection node of the other node domain other than the node domain to which it belongs, notifying the other node domain that a new node joins.
  • the resource domain and the node domain are separated. When the resource data of a certain resource domain is relatively large, the resource data of the resource domain can be distributed to run in multiple node domains, thereby reducing system maintenance.
  • FIG. 3 is a P2P overlay network according to an embodiment of the present invention.
  • FIG. 4 is a flowchart of a data resource operation method of a P2P overlay network according to an embodiment of the present invention.
  • FIG. 5 is a schematic diagram of operations on data resources in a P2P overlay network according to an embodiment of the present invention;
  • FIG. 7 is a flowchart of a new node joining method of a P2P overlay network according to an embodiment of the present invention;
  • FIG. 4 is a flowchart of a data resource operation method of a P2P overlay network according to an embodiment of the present invention.
  • FIG. 5 is a schematic diagram of operations on data resources in a P2P overlay network according to an embodiment of the present invention.
  • FIG. 9 is a diagram of a preferred embodiment of a new node joining method for a P2P overlay network according to an embodiment of the present invention.
  • BEST MODE FOR CARRYING OUT THE INVENTION the present invention will be described in detail with reference to the accompanying drawings. It should be noted that the embodiments in the present application and the features in the embodiments may be combined with each other without conflict.
  • a P2P overlay network is first provided, in which a resource domain and a node domain are separated.
  • FIG. 3 is a schematic structural diagram of a P2P overlay network according to an embodiment of the present invention. As shown in FIG.
  • data resources in an entire P2P network are divided into multiple resources.
  • the domain (a box in Figure 3 represents a resource domain), and the nodes in the entire P2P overlay network are divided into multiple node domains (one circle in Figure 3 represents a node domain), and the data resources of each resource domain It can be responsible for one node domain or multiple node domains. That is, the data resources of one resource domain can be stored in each node of a node domain, or can be stored in each node of multiple node domains. The amount of data resources included in the resource domain is determined. When a resource resource of a resource domain is large, the data resource of the resource domain may be stored in multiple node domains.
  • the data resources stored by each node of a node domain belong to the same resource domain.
  • the division of resource domains can be performed according to geographical location, for example, Shanghai domain, Nanjing domain, Beijing domain, and the like.
  • the geographical location information on which the division is based may be the resource or the administrative area where the user is located, or may be divided into regions according to the operator.
  • a resource management domain can deploy only one node domain. For example, a Nanjing resource domain can be deployed in a node domain, and a Shanghai resource domain is also a node domain. However, if there are many resources (users) in the resource domain, the node size of the deployed node domain will be large.
  • each resource domain has a domain name, and has a unique identifier (referred to as a resource domain ID) corresponding thereto.
  • resource domain ID a unique identifier
  • the division of the node domain may be performed according to the geographical location, or may be divided according to other methods such as an IP address, and each node domain has a node domain ID.
  • the node domain ID of the node domain The resource domain ID of the resource domain to which the data resource stored in the node domain belongs may be included, that is, the length of the resource domain ID is less than or equal to the length of the node domain ID.
  • the resource domain ID may be used as a prefix of the node domain ID, or The resource domain ID can also be used as a predetermined bit of the node domain ID, for example, the last four digits, and the like.
  • the node identifier of each node in the node domain may be represented by the node domain ID.
  • the node identifier may include the node domain ID to which the node belongs and the node ID of the node in the node domain.
  • node identification node domain ID + node ID
  • the resource ID and the node ID may be obtained by using a predetermined intra-domain DHT algorithm, so that the resource ID of the data resource is related to the node ID of the node storing the data resource.
  • Figure 3 contains five node domains.
  • the node domain ID of each node domain contains the ID of the resource to which the stored data resource belongs.
  • the five node domains in Figure 3 can be 0301, 0201, 01011, respectively. 01012, 01013.
  • the node domain and the node domain of the P2P overlay network may use a full connection mode, and the node domain ID of each node domain and the routing information of the node domain may be stored in each node of the P2P overlay network.
  • the correspondence relationship is such that a connection can be established between the respective node domains.
  • the correspondence relationship can be stored by using a mapping table as shown in Table 2. Table 2. Inter-domain routing table
  • the resource domain and the node domain in which the resource domain is located may have the same ID of the resource domain and the ID of the node domain, but the ID of the resource domain is included in the node.
  • the node domain where the resource domain is located can be obtained by the longest match. For example, if one resource domain is deployed to multiple node domains, the domain ID of the resource domain can be the longest match in the domain ID of the node domain. .
  • the resource domain and the node domain are separated, so that the data resources of one resource domain can be stored by one or more node domains.
  • the domain name is dom-b.com.cn. All data resources in the domain are responsible for the nodes in the three node domains (domain IDs 01011, 01012, and 01013).
  • the resource domain and the node domain can be separated. If the resource data of a resource management domain is relatively large, the number of nodes is also very large, and the system can be deployed to run in multiple node domains. The maintenance overhead will not be too great. In this way, the overlay network can be flexibly configured according to the actual situation. Thereby improving the performance of the entire overlay network.
  • the data resource operation method of the above P2P overlay network provided by the embodiment of the present invention is described below.
  • Step S402 a connection of a P2P overlay network
  • the ingress node receives an operation request sent by the requesting party, where the operation request is used to request to perform a predetermined operation on a certain data resource stored in the P2P overlay network; specifically, the predetermined operation may be querying, storing, or modifying a certain data resource.
  • Step S404 The access node acquires a node domain that stores the data resource.
  • Step S406 The access node sends the operation request to a node that stores the data resource in the node domain.
  • the data resource operation method of the P2P overlay network in the foregoing embodiment of the present invention may perform a predetermined operation on a data resource stored in a P2P overlay network in which the node domain and the resource domain are separated. Details of the processing of the above steps are further described below.
  • Step S402 In the specific implementation process, when the user needs to perform some operation on a certain data resource in the P2P overlay network, the client sends a request to the access node connected to the client in the P2P overlay network through the client. Request, request to perform an operation on a data resource.
  • the user needs to query the data resource abc whose domain name is dom-c.com.cn, that is, query abc@dom-c.com.cn, and the user sends a query request through its client.
  • the name of the data resource to be operated and the domain name of the resource domain in which the client is located may be converted into the resource identifier of the data resource, for example, abc@dom- C.com.cn is converted into the resource identifier 02012213 of the data resource, and the resource identifier of the data resource is carried in the operation request and sent to the access node of the P2P overlay network; or, the client may only use the data resource
  • the name and the domain name of the resource domain in which it resides are carried in the operation request and sent to the access node, and the access node converts the name of the resource and the domain name of the resource domain into the resource identifier of the data resource.
  • Step S404 In the specific implementation process, if the resource identifier of the data resource includes the resource domain ID of the resource domain to which the data resource belongs and the resource ID of the data resource in the resource domain, and the node domain ID of the node domain includes the node
  • the resource domain ID of the resource domain to which the data resource stored in the domain belongs can obtain the node domain in which the data resource is stored by the longest matching method. That is, the access node performs the longest match between the resource identifier and the node domain ID of each node domain of the P2P overlay network, and obtains the node domain corresponding to the longest matching node domain ID, where the node domain is the node that stores the data resource. area.
  • the resource domain ID may be used as a prefix of the node domain ID, or may be located at a predetermined location of the node domain ID (for example, the last few digits); and the resource identifier includes: a resource domain ID and a resource ID, where the resource domain The ID may be used as a prefix of the resource identifier, or may be located at a predetermined location of the resource identifier (the predetermined location may be pre-agreed), and the resource ID is calculated by using an intra-domain algorithm.
  • the longest matching node domain ID may be directly obtained by using the longest matching method of the prefix; or Obtaining, according to a predetermined agreement, a resource domain ID included in the node domain ID from a predetermined location of the node domain ID, and obtaining a resource domain ID of the resource domain to which the data resource belongs from the predetermined location of the resource identifier, and setting the two resource domain IDs Matching is performed. If the matching is successful, the remaining bits in the resource identifier are matched with the remaining bits of the node domain ID, so that the longest matching node domain ID can be obtained.
  • the node domain of each resource domain may be stored in the P2P overlay network, or the node domain of each data resource may be stored. For example, it may be recorded in which node the data resource whose resource identifier is in a certain range is stored. Etc., based on the information, the access node can determine the node domain in which the data resource is stored.
  • Step S406 In the specific implementation process, if the node domain determined in the foregoing step S404 is the node domain (ie, the local domain) where the access node is located, the access node may obtain the storage according to the preset intra-domain algorithm.
  • the access node if the node domain determined in the foregoing step S404 is not the node domain where the access node is located, the access node is pre-stored according to the P2P network.
  • Corresponding relationship between the node domain ID and the routing information of the node domain may obtain the routing information of the node domain determined in step S404, and according to the routing information, the access node forwards the operation request to the The connection node of the node domain.
  • the connection node After receiving the operation request, the connection node determines that the data resource is stored in the local domain, and obtains a node that stores the data resource in the local domain according to a predetermined intra-domain algorithm, and forwards the operation request to the node.
  • Step S408 After receiving the operation request, the node storing the data resource performs a predetermined operation on the data resource according to the instruction of the operation request, that is, queries, stores, or modifies the data resource, if it is a query operation, The node returns corresponding data to the requester according to the path of the operation request, and if it is a storage or modification operation request, the node returns a corresponding response message to the request according to the path of the operation request.
  • the P2P overlay network shown in FIG. 5 is taken as an example to describe a preferred implementation manner of the data resource operation method of the P2P overlay network in the embodiment of the present invention. In Figure 5, the ID is described in hexadecimal.
  • the resource i or ID of the resource domain dom-b.com.cn is 0101, which corresponds to three nodes i or ID is 01011.
  • the node i of 01012 and 01013 or; and the resource domain ID of the resource domain dom-a.com.cn is 0301, which corresponds to a node i with a node domain ID of 0301; and the resource of resource i or dom-c com.cn
  • the i or ID is 0201, which corresponds to a node domain with a node domain ID of 0201.
  • the user queries/stores/modifies a resource domain name to the P2P overlay network through client A (Client A) as the resource data of the dom-c.com.cn domain, for example, abc@dom-c. Com. cn.
  • the data resource is stored or stored in an E-node in a node domain with a node domain ID of 0201.
  • FIG. 6 is a flowchart of a specific implementation. As shown in FIG. 6, the method mainly includes the following steps: Step-Chen 601, Client A will The resource abc@dom-c. com.
  • cn is converted into a resource identifier of 02012213;
  • Client A can query the domain name mapping table (as shown in Table 1), and obtain the resource domain ID of the resource domain whose domain name is Dom-c.com.cn is 0201. By using the intra-domain algorithm, "abc" can be calculated. The corresponding resource ID is 2213, so that the resource identifier ID of the data resource is 0201-2213.
  • Step 602 Client A sends a query/storage/modification resource request message to the connection node B, where the resource identifier carried in the request is 0201-2213;
  • Step 603 the node B (node domain ID is 01011) is based on the resource identifier 0201- 2213 In the inter-domain routing table (shown in Table 2), the longest matching node domain ID, find the longest matching node domain ID is 0201, determine that the node domain ID is not the local domain ID, therefore, responsible for the data resource 0201
  • the node of -2213 is not in the domain; step 604, the node B obtains the routing information corresponding to the node domain ID0201 according to the table 2, and obtains the connection node of the node domain 0201 as A, and then forwards the request message received in the above step 602 to the connection.
  • Step 606 Node A According to the algorithm used in the domain (such as Chord, Pastry, etc.), the final message is routed to the node E storing the data resource;
  • Steps 608 ⁇ 610 Node E Send ring
  • the message is returned to Client A. If the data resource is queried, the response message carries the data that is queried.
  • FIG. 7 is a flowchart of a method for joining a new node of a P2P overlay network according to an embodiment of the present invention. As shown in FIG. 7, the method mainly includes the following steps (step S702 - step S706): Step S702, the new node superimposes the network to the P2P.
  • the access node sends a join request message requesting to join the P2P overlay network, where the join request message carries the node identifier of the new node; Step S704, the access node determines the node domain to which the new node belongs, and sends the join request message to the responsible node of the new node in the node domain, where the responsible node is the node identifier of the node identifier and the new node.
  • the neighboring node receives the above-mentioned join request message, and returns a response message, and the response message is returned to the new node according to the routing path of the join request message, wherein the response message carries the identification information of the responsible node.
  • a new node may be added in a P2P overlay network in which the node domain and the resource domain are separated. Details of each of the above processes are further described below.
  • Step 4 S S702 before the new node sends a join request message to an access node of the P2P overlay network, the new node first acquires the node identifier.
  • the method for the new node to obtain the node identifier includes, but is not limited to, the following two methods: Method 1, the new node sends a request to the configuration server, and the configuration server allocates the node identifier of the new node, as shown in FIG.
  • the new node As shown in the second method, the new node generates its node identifier according to its own IP address and other information. If the node identifier of the new node is obtained by using the foregoing method 1, the configuration server allocates the node identifier to the new node at the same time, and allocates the access node to the new node at the same time; if the node identifier of the new node is obtained by using the foregoing method 2, the P2P The access nodes of the overlay network can be manually configured. After obtaining the configured access node, the new node sends a join request message to the access node, requesting to join the P2P overlay network, where the request message carries the node identifier of the new node.
  • the access node may perform the longest match by the node identifier of the new node and the node domain ID of each node domain in the P2P overlay network.
  • the node domain to which the node whose node identifier is within a certain range may be pre-stored when the network is set up, thereby acquiring the node domain to which the new node belongs.
  • the node identifier of the new node in the above step S702 includes: the node domain ID of the node domain to which the new node belongs and the new node
  • the node domain to which the new node belongs may be the local domain of the foregoing access node, or may not be the local domain of the access node.
  • the access node sends the join request message to the new domain in the node domain.
  • the responsible node of the node has two ways of processing: Mode 1, the new node and the access node are in the same node domain. After determining that the new node is in the local domain, the access node calculates the responsible node of the new node according to the intra-domain algorithm. Specifically, the responsible node has a node identifier greater than the node identifier of the new node, and the node identifier and the new node identifier The node of the node identifies the closest node, and then forwards the above join request message to the responsible node; mode 2, the new node and the access node are not in the same node domain.
  • the access node obtains the routing information of the node domain where the new node is located according to the foregoing Table 2, and forwards the joining request message to the connecting node of the node domain according to the routing information.
  • the connecting node determines that the new node is determined in the local domain (specifically, may be determined by using the longest matching method described above, or may be determined according to pre-stored information), and the intra-domain algorithm is used to calculate the responsible node of the new node, and The above join request message is sent to the responsible node.
  • Step 4 The S706-receiving node returns a response message to the new node according to the routing path of the join request message after receiving the join request message, where the response message carries the identifier information of the responsible node.
  • the new node learns the identification information of the responsible node from the response message, and performs interaction with the responsible node according to the identification information to obtain a routing table of the P2P overlay network, and the new node is responsible for Data resources, etc., are added to the P2P overlay network. Moreover, after receiving the response message, the new node sends an out-of-domain broadcast message to other out-of-domain access points to notify other domains, new nodes join, and receive response messages sent by other out-of-domain nodes.
  • the P2P overlay network shown in Figure 8 is taken as an example to describe the preferred implementation of the new node joining the P2P overlay network.
  • Figure 9 shows the process power of the new node joining the P2P overlay network, as shown in Figure 9.
  • the new node joins the P2P overlay network mainly includes the following steps: Step 901: The new node obtains its node identifier. In the specific implementation process, the new node obtains the node identifier in two ways: Method 1, the new node sends a request to the configuration server, Configure the server to assign node IDs and overlay network access nodes, as shown in Figure 8. Method 2: The new node generates a node identifier according to its own IP address and other information, and the overlay network access node is manually configured. For example, the node identifier of the new node N is 01012340.
  • Step 902 the new node sends a request message to the access node of the P2P overlay network, where the join request message carries the node identifier of the new node; the access node is the new node connected to the P2P.
  • An access point of the overlay network is generally obtained by the configuration server or manually.
  • Step 903: The access node B (NodeID 01011345) queries the i or the inter-exchange table (Table 2), and matches the node identifier of the new node with the node domain ID of each node domain for the longest match, and finds the NodelD with the new node N. ( 01012340 ) The longest matching node i or ID is 01012.
  • the access node B can obtain the connected node of the node domain as the node G, and the access node B routes the join request message to the inter-domain inter-node connection node G.
  • the connection node G queries the inter-domain routing table (Table 2), and matches the node identifier of the new node with the node domain ID of each node domain for the longest match, and finds the new node N.
  • NodeID (01012340) matches the node i or ID to 01012, which is the domain where the node is located, and then finds the responsible node according to the algorithm in the domain (such as Pastry, Chord, One-Hop, etc.) (the NodelD ratio of the node responsible for the node)
  • the new node is large, NodelD and Node1D of the new node and the nearest node), after receiving the message, the node returns a response message; Steps 905 ⁇ 908, the response message is returned to the new node according to the requested routing path; 909, the new node obtains the information of the responsible node by using the response message, and interacts with the responsible node through other messages to obtain the routing table, the responsible resource data, and the like; Step 910, the new node sends an out-of-domain broadcast message to the other out-of-domain access point.
  • Step 911 other extra-domain nodes receive the above The broadcast message sends a response message to the new node.
  • the operator can separate the resource domain from the node domain when planning the overlay network, if a resource
  • the resource data of the management domain is relatively large, the number of nodes will be very large, and it can be deployed to run in multiple node domains, and the maintenance cost of the system will not be too large.
  • the overlay network can be flexibly configured according to the actual situation. Thereby improving the performance of the entire overlay network.
  • the computing device may be implemented by program code executable by the computing device, such that they may be stored in the storage device by the computing device and, in some cases, may be different from the order herein.
  • the steps shown or described are performed, or they are separately fabricated into individual integrated circuit modules, or a plurality of modules or steps are fabricated as a single integrated circuit module.
  • the invention is not limited to any specific combination of hardware and software.
  • the above is only the preferred embodiment of the present invention, and is not intended to limit the present invention, and various modifications and changes can be made to the present invention. Any modifications, equivalent substitutions, improvements, etc. made within the scope of the present invention are intended to be included within the scope of the present invention.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

La présente invention concerne un réseau superposé point à point (P2P), un procédé d'exploitation de ressources de données et un procédé pour joindre un nouveau nœud de ce réseau. Un réseau superposé P2P comprend des domaines de nœuds multiples, chaque domaine de nœud étant connecté aux autres, et les nœuds de chaque domaine de nœud étant utilisés pour mémoriser les ressources de données du réseau superposé P2P. Les ressources de données sont divisées en domaines de ressources multiples et les ressources de données mémorisées dans chaque nœud d'un domaine de nœud appartiennent au même domaine de ressources. Avec la présente invention, le temps passé pour la maintenance d'un système peut être réduit, et le réseau superposé P2P peut être configuré de manière commode.
PCT/CN2011/074167 2010-06-01 2011-05-17 Réseau superposé point à point (p2p), procédé d'exploitation de ressources de données et procédé pour joindre un nouveau nœud de ce réseau Ceased WO2011150741A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201010193254.1 2010-06-01
CN2010101932541A CN102271144A (zh) 2010-06-01 2010-06-01 P2p叠加网络及其数据资源操作方法和新节点加入方法

Publications (1)

Publication Number Publication Date
WO2011150741A1 true WO2011150741A1 (fr) 2011-12-08

Family

ID=45053307

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2011/074167 Ceased WO2011150741A1 (fr) 2010-06-01 2011-05-17 Réseau superposé point à point (p2p), procédé d'exploitation de ressources de données et procédé pour joindre un nouveau nœud de ce réseau

Country Status (2)

Country Link
CN (1) CN102271144A (fr)
WO (1) WO2011150741A1 (fr)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107306296A (zh) * 2016-04-17 2017-10-31 王正伟 域名替代使用方法
WO2021056738A1 (fr) * 2019-09-23 2021-04-01 平安科技（深圳）有限公司 Procédé, appareil et dispositif de traversée nat de système distribué et support de stockage

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111262916B (zh) * 2020-01-10 2022-11-08 深圳市网心科技有限公司 数据分布式存储方法、装置、存储节点及存储介质

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101651710A (zh) * 2009-09-21 2010-02-17 北京工业大学 基于p2p的容灾备份方法
CN101674233A (zh) * 2008-09-12 2010-03-17 中国科学院声学研究所 基于彼得森图的存储网络结构及数据读写方法
CN101710902A (zh) * 2009-12-10 2010-05-19 北京邮电大学 一种无结构p2p网络及其数据查询方法和索引更新方法

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN100383764C (zh) * 1998-01-30 2008-04-23 纽约市哥伦比亚大学托管会 交互通信中客户机-服务器交互方法和系统
US8874691B2 (en) * 2005-06-22 2014-10-28 Core Wireless Licensing S.A.R.L. System and method for establishing peer to peer connections between PCS and smart phones using networks with obstacles
CN101471838B (zh) * 2007-12-27 2012-06-27 华为技术有限公司 一种源切换的方法、系统和设备
CN101374159B (zh) * 2008-10-08 2012-05-23 中国科学院计算技术研究所 一种p2p网络可信控制方法及系统
CN101483670B (zh) * 2009-02-25 2012-02-22 南京邮电大学 基于分布式哈希表的区域化对等计算数据一致性维护方法

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101674233A (zh) * 2008-09-12 2010-03-17 中国科学院声学研究所 基于彼得森图的存储网络结构及数据读写方法
CN101651710A (zh) * 2009-09-21 2010-02-17 北京工业大学 基于p2p的容灾备份方法
CN101710902A (zh) * 2009-12-10 2010-05-19 北京邮电大学 一种无结构p2p网络及其数据查询方法和索引更新方法

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107306296A (zh) * 2016-04-17 2017-10-31 王正伟 域名替代使用方法
WO2021056738A1 (fr) * 2019-09-23 2021-04-01 平安科技（深圳）有限公司 Procédé, appareil et dispositif de traversée nat de système distribué et support de stockage

Also Published As

Publication number Publication date
CN102271144A (zh) 2011-12-07

Similar Documents

Publication Publication Date Title
US8732298B2 (en) Method and apparatus for maintaining routing information
EP2356792B1 (fr) Noeuds de réseau et procédés d'autorisation de données dans les réseaux à stockage réparti
CN101860474B (zh) 基于对等网络的资源信息处理方法及对等网络
US8233489B2 (en) System, method, and router for routing data packets in an overlay network
TW200803303A (en) Inter-proximity communication within a rendezvous federation
CN104170333A (zh) 用于快速且大规模的最长前缀匹配的方法和系统
CN103618801B (zh) 一种p2p资源共享的方法、设备及系统
WO2009089772A1 (fr) Procédé de recherche d'un dispositif de réseau et dispositif de réseau
CN104380289B (zh) 服务感知分布式散列表路由
WO2013078776A1 (fr) Établissement d'une relation de voisinage distante dans un protocole de distribution avec étiquette, ldp
CN108989220A (zh) 路由方法和路由系统
CN103139076B (zh) 分布式哈希表互通网络系统、域间节点及实现方法
WO2011150741A1 (fr) Réseau superposé point à point (p2p), procédé d'exploitation de ressources de données et procédé pour joindre un nouveau nœud de ce réseau
US20200186463A1 (en) Method and system for name-based in-networking processing
CN104539538A (zh) 路由器的ip地址匹配方法和路由器的数据包转发方法
US20150098468A1 (en) Method of controlling routing of identifier/locator mapping service
US10735316B2 (en) Receiver directed anonymization of identifier flows in identity enabled networks
CN102611718B (zh) 一个节点域支撑多个资源域的资源查找方法及系统
CN103841027B (zh) 哈希映射平面的映射信息注册和查找方法、设备及系统
Azgin et al. Hash-based overlay routing architecture for information centric networks
CN101753430B (zh) 基于路由区分符的分布式vpn路由处理装置及方法
CN101399739B (zh) 一种实现覆盖网互联的方法、系统和装置
WO2012003623A1 (fr) Procédé de traitement d'informations de ressource basé sur un réseau poste à poste, réseau poste à poste et nœud
CN121151214A (zh) 网关升级方法、系统、装置、计算机设备和存储介质
CN120186127A (zh) 去中心化网络系统的dns解析方法、设备及计算机存储介质

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 11789120

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 11789120

Country of ref document: EP

Kind code of ref document: A1