CN108337170B - Distributed resource searching method and system - Google Patents
Distributed resource searching method and system Download PDFInfo
- Publication number
- CN108337170B CN108337170B CN201810090118.6A CN201810090118A CN108337170B CN 108337170 B CN108337170 B CN 108337170B CN 201810090118 A CN201810090118 A CN 201810090118A CN 108337170 B CN108337170 B CN 108337170B
- Authority
- CN
- China
- Prior art keywords
- node
- local domain
- super
- routing information
- searched
- 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.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/74—Address processing for routing
- H04L45/745—Address table lookup; Address filtering
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/121—Shortest path evaluation by minimising delays
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The disclosure provides a distributed resource searching method and a distributed resource searching system, and relates to the field of distributed computing. The method comprises the following steps: selecting one or more nodes as super nodes in each local domain of the physical network; the super node converges the routing information of each node in the local domain to obtain a local domain routing information table, wherein the routing information of each node comprises an address in a peer-to-peer network where the node can be routed to and an address in a physical network where the node can be routed; the starting node is routed to the target node through the super node or the local domain routing information table; and the starting node downloads the resources required to be searched according to the storage addresses of the resources required to be searched, which are obtained from the target node. Compared with the prior art, the method or the system disclosed by the invention can select the routing path with shorter time delay, and the routing efficiency is improved.
Description
Technical Field
The present disclosure relates to the field of distributed computing, and in particular, to a method and a system for searching distributed resources.
Background
Currently, the use efficiency of computers is extremely low, and how to effectively utilize computing resources has become a hot issue. Meanwhile, the processing capacity of the computer doubles every 18 months, the network speed doubles every 9 months, and the feasibility and the urgency of the realization of the efficient use of resources in video processing by using the rapidly developed network technology have been widely agreed. The peer-to-peer network as a fully distributed computing model can effectively release and search network resources, thereby realizing the resource utilization efficiency of video processing.
Peer-to-peer networks can be divided into structured peer-to-peer networks and unstructured peer-to-peer networks, depending on the structure. Compared with an unstructured peer-to-peer network, the structured peer-to-peer network has the advantages of high search efficiency, search certainty and the like. The core of the structured peer-to-peer network is a peer-to-peer network routing algorithm, and the routing efficiency, expandability and fault tolerance of the peer-to-peer network routing algorithm have important values on a peer-to-peer network system.
Peer-to-peer network technology has been applied to various fields such as file storage, event notification, and cooperative work. The core of the peer-to-peer network is a peer-to-peer network routing algorithm, and the expandability and fault tolerance of the peer-to-peer network algorithm directly influence the performance of a peer-to-peer network system, so that the research on the peer-to-peer network routing algorithm has important significance. Structured peer-to-peer network routing algorithms are becoming an increasing focus of research and application due to their advantages of search determinability, simplicity, distribution, and robustness.
The geographic heterogeneity problem directly affects the routing efficiency of peer-to-peer networks, where in existing structured peer-to-peer networks, nodes select the next routing hop based on Identification (ID). The node ID is randomly generated by a hashing algorithm (i.e., the ID herein refers to a hash ID, which may be simply referred to as an ID in the description herein). The routing path of the peer-to-peer network is composed of application-level routing hops between the starting node and the target node, the routing process is independent of the IP network, the routing delay is high, the routing efficiency is low, and therefore the resource searching efficiency is reduced.
Disclosure of Invention
One technical problem that embodiments of the present disclosure solve is: a resource searching method is provided to reduce the route delay and improve the resource searching efficiency.
According to an aspect of the embodiments of the present disclosure, a distributed resource searching method is provided, including: selecting one or more nodes as super nodes in each local domain of the physical network; the super node converges the routing information of each node in the local domain to obtain a local domain routing information table, wherein the routing information of each node comprises an address in a peer-to-peer network where the node can be routed to and an address in a physical network where the node can be routed; the starting node is routed to a target node through the super node or the local domain routing information table, and a search request message is sent to the target node, wherein the search request message contains resource information needing to be searched; the target node returns the storage address of the resource to be searched to the starting node according to the resource information to be searched; and the starting node downloads the resources required to be searched according to the storage addresses of the resources required to be searched.
Optionally, after obtaining the local domain routing information table, the super node does not distribute the local domain routing information table to all nodes in the local domain where the super node is located; wherein the initiating node is routed to a target node through the supernode; or after obtaining the local domain routing information table, the super node distributes the local domain routing information table to all nodes in the local domain where the super node is located, wherein the starting node is routed to the target node through the local domain routing information table.
Optionally, in a case that the super node does not distribute the local domain routing information table to all nodes in the local domain where the super node is located, the initiating node routes to the target node through the super node or the local domain routing information table, and the step of sending the lookup request message to the target node includes: the starting node is routed to a super node in a local domain where the starting node is located, and a search request message is sent to the super node; the super node obtains the Hash mark of the resource information according to the resource information needing to be searched, searches and routes to an intermediate node which is closest to the Hash mark of the resource information in the local domain routing information table according to the Hash mark of the resource information and the local domain routing information table, and forwards the search request message to the intermediate node; and the intermediate node searches and routes to the intermediate node of the next routing hop through the super node in the local domain, wherein the intermediate node of the next routing hop is searched and routed sequentially among the nodes until the intermediate node is routed to the target node, and the search request message is forwarded to the target node.
Optionally, in a case where the super node distributes the local domain routing information table to all nodes in the local domain where the super node is located, the initiating node routes to the target node through the super node or the local domain routing information table, and the step of sending the lookup request message to the target node includes: the starting node calculates the Hash mark of the resource information according to the resource information needing to be searched, searches and routes to an intermediate node which is closest to the Hash mark of the resource information in the local domain routing information table through the Hash mark of the resource information and a local domain routing information table obtained from a super node, and sends a searching request message to the intermediate node; and the intermediate node searches and routes to the intermediate node of the next route hop through the resource information required to be searched and a local domain route information table obtained from the super node of the local domain where the intermediate node is located, wherein the intermediate node of the next route hop is searched and routed sequentially through the nodes until the intermediate node is routed to the target node, and the search request message is forwarded to the target node.
Optionally, the step of aggregating the routing information of each node in the local domain where the super node is located to obtain the local domain routing information table includes: the super node converges the routing information of each node in the local domain where the super node is located and the routing information of the next-level node of each node, thereby obtaining a local domain routing information table.
Optionally, the starting node and the target node are in the same local domain, or the starting node and the target node are in different local domains respectively.
According to another aspect of the embodiments of the present disclosure, there is provided a distributed resource lookup system, including: the system comprises a super node, an initial node and a target node; wherein one or more nodes are selected as super nodes in each local domain of the physical network; the super node is used for converging the routing information of each node in the local domain where the super node is located to obtain a local domain routing information table, wherein the routing information of each node comprises an address in a peer-to-peer network where the node can be routed to and an address in a physical network where the node is located; the starting node is used for routing to a target node through the super node or the local domain routing information table, sending a search request message to the target node, wherein the search request message contains resource information to be searched, and downloading resources to be searched according to a storage address of the resources to be searched; and the target node is used for returning the storage address of the resource to be searched to the starting node according to the resource information to be searched.
Optionally, the super node is configured to, after obtaining the local domain routing information table, not distribute the local domain routing information table to all nodes in the local domain where the super node is located; wherein the initiating node is routed to a target node through the supernode; or after obtaining the local domain routing information table, the super node is configured to distribute the local domain routing information table to all nodes in the local domain where the super node is located, where the start node is routed to the target node through the local domain routing information table.
Optionally, in a case that the super node does not distribute the local domain routing information table to all nodes in the local domain where the super node is located, the start node is configured to route to the super node in the local domain where the start node is located, and send a search request message to the super node; the super node is used for obtaining the Hash mark of the resource information according to the resource information required to be searched, searching and routing to an intermediate node which is closest to the Hash mark of the resource information in the local domain routing information table according to the Hash mark of the resource information and the local domain routing information table, and forwarding the search request message to the intermediate node; the distributed resource lookup system further comprises: the intermediate nodes are used for searching and routing to the intermediate nodes of the next routing hop through the super nodes in the local domain, wherein the intermediate nodes of the next routing hop are searched and routed sequentially among the nodes until the intermediate nodes are routed to the target node, and the searching request message is forwarded to the target node.
Optionally, in a case that the super node distributes the local domain routing information table to all nodes in a local domain in which the super node is located, the start node is configured to calculate a hash identifier of the resource information according to resource information to be searched, search and route to an intermediate node closest to the hash identifier of the resource information in the local domain routing information table through the hash identifier of the resource information and the local domain routing information table obtained from the super node, and send a search request message to the intermediate node; the distributed resource lookup system further comprises: the intermediate node is used for searching and routing to the intermediate node of the next routing hop through the resource information required to be searched and a local domain routing information table obtained from the super node of the local domain where the intermediate node is located, wherein the intermediate node of the next routing hop is searched and routed sequentially through the nodes until the intermediate node is routed to the target node, and the search request message is forwarded to the target node.
Optionally, the super node is configured to aggregate routing information of each node in a local domain where the super node is located and routing information of a next-level node of each node, so as to obtain a local domain routing information table.
Optionally, the starting node and the target node are in the same local domain, or the starting node and the target node are in different local domains respectively.
According to another aspect of the embodiments of the present disclosure, there is provided a distributed resource lookup system, including: a memory; and a processor coupled to the memory, the processor configured to perform the method as previously described based on instructions stored in the memory.
According to another aspect of embodiments of the present disclosure, there is provided a computer readable storage medium having stored thereon computer program instructions which, when executed by a processor, implement the steps of the method as previously described.
In the method or system of the above embodiment, one or more nodes are selected as super nodes in each local domain of the physical network; the super node converges the routing information of each node in the local domain to obtain a local domain routing information table, wherein the routing information of each node comprises an address in a peer-to-peer network where each node is located and an address in a physical network where each node is located; the starting node is routed to a target node through a super node or a local domain routing information table, and a search request message is sent to the target node, wherein the search request message contains resource information to be searched; the target node returns the storage address of the resource to be searched to the starting node according to the resource information to be searched; and the starting node downloads the resources required to be searched according to the storage addresses of the resources required to be searched. The distributed resource searching method integrates the addresses of the peer-to-peer network and the physical network, and the proximity of the peer-to-peer network routing table and the physical network is comprehensively considered in the process of selecting the routing path, so that compared with the prior art, the routing path with shorter time delay can be selected, and the resource searching efficiency is improved.
Other features of the present disclosure and advantages thereof will become apparent from the following detailed description of exemplary embodiments thereof, which proceeds with reference to the accompanying drawings.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments of the disclosure and together with the description, serve to explain the principles of the disclosure.
The present disclosure may be more clearly understood from the following detailed description, taken with reference to the accompanying drawings, in which:
fig. 1 is a schematic diagram that schematically illustrates a peer-to-peer network, in accordance with some embodiments.
Fig. 2 is a schematic diagram that schematically illustrates a routing path in a physical network, in accordance with some embodiments.
FIG. 3 is a flow diagram that schematically illustrates a distributed resource lookup method, in accordance with some embodiments of the present disclosure.
Fig. 4 is a schematic diagram schematically illustrating routing paths obtained according to a Super algorithm of a distributed resource lookup method according to some embodiments of the present disclosure.
Fig. 5 is a schematic diagram schematically illustrating routing paths obtained according to a Local algorithm and a Broaden algorithm, respectively, of a distributed resource lookup method according to some embodiments of the present disclosure.
FIG. 6 is a block diagram that schematically illustrates a distributed resource lookup system, in accordance with some embodiments of the present disclosure.
FIG. 7 is a block diagram that schematically illustrates a distributed resource lookup system, in accordance with further embodiments of the present disclosure.
FIG. 8 is a block diagram that schematically illustrates a distributed resource lookup system, in accordance with further embodiments of the present disclosure.
Detailed Description
Various exemplary embodiments of the present disclosure will now be described in detail with reference to the accompanying drawings. It should be noted that: the relative arrangement of the components and steps, the numerical expressions, and numerical values set forth in these embodiments do not limit the scope of the present disclosure unless specifically stated otherwise.
Meanwhile, it should be understood that the sizes of the respective portions shown in the drawings are not drawn in an actual proportional relationship for the convenience of description.
The following description of at least one exemplary embodiment is merely illustrative in nature and is in no way intended to limit the disclosure, its application, or uses.
Techniques, methods, and apparatus known to those of ordinary skill in the relevant art may not be discussed in detail but are intended to be part of the specification where appropriate.
In all examples shown and discussed herein, any particular value should be construed as merely illustrative, and not limiting. Thus, other examples of the exemplary embodiments may have different values.
It should be noted that: like reference numbers and letters refer to like items in the following figures, and thus, once an item is defined in one figure, further discussion thereof is not required in subsequent figures.
The inventors of the present disclosure found that in the existing P2P routing algorithm, a node selects the next routing hop based on a node ID, which is randomly generated by a hash algorithm. The path of the P2P route is composed of application-level routing hops between the starting node and the target node, not IP-level routing hops, the actual P2P routing efficiency is measured by end-to-end routing delay, and since the peer nodes are geographically distributed, some application-level routing hops traverse different autonomous systems, while other routing hops only go from one node to another node in the same lan. The P2P routing algorithm often selects high latency routing hops because it ignores the latency between nodes.
In a structured peer-to-peer network, each node maintains a routing table, e.g., a Chord peer node maintains a list of successor nodes. Each node in the list is a successor to the node. The ith routing table entry pointing ID of the node n is more than or equal to n +2i-1S, s is success (n + 2)i-1) I is 1. ltoreq. m (all algorithms are for 2)mModulo, m is a positive integer).
The structured peer-to-peer network may be represented as a directed graph G ═ (V, E), where V is the set of peer nodes and E is the set of directed edges. A directed edge (u, v) exists if and only if node u has an entry pointing to node v. For routing path (v)0，v1，…，vn) The peer-to-peer network routing path length is calculated as follows:
wherein: dist is the length of the routing path, | vi-vi-1Is vi-1To viThe distance of (c).
Since the peer-to-peer network routing table is established based on the node ID, the routing path is optimized in ID space but random in geographic space, however, the routing efficiency of the peer-to-peer network is measured by the time delay between end to end, and thus, the routing based on the physical network is more efficient.
Fig. 1 is a schematic diagram that schematically illustrates a peer-to-peer network, in accordance with some embodiments. Fig. 2 is a schematic diagram that schematically illustrates a routing path in a physical network, in accordance with some embodiments. Fig. 1 is an example of a Chord directed graph, in which vertices are peer nodes, edges are adjacency relationships between nodes, and thick solid lines are routing paths of the Chord algorithm. The nodes in fig. 1 are distributed in the physical network of fig. 2. The dashed line in fig. 2 is the routing path of the Chord algorithm, which corresponds to the thick solid line in fig. 1. The routing path is a → k → d → g → j → h. As can be seen from fig. 1 and fig. 2, the existing P2P route frequently selects a high-latency routing path, and the resource lookup efficiency is low.
In order to solve the problem of low routing efficiency in the prior art, embodiments of the present disclosure provide a distributed resource lookup method or system, so as to reduce routing delay and improve resource lookup efficiency. The distributed resource lookup method takes into account the proximity of peer-to-peer network routing tables and physical networks in selecting routing paths. The distributed resource lookup method according to some embodiments of the present disclosure is described in detail below with reference to the accompanying drawings.
FIG. 3 is a flow diagram that schematically illustrates a distributed resource lookup method, in accordance with some embodiments of the present disclosure. The distributed resource searching method can be applied to the searching process of the distributed video resources based on the heterogeneous environment.
In step S302, one or more nodes are selected as super nodes in each local domain of the physical network.
In step S304, the super node aggregates the routing information of each node in the local domain where the super node is located to obtain a local domain routing information table, where the routing information of each node includes an address in a peer-to-peer network where the node can be routed to and an address in a physical network where the node is located.
For example, the address in the peer-to-peer network where the node to which each node can route is located may be an ID (e.g., hash ID) of the nodes to which each node can route, and the address in the physical network where the node to which each node can route is located may be an IP (Internet Protocol) address of the nodes to which each node can route. For example, node a may route to nodes i and k, and then the routing information of node a includes: the address of node i within the peer-to-peer network (e.g., the ID of node i) and within the physical network (e.g., the IP address of node i), and the address of node k within the peer-to-peer network (e.g., the ID of node k) and within the physical network (e.g., the IP address of node k).
In step S306, the start node routes to the target node through the super node or the local domain routing information table, and sends a search request message to the target node, where the search request message includes resource information to be searched.
For example, the originating node and the target node may be within the same local domain. That is, the distributed resource lookup method can be applied to routing between nodes in the same local domain. As another example, the originating node and the target node may each be within different local domains. That is, the distributed resource lookup method may be applied to routes between cross-domain nodes.
In some embodiments, the resource information to be searched may be a resource name or attribute, or may be a Hash identifier (i.e., Hash ID) of the resource information. For example, the resources to be searched may include video resources and the like.
In step S308, the target node returns the storage address of the resource to be searched to the starting node according to the resource information to be searched.
In embodiments of the present disclosure, a resource may be published on a certain node or nodes (such a node may be referred to as a publishing node) and information of the resource may be registered on another node (such a node may be referred to as a registering node) that contains an address of the publication of the resource, i.e. an address of the publishing node (e.g. a hash ID of the node) that stores the resource, before looking up the resource. In the embodiment of the present disclosure, the target node to which the route is routed is a registered node, and in this step S308, the target node (i.e., the registered node) returns the storage address of the resource to be searched (i.e., the address of the publishing node storing the resource) to the starting node according to the resource information to be searched (e.g., the hash identifier of the resource information).
In step S310, the start node downloads the resource to be searched according to the storage address of the resource to be searched.
In step S310, the start node obtains the storage address of the resource to be searched from the target node, and then downloads the resource to be searched from the corresponding publishing node according to the storage address of the resource.
In the method of the above embodiment, one or more nodes are selected as super nodes in each local domain of the physical network; the super node converges the routing information of each node in the local domain to obtain a local domain routing information table, wherein the routing information of each node comprises an address in a peer-to-peer network where each node is located and an address in a physical network where each node is located; the starting node is routed to a target node through a super node or a local domain routing information table, and a search request message is sent to the target node, wherein the search request message contains resource information to be searched; the target node returns the storage address of the resource to be searched to the starting node according to the resource information to be searched; and the starting node downloads the resources required to be searched according to the storage addresses of the resources required to be searched. The distributed resource searching method integrates the addresses of the peer-to-peer network and the physical network, and the proximity of the peer-to-peer network routing table and the physical network is comprehensively considered in the process of selecting the routing path, so that compared with the prior art, the routing path with shorter time delay can be selected, and the resource searching efficiency is improved.
In an embodiment of the present disclosure, the distributed resource searching method may include at least one of the following three routing algorithms: super algorithm (Super algorithm), Local algorithm (Local algorithm), and Broaden algorithm (extended algorithm).
In some embodiments, after obtaining the local domain routing information table, the super node does not distribute the local domain routing information table to all nodes in the local domain where the super node is located; wherein the originating node is routed to the destination node through the supernode. This implements the Super algorithm of the distributed resource lookup method described above.
In other embodiments, after obtaining the local domain routing information table, the super node distributes the local domain routing information table to all nodes in the local domain where the super node is located, wherein the start node is routed to the target node through the local domain routing information table. This implements the Local algorithm or the Broaden algorithm of the distributed resource lookup method described above.
The three algorithms of the distributed resource searching method according to the embodiment of the present disclosure are described in detail below.
In some embodiments, in the case that the super node does not distribute the local domain routing information table to all nodes in the local domain where the super node is located, the step S306 may include: the starting node is routed to a super node in a local domain where the starting node is located, and the searching request message is sent to the super node; the super node obtains the Hash mark of the resource information according to the resource information to be searched, searches and routes to an intermediate node which is closest to the Hash mark of the resource information in the local domain routing information table according to the Hash mark of the resource information and the local domain routing information table, and forwards the search request message to the intermediate node; and the intermediate node searches and routes to the intermediate node of the next route hop through the super node in the local domain where the intermediate node is located, wherein the intermediate node of the next route hop is searched and routed sequentially between the nodes until the intermediate node is routed to the target node, and the search request message is forwarded to the target node.
In the above embodiment, a Super algorithm of the above distributed resource lookup method is provided. In the Super algorithm, after obtaining a local domain routing information table, a Super node does not distribute the local domain routing information table to all nodes in a local domain where the Super node is located; the starting node firstly routes to a super node in a local domain where the starting node is located, and sends a search request message to the super node; the super node obtains the hash mark of the resource information according to the resource information to be searched, searches and routes to an intermediate node closest to the hash mark of the resource information in the local domain routing information table according to the hash mark of the resource information and the local domain routing information table, and forwards the search request message to the intermediate node (for example, the intermediate node may be a node in the next local domain); if the intermediate node is not the target node, in the next routing hop, the intermediate node continues to route to the super node in the local domain where the intermediate node is located, and forwards the search request message to the super node; the super node searches and routes to an intermediate node of a next route hop closest to the hash mark of the resource information in the local domain routing information table according to the hash mark of the resource information needing to be searched and the local domain routing information table; and searching and routing in sequence until the target node is reached, and forwarding the searching request message to the target node.
In some embodiments, in the case that the super node distributes the local domain routing information table to all nodes in the local domain where the super node is located, the step S306 may include: the starting node calculates the Hash mark of the resource information according to the resource information needing to be searched, searches and routes to an intermediate node which is closest to the Hash mark of the resource information in the local domain routing information table through the Hash mark of the resource information and a local domain routing information table obtained from a super node, and sends a searching request message to the intermediate node; and the intermediate node searches and routes to the intermediate node of the next route hop through the resource information required to be searched and a local domain route information table obtained from the super node of the local domain where the intermediate node is located, wherein the intermediate node of the next route hop is searched and routed sequentially between the nodes until the intermediate node is routed to the target node, and the search request message is forwarded to the target node.
In the above embodiment, a Local algorithm of the above distributed resource lookup method is provided. In the Local algorithm, after obtaining a Local domain routing information table, a super node distributes the Local domain routing information table to all nodes in a Local domain where the super node is located; the starting node calculates the Hash mark of the resource information according to the resource information needing to be searched, searches and routes to an intermediate node which is closest to the Hash mark of the resource information in the local domain routing information table through the Hash mark of the resource information and a local domain routing information table obtained from a super node, and sends a search request message to the intermediate node (for example, the intermediate node is a node in the next local domain); if the intermediate node is not the target node, the intermediate node continues to obtain the hash identification of the resource information according to the resource information needing to be searched, and searches and routes to the intermediate node of the next route hop closest to the hash identification of the resource information in the local domain route information table according to the obtained local domain route information table and the hash identification of the resource information; this is routed in turn until the destination node is reached and the lookup request message is forwarded to the destination node.
It should be noted that, in some steps in which the super node or the intermediate node obtains the hash identifier of the resource information according to the resource information, if the resource information to be searched included in the search request message includes the hash identifier of the resource information, the hash identifier of the resource information may be directly obtained; if the resource information to be searched included in the search request message does not include the hash identifier of the resource information, but includes a keyword (e.g., a name or an attribute) of the resource information, the super node or the intermediate node may perform hash calculation on the keyword of the resource information to obtain the hash identifier of the resource information.
In the above Super algorithm and Local algorithm, the routing information of each node in the Local domain where the Super node is located, which is aggregated by the Super node, is the routing information of the node at this level (i.e. the current node), and the routing information of the node at the next level of each node is not aggregated (here, the node at the next level refers to the node to which the current node is routed). For example, in the Super algorithm and the Local algorithm, the node e in fig. 2 is used as a Super node, and the Super node e aggregates the routing information of the nodes a to e (the nodes a to e are used as the nodes of the current stage), and does not aggregate the routing information of the next-stage node i or k to which the node a is routed. The Broaden algorithm is different from the Local algorithm in that in the Broaden algorithm, a super node aggregates routing information of each node in a Local domain where the super node is located and routing information of a next-level node of each node to obtain a Local domain routing information table. For example, in the Broaden algorithm, the node e in fig. 2 is taken as a super node, and the super node e needs to aggregate the routing information of the nodes a to e (the nodes a to e are taken as the nodes of this stage), for example, the routing information of the next-stage node i or k to which the node a is routed.
In some embodiments, the step S304 may include: the super node converges the routing information of each node in the local domain where the super node is located and the routing information of the next-level node of each node, thereby obtaining a local domain routing information table.
In some embodiments of the present disclosure, a Broaden algorithm of the distributed resource lookup method described above is provided. In the Broaden algorithm, a super node converges the routing information of each node in the local domain where the super node is located and the routing information of the next-level node of each node so as to obtain a local domain routing information table; after obtaining the routing information table of the local domain, the super node distributes the routing information table of the local domain to all nodes in the local domain where the super node is located; the starting node calculates the Hash identification of the resource information according to the resource information needing to be searched, searches and routes to an intermediate node which is closest to the Hash identification of the resource information in a local domain routing information table obtained from a super node through the local domain routing information table, and sends a search request message to the intermediate node (for example, the intermediate node is a node in the next local domain); if the intermediate node is not the target node, the intermediate node continues to obtain the hash identification of the resource information according to the resource information needing to be searched, and searches and routes to the intermediate node of the next route hop closest to the hash identification of the resource information in the local domain route information table according to the obtained local domain route information table and the target node information; this is routed in turn until the destination node is reached and the lookup request message is forwarded to the destination node.
The three distributed resource searching methods are described below in the form of a matrix. Before describing the above distributed resource lookup method, we will describe the Chord peer-to-peer network and the clustered physical network as a connection matrix.
(I) Peer-to-peer network connection matrix
A Chord peer-to-peer network may be represented as a directed graph G ═ V, E, V being the set of peer nodes and E being the set of directed edges. The connection matrix of the graphs (V, E) is represented as follows:
R＝{r1,r2,...,ri,...,rn}T i＝1,...,n (2)
vector riBy node vi,viAnd e.V maintenance. Vector riContains n entries, which can be represented by equation (3).
ri＝{ri1,ri2,...,rij,...,rin} i＝1,...,n；j＝1,...,n (3)
Wherein
For example, the exemplary peer-to-peer network shown in fig. 1 may be given by equation (4):
(II) physical network connection matrix
In the distributed resource searching method, nodes which are physically adjacent and belong to the same local domain are grouped into a class, one or more super nodes are arranged in the cluster (namely, one or more super nodes are arranged in one local domain), and the super nodes point to all client nodes (the client nodes refer to nodes except the super nodes) in the cluster (namely, the local domain). At the same time, each client node points to a supernode. Thus, the clustered physical network is defined as follows:
for a peer-to-peer network directed graph G ═ (V, E), there is V1,V2,…,VkAnd satisfies the following conditions:
(i)Vi∩Vj＝Φ,1<i,j≤k,
(ii)
v is thenl，vmIn physical proximity.
(a) We call the physical network where the peer-to-peer network is located a clustered physical network.
(b)
ViCan also be represented as V (V)l)。
(c)
ViOne or more super nodes are present therein. The super node maintains client node information. ViIs associated with a super node.
(d) The routing table of the client node is denoted ti。
The clustered physical network is given by equation (5):
T＝{t1,t2,...,ti,...,tn}T i＝1,...,n (5)
tifurther given by equation (6):
ti＝{ti1,ti2,...,tij,...,tin} i＝1,...,n；j＝1,...,n (6)
wherein:
for example, the connection matrix of the physical network in fig. 2 can be given by equation (7):
as can be seen from T in equation (7), the physical network shown in fig. 2 has clusters of three neighboring nodes. The three clusters are: v1＝{a,b,c,d,e}，V2＝{f,g,h,i}，V3J, k. Matrix T2And (4) representing that full connection is realized between the nodes in the cluster, namely each node and other nodes in the cluster are neighbors. t is t2 ijIs a matrix T2Element of row i, column j, t2 ijThe value is given by equation (8):
the addition operation and the multiplication operation in expression (8) are boolean operations. For the physical network shown in FIG. 2, T2Can be expressed as:
let PC＝R，PS＝R+T，PL＝R+T2，PB＝R×T2。
PC,ij、PS,ij、PL,ij、PB,ijAre respectively a matrix PC、PS、PL、PBRow i and column j element values.
The distributed resource lookup method of the disclosed embodiments combines the advantages of both the super peer-to-peer network routing algorithm and the neighbor routing algorithm. The combination of the two algorithms is embodied in the combined relationship of the matrices R and T. How R and T are combined largely determines the routing efficiency of the routing algorithm of the disclosed embodiments. The three routing algorithms of the embodiment of the present disclosure, i.e., the Super algorithm, the Local algorithm, and the Broaden algorithm, are described in detail below.
Super algorithm: the connection matrix of the algorithm is PSR + T. The client node (as the starting node) submits the search request to the super node and maintains a client node list t through the super nodesSpeeding up the routing process. The pseudo-code of the algorithm is as follows:
the pseudo codes in lines 1-2 of the Super algorithm are used for judging whether a target node is found or not, if the target node is not found,selecting the next route jump v by the pseudo code of the 4 th to 5 th lineskSatisfying that key (key) is less than or equal to node ID (v)k) And node ID (v)k) The closest key among all the neighbor nodes. For example, the key may be resource information that needs to be searched. Line 6 pseudo code submits a lookup request to supernode vs. The 7 th to 8 th lines of pseudo codes are used for searching the node vlThe node vlIs closest to the key in the ID list maintained by the super node, the key is less than or equal to the node ID (v)l). Line 9 pseudo code comparison vkAnd vlAnd the node with the key closer to the node with the key is the next route hop node.
The Super algorithm effectively improves the routing efficiency. The algorithm has the advantages of light weight and easy implementation because the client node only needs to maintain a peer-to-peer network routing table and a pointer to the super node.
The Local algorithm: the connection matrix of the algorithm is PL＝R+T2. Each client node points to other peer nodes within the cluster (i.e., local domain). Compared with the Super algorithm, Local realizes load balancing better, and the search request does not need to be submitted to the Super node. The following is pseudo code for the Local algorithm routing process:
the pseudo codes of lines 1-2 of the Local algorithm are used for judging whether a target node is found. If the target node is not found, the pseudo codes in lines 4-5 are used for selecting the next route hop vkSatisfies key ≦ node ID (v)k) And v iskThe closest key among all the neighbor nodes.
The Broaden algorithm: the connection matrix of the algorithm is PB＝R×T2. The pseudo code for the Broaden algorithm is as follows:
as can be seen above, the pseudo-generation of the Broaden algorithmThe code is substantially similar to the pseudo-code of the Local algorithm. The pseudo codes of lines 1-2 of the Broaden algorithm are used for judging whether a target node is found. If the target node is not found, the pseudo codes in lines 4-5 are used for selecting the next route hop vkSatisfies key ≦ node ID (v)k) And v iskThe closest key among all the neighbor nodes.
In the Broaden algorithm, each node points to other nodes and their neighbors in the same group. Because the number of neighbors of each node is much larger than that of the Super algorithm and the Local algorithm, the routing efficiency of the Broaden algorithm is higher than that of the Super algorithm and the Local algorithm. The routing process of the Broaden algorithm is similar to that of the Local algorithm, but the connection matrix of the Broaden algorithm is different from that of the Local algorithm.
Fig. 4 is a schematic diagram schematically illustrating routing paths obtained according to a Super algorithm of a distributed resource lookup method according to some embodiments of the present disclosure. The scenario of the routing path shown in fig. 4 is: the distribution of nodes on the physical network may be as shown in fig. 2, with the peer-to-peer network topology shown in fig. 1 maintained among the nodes, and with node a seeking node h. The solid and dashed lines of fig. 4 are the routing paths of the Super algorithm and the prior art algorithm (e.g. Chord algorithm), respectively. A local domain A, B, C and a network transport domain D, E are shown in fig. 4. The large nodes in FIG. 4 are super nodes (e.g., nodes e, i, and k) and the small nodes are client nodes (e.g., nodes a, b, c, d, f, g, h, and j). The routing steps of the Super algorithm are as follows:
(1) customer node a as the originating node looks up Chord routing table raAnd creates a message msg (key)h) Therein keyhThe resource information to be searched is a keyword. This step corresponds to lines 4-6 pseudo code of the Super algorithm.
(2) The start node a sends a message msg (key)h) To the supernode e.
(3) The super node e according to the keyhCalculating to obtain the Hash ID of the resource information needing to be searched, and listing t in the client nodeeFind ID and key inhNode ID nearest. In the given example, the ID and key of intermediate node chHash ID ofAnd (4) approaching. This step corresponds to pseudo code lines 7-9 of the Super algorithm.
(4) Node e routes the message to c. c, continuing to execute the step (1). This step corresponds to the pseudo code line 10 of the Super algorithm.
Because the super node e gathers the routing information of all nodes a-e in the local domain A, the super node can search the hash mark of the resource information and the local domain routing information table (including Chord routing table r) according to the requirementaAnd a client node list te) Searching and routing to an intermediate node c which is closest to the hash identification of the resource information needing to be searched in the local domain routing information table, and forwarding the searching request message to the intermediate node c.
The above steps are repeatedly executed until the target node h is found, so the routing path of the Super algorithm is a → e → c → f → i → h. This path is shown in solid lines in fig. 4. It should be noted that the intermediate node c is not routed to the super node e, but is routed to the intermediate node f. Compared with the routing path in the prior art, the Super algorithm of the distributed resource searching method in the embodiment of the disclosure can select the routing path with lower time delay, thereby improving the routing efficiency and further providing the resource searching efficiency.
Fig. 5 is a schematic diagram schematically illustrating routing paths obtained according to a Local algorithm and a Broaden algorithm, respectively, of a distributed resource lookup method according to some embodiments of the present disclosure. The solid and dashed lines shown in fig. 5 are the routing paths of the Local algorithm and the Broaden algorithm, respectively.
As shown in fig. 5, in the Local algorithm, since each node in the cluster (i.e., Local domain) points to other nodes in the cluster, the client node does not need to route the lookup request to a Super node, and thus the routing efficiency of the Local algorithm is higher than that of the Super algorithm. The routing steps of the Local algorithm are as follows:
(1) the home node a obtains a routing information table (e.g., including a routing table r) in the local domain from the super node eaAnd ta) Key word key for searching and resource informationhThe ID closest to the hash ID of (1). Wherein, the node ID and key of the intermediate node chIs closest.This step corresponds to pseudo code lines 4-5 of the Local algorithm.
(2) The originating node a routes the lookup request to the intermediate node c. This step corresponds to line 6 pseudo code of the Local algorithm.
(3) The intermediate node c continues to perform (1).
The steps are repeatedly executed until the target node h is found. The routing path of the Local algorithm is as follows: a → c → f → h. This routing path is shown in solid lines in fig. 5.
The routing process of the Broaden algorithm is similar to the Local algorithm. The Broaden algorithm has much larger neighbor nodes than the Super algorithm and the Local algorithm, so the Broaden algorithm has better routing efficiency. As can be seen from FIG. 1, although node b is a distance keyhFar away, but rbOne entry in it points to node h (see fig. 1). Since node a maintains the routing tables of other nodes in the local domain, it also includes the routing table of node b. The search request is routed directly from the start node a to the destination node h containing the information of the resource to be searched, and therefore, the routing path of the Broaden algorithm is a → h, and the routing path is shown by the dotted line in fig. 5.
FIG. 6 is a block diagram that schematically illustrates a distributed resource lookup system, in accordance with some embodiments of the present disclosure. As shown in fig. 6, the distributed resource search system can be applied to a search process of distributed video resources based on heterogeneous environments. The distributed resource lookup system may include a super node 602, an originating node 604, and a target node 608. The originating node 604 and the target node 608 may be within the same local domain, or the originating node 604 and the target node 608 may be within different local domains, respectively.
One or more nodes are selected as supernodes in each local domain of the physical network. The super node 602 may be configured to aggregate routing information of each node (including the super node itself and other client nodes) in the local domain where the super node is located to obtain a local domain routing information table, where the routing information of each node includes an address in a peer-to-peer network where the node can be routed to and an address in a physical network where the node is located.
The start node 604 may be configured to route to a target node through a super node or a local domain routing information table, send a search request message to the target node, where the search request message includes information of a resource to be searched, and download the resource to be searched according to a storage address of the resource to be searched.
The target node 608 may be configured to return the storage address of the resource to be searched to the start node 604 according to the information of the resource to be searched.
In the system of the above embodiment, the super node aggregates the routing information of each node in the local domain where the super node is located to obtain a local domain routing information table, where the routing information of each node includes an address in a peer-to-peer network where the node is located and an address in a physical network where the node is located; the starting node is routed to a target node through a super node or a local domain routing information table, and a search request message is sent to the target node, wherein the search request message contains resource information to be searched; the target node returns the storage address of the resource to be searched to the starting node according to the resource information to be searched; and the starting node downloads the resources required to be searched according to the storage addresses of the resources required to be searched. The distributed resource searching system integrates the addresses of the peer-to-peer network and the physical network, and the proximity of the peer-to-peer network routing table and the physical network is comprehensively considered in the process of selecting the routing path, so that compared with the prior art, the distributed resource searching system can select the routing path with shorter time delay and improve the resource searching efficiency.
In some embodiments, the super node 602 may be configured to not distribute the local domain routing information table to all nodes within the local domain in which the super node is located after obtaining the local domain routing information table. The originating node may be routed through the supernode to the target node.
In other embodiments, the super node 602 may be configured to distribute the local domain routing information table to all nodes within the local domain in which the super node is located after obtaining the local domain routing information table. The originating node may route to the destination node through the local domain routing information table.
In some embodiments, in the case where a super node does not distribute a local domain routing information table to all nodes within the local domain in which the super node is located, the originating node may be configured to route to the super node within the local domain in which the originating node is located and send a lookup request message to the super node. The super node may be configured to obtain the hash identifier of the resource information according to the resource information that needs to be searched, search and route to an intermediate node closest to the hash identifier of the resource information in the local domain routing information table according to the hash identifier of the resource information and the local domain routing information table, and forward the search request message to the intermediate node.
In some embodiments, as shown in fig. 6, the distributed resource lookup system may further include: the intermediate node 606 may be configured to find and route to an intermediate node of the next routing hop through the super nodes in the local domain where the intermediate node of the next routing hop is found and routed sequentially between the nodes until the destination node 608 is reached, and forward the search request message to the destination node.
In some embodiments, in a case where the super node distributes the local domain routing information table to all nodes in the local domain where the super node is located, the start node may be configured to calculate a hash identifier of the resource information according to the resource information to be searched, search and route to an intermediate node closest to the hash identifier of the resource information in the local domain routing information table, through the local domain routing information table obtained from the super node, and send a search request message to the intermediate node.
In some embodiments, the distributed resource lookup system may further include: the intermediate node can be used for searching and routing to the intermediate node of the next routing hop through the resource information required to be searched and a local domain routing information table obtained from the super node of the local domain where the intermediate node is located, wherein the intermediate node of the next routing hop is searched and routed sequentially between the nodes until the intermediate node is routed to the target node, and the searching request message is forwarded to the target node.
In some embodiments, the super node 602 may be configured to aggregate the routing information of each node in the local domain where the super node is located and the routing information of the next node of each node, so as to obtain the local domain routing information table.
FIG. 7 is a block diagram that schematically illustrates a distributed resource lookup system, in accordance with further embodiments of the present disclosure. The distributed resource lookup system includes a memory 710 and a processor 720. Wherein:
the memory 710 may be a magnetic disk, flash memory, or any other non-volatile storage medium. The memory is used for storing the instructions in the embodiment corresponding to fig. 3. In some embodiments, the memory 710 and processor 720 may be located in each node.
In one embodiment, as also shown in FIG. 8, the distributed resource lookup system 800 includes a memory 810 and a processor 820. The processor 820 is coupled to the memory 810 by a BUS 830. The distributed resource lookup system 800 may also be coupled to an external storage device 850 via a storage interface 840 to facilitate the retrieval of external data, and may also be coupled to a network or another computer system (not shown) via a network interface 860, which will not be described in detail herein. In some embodiments, the memory 810, processor 820, BUS BUS 830, storage interface 840, external storage 850, and network interface 860 may be provided in each node.
In the embodiment, the data instruction is stored in the memory, and the instruction is processed by the processor, so that the routing delay can be reduced, and the resource searching efficiency is improved.
In another embodiment, the present invention further provides a computer-readable storage medium having stored thereon computer program instructions, which when executed by a processor, implement the steps of the method in the corresponding embodiment of fig. 3. As will be appreciated by one skilled in the art, embodiments of the present invention may be provided as a method, apparatus, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable non-transitory storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
Thus far, the present invention has been described in detail. Some details well known in the art have not been described in order to avoid obscuring the concepts of the present invention. It will be fully apparent to those skilled in the art from the foregoing description how to practice the presently disclosed embodiments.
The method and system of the present invention may be implemented in a number of ways. For example, the methods and systems of the present invention may be implemented in software, hardware, firmware, or any combination of software, hardware, and firmware. The above-described order for the steps of the method is for illustrative purposes only, and the steps of the method of the present invention are not limited to the order specifically described above unless specifically indicated otherwise. Furthermore, in some embodiments, the present invention may also be embodied as a program recorded in a recording medium, the program including machine-readable instructions for implementing a method according to the present invention. Thus, the present invention also covers a recording medium storing a program for executing the method according to the present invention.
Although some specific embodiments of the present invention have been described in detail by way of illustration, it should be understood by those skilled in the art that the above illustration is only for the purpose of illustration and is not intended to limit the scope of the invention. It will be appreciated by those skilled in the art that modifications may be made to the above embodiments without departing from the scope and spirit of the invention. The scope of the invention is defined by the appended claims.
Claims (6)
1. A distributed resource searching method comprises the following steps:
selecting one or more nodes as super nodes in each local domain of the physical network;
the super node converges the routing information of each node in the local domain to obtain a local domain routing information table, wherein the routing information of each node comprises an address in a peer-to-peer network where the node can be routed to and an address in a physical network where the node can be routed to, and the super node converges the routing information of each node in the local domain where the super node is located and the routing information of the next-level node of each node, so that the local domain routing information table is obtained; after obtaining a local domain routing information table, the super node distributes the local domain routing information table to all nodes in a local domain where the super node is located, wherein an initial node is routed to a target node through the local domain routing information table;
the starting node is routed to a target node through the local domain routing information table, and a search request message is sent to the target node, wherein the search request message contains resource information to be searched; wherein, the starting node routes to the target node through the local domain routing information table, and the step of sending the search request message to the target node comprises the following steps: the starting node calculates the Hash mark of the resource information according to the resource information needing to be searched, searches and routes to an intermediate node which is closest to the Hash mark of the resource information in the local domain routing information table through the Hash mark of the resource information and a local domain routing information table obtained from a super node, and sends a searching request message to the intermediate node; the intermediate node searches and routes to the intermediate node of the next route hop through the resource information to be searched and a local domain route information table obtained from the super node of the local domain where the intermediate node is located, wherein the intermediate node of the next route hop is searched and routed sequentially between the nodes until the intermediate node is routed to the target node, and the search request message is forwarded to the target node;
the target node returns the storage address of the resource to be searched to the starting node according to the resource information to be searched; and
and the starting node downloads the resources required to be searched according to the storage addresses of the resources required to be searched.
2. The distributed resource lookup method of claim 1 wherein,
the starting node and the target node are in the same local domain, or the starting node and the target node are in different local domains respectively.
3. A distributed resource lookup system, comprising:
the system comprises a super node, an initial node and a target node;
wherein one or more nodes are selected as super nodes in each local domain of the physical network; the super node is used for converging the routing information of each node in the local domain where the super node is located to obtain a local domain routing information table, wherein the routing information of each node comprises an address in a peer-to-peer network where the node can be routed to and an address in a physical network where the node is located, and the super node is used for converging the routing information of each node in the local domain where the super node is located and the routing information of a next-level node of each node to obtain the local domain routing information table; the super node is used for distributing a local domain routing information table to all nodes in a local domain where the super node is located after the super node obtains the local domain routing information table, wherein the starting node is routed to a target node through the local domain routing information table;
the starting node is used for routing to a target node through the local domain routing information table, sending a search request message to the target node, wherein the search request message contains resource information to be searched, and downloading resources to be searched according to storage addresses of the resources to be searched, the starting node is used for calculating hash marks of the resource information according to the resource information to be searched, searching and routing to an intermediate node closest to the hash marks of the resource information in the local domain routing information table through the hash marks of the resource information and the local domain routing information table obtained from a super node, and sending the search request message to the intermediate node;
the target node is used for returning the storage address of the resource to be searched to the starting node according to the resource information to be searched;
the distributed resource lookup system further comprises:
the intermediate node is used for searching and routing to the intermediate node of the next routing hop through the resource information required to be searched and a local domain routing information table obtained from the super node of the local domain where the intermediate node is located, wherein the intermediate node of the next routing hop is searched and routed sequentially through the nodes until the intermediate node is routed to the target node, and the search request message is forwarded to the target node.
4. The distributed resource lookup system of claim 3 wherein,
the starting node and the target node are in the same local domain, or the starting node and the target node are in different local domains respectively.
5. A distributed resource lookup system, comprising:
a memory; and
a processor coupled to the memory, the processor configured to perform the method of any of claims 1-2 based on instructions stored in the memory.
6. A computer-readable storage medium having stored thereon computer program instructions which, when executed by a processor, implement the steps of the method of any one of claims 1 to 2.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810090118.6A CN108337170B (en) | 2018-01-30 | 2018-01-30 | Distributed resource searching method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810090118.6A CN108337170B (en) | 2018-01-30 | 2018-01-30 | Distributed resource searching method and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108337170A CN108337170A (en) | 2018-07-27 |
| CN108337170B true CN108337170B (en) | 2021-08-17 |
Family
ID=62926413
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810090118.6A Active CN108337170B (en) | 2018-01-30 | 2018-01-30 | Distributed resource searching method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108337170B (en) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109617989B (en) * | 2018-12-28 | 2021-11-26 | 浙江省公众信息产业有限公司 | Method, apparatus, system, and computer readable medium for load distribution |
| CN109450781B (en) * | 2018-12-29 | 2021-08-06 | 深圳市网心科技有限公司 | Mail communication method based on distributed network and related device |
| CN110442773B (en) * | 2019-08-13 | 2023-07-18 | 深圳市网心科技有限公司 | Node caching method, system and device in distributed system and computer medium |
| CN112054953B (en) * | 2020-09-15 | 2022-11-11 | 深圳市健成云视科技有限公司 | Multimedia instant messaging method, system, terminal equipment and computer storage medium |
| CN112702270B (en) * | 2020-12-18 | 2023-05-02 | 深圳赛安特技术服务有限公司 | Node calling method, system and storage medium based on event distribution mechanism |
| CN112766650A (en) * | 2020-12-31 | 2021-05-07 | 北京嘀嘀无限科技发展有限公司 | Method and device for determining scheduling scheme |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1731742A (en) * | 2005-08-26 | 2006-02-08 | 南京邮电大学 | Distributed hash table in opposite account |
| CN101867527A (en) * | 2010-07-06 | 2010-10-20 | 重庆大学 | Layering Chord routing method based on physical position |
| CN101938425A (en) * | 2010-09-19 | 2011-01-05 | 周维 | Method for delaying dynamic optimization in structuralized P2P system |
| CN106202303A (en) * | 2016-06-30 | 2016-12-07 | 南京邮电大学 | A kind of Chord routing table compression method and optimization file search method |
Family Cites Families (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7468952B2 (en) * | 2005-11-29 | 2008-12-23 | Sony Computer Entertainment Inc. | Broadcast messaging in peer to peer overlay network |
| CN101127758B (en) * | 2006-08-16 | 2010-08-04 | 华为技术有限公司 | IP address acquisition method and acquisition system for mobile nodes |
| CN101399743B (en) * | 2007-09-28 | 2011-09-14 | 华为技术有限公司 | Method and system for searching data in P2P network base on distributed Hash table |
| CN101860559B (en) * | 2009-04-08 | 2014-11-05 | 中兴通讯股份有限公司 | Peer-to-peer network and resource information backup operation method based on same |
| CN101860474B (en) * | 2009-04-08 | 2015-07-22 | 中兴通讯股份有限公司 | Peer-to-peer network and resource information processing method based on same |
| CN101714996B (en) * | 2009-12-31 | 2013-08-07 | 中兴通讯股份有限公司 | Authentication system and method based on peer-to-peer computing network |
| CN101895958A (en) * | 2010-03-30 | 2010-11-24 | 华为终端有限公司 | Method and device for self-establishing route in mobile network |
| WO2012129794A1 (en) * | 2011-03-30 | 2012-10-04 | 青岛海信传媒网络技术有限公司 | Communication method, network node and network super node in a peer-to-peer (p2p) network |
| CN103095727B (en) * | 2013-02-07 | 2015-10-21 | 北京邮电大学 | P2p resource location method |
| CN103179045B (en) * | 2013-02-07 | 2016-04-13 | 北京邮电大学 | Support the resource node selecting method of P2P flow optimization |
| CN106210090B (en) * | 2016-07-18 | 2019-06-11 | 山东浪潮人工智能研究院有限公司 | The method for searching network services of double-layer circular routing infrastructure based on P2P network |
-
2018
- 2018-01-30 CN CN201810090118.6A patent/CN108337170B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1731742A (en) * | 2005-08-26 | 2006-02-08 | 南京邮电大学 | Distributed hash table in opposite account |
| CN101867527A (en) * | 2010-07-06 | 2010-10-20 | 重庆大学 | Layering Chord routing method based on physical position |
| CN101938425A (en) * | 2010-09-19 | 2011-01-05 | 周维 | Method for delaying dynamic optimization in structuralized P2P system |
| CN106202303A (en) * | 2016-06-30 | 2016-12-07 | 南京邮电大学 | A kind of Chord routing table compression method and optimization file search method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108337170A (en) | 2018-07-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108337170B (en) | Distributed resource searching method and system | |
| Rosensweig et al. | On the steady-state of cache networks | |
| US10091012B2 (en) | System and method for multi-source multicasting in content-centric networks | |
| KR20160076445A (en) | System and method for efficient name-based content routing using link-state information in information-centric networks | |
| US9503358B2 (en) | Distance-based routing in an information-centric network | |
| CN104247371A (en) | Name-based neighbor discovery and multi-hop service discovery in information-centric networks | |
| EP2983340B1 (en) | Explicit strategy feedback in name-based forwarding | |
| JP2016059039A (en) | Interest keep alive in intermediate router in ccn | |
| WO2011054248A1 (en) | System and method for broadcasting message in structured peer-to-peer network | |
| US20120317275A1 (en) | Methods and devices for node distribution | |
| JP2008234563A (en) | Overlay management device, overlay management system, overlay management method, and program for managing overlay | |
| CN109617989B (en) | Method, apparatus, system, and computer readable medium for load distribution | |
| WO2011116502A1 (en) | Indexing server and method therefor | |
| JP2015220699A (en) | Method for searching cache node | |
| Kawaguchi et al. | Self-refining skip graph: Skip graph approaching to an ideal topology | |
| Hemmati et al. | Making name-based content routing more efficient than link-state routing | |
| WO2012133211A1 (en) | Data transfer device and data transfer method | |
| Garcia-Luna-Aceves et al. | CORD: Content oriented routing with directories | |
| Ando et al. | FRT-2-Chord: A DHT supporting seamless transition between one-hop and multi-hop lookups with symmetric routing table | |
| Moeini et al. | Summarization in semantic based service discovery in dynamic iot-edge networks | |
| JP2006221457A (en) | Servant for replication control in pure p2p communication, replication control method for the same, and program | |
| Zhang et al. | Decision-making for in-network caching of Peer-to-Peer content chunks-An analytical modelling study | |
| JP5287500B2 (en) | Node device and program for node device | |
| Miao et al. | Super node routing strategy in content-centric networking | |
| Suresh et al. | A Comparative Performance Analysis of AOMDV and PAR Algorithms for Mobile Ad Hoc Networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |