WO2008128450A1 - Procédé et système de publication de contenu, procédé et système de demande de contenu - Google Patents
Procédé et système de publication de contenu, procédé et système de demande de contenu Download PDFInfo
- Publication number
- WO2008128450A1 WO2008128450A1 PCT/CN2008/070343 CN2008070343W WO2008128450A1 WO 2008128450 A1 WO2008128450 A1 WO 2008128450A1 CN 2008070343 W CN2008070343 W CN 2008070343W WO 2008128450 A1 WO2008128450 A1 WO 2008128450A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- content
- node
- network
- super
- common node
- Prior art date
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
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/10—File systems; File servers
- G06F16/13—File access structures, e.g. distributed indices
- G06F16/134—Distributed indices
-
- 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/1061—Peer-to-peer [P2P] networks using node-based peer discovery mechanisms
- H04L67/1065—Discovery involving distributed pre-established resource-based relationships among peers, e.g. based on distributed hash tables [DHT]
-
- 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/1087—Peer-to-peer [P2P] networks using cross-functional networking aspects
- H04L67/1093—Some peer nodes performing special functions
-
- 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
Definitions
- the present invention relates to network technologies, and to a method and system for content and a method and system for finding content. Background technique
- a hierarchical network As more and more nodes join the peer-to-peer (P2P, Peer to Peer) network, in order to make the most powerful nodes in the P2P network play the biggest role, the concept of hierarchical P2P network is proposed.
- ordinary nodes can be grouped into multiple common node networks according to different regions, and then a super node is set for each common network. This super node can be selected from each common node network.
- the node can also be a more powerful node configured for each common node network; then the super nodes are composed into multiple super node networks, and then a more powerful super node is set for each super node network.
- a hierarchical network is formed; for example, a P2P network, an Internet Protocol Television (IPTV) network, etc. can organize the network in a hierarchical manner.
- IPTV Internet Protocol Television
- a common node and a super node are included, wherein a common node in a common node network only needs to store index information of content in the common node network in a distributed manner, and There are a large number of common nodes in a common node network, so there is not much index information that needs to be saved for each common node; and a super node in a super node network needs to store all the contents of the ordinary node network managed by it in a distributed manner.
- the index information while the number of super nodes is relatively small, so each super node needs to store more index information.
- An existing method for distributing content is: a common node that saves content publishes the content on a common node network to which the ordinary node belongs; publishes the content on the super node network; and when the super node network issues content, the content index information Saved in the super node network; and every time a normal node publishes a new content, it not only needs to add the content to the ordinary node that should save the index of the content. In addition, you need to add an index to the content on the super node where the index of the content should be saved.
- the inventor has found that the prior art has at least the following drawbacks:
- the super node in the super node network needs to store the index information of all the contents in the network of the ordinary node that it manages, so that each super node needs to store more index information. It greatly occupies the limited storage space of the super node; and every time a common node publishes a content, the super node needs to create or update the index of the content, and the number of common nodes is relatively large, thereby causing the index update of the super node. Frequently, it increases the processing load of the super node. Summary of the invention
- the embodiment of the present invention provides a method and system for distributing content, and a method and system for searching for content.
- the technical solution provided by the embodiment of the present invention does not need to save index information.
- An embodiment of the present invention provides a method for publishing content, including:
- the ordinary node storing the content issues the content in the first common node network to which the ordinary node belongs;
- the super node issues the content on a second common node network managed by the super node.
- the embodiment of the invention further provides a method for searching for content, including:
- the ordinary node that needs to find the content searches for the index information of the content in the third common node network to which the ordinary node belongs; searches for the super node corresponding to the content in the super node network; the super node corresponding to the content is in the The common node network managed by the super node searches for index information corresponding to the content; and returns index information corresponding to the content to a common node that needs to find content.
- the embodiment of the invention further provides a system for publishing content, including:
- a first common node network configured to save index information of the content in the first common node network when the content is published, and send the first trigger information to the super node network;
- a super node network configured to receive first trigger information of the first common node network, search for a second super node corresponding to the content in the super node network, and manage the second super node
- the second common node network sends the second trigger information
- a second common node network configured to: after receiving the second trigger information of the super node network, The second common node network saves index information of the content.
- the embodiment of the invention further provides a system for searching for content, including:
- a third common node network configured to search for index information of the content and receive index information of the content in the third common node network
- a super node network configured to: when the third common node network cannot find the index information of the content, searching, in the super node network, a second super node corresponding to the content, to the second super node
- the managed second common node network sends trigger information
- a second common node network configured to: after receiving trigger information of the super node network, search for index information of the content in the second common node network, and send the content to the third common node network Index information.
- the embodiment of the invention further provides a network device, including:
- An information receiving unit configured to receive trigger information, where the trigger information includes a content identifier that uniquely determines the content
- a key value generating unit configured to generate the content according to the content identifier received by the information receiving unit
- a common node search unit is configured to find a common node corresponding to the key value generated by the key value generating unit.
- the embodiment since the content that should be distributed on the super node network is released to the common node network managed by the super node, the embodiment should be saved by the super node.
- the index information is stored in the common node network managed by the super node, and the index information corresponding to the content can be searched from the common node network, so that the super node does not need to save the index information, thereby reducing the occupation of the limited space of the super node.
- FIG. 1 is a specific flowchart of a first embodiment of a method for distributing content according to the present invention
- FIG. 2 is a specific flowchart of a second embodiment of a method for distributing content according to the present invention
- FIG. 3 is a specific flowchart of a first embodiment of a method for finding content according to the present invention.
- FIG. 4 is a specific flowchart of a second embodiment of a method for searching for content according to the present invention.
- Figure 5 is a structural diagram of a first embodiment of the network device of the present invention
- Figure 6 is a structural diagram of a second embodiment of the network device of the present invention
- Figure 7 is a structural diagram of a first embodiment of a system for distributing contents of the present invention.
- Figure 8 is a structural diagram of a second embodiment of the system for distributing the content of the present invention.
- FIG. 9 is a structural diagram of a first embodiment of a system for finding content according to the present invention.
- Figure 10 is a block diagram showing a third embodiment of the system for finding contents of the present invention. detailed description
- the first embodiment of the method for distributing content provided by the present invention includes:
- the common node storing the content issues content in the first common node network to which the ordinary node belongs;
- the super node issues the content in a second common node network managed by the super node; after finding the super node corresponding to the content, the super node issues content on the second common node network managed by the super node;
- the second embodiment of the method for distributing content includes:
- the first common node that stores the content generates a first key value of the content.
- the first common node generates a first key value of the content according to the preset first key value generation algorithm, and the preset algorithm may be a hash algorithm, a message digest algorithm, etc., as long as the unique key value can be generated for the content, and the same
- the algorithm may be the same as the key value generated in the content;
- the common node may be a common network node in a hierarchical P2P network, or an edge server (ES, Edge Server) in the IPTV network;
- the second common node saves the first index information corresponding to the first key value; the second common node and the first common node belong to the first common node network;
- a second common node that should save the first index information corresponding to the first key value according to a preset first query algorithm or from the preset node table according to the first key value
- the second common node is found; in the common node network, the range of key values that each common node needs to save is clear, and each common node stores a certain range of key values, for example, 5 in a common node network.
- a common node they can save the key range of 0 ⁇ 2, 2 ⁇ 4, 4 ⁇ 6, 6 ⁇ 8, 8-10 respectively; thus, after obtaining the key value, it can be found according to the preset query algorithm.
- DHT distributed hash table
- the ordinary node should save the key value; node table may be stored on the super node corresponding ordinary node network, or select a common node stored in the ordinary node network, each ordinary node may also have stored;
- the common node After the corresponding common node is found, the common node is triggered to save the first index information.
- the index information further includes the ability to uniquely identify the first common The information of the node, such as the network address of the first common node, the unique number of the first common node in the network, and the like, so that the ordinary node that obtains the index information can interact with the first common node;
- the first super node network acquires a second key value of the content, where the first super node tube Processing the first common node network;
- the first super node needs to be triggered to acquire the second key value; wherein the first super node may generate, according to the content identifier of the content from the first common node or the second common node, according to the second key value generation algorithm
- the second key value generation algorithm may be the same as or different from the first key value generation algorithm; when the second key value generation algorithm is the same as the first key value generation algorithm, the second key value is The first key value is the same, so the second key value can be sent to the first super node by the first normal node or the second normal node; wherein the content identifier can be the name of the content, and any information that can uniquely identify the content. ;
- the first common node or the second common node determines the address of the first super node according to its own routing information, or obtains the address of the first super node from other common nodes, thereby sending trigger information to the first super node; And obtaining, by the network number of the first super node, information that can uniquely identify the first super node, to determine the first super node, and sending the trigger information to the first super node;
- the key values that each super node needs to save are clear, and each super node saves a certain range of key values; thus, after obtaining the key value, it can follow the preset second query algorithm.
- the second query algorithm may be the same algorithm as the first query algorithm, or may be different from the first query algorithm;
- the node table is also maintained in the super node network, and the Node ID and other information of each super node in the super node network are saved. Therefore, after the key value is obtained, the super node that should save the key value can be found through the node table;
- the table can be saved on a node of a higher layer network, or a super node can be selected in the super node network for saving, and each super node can be saved;
- the second super node triggers the third common node to save the second index information of the content, and the third common node belongs to the second common node network corresponding to the second super node.
- the super node does not save the index information, so when the index information corresponding to the key value should be saved
- the second super node searches for the second index corresponding to the third key value in the second normal network according to the preset third query algorithm according to the obtained key value in the corresponding second common network.
- the third common node of the information so that the index information that should be saved on the super node is saved to the common node; likewise, the third query algorithm may be the same as or different from the first query algorithm and the second query algorithm;
- the third common node network also maintains a node table, and stores information such as the Node ID of each common node in the third common node network. Therefore, after obtaining the key value, the node table can be found to be commonly used to save the key value. Node; the node table can be saved on the super node, or a common node can be selected in the common node network for saving, and can also be saved for each common node;
- the third normal node After receiving the corresponding key value, the third normal node saves the second index information including the key value, and the index information may directly point to the first common node that stores the content corresponding to the key value, or may point to the management first common
- the first super node of the first common node network to which the node belongs further, this embodiment only describes the case where the common node network is first released and then released in the super node network, and in actual applications, it may also be in the first application.
- the super-node network is released, and then released on the common node network, and can also be released simultaneously on the super-node network and the common node network;
- the key value received by the third ordinary node may be from the second super node, or may be from the fifth common node in the third common node network; the key value from the second super node is the second common node by the second super node.
- Generated by the key generation algorithm of the network when the key generation algorithm of the third common node network is the same as the super node network, the second super node can directly send the key value to the third ordinary node; the key value from the fifth common node Is generated by the fifth normal node according to the content identifier from the second super node, according to the key value generation algorithm of the third common node network;
- the index information that should be saved in the super node can be saved on the common node in the common node network managed by the super node, so that the super node does not need to save the index information, thereby reducing the limited space of the super node. Occupied.
- the same content is re-published in the same common node network, that is, the processing method is different when the secondary is published: when the index information directly points to the ordinary node that saves the content, it belongs to the first common node network.
- the fourth ordinary node publishes the same content again, the release of the index information is still the technical solution described in FIG. 1; but when the index information is only directed to the super node of the ordinary node network to which the ordinary node storing the content belongs, If storing content The fourth normal node publishes the content again, and only needs to publish the content in the first common node network, so that the second common node can update the corresponding index information;
- the fourth common node storing the content obtains the first key value of the content, and triggers the second normal node to update the first index information corresponding to the first key value;
- the fourth common node generates a key value of the content according to a preset algorithm, and searches for a second common node that should save the key value according to the preset first query algorithm according to the key value, and triggers the second normal node to update the The first index information corresponding to the key value; enabling the index information to point to the first normal node and the fourth normal node that have posted the content;
- FIG. 3 depicts a first embodiment of a method for finding content provided by the present invention, including:
- a normal node When a normal node needs to find a content, it first searches for the index information corresponding to the content in the ordinary node network to which the ordinary node belongs, thereby searching for the content through the information of the cable;
- the third common node network cannot find the index information of the content, search for a super node corresponding to the content in the super node network.
- the common node cannot find the corresponding index information in the common node network to which the ordinary node belongs, it can continue to search in the super node network; the content and the index information in the super node network are corresponding, so the super node searches for the content corresponding to the content.
- the super node searches for the index information corresponding to the content in the common node network managed by the super node.
- the super node After finding the super node corresponding to the content, the super node searches for the index information corresponding to the content in the normal node network managed by the super node;
- index information of the content After the index information corresponding to the content is found, the index information is returned to the ordinary node that needs to find the content, so that the ordinary node that needs to find the content can find the content according to the index information;
- FIG. 4 illustrates a second embodiment of a method for finding content provided by the present invention, including:
- the sixth common node acquires a fourth key value of the content.
- the sixth common node needs to obtain a content, and then needs to obtain the index information of the content, and then can interact with the common node that saves the content according to the index information, thereby acquiring the content; the sixth common node can follow the content name according to the content name.
- the algorithm obtains the key value of the content;
- the query algorithm when the content is published may be used, and the seventh common node that should save the index information including the key value is found according to the key value, and the query when the content is published here
- the algorithm is because it can ensure that the same common node is found by the same key value; of course, the corresponding seventh common node can also be found through the node table;
- This embodiment describes the case where the corresponding index information is not found in the third common node network to which the sixth ordinary node belongs. In actual applications, it is also possible to directly find the corresponding index information in the common node network.
- the sixth common node and the seventh common node are both Attributable to the third common node network, the third super node managing the third common node network;
- the index information can also be searched in the super node network, and thus the sixth ordinary node or the seventh ordinary node determines management according to its own routing information.
- the information of the third super node of the third common node network to which it belongs may also obtain information of the third super node managing the third common node network to which it belongs from other common nodes, thereby transmitting trigger information to the third super node.
- the trigger information may include information such as a content name, so that the third super node may generate the second key value according to the preset name according to the content name; when the third common node network and the super node network adopt the same key value generation algorithm, the direct Sending a key value to the third super node, so that the third super node directly obtains the key value; 403. Search for a second super node corresponding to the second key value.
- the third super node searches for the second super node in the same manner as the second super node is found when the content is published;
- the third common node that should save the second index information can be found according to the preset query algorithm; wherein the second query algorithm is also the same as the query algorithm used when the content is published;
- the third common node is triggered to return the second index information to the sixth common node, where the third common node belongs to the second common node network managed by the second super node.
- the sixth common node can obtain the content according to the index information and the common node that saves the content, where the second super node can send the trigger information to the third common node according to the preset message format.
- the trigger information should include at least the key value and the information of the first common node, so that the third normal node can find the index information including the key value according to the key value, and can return to the sixth ordinary node according to the information of the sixth ordinary node.
- the found index information including the key value; the present embodiment using the search content can obtain the index information of the ordinary node, so that the index information that should be saved in the super node is saved in the common node network managed by the super node. On the node, and can find content from the ordinary node, so that the super node does not need to protect Index information, reducing the occupation of super nodes limited space.
- the second index information returned by the third normal node to the sixth normal node may also have two cases.
- One type is that the index information includes information of a common node that stores the corresponding content.
- the sixth ordinary node can directly interact with the common node according to the information of the common node; the other is that the index information only includes the super node of the common node network to which the ordinary node that stores the corresponding content is managed.
- the information, and thus the third embodiment of the method for finding content provided by the present invention, based on the second embodiment of the method for finding content, further includes:
- the sixth normal node triggers the first super node to find the second common node that saves the first index information,
- the second common node belongs to the first common node network managed by the first super node;
- the first super node triggers the second normal node to return the first index information to the sixth normal node; the sixth normal node may send trigger information to the first super node according to the obtained information of the first super node, where the first super node Obtaining a first key value according to the trigger information, and then finding a second common node that should save the key value according to the first key value;
- the trigger information sent by the sixth common node to the first super node may be directly sent by the sixth common node to the first super node, or may be managed by the sixth common node to manage the third super node of the third common node network.
- the node sends the first super node: In an actual application, the first common node can also be searched in the following manner:
- the sixth common node triggers the first super node to acquire the content identifier of the content, and the first super node triggers the ordinary node that belongs to the first common node network to acquire the first content of the content according to the content identifier.
- Key value finding a second normal node that should save the first index information corresponding to the first key value or finding the second normal node in the preset first node table according to the first key value;
- the first super node only needs to send the content identifier to the first common node network managed by the first super node, and then the first key value is generated by the common node of the common node network, and the corresponding second common node is found, thereby making the super Nodes need to do less processing, so when the index information points to the super node, it will not increase the burden of the super node too much;
- the first super node After the first super node finds the second common node, it may trigger the second normal node to find the first index information corresponding to the first key value in the index information saved by itself, and return the first index to the sixth normal node. Information, so that the sixth ordinary node can interact with the ordinary node that saves the content according to the first index information, thereby obtaining the content;
- the present embodiment can be used to obtain the index information of the common node after obtaining the index information that only points to the super node, so that when the same content is secondarily released, it only needs to be published in the common node network. It does not need to be published in the super node network, which reduces the update of the index information and does not increase the processing load of the super node.
- the first embodiment of the network device provided by the present invention includes:
- the information receiving unit 501 is configured to receive trigger information, where the trigger information includes uniquely determined content.
- Content identifier
- the trigger information can be from a normal node or a super node
- the key value generating unit 502 is configured to generate a key value of the content according to the content identifier; the key value is generated according to a preset key value generation algorithm, such as a hash algorithm;
- a common node searching unit 503, configured to find a common node corresponding to the key value
- Each common node corresponds to different content, and the key value is corresponding to the content, so the common node corresponding to the content can be found by the key value;
- the network device in this embodiment can be used as a common node of a common node network or as a super node of a super node network.
- the common node network managed by the super node can search for a common node corresponding to the key value, thereby The common node is triggered to create, update, or return index information, so that the super node does not need to save the index information, thereby reducing the occupation of the storage space of the super node; as a common node, the key value can be generated according to the content identifier, thereby finding a corresponding value according to the key value.
- the second embodiment of the network device includes:
- the information receiving unit 601 is configured to receive trigger information, where the trigger information includes a content identifier that uniquely determines the content;
- a key value generating unit 602 configured to generate a key value of the content according to the content identifier
- the information sending unit 604 is configured to send trigger information to the network node corresponding to the key value; the location of the network device in the network is different, and the function of sending the trigger information is also different;
- the corresponding common node can be triggered to create, update, or return index information, so that the super node does not need to save the index information, thereby reducing the occupation of the super node's limited storage space; as a common node of the ordinary node network with the ordinary node that saves the content
- the corresponding common node may be triggered to create, update, or return index information, so that the corresponding super node does not need to generate a key value, but only needs to send the content identifier to the ordinary node, thereby reducing the processing load of the super node.
- the first embodiment of the system for distributing content provided by the present invention includes: a first common node network 701, configured to save index information of the content in the local node network when the content is published, and send the first trigger information to the super node network;
- the first common node network includes: a first common node, configured to save the content, generate a key value of the content in the first common node network, that is, a first key value, and search and search in a first common node network a second common node corresponding to the first key value; a second common node, configured to save information of the content; thereby enabling the first common node network to save content in the common node network when publishing content Index information; the common node network is used to complete the key value search of the common node network, wherein the key value and the content, the key value and the index information are in a one-to-one correspondence;
- the super node network 702 is configured to receive the first trigger information, search for a second super node corresponding to the content in the super node network, and send a second trigger to the second common node network managed by the second super node.
- the super node network is mainly used to complete the key value search across the common node network, wherein the key value and the content, the key value and the index information are in a one-to-one correspondence;
- the second common node network 703 managed by the second super node is configured to save the index information of the content in the local node network after receiving the second trigger information;
- the second common node network includes a third common node, which is used to save the index information of the content, so that the second common node network can save the corresponding index information when the content is published;
- the present invention provides a second embodiment of a system for distributing content. As shown in FIG. 8, FIG. 8 illustrates a case of a layered P2P network, including:
- Super network node network 805, the super network node network includes super network node A 801, super network node B 802, super network node C 803 and super network node D 804, wherein: super network node A 801 manages ordinary network node network A 806
- the super network node B 802 manages the normal network node network B 807
- the super network node C 803 manages the normal network node network C 808,
- the super network node D804 manages the ordinary network node network D 809
- each common network node network Including the at least one common network node, this embodiment describes only a part of the common network node for the convenience of description.
- the common network node A 810, the normal network node B 811, and the common network node C 812 belong to the common network node network D809.
- Network node D 813 belongs to ordinary network node network C 808;
- the ordinary network node A generates the key value of X according to the hash algorithm.
- the ordinary network node C that should save the key value is searched according to the DHT algorithm, and the ordinary network node B is found first.
- the network node B continues to find the ordinary network node C according to the DHT algorithm according to the key value, and the ordinary network node C saves the index information including the key value; the content X is released in the ordinary network node network D;
- Ordinary network node A triggers super network node D to publish content X in the super network node network.
- the super network node D obtains the key value, according to the key value in the super network node network, the DHT algorithm is used to find the super that should save the key value.
- Network node C first finds the super network node A, and the super network node A continues to find the super network node C according to the DHT algorithm according to the key value;
- the super network node C finds the ordinary network node D that should save the key value in the ordinary network node network C according to the DHT algorithm according to the key value, and the ordinary network node D saves and includes the Index information of the key value; completion of the release of the content X in the network of the super network node;
- FIG. 9 is a first embodiment of a system for searching for content provided by the present invention, including:
- a third common node network 901 configured to search for index information of the content in the common node network;
- the third common node network includes: a sixth common node, configured to generate a key value of the content in the third common node network, that is, the first a four-key value, in the third common node network, searching for index information of the content corresponding to the fourth key value; thereby enabling the third common node network to search for index information of the content in the common node network;
- the super node network 902 is configured to: when the third common node network cannot find the index information of the content, search for the second super node corresponding to the content in the super node network, and manage the second super node to the second super node.
- the second common node network sends trigger information;
- the second common node network 903 managed by the second super node is configured to: after receiving the trigger information, search for the index information of the content in the common node network, and send the index information of the content to the third common node network. ;
- the second common node network includes a third common node, configured to save index information of the content, so that the second common node network can search for index information of the content in the common node network; and return to the third common node network.
- the index information of the content includes two cases: if the second common node network has a direct connection with the first common node network, it can be directly sent to the third common node network; if the second common node network is the first common network If the node network does not have a direct connection, it needs to be sent through the super node network.
- the third common node receives the index information of the content
- the third common node network may further search for the corresponding content according to the index information
- the index information corresponding to the content can be searched from the common node network, so that the index information that should be saved in the super node network is saved in the common node network managed by the super node, so that the super node does not need to save the index information, thereby reducing The occupation of the super node's limited space.
- the present invention further provides a second embodiment of a system for finding content, further comprising:
- a first common node network managed by the first super node configured to search for index information of the content in the common node network, and send index information of the content to a third common node network;
- the first common node network includes a second common node for storing index information of the content; thereby enabling the first common node network to search for index information of the content in the common node network;
- the index information saved by the common node does not directly point to the ordinary node that stores the corresponding content, it can also finally obtain the ordinary node that directly points to the corresponding content, so that when the content is released twice, it does not need to be published in the super node network, and the index is reduced.
- Information update frequency Rate reducing the processing load of the super node.
- the present invention further provides a third embodiment of a system for finding content, which describes the case of an IPTV network
- the original IPTV system includes: a central server (CS, Central Server), and the CS is a central media server of the IPTV system, There is all media content, mainly responsible for distributing media content to the edge server (ES, Edge Server); ES is a media server close to the client, providing streaming services for users;
- ES is a media server close to the client, providing streaming services for users
- multiple ES combinations are ES Domain
- P2P is used in the ES domain to implement content discovery and media scheduling.
- content search and media scheduling across ES domains need to be completed by CS.
- an IPTV system has only one CS, so CS needs to save all media.
- this embodiment proposes a new IPTV system, which removes the CS in the original IPTV system, and simultaneously for each ES.
- the domain is configured with an ES controller.
- the ES controllers are also organized in P2P mode, as shown in Figure 10. :
- ES controller domain 1005 the ES controller domain includes an ES controller A 1001, an ES controller B 1002, an ES controller C 1003, and an ES controller D 1004, where: ES controller A manages ES domain A 1006, ES control The controller B manages the ES domain B 1007, the ES controller C manages the ES domain C 1008, and the ES controller D manages the ES domain D 1009; each ES domain includes at least one ES, and this embodiment describes only a part of the ES for convenience of description.
- the first ES 1010, the second ES 1011, and the third ES 1012 belong to the ES domain D 1009, and the fourth ES 1013 belongs to the ES domain C 1008; in this embodiment, the update of the index information is provided by the present invention.
- the first embodiment of the method for publishing content, the search content in this embodiment includes:
- the first ES generates a key value according to a hash algorithm according to the name of the content to be acquired, and finds a third ES that should save the key value according to the DHT algorithm according to the key value in the ES domain D, and first finds the second ES, The second ES continues to find the third ES according to the DHT algorithm according to the key value, but the corresponding index information cannot be found in the third ES; therefore, it needs to look in the ES controller domain to see if there is any belonging to other ES domains.
- the ES saves the corresponding index information;
- the first ES triggers the ES controller D to search for the index information including the key value in the ES controller domain, and after the ES controller D acquires the key value, according to the key value in the ES controller domain, the search according to the DHT algorithm should be saved.
- the key controller ES first find the ES controller A, the ES controller A Continue to find the ES controller C according to the DHT algorithm according to this key value;
- the ES controller C finds the fourth ES that should save the key value in the ES domain C according to the DHT algorithm according to the key value, and the fourth ES finds according to the key value. And storing the index information including the key value, so that the index information is returned to the first ES, so that the first ES can interact with the ES that stores the corresponding content according to the index information, thereby completing media scheduling;
- the method for publishing content and the method for searching for content provided by the embodiment of the present invention may not configure CS, but configure an ES controller for each ES domain, and The ES controller does not need to save the index information, so that the ES controller does not need to consume a lot of system resources, thereby improving the processing speed of the ES controller and improving user satisfaction.
- the embodiment of the present invention can save the index information that should be saved in the super node on the common node in the common node network managed by the super node, so that the super node does not need to save the index information, thereby reducing the pair.
- the saved index information is updated without re-publishing to the super node network, thereby reducing the update frequency of the index information and reducing the processing load of the super node.
Landscapes
- Engineering & Computer Science (AREA)
- Signal Processing (AREA)
- Computer Networks & Wireless Communication (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Computing Systems (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Computer And Data Communications (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Information Transfer Between Computers (AREA)
Description
Claims
Priority Applications (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP2009543337A JP5253414B2 (ja) | 2007-04-19 | 2008-02-22 | コンテンツを公表するための方法及びシステム、コンテンツを検索するための方法及びシステム |
KR1020097013241A KR101118076B1 (ko) | 2007-04-19 | 2008-02-22 | 콘텐츠를 배포하는 방법 및 시스템과, 콘텐츠를 검색하는 방법 및 시스템 |
EP08706716A EP2091184A4 (en) | 2007-04-19 | 2008-02-22 | METHOD AND SYSTEM FOR PUBLISHING THE CONTENT, METHOD AND SYSTEM FOR REQUESTING THE CONTENT |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN200710098354A CN101291321B (zh) | 2007-04-19 | 2007-04-19 | 发布内容的方法及系统、查找内容的方法及系统 |
CN200710098354.4 | 2007-04-19 |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2008128450A1 true WO2008128450A1 (fr) | 2008-10-30 |
Family
ID=39875086
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/CN2008/070343 WO2008128450A1 (fr) | 2007-04-19 | 2008-02-22 | Procédé et système de publication de contenu, procédé et système de demande de contenu |
Country Status (5)
Country | Link |
---|---|
EP (1) | EP2091184A4 (zh) |
JP (2) | JP5253414B2 (zh) |
KR (1) | KR101118076B1 (zh) |
CN (1) | CN101291321B (zh) |
WO (1) | WO2008128450A1 (zh) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN115242659A (zh) * | 2022-08-09 | 2022-10-25 | 安徽大学 | 一种基于高阶集体影响力的超网络节点分析方法 |
Families Citing this family (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN102238202B (zh) * | 2010-04-23 | 2014-12-03 | 华为技术有限公司 | 索引信息的存储、查找方法及装置 |
CN103095727B (zh) * | 2013-02-07 | 2015-10-21 | 北京邮电大学 | P2p资源定位方法 |
JP5732084B2 (ja) * | 2013-02-15 | 2015-06-10 | 日本電信電話株式会社 | データベース装置 |
CN103703747A (zh) * | 2013-08-13 | 2014-04-02 | 华为技术有限公司 | 互联网内容存储方法和设备 |
CN104753873A (zh) * | 2013-12-30 | 2015-07-01 | 中国移动通信集团公司 | 一种提供内容服务的方法、装置和系统 |
CN104809129B (zh) | 2014-01-26 | 2018-07-20 | 华为技术有限公司 | 一种分布式数据存储方法、装置和系统 |
CN104834703A (zh) * | 2015-04-29 | 2015-08-12 | 深圳市梦网科技股份有限公司 | 检索方法及系统 |
Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN1778089A (zh) * | 2003-04-24 | 2006-05-24 | 皇家飞利浦电子股份有限公司 | 内容的对等传输 |
CN1845524A (zh) * | 2006-05-18 | 2006-10-11 | 北京邮电大学 | 采用小区动态划分技术的对等网络系统实现方法 |
CN1858734A (zh) * | 2005-12-28 | 2006-11-08 | 华为技术有限公司 | 一种数据存储及搜索方法 |
Family Cites Families (8)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
AU2002234258A1 (en) * | 2001-01-22 | 2002-07-30 | Sun Microsystems, Inc. | Peer-to-peer network computing platform |
JP2002318720A (ja) * | 2001-04-19 | 2002-10-31 | Oki Electric Ind Co Ltd | コンテンツ配信管理システム |
JP2003271440A (ja) * | 2002-03-18 | 2003-09-26 | Oki Electric Ind Co Ltd | コンテンツ配信管理システム |
AU2003903967A0 (en) * | 2003-07-30 | 2003-08-14 | Canon Kabushiki Kaisha | Distributed data caching in hybrid peer-to-peer systems |
JP3872051B2 (ja) * | 2003-09-26 | 2007-01-24 | Necソフト株式会社 | コンテンツの検索と配信を行うシステムと方法、及びプログラム |
US7418454B2 (en) * | 2004-04-16 | 2008-08-26 | Microsoft Corporation | Data overlay, self-organized metadata overlay, and application level multicasting |
JP2005333374A (ja) * | 2004-05-19 | 2005-12-02 | Toshiba Corp | ネットワーク検索システム、情報検索方法、ブリッジ装置及びプログラム |
JP2006252384A (ja) * | 2005-03-14 | 2006-09-21 | National Institute Of Advanced Industrial & Technology | 検索システム、検索サーバ、及び、ネットワークサーバ |
-
2007
- 2007-04-19 CN CN200710098354A patent/CN101291321B/zh active Active
-
2008
- 2008-02-22 JP JP2009543337A patent/JP5253414B2/ja active Active
- 2008-02-22 KR KR1020097013241A patent/KR101118076B1/ko active IP Right Grant
- 2008-02-22 EP EP08706716A patent/EP2091184A4/en not_active Withdrawn
- 2008-02-22 WO PCT/CN2008/070343 patent/WO2008128450A1/zh active Application Filing
-
2012
- 2012-02-15 JP JP2012030307A patent/JP5541812B2/ja active Active
Patent Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN1778089A (zh) * | 2003-04-24 | 2006-05-24 | 皇家飞利浦电子股份有限公司 | 内容的对等传输 |
CN1858734A (zh) * | 2005-12-28 | 2006-11-08 | 华为技术有限公司 | 一种数据存储及搜索方法 |
CN1845524A (zh) * | 2006-05-18 | 2006-10-11 | 北京邮电大学 | 采用小区动态划分技术的对等网络系统实现方法 |
Non-Patent Citations (2)
Title |
---|
JOHNSTONE S. ET AL.: "ixChange - A Self-Organising Super Peer Network Model", 10TH IEEE SYMPOSIUM ON COMPUTERS AND COMMUNICATIONS, 2005. ISCC 2005. PROCEEDINGS, 30 June 2005 (2005-06-30), XP008109849, Retrieved from the Internet <URL:http://www.ieeexplore.ieee.org> * |
See also references of EP2091184A4 * |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN115242659A (zh) * | 2022-08-09 | 2022-10-25 | 安徽大学 | 一种基于高阶集体影响力的超网络节点分析方法 |
Also Published As
Publication number | Publication date |
---|---|
JP2012094192A (ja) | 2012-05-17 |
CN101291321B (zh) | 2012-10-03 |
JP5253414B2 (ja) | 2013-07-31 |
CN101291321A (zh) | 2008-10-22 |
JP5541812B2 (ja) | 2014-07-09 |
EP2091184A4 (en) | 2011-12-14 |
KR101118076B1 (ko) | 2012-02-24 |
JP2010515133A (ja) | 2010-05-06 |
KR20090094313A (ko) | 2009-09-04 |
EP2091184A1 (en) | 2009-08-19 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
KR100576935B1 (ko) | 온톨로지 기반의 애드혹 서비스 검색 시스템 및 방법 | |
WO2008128450A1 (fr) | Procédé et système de publication de contenu, procédé et système de demande de contenu | |
JP5536362B2 (ja) | コンテンツセントリックネットワークにおける通信を円滑化するための方法 | |
WO2010127618A1 (zh) | 一种实现流媒体内容服务的系统和方法 | |
KR101766354B1 (ko) | 콘텐츠 중심 네트워크에서 에너지-효율적 콘텐츠 검색 | |
CN102714665B (zh) | 用于分解对等网络并且使用分解的对等网络的方法和设备 | |
Zhang et al. | Distributed hash table: Theory, platforms and applications | |
US20110099226A1 (en) | Method of requesting for location information of resources on network, user node and server for the same | |
WO2010069198A1 (zh) | 分布式网络构造方法和系统以及任务处理方法 | |
WO2011150830A1 (zh) | 获取内容的方法、节点及内容网络 | |
WO2013078875A1 (zh) | 内容的管理方法的方法、装置和系统 | |
JP5847185B2 (ja) | コンテンツ中心のネットワーク環境でグループ変更に関する情報を用いるコンテンツ共有方法及び装置 | |
Li et al. | SCOM: A scalable content centric network architecture with mobility support | |
CN103546327A (zh) | 一种建立基于jxta的混合式拓扑的网络管理模型的方法 | |
WO2009006779A1 (fr) | Procédé et système pour déterminer un nœud d'index de domicile et un nœud de service de domicile d'un utilisateur | |
EP2433412A1 (en) | Limiting storage messages in peer to peer network | |
JP2009259008A (ja) | ノード、コンテンツ格納方法およびコンテンツ取得方法 | |
JP2007328736A (ja) | リソース検索システム | |
Watanabe et al. | CBF: Look-up protocol for distributed multimedia objects in peer-to-peer overlay networks | |
Ghamri-Doudane et al. | Enhanced DHT-based P2P architecture for effective resource discovery and management | |
US20150227534A1 (en) | Method for processing data query using information-centric network | |
Sangpachatanaruk et al. | A p2p overlay architecture for personalized resource discovery, access, and sharing over the internet | |
Kaffille et al. | Distributed Service Discovery with Guarantees in Peer-to-Peer Networks using Distributed Hashtables. | |
JP2005234878A (ja) | リソース検索システム、および方法 | |
JP2010278617A (ja) | 分散保存システム、データファイル分散保存方法及びプログラム |
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: 08706716 Country of ref document: EP Kind code of ref document: A1 |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2008706716 Country of ref document: EP |
|
ENP | Entry into the national phase |
Ref document number: 2009543337 Country of ref document: JP Kind code of ref document: A |
|
WWE | Wipo information: entry into national phase |
Ref document number: KR Ref document number: 1020097013241 Country of ref document: KR |
|
NENP | Non-entry into the national phase |
Ref country code: DE |