WO2007023636A1 - Système de délivrance d’informations, méthode de délivrance d’informations, appareil nœud inclus dans le système de délivrance d’informations et support de stockage sur lequel un programme de traitement d’informations a été stocké - Google Patents

Système de délivrance d’informations, méthode de délivrance d’informations, appareil nœud inclus dans le système de délivrance d’informations et support de stockage sur lequel un programme de traitement d’informations a été stocké Download PDF

Info

Publication number
WO2007023636A1
WO2007023636A1 PCT/JP2006/314657 JP2006314657W WO2007023636A1 WO 2007023636 A1 WO2007023636 A1 WO 2007023636A1 JP 2006314657 W JP2006314657 W JP 2006314657W WO 2007023636 A1 WO2007023636 A1 WO 2007023636A1
Authority
WO
WIPO (PCT)
Prior art keywords
information
node
node device
content
communication
Prior art date
Application number
PCT/JP2006/314657
Other languages
English (en)
Japanese (ja)
Inventor
Yuji Kiyohara
Hiroaki Suzuki
Kentaro Ushiyama
Koichi Iijima
Original Assignee
Brother Kogyo Kabushiki Kaisha
Xing Inc.
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Brother Kogyo Kabushiki Kaisha, Xing Inc. filed Critical Brother Kogyo Kabushiki Kaisha
Publication of WO2007023636A1 publication Critical patent/WO2007023636A1/fr

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/1001—Protocols in which an application is distributed across nodes in the network for accessing one among a plurality of replicated servers

Definitions

  • Information distribution system information distribution method, node device included in information distribution system, and storage medium storing information processing program
  • the present invention relates to a Peer to Peer (P2P) type information (content) distribution system including a plurality of node devices connected to each other via a network, and in particular, a plurality of node devices.
  • P2P Peer to Peer
  • the present invention relates to a technical field such as an information (content) distribution system and a method that eliminate the inconvenience that a line is congested when a content request is concentrated on one node device.
  • each node device is Link information to some of the node devices that are obtained when you do not recognize link information (for example, IP address) to all the node devices participating in the overlay network Only the data is stored, and based on the strong link information, it is now possible to query and collate data!
  • DHT Distributed Hash Table
  • Non-Patent Document 1 discloses an overlay network. Discloses techniques for appropriately distributing loads even when participation and withdrawal (withdrawal) are frequently performed.
  • each node device becomes a content distribution server that holds content data, and each node device also becomes a content distribution request client.
  • a node device that holds a copy of content data is also referred to as a replica node.
  • Content delivery request client The node device that is the client can also obtain the content requested by such a replica node.
  • the content can be distributed from the replica node device that holds the duplicate only by the node device that is the content distribution server. Concentration of access to the node device that is the distribution server can be avoided.
  • a method in a system including a content distribution server, a client device group, and a topology control device that controls the connection relationship between the server device and the client device is known.
  • the topology control device when the client device inquires the topology control device for a content acquisition request, the topology control device notifies the client device of identification information of the peer device included in the connection destination candidate, and the client device indicates the identification information. Attempts to connect to the peer device and receives the packet at the client device.
  • the connection destination candidates are narrowed down and extracted from the peer devices included in the connection destination candidates by a selection policy defined in advance.
  • this topology control device provides a means for selecting an appropriate connection destination from a server device that transmits information to a certain client device or a client device that can deliver content, and for content reproduction to the user. Provides high-quality services that do not cause interruptions, skips, and reversions.
  • Non-Patent Document 1 Toshio Oka, Hiroyuki Morikawa, Yuki Aoyama, “Examination of lightweight load distribution method for distributed hash table”, IEICE technical report, (Japan), IEICE, 2004 2 5th, No. 103, No. 650, p.7-12
  • Patent Document 1 Japanese Patent Laid-Open No. 2004-246790
  • V is a technology for selecting an appropriate connection destination by controlling a tree-type distribution topology in P2P type content distribution.
  • the technology is disclosed, the technology is disclosed from the viewpoint of avoiding the concentration of access to a certain device.
  • the present invention has been made in view of the above problems, and in a P2P type content distribution system having a plurality of node devices, a plurality of node devices are concentrated on one node device to request content. It is an object of the present invention to provide a content distribution system and method in which inconveniences such as a decrease in content quality due to the operation are eliminated.
  • the invention according to claim 1 includes a plurality of node devices connected to each other via a network, and provides shared information to be shared among the plurality of node devices.
  • An information distribution system for storing shared information from an information storage node device stored in the plurality of node devices to another node device, wherein one node device included in the plurality of node devices is specified
  • Storage means for associating and storing node information indicating the information storage node device for storing the shared information and unique identification information corresponding to the shared information, and the information for storing the shared information Request information for requesting transmission of the node information corresponding to a storage node device, the request information including unique identification information corresponding to the shared information, the plurality of node devices
  • a request information receiving means for receiving from the contained Ru said node device, wherein included in the request information
  • the information storage node device corresponding to the node information indicates the degree of local concentration of communication with other
  • Communication busyness recognition means for determining communication busyness, and information that stores only the already received part of the shared information corresponding to the request information when the communication busyness is outside a predetermined range.
  • Information partial storage node information transmission means for transmitting the node information indicating a partial storage node device to the node device that is the transmission source of the request information, and when the communication busyness is within a predetermined range,
  • An information storage node that transmits the node information indicating the information storage node device storing the entire shared information corresponding to the request information to the node device that is the transmission source of the request information
  • the node device that is the transmission source of the request information receives the node information indicating the information partial storage node device or the information storage node device.
  • Shared information request information transmitting means for transmitting shared information request information for requesting transmission to the node device corresponding to the received node information, and the information partial storage node device that has received the shared information request information or
  • the information storage node device is an information distribution system comprising shared information transmission means for transmitting the shared information to a node device that is a transmission source of the shared information request information.
  • the root node and cache node that store the content ID (identification information) contained in the network and the IP address (node information) of the corresponding content node (information storage node device) depend on the communication status of the content node. This makes it possible to distribute the request destinations from which request nodes request content.
  • the root node and the cache node are delivering content and the content is
  • the request node storing only the received part is set as a stream type content node (information partial storage node device), and the IP address of the stream type content node is notified to the requesting node as the content request destination node device.
  • the content nodes communicate with the root node and cache node. When not busy (communication busyness is within a predetermined range), the IP address of the content node is notified to the request node as a content request destination node device as usual.
  • the information partial storage node information transmitting means operates as described above.
  • Content distribution to multiple request nodes causes excessive load on the content node, and communication is interrupted or errors occur at the request nodes of multiple users who wish to distribute content.
  • the quality is prevented from deteriorating.
  • the invention according to claim 2 includes a plurality of node devices connected to each other via a network, and includes shared information to be shared among the plurality of node devices.
  • the node information indicating the information storage node device that stores the specific shared information and the unique identification information corresponding to the shared information are stored in association with each other, and the information for storing the shared information is stored.
  • Request information for requesting transmission of the node information corresponding to a storage node device the request information including unique identification information corresponding to the shared information
  • the node information corresponds to the node information.
  • a communication busyness indicating a degree of local concentration of communication with other node devices is recognized, and if the communication busyness is out of a predetermined range, the request information is supported.
  • the node information indicating the information partial storage node device that stores only the already received part of the shared information is transmitted to the node device that is the transmission source of the request information, and the communication busyness is predetermined.
  • the information storage node device storing the entire shared information corresponding to the request information.
  • the node information indicating the location of the request information is transmitted to the node device that is the transmission source of the request information, and the information partial storage node device or the information storage device is transmitted to the node device that is the transmission source of the request information.
  • the shared information request information for requesting transmission of the shared information is transmitted to the node device corresponding to the received node information, and the shared information request information is transmitted.
  • the shared information is transmitted to a node device that is a transmission source of the shared information request information.
  • the invention according to claim 3 includes a plurality of node devices connected to each other via a network, and provides shared information to be shared among the plurality of node devices.
  • a node device in an information distribution system for storing shared information from an information storage node device stored in the plurality of node devices to another node device, the information storage node device storing the specific shared information Storage means for storing the node information indicating the shared information and the unique identification information corresponding to the shared information in association with each other, and transmission of the node information corresponding to the information storage node device storing the shared information is required.
  • the request information including unique identification information corresponding to the shared information is received from the node devices included in the plurality of node devices.
  • Request information receiving means when storing the node information corresponding to the identification information included in the request information in the storage means, the information storage node device corresponding to the node information.
  • Communication busyness recognition means for determining communication busyness indicating the degree of local concentration of communication with other node devices, and if the communication busyness is out of a predetermined range, corresponds to the request information Only the already received part of the shared information is stored! /, The node information indicating the information partial storage node device is transmitted to the node device that is the transmission source of the request information.
  • the invention according to claim 4 is the node device according to claim 3, wherein the communication busyness certifying means is configured to correspond to the node information.
  • Memory node device power The node device is characterized in that the communication busyness level is recognized by receiving communication busyness level information corresponding to the communication busyness level.
  • the root node or the cache node obtains the content node power communication busyness information directly, grasps the communication status, and distributes information request destinations of the request nodes at an appropriate timing. Can do. Therefore, it becomes possible to obtain and view the desired content with high quality without stress at request nodes of a plurality of users who wish to distribute the content.
  • the invention according to claim 5 is the node device according to claim 3 or 4, wherein the information partial storage node information transmission means is the information storage node device.
  • the information partial storage node device that is distributing the shared information is present, the node information indicating the node information indicating the information partial storage node device is being received from the information storage node device.
  • Node information receiving means for receiving, from the information partial storage node device, reception status information indicating the reception status of the shared information in the information partial storage node device corresponding to the node information being distributed; Based on the reception status information, the node information indicating the information partial storage node device corresponding to at least one or more of the delivering node information is selected.
  • a node device characterized by transmitting the node information indicating the information partial storage node device selected by the selection unit to the node device that is the transmission source of the request information. It is.
  • a device that has a good content reception status is selected among the request nodes (information partial storage node devices) that are delivering content from content nodes and that store a part of the content.
  • the root node can select.
  • the root node sets the selected request node (information partial storage node device) as a stream type content node, and sets the stream type content node as a content request destination to another new request.
  • the node device with particularly good content reception status. Obtain and view the desired content with high quality without stress. It becomes possible.
  • the root node selects such a stream type content node, and the cache node normally does not perform this operation.
  • the invention according to claim 6 is the node device according to any one of claims 3 to 5, wherein the communication busyness is out of a predetermined range.
  • communication busy indication information indicating that the node information indicating the information partial storage node device should be transmitted to the node device that is the transmission source of the request information corresponds to the identification information included in the request information.
  • a busy node instruction information transmitting means for transmitting the node information to another node device that similarly stores the node information.
  • the root node that has determined the busyness of communication determines that the communication is busy! /
  • the IP address corresponding to the content ID included in the query is similarly stored.
  • the busy communication instruction information indicating that the IP address of the stream type content node should be transmitted to the request node is transmitted to the other node device (indicating a cache node). Therefore, when a query is received at the cache node, the IP address of the stream type content node can be notified (transmitted) to the request node without transferring the query to the root node. IP addresses can be obtained, and the number of communications can be reduced. Therefore, the number of communications in the entire content distribution system can be reduced, and the load on the system is reduced.
  • the invention according to claim 7 is the node device according to claim 6, wherein when the communication busyness is within a predetermined range, the information Non-communication busy instruction information indicating that the node information indicating a storage node device should be transmitted to the node device that is the transmission source of the request information, and the node information corresponding to the identification information included in the request information Is a node device characterized by having non-communication busy instruction information transmission means for transmitting the same to other node devices storing the same.
  • Non-communication busy instruction information indicating that the IP address of the normal content node should be sent to the request node to the cache node that similarly stores the IP address corresponding to the content ID included in the query. Send. Therefore, when a query is received at the cache node, the IP address of the normal content node can be notified (sent) to the request node without transferring the query to the root node, and the request node can quickly request the content request destination. IP addresses can be obtained, and the number of communications can be reduced. Therefore, the number of communications in the entire content distribution system can be reduced, and the load on the system is reduced.
  • the invention according to claim 8 is the node device according to claim 7, wherein the communication busyness is within a predetermined range.
  • Non-communication busy report information receiving means for receiving report information from the node device to which the busy communication instruction information is transmitted, and when the non-communication busy report information is received, the information storage
  • a node device characterized by operating a node information transmitting means and operating the non-communication busy instruction information transmitting means.
  • the cache node when it is determined that the communication is busy! /, !, the IP address corresponding to the content ID included in the query is similarly stored. Then, the root node and other cache nodes receive the non-communication busy report information indicating that the communication is busy! The root node and other cache nodes that have received this non-communication busy report information transmit the normal content node IP address to the request node and the non-communication busy instruction information. Therefore, when the cache node first knows that the communication status of the content node is busy, it reports it to the root node and other cache nodes first, so the normal content node is the main subject. It is possible to return to a so-called grid type communication form.
  • the invention according to claim 9 is the node device according to any one of claims 6 to 8, wherein the communication busyness is out of a predetermined range.
  • a communication busy report information receiving means for receiving communication busy report information from the node device that is the transmission destination of the non-communication busy instruction information, and when the communication busy report information is received Operates the information partial storage node information transmission means and A node device characterized by operating a busy instruction information transmitting means.
  • the IP address corresponding to the content ID included in the query is similarly stored and the route is stored.
  • the node or cache node receives the busy communication report information indicating that the communication is busy! /.
  • the root node that has received the busy communication report information selects the stream type content node, transmits the IP address of the stream type content node to the return node, and transmits the busy communication instruction information. Therefore, when the cache node first knows that the communication status of the content node is busy, the information request destinations of the request node are quickly distributed to report this to the root node and other cache nodes. It can be changed to a so-called tree-type communication form. Then, it becomes possible to obtain and view the desired content with high quality without stress in the node devices of a plurality of users who wish to distribute the content.
  • the invention according to claim 10 is the node device according to claim 3 or 4, wherein the node information indicating the information partial storage node device is included in the request information.
  • the information partial storage node information transmission means is operated to transfer the node information indicating the information partial storage node device to another Transmitted information transmitting means for transmitting transmitted information indicating transmission to the node device to the node device that is the transmission source of the busy communication instruction information.
  • the cache node that has received the busy instruction information from the root node or the cache node transmits the IP address of the stream type content node to the request node to the new request node. Therefore, the cache node can inform (send) the IP address of the stream type content node to the request node without transferring the query to the root node, and the request node can quickly obtain the IP address of the content request destination.
  • the number of communications can be reduced. Therefore, the number of communications in the entire content distribution system can be reduced, and the load on the system is reduced.
  • the cache node force S request node is notified of the IP address of the stream type content node as the content request destination.
  • the cache node returns the fact that the stream type content node has been notified to the request node in this way as returned information to the root node that is the transmission source of the busy instruction information.
  • the root node can select again the stream type content node to be notified to the request node based on the transmitted information, and a new stream type content node with distributed content request destinations can be newly selected. It is possible to inform the request node.
  • an invention according to claim 11 is the node device according to claim 10, wherein the node information indicating the information storage node device is transmitted from the request information source.
  • Non-communication busy instruction information to be transmitted to the node device is received from another node device that similarly stores the node information corresponding to the identification information included in the request information.
  • Non-communication busy instruction information receiving means and when the non-communication busy instruction information is received or when the communication busy instruction information is received! /,!, The information storage node information is transmitted.
  • the cache node when the cache node receives the non-communication busy instruction information from the root node or another cache node, or when the cache node does not receive the communication busy instruction information, the IP address of the normal content node can be notified (sent) to the request node without forwarding the query to the root node, and the request node can obtain the IP address of the content request destination quickly.
  • the number of communications can be reduced. Therefore, the number of communications in the entire content distribution system can be reduced, and the load on the system is reduced.
  • the invention according to claim 12 is the node device according to claim 10 or 11, wherein the busyness of communication is within a predetermined range.
  • Non-communication busy report information transmission means for transmitting non-communication busy report information indicating that the communication busyness is within a predetermined range to the node device that is the transmission busy instruction information source.
  • the node device that is the transmission busy instruction information source.
  • the cache node that has determined the busy communication level is the root node that is the transmission source of the busy communication instruction information
  • Non-communication busy time report information indicating that communication is not busy is transmitted to the cache node.
  • the root node or cache node that has received this non-communication busy report information transmits the normal content node IP address to the request node, or transmits the non-communication busy instruction information to other cache nodes. be able to. Therefore, when the cache node first knows that the communication status of the content node is busy, it reports to the root node and other cache nodes first, so that the normal content node is the main subject. It is possible to return to a so-called grid type communication form.
  • the invention according to claim 13 is the node device according to claim 11 or 12, wherein the busyness of communication is outside a predetermined range.
  • the cache node power that has been determined to be busy is sent to the root node or other cache node that is the source of the non-communication busy instruction information.
  • the communication busy time report information indicating that the communication is busy is transmitted. Therefore, the root node that has received this busy communication report information can select the stream type content node, and transmits the IP address of the stream type content node to the request node and also transmits the above busy communication instruction information. To do. Therefore, when the cache node first knows that the communication status of the content node is busy, the information request destination of the request node is quickly distributed in order to report this to the root node and other cache nodes. The so-called tree-type communication mode can be changed. Then, it becomes possible to obtain and view the desired content with high quality without stress at the node devices of a plurality of users who wish to distribute the content.
  • the invention according to claim 14 is the node device according to any one of claims 3 to 13, wherein the information partial storage node information transmitting means includes: A transmission source of the request information of a predetermined number or less with respect to the one information partial storage node device The node device transmits the node information of the information partial storage node device to the node device.
  • the root node and the cache node inform the request nodes of a predetermined number or less of the IP address of one stream type content node. Therefore, a request node force content request of a predetermined number or less is transmitted to one stream type content node. Therefore, the distribution of content to a large number of request nodes places an excessive load on the stream-type content node, and communication is interrupted or an error occurs at the request nodes of multiple users who want to distribute content. This prevents the quality of the content from being degraded. As a result, even in a stream type content node, it is possible to obtain and view a plurality of user-desired contents desired to be distributed with high quality without stress.
  • an invention according to claim 15 is an information processing program that causes a computer to function as the node device according to any one of claims 3 to 14. This is a stored storage medium. The invention's effect
  • FIG. 1 is a diagram showing an example of a connection mode of each node device in the content distribution system according to the present embodiment.
  • FIG. 2 is an explanatory diagram of an ID space.
  • FIG. 3 is a diagram showing an example of how a routing table is created by DHT.
  • FIG. 4 An example of a level 1 table.
  • B An example of a level 2 table.
  • C An example of a level 3 table.
  • D An example of a completed routing table.
  • FIG. 5 is a diagram showing an example of a state in which the node device 1 that is the storage source of content data is searched by the DHT.
  • FIG.6 Spanning tree view showing how content node public messages are forwarded
  • FIG. 7 is a diagram illustrating a schematic configuration example of the node device 1.
  • FIG. 8 is a diagram showing an example of a connection mode of each node device in the content distribution system according to the present embodiment.
  • FIG. 9 Diagram explaining the operation when the root node selects a stream type content node
  • FIG. 10 Diagram explaining the operation when the root node selects a stream type content node
  • FIG. 11 Sequence chart showing exchange of various information such as queries between request node, root node, content node, downloading node, stream type content node, cache node when communication busyness is outside the predetermined range ( 1).
  • FIG. 12 Sequence chart showing exchange of various information such as queries between request node, root node, content node, downloading node, stream type content node, cache node when communication busyness is outside the predetermined range ( 2).
  • FIG. 13 Sequence chart showing exchange of various information such as queries between request node, root node, content node, downloading node, stream type content node, and cache node when communication busyness is within a predetermined range ( 3).
  • FIG. 14 Sequence chart showing exchange of various information such as queries between request node, root node, content node, downloading node, stream type content node, cache node when communication busyness is within a predetermined range ( 4).
  • FIG. 15 is a flowchart showing processing for analyzing a received message in the control unit of the node device.
  • FIG. 16 is a flowchart showing processing in the control unit of the request node.
  • FIG. 17 is a flowchart showing node information transmission processing (1) in the control unit of the root node.
  • FIG. 18 is a flowchart showing report information handling processing in the control unit of the root node.
  • FIG. 19 is a flowchart showing node information transmission processing (2) in the control unit of the cache node. It is
  • FIG. 20 is a flowchart showing instruction information handling processing in the control unit of the cache node.
  • FIG. 21 is a flowchart showing processing in the control unit of the content node and the stream type content node.
  • FIG. 1 is a diagram showing an example of a connection state of each node device in the content distribution system according to the present embodiment.
  • a network (real-world network) 8 such as the Internet is constructed by a provider (device) 6 and a communication line (for example, a telephone line or optical cable) 7 or the like.
  • the content distribution system S is configured to include a plurality of node devices la, lb, lc---lx, ly, 1 ⁇ ⁇ connected to each other via such a network 8. It has become a peer-to-peer network system. Each node device la, lb, lc---lx, ly, 1 ⁇ ⁇ ⁇ ⁇ is assigned a unique production number and IP (Internet Protocol) address as information indicating the node device (node information in the present invention). ing. The serial number and IP address are not duplicated among the plurality of node devices 1. In the following description, when any one of the node devices la, lb, lc---lx, ly, 1 ⁇ ⁇ is indicated, it may be referred to as a node device 1 for convenience.
  • DHT Distributed Hash Table
  • each node device 1 participating in the network 8 it is simple for each node device 1 participating in the network 8 to know the IP addresses of all the node devices 1 participating in the network 8. If the number of terminals is tens of thousands and hundreds of thousands, it is not realistic to remember the IP addresses of all the node devices 1. If the power of any node device is turned ON or OFF, the IP address of the arbitrary node device stored in each node device 1 is frequently updated, which makes operation difficult.
  • an overlay network 9 as shown in an upper frame 100 of FIG. 1 is constructed by an algorithm using DHT.
  • this overlay network 9 means a network that forms a virtual link formed using the existing network 8.
  • an overlay network 9 constructed by an algorithm using DHT is assumed, and the node device 1 arranged on the overlay network 9 participates in the content distribution system S (in other words, in other words).
  • the node device 1 arranged on the overlay network 9 participates in the content distribution system S (in other words, in other words).
  • participation in the content distribution system S is performed by sending a participation request to an arbitrary node device 1 that has already participated and has already participated, and has already participated.
  • the node ID of each node device 1 is hashed with a common hash function (hash algorithm), which is a unique value for each node device, such as the IP address or serial number of each node device.
  • the hash value obtained in this way is distributed evenly in one ID space.
  • the node ID (hashed) obtained by a common hash function has a very low probability of having the same value if the IP address or serial number is different. Since the hash function is publicly known, detailed explanation is omitted.
  • a node ID is a value obtained by hashing an IP address (global IP address) with a common hash function.
  • a plurality of node devices 1 participating in the content distribution system S include content (for example, movies and music) as shared information distributed from one node device 1 to another node device 1. Etc.) The data is distributed and stored (stored). A unique number (hereinafter referred to as a content ID (identification information of the present invention)) is assigned to each content data.
  • content ID identification information of the present invention
  • the content ID has the same length as the node ID (for example, 128 bits).
  • a keyword such as a content name (content title) or content summary information (summary) It is hashed by the same hash function as when obtaining the above node ID (that is, placed in the same ID space as the hash value of the IP address of node device 1) and is closest to the hash value (for example, the higher digit is more
  • the node device 1 having a node ID that matches the node ID holds the power to store the content data or the link information to the node device that holds the content data (IP address of the content holding node). As a result, the content data can be distributed on the content distribution system S without any bias.
  • the keyword to be converted may be, for example, a combination of content name and copyright information (for example, performer name, director name, original author name, singer name, composer name, or songwriter name).
  • the node ID and the content ID assigned to each node device 1 and each content data are generated by a common hash function, the node IDs and the content IDs are almost the same in the ring-shaped ID space as shown in FIG. It can be thought of as being scattered and scattered.
  • This figure shows a node ID and content ID assigned in 32 bits.
  • black dots indicate node IDs
  • black diamonds indicate content IDs
  • IDs increase counterclockwise.
  • the rule is that “a node device that manages content data having a certain content ID is a node device 1 having a node ID close to that content ID”.
  • the definition of “close” does not exceed the content ID, and the power to minimize the difference between the content ID and the node ID.
  • each content device is managed by each node device. It should be consistent when allocating to 1.
  • the content IDa is managed by the node device having the node IDa.
  • the content IDb is managed by the node device having the node IDb
  • the content IDc is managed by the node device 1 having the node IDc.
  • node device 1 having node IDa is a root node of content data having content IDa
  • node device 1 having node IDb is a root node of content data having content IDb and has node IDc.
  • the node device 1 is a content data root node having a content IDc.
  • the node device 1 that holds (stores) content data is called a content node.
  • FIG. 3 is a diagram illustrating an example of a state in which a routing table is created by the DHT.
  • the ID space as shown in FIG. 3A is divided into several areas. Actually, about 16 divisions are often used, but in order to simplify the explanation, here, it is divided into four and the ID is expressed as a quaternary number with a bit length of 16 bits.
  • An example of creating a routing table for the node device 1N with the node ID of the node device 1N being “10230210” will be described.
  • each area is expressed in quaternary numbers with different maximum digits. 3 natural numbers, and so on. ). Since the node ID of the node device 1N itself is “10230210”, the node device 1N exists in the lower left “1XXXXXX” area in the figure. Then, the node device 1N appropriately selects the node device 1 existing in an area other than the area where the node device exists (that is, the “1XXXXXX” area), and stores the IP address of the node ID in the level 1 table. .
  • Figure 4 (A) is an example of a level 1 table. The second column shows the node device 1N itself, so there is no need to store the IP address.
  • the area where I exist is further divided into four, and four areas ⁇ 10XXXXXX '', ⁇ 11XXXXX '', ⁇ 1 2XXXXX '', ⁇ 13XXXXX ".
  • the node device 1 existing in an area other than the area where it exists is appropriately selected, and the IP address of the node ID is stored in the level 2 table.
  • Figure 4 (B) is an example of a level 2 table. The first column shows the node device 1N itself, so there is no need to memorize the IP address!
  • the area that exists is further divided into four, and four areas ⁇ 100XXXXX '', ⁇ 101XXXXX '', ⁇ 102XXXX '', ⁇ 103XXXX '' ".
  • the node device 1 existing in an area other than its own area is appropriately selected, and the IP address of the node ID is stored in the level 1 table.
  • Figure 4 (C) shows an example of a level 3 table.
  • the third column shows the node device 1N itself, so there is no need to store the IP address.
  • the second and fourth columns are blank because there are no node devices in the area.
  • All the node devices 1 create and own the routing table created according to the method described above.
  • FIG. 5 is a diagram showing an example of a state in which the node device 1 that is the content data storage source is searched by the DHT.
  • node device 1-1 having node ID “12003030” (hereinafter, a node device that searches for content data and requests reception of content data is referred to as “request node”.) Force Content ID A procedure for searching for content data having “31330012” will be described.
  • the request node refers to the level 1 table in the routing table held by itself, and requests the node device having the node ID in the same area as the content ID “31330012” to inquire about the location of the content.
  • Information hereinafter, “request information” of the present invention (request information for inquiring about the location of content) is referred to as “query”).
  • the content 10 “31330012” is an area “3”, and therefore the node device 1 belonging to the area “3XXXXXXX” knows the IP address (that is, the routing that it owns).
  • the IP address is stored in the table, and the message is sent to node equipment 1-2.
  • the query includes a content ID that is unique identification information corresponding to the content.
  • the IP address of the node device 12 whose node ID is “30100000” is stored in the routing table of the request node.
  • a query is transmitted to the node device 12 which is “30100000”.
  • the node device 1-2 that has received the query refers to the level 2 table of the routing table held by the node device 1-2 itself, and belongs to the area “31XXXXX”.
  • the query is forwarded to node device 1-3 (node ID “3101200 1”) that knows the IP address.
  • the node device 1-5 that manages the content data that is, the root node is reached.
  • the root node searches the content ID “31330012” included in the query from index information (described later) managed by itself, and retrieves the content data.
  • the node device 1's IP address, etc. is returned to the requesting node.
  • the request node (node device 11) outputs the above-mentioned root node (node device 15) power, the location of the content data of the content ID “31330012”, that is, the IP address of the node device 1 that is the storage source.
  • the content data is received (obtained) from the node device 1 that is the storage source.
  • This node device 1 becomes a content node as an information storage node device that holds (stores) content data.
  • the content node obtains the content ID from the content title and the like, and is directed to the node device having the same node ID as the content ID (whether or not this node device actually exists is not at this point) .) Send a public message.
  • this public message is also transferred one after another according to the routing table in the same manner as the above query, and when it is transferred to the node device 1 having the node ID closest to the content ID included in the public message,
  • the node device 1 determines that there is no other destination node device, the node device 1 determines that the node device 1 itself should be the root node of the content, and the content ID, auxiliary information (title, genre, etc.) Attribute information, copyright information such as director name) and the IP address of the content node are stored as index information.
  • the node device in the middle of the route to the root node is provided with a cache node that holds the index information stored in the root node as a cache.
  • the cache node may return the IP address of the content node to the request node that inquired about the location of the content when the query is transferred to the cache node device earlier. It becomes possible.
  • the cache node power is normally set as described above. Only the information on the box is retained. On the other hand, in the embodiments described later, as necessary
  • each cache node force index information is held, and its own IP address and the IP address of the cache node holding the index information in front of it are set together with the index information to the next cache node or route. Transfer to node.
  • the node device 1 that has received the function functions as a cache node (1) by holding the index information. Then, the cache node (1) adds its own IP address information to the public message and transfers it.
  • the node device 1 that has received the public message functions as a cache node (2) by holding the index information and the IP address information of the cache node (1). Then, the cache node (2) adds its own IP address information to the public message to which the IP address information of the cache node (1) is added, and transfers it.
  • the node device 1 that has received the public message functions as a root node by holding the index information and the IP address information of the cache nodes (1) and (2).
  • the two node devices between the content node and the root node function as cache nodes.
  • the present invention is not limited to this, and the number of cache nodes and all transferred node devices are cached.
  • the power distribution, etc., can be freely determined by the content distribution system S.
  • Each node device 1 inquires by a request node that transmits a query for inquiring about the location of content by a process performed by each node, a cache node or a route node that receives a query from the request node or a terminal on a route, and a request node
  • a content node as an information storage node device that holds the content
  • a stream as an information partial storage node device that is storing (partially) the content and is storing a part of the content It acts as a type content node (also a request node), but its structure is the same.
  • FIG. 7 is a diagram illustrating a schematic configuration example of the node device 1.
  • Each node device 1 includes, as shown in FIG. 7, a CPU 11 having a calculation function, a working RAM, a ROM that stores various data and programs, a control unit 11 as a computer, and the content data HD storage for storing (storing) the index information, the DHT, and the program, etc., and a storage unit 12 as the configured storage means (the content data may be stored in the node device 1).
  • Buffer memory 13 that temporarily stores the received content data, and a decoder that decodes the encoded video data (video information) and audio data (audio information) included in the content data.
  • the display unit 16 such as a CRT or a liquid crystal display that displays video based on the video signal output from the video processing unit 15 and the decoded audio data as an analog audio signal D (Digital) / A (Analog After the conversion, the audio processing unit 17 that amplifies the output by an amplifier and outputs it, the speaker 18 that outputs the audio signal output from the audio processing unit 17 as a sound wave, and the other node device 1 through the network 8
  • a communication unit 20 for performing communication control of information between them, and an input unit (for example, a keyboard, a mouse, or an operation unit) that receives an instruction from the user and gives an instruction signal corresponding to the instruction to the control unit 11
  • the control unit 11, the storage unit 12, the buffer memory 13, the decoder unit 14, and the communication unit 20 are connected to each other via a bus 22.
  • the node device 1 is a request node, a cache node, a root node, a content node as an information storage node device, a stream type content node as an information partial storage node device (content distribution (receiving)) depending on the program to be executed. As a node device).
  • the control unit 11 sends request information (query) transmission means for inquiring about the location of content, shared information (content) request information transmission means.
  • request information query
  • content shared information
  • Node device 1 is a cache node or When functioning as a data node, the control unit 11 functions as storage means, request information reception means, communication busyness recognition means, information partial storage node information transmission means, and information storage node information transmission means.
  • the control unit 11 when the node device 1 functions as a root node, the control unit 11 performs distribution node information reception means, reception status information reception means, selection means, busy communication instruction information transmission means, non-delivery It functions as communication busy instruction information transmission means, non-communication busy report information reception means, and communication busy report information reception means.
  • the control unit 11 transmits busy instruction information receiving means, transmitted information transmitting means, non-communication busy instruction information receiving means, non-communication busy report information transmission. Means, communication It functions as a busy time report information transmission means.
  • the control unit 11 includes a shared information request information receiving means, a shared information Functions as a transmission means.
  • a plurality of node devices for example, la, ld, le, lf, lj, lz
  • one node device for example, lh (shown with grid lines)
  • the content data is downloaded at the bottom of FIG.
  • the content request destinations of request nodes are distributed.
  • communication concentrates on content nodes having specific popular content data (the content is stored in the replica node and a copy is made, and the time is short).
  • access concentrates locally on a specific content node
  • the so-called grid-type communication form power is also changed to a so-called tree-type communication form.
  • the content is requested in the past to become a request node, and the content is Other node devices le, lz ( Hereinafter, it is referred to as a “downloading node”. ) Exists.
  • the node device la, ld, lf, and lj which become other newly requested node nodes, download the content data, and the root node manages as described in detail later. It is a thing.
  • the above-described nodes le and lz that are being downloaded receive content from the node device 1h and distribute the received content to other node devices one after another. Therefore, the node devices le and lz are referred to as “stream content nodes” in the present embodiment.
  • FIG. 9 to FIG. 9 and 10 are diagrams for explaining the operation when the root node selects a stream type content node.
  • Figures 11 to 14 show the request node, the root node, the content node, the node being downloaded, the stream type content node, and the cache node when the request node inquires about the location of the content node holding the desired content data. It is a sequence chart.
  • the content ID (identification information) of the content requested by the request node is “30210113”, and the content node stores this content.
  • the IP address (node information) is set to “100.23.1 5 6.1”.
  • FIG. 9 and FIG. 10 will be described.
  • Figure 9 (A) shows a request with multiple root nodes. This is an information table created when a stream type content node is selected from a stream node, and shows an information table of a stream type content node created at the moment when communication of the content node starts to be busy.
  • Fig. 9 (B) corresponds to the information table in Fig. 9 (A). The access from the request node is concentrated on the content node and the communication of the content node starts to be busy (or the communication is busy).
  • FIG. 6 is a schematic diagram showing a content distribution mode immediately before starting).
  • FIG. 10 (A) is an update of the information table of Fig. 9 (A). After the content node communication starts to become busy, the stream type is created including more request nodes. The information table of a content node is shown.
  • FIG. 10 (B) is a schematic diagram showing a tree-type content distribution form in which stream-type content nodes are created corresponding to the information table of FIG. 10 (A).
  • Fig. 9 (B) when access from the request node concentrates on the content node, the root node has a communication busy rate of the content node outside the predetermined range (local concentration occurs.
  • Fig. 9 (A) an information table for selecting a stream type content node from a plurality of request nodes is created. This information table
  • Each content node managed by the root node is created and stored in the storage unit 12 of the root node. If the IP addresses of multiple content nodes are stored, multiple information tables are created.
  • the node ID of each downloading node is shown as downloading node information (distributing node information). , IP address, query transmission date / time information of each downloading node.
  • V is added to each node being downloaded, and node numbers 1> to 7> are temporarily attached!
  • the root node displays the DL (download) start date, the number of HOPs with the DL (download) source, the DL (download) status, Obtain information such as the assumed effective bandwidth.
  • the root node receives a query from a new request node when the content node is busy (communication busy is out of the specified range), it evaluates the environment as information for selecting stream-type content from these reception status information. value Determine (estimate) the number of DL (downloadable) devices, the number of DL (downloading) devices, etc. Information such as the environmental evaluation value, the number of DL-capable devices, and the number of devices in the DL is used as distribution capability information.
  • the root node refers to the distribution capability information and should introduce the DL to be introduced to the new request node (node number 4> to ⁇ 7>).
  • Download Determines the original IP address and returns this IP address as a response to the query from the new request node.
  • the node device 1 corresponding to the DL source IP address notified to the new request node may be inquired of other node devices 1 as to whether or not the content can be downloaded. Then, the information request node such as the IP address of the device in the DL as topology information, the number of stages in the tree, etc. is determined according to the original stream type content node that receives the content.
  • a tree-type distribution form as shown in Fig. 10 (B) can be grasped. Then, after the state of Fig. 10 (B), a new request node is connected to the node device 1 with the node numbers ⁇ 5> and ⁇ 7> (refer to the broken arrow and the oval box in Fig. 10 (B)). Will deliver content
  • the query transmission date and time indicates the date and time when the downloading node transmits the query
  • the download start date and time indicates the date and time when the downloading node starts downloading.
  • the number of HOPs with the download source indicates the number of hops from the downloading node to the content node that is the download source, and this hop number is included in the IP packet when the downloading node exchanges with the content node. It is possible to obtain the reduced force of the TTL field. The smaller the number of hops, the closer the node power is to the content node. The reception status of the node being downloaded is better.
  • the download status indicates the percentage of the downloaded content in the node being downloaded. The closer the download status is to 100%, the closer the reception of the content being downloaded is to the end.
  • the request node has downloaded the content of node device 1 (stream type content node) whose download status is close to 100%. The probability that content data can be received without interruption until the end increases. For this reason, when a stream type content node that responds to a request node selects a stream type content node that responds to a request node, a root node that has a download status close to 100% is selected. The priority can be raised and selected.
  • the estimated effective bandwidth is the transmission speed assumed in the node being downloaded in units of bps (bit per second). The larger this size, the better the reception status of the node being downloaded. Indicates.
  • the assumed effective bandwidth may be obtained directly from the node being downloaded, or may be calculated by the root node from the download start date and time and the download status described above. In this embodiment, it is assumed that the assumed effective bandwidth is obtained directly from the node being downloaded, and the node being downloaded recognizes the assumed effective bandwidth itself! In this case, the node numbers in FIG. 10A are indicated as unknown as shown in 4> and ⁇ 6>.
  • the environment evaluation value is a value obtained by evaluating the communication environment of the node being downloaded.
  • A is the best and D and unknown are the least.
  • the environmental evaluation value is calculated from at least one of the number of HOPs with the download source, download status, and assumed effective bandwidth. In this embodiment, only the assumed effective bandwidth is calculated.Environmental evaluation value is calculated, the assumed effective bandwidth is 20Mbps or more, the environmental evaluation value is A, the assumed effective bandwidth is 10Mbps or more, but less than 20Mbps is the environmental evaluation value B, and the assumed effective bandwidth is 5Mbps or more, but less than 10Mbps.
  • Environmental assessment value C assumed effective bandwidth Less than 5 Mbps is assumed to be environmental assessment value D, and the environmental assessment value is also unknown if the assumed effective bandwidth is unknown (unknown).
  • the number of devices that can be downloaded indicates the number of devices that can be downloaded simultaneously from one node device 1, and is estimated according to the environmental evaluation value.
  • the number of downloadable devices is as follows: environmental evaluation value A: 4 units, environmental evaluation value B: 2 units, environmental evaluation value C: 1 unit, environmental evaluation value D and environmental evaluation value unknown: 0 units Yes.
  • Downloading nodes with one or more downloadable devices are node devices that are certified as stream type content nodes, and the number of downloadable devices is ⁇ ⁇ Downloading nodes are not certified as stream type content nodes Node device. In this way The root node selects one or more downloadable nodes with good network environment as devices that can distribute the content to other node devices.
  • the number of devices being downloaded indicates the number of node devices that are actually downloading the corresponding node device content at the present time. It is managed by the root node so that the number of devices being downloaded does not exceed the number of downloadable devices.
  • the number of devices being downloaded is zero. Downloading node device power of 1 request node, downloading node device power of node number ⁇ 2> Downloading node device power of 2 request nodes, node number ⁇ 5> One request node is being downloaded.
  • the DL source IP address is node information indicating the power of the node device 1 to directly download the content data and the power of downloading from which node device. That is, the DL source IP address can be said to be link information directed upstream in the tree type distribution form of the node device 1.
  • the IP address of the content node managed by the root node is “100.23.156.1” for all IP addresses.
  • the IP address of the device in the DL is information indicating to which node device 1 the content is distributed from the node device 1 downstream in the tree-type distribution form.
  • the IP address of the device in the DL can be said to be link information toward the downstream in the tree-type distribution form of the node device 1 concerned. Since the capacity of one node device may also distribute content to multiple node devices, the IP address of the device in the DL is the IP address of multiple IP addresses, such as the node device number 2> in Fig. 10 (A).
  • the number of stages in the tree is a number indicating the stage number of the node device 1 in the tree-type distribution form. Refer to the number of stages in the tree when deciding which branch (node device 1) should be connected to the new request node when adding a new request node to the tree-type distribution form. Is done.
  • topology information (DL source IP address, IP address of the device in the DL, in the tree)
  • IP address of the device in the DL, in the tree The topology of the tree-type distribution form can be ascertained from the three types of information).
  • the information table in Fig. 9 (A) shows the information at the time when the communication started to be busy, so the DL source IP address is all node devices 1 (node numbers 1> ⁇ ⁇ 3>) shows the IP address “100.23.156.1” of the content node.
  • new request nodes for the content that sent the query are sequentially managed in the lower column of the information table in Fig. 9 (A).
  • the node number added in Fig. 10 (A) is 4>.
  • the DL source IP address of the node device with the node number ⁇ 1> is a stream type content node.
  • the IP address of the device is “205.60.222.23”.
  • the root node when the node device with node number 4> issues a query, the root node returns the IP address of the node device with node number 1> as a response to the query.
  • the root node holds an information table so that topology information in a tree-type distribution form can be managed.
  • the root node knows all the information about which node is downloading the content with which node power, and when a new request node appears, it can introduce to which position in the distribution tree it should be connected.
  • various types of information such as topology information in the information tables shown in FIGS. 9A and 10A are not limited to this, and can be changed according to the embodiment.
  • the storage variables indicating each node device are connected with a pointer, and the LISP S-expression is used, such as (0 (1 (4)) (2 (5 (7)) (6)) (3) Good storage format.
  • the root node selects a stream type content node so as to be connected to the position represented by the broken line in FIG. Returns the IP address of as a response to the query.
  • each node device 1 should share the load evenly, it is better to select the node with the most power margin out of the nodes with sufficient DL number. Or if your policy is to avoid interruptions during playback as much as possible, choose a sword with DL status as close to 100% as possible! ,.
  • the operation of the system S when the communication status of the content node is busy (congested) will be described with reference to FIG.
  • a request node sends a query (including content ID “30210113”)
  • the query is forwarded to the root node via an intermediate node in some cases (1).
  • the node device 1-1 is a request node
  • the node devices 12 1, 13 and 14 are intermediate nodes
  • the node device 15 is a root node.
  • the root node that has received the query manages (stores) the content ID included in the query and searches for the index information, and the content ID “30210113” as shown in FIG. And the IP address “100.23.156.1” of the corresponding content node Therefore, the content node is inquired about the busyness of communication (2).
  • the content node recognizes its own communication busyness and transmits communication busyness information corresponding to this to the root node (3). Specifically, as shown in FIGS. 9A and 9B, the content node transmits communication busyness information indicating that content is currently being distributed to three node devices. The content node may send information to the root node that the communication busyness is out of the predetermined range at this time.
  • the content node confirms the node being downloaded (6), and transmits the node information (IP address: refer to Fig. 9 (A)) corresponding to each of these node devices to the root node ( 7).
  • the root node starts creating a stream-type content node information table as shown in FIG. 9A based on the received node information being delivered (8), and downloading is in progress corresponding to the received IP address.
  • the node (in this case, the request node) is inquired about the content reception status (query date, download start date, number of HOPs with the download source, download status, assumed effective bandwidth, etc.) (9).
  • the downloading node inquired about the content reception status transmits reception status information (see Fig.
  • the root node that has obtained the reception status information from the node being downloaded creates information for selecting a stream type content node from the assumed effective bandwidth, as shown in FIG. 9 (A).
  • the environmental evaluation value, the number of downloadable devices, the number of devices being downloaded, the IP address of the download source, the node device being downloaded Determine the list of IP addresses for device 1, the number of levels in the tree.
  • processing is performed to determine the stream type content node, so the download source IP address at this point is the IP address of the content node, and a list of IP addresses being downloaded Is empty and the number of devices being downloaded is 0 (zero).
  • the root node stores the node information being delivered, the reception status information, and information for selecting the stream type content node as a "stream type content node information table" (FIG. 9A).
  • the root node is one or more node devices (for example, node devices with node numbers ⁇ 1> and ⁇ 2>) selected as a delivering node device that can distribute content to other devices from the environmental evaluation value. Inquires of 1) whether content information can be distributed (11). In this case, this inquiry may be omitted if the DL node number estimated by the root node has high accuracy. Or conversely, if only low-accuracy estimation can be performed, the information table does not have an environmental evaluation value, and the configuration may be good.
  • node devices for example, node devices with node numbers ⁇ 1> and ⁇ 2>
  • the root node When the node power being downloaded inquired in this way is transmitted to the root node that content information distribution is possible (12), the root node recognizes the node device as a stream type content node (13). Then, the root node selects a node device that informs (transmits) the IP address to the requesting node as well as the central power of the node device that has been recognized as the stream type content node.
  • the method of selecting a stream type content node is as described in the above topology information.
  • the root node uses the IP address of the selected stream type content node as the content request destination, and sends it to the request node as a reply to the query (14). Note that the root node sends the IP address of the stream type content node to the request node (the node device that sent the query) that is equal to or less than a predetermined number (the number of downloadable devices described above) for one stream type content node. Is preferably transmitted. As a result, the communication status of the stream type content node is congested, and it is prevented that the quality of the content is deteriorated due to the interruption of communication or the occurrence of an error.
  • the request node Upon receiving the IP address of the content request destination, the request node transmits a content request (shared information request information of the present invention) to the stream type content node corresponding to the IP address (15). Upon receiving the content request, the stream type content node starts distributing the content to the request node that has transmitted the content request (16). In this way, the content distribution system S temporarily becomes a so-called tree-type communication form as shown in FIG. 10 (B), and communication congestion at the content node is alleviated.
  • a content request shared information request information of the present invention
  • the root node When a new request node starts downloading content from a stream type content node, the root node increases the number of node devices 1 shown in Fig. 9 (A) and Fig. 10 (A), and distribution capability information and topology information. Update the DL status of the reception status information.
  • the root node selects a stream type content node (13), the route information indicating that the stream type content node should be transmitted to the request node of the query transmission source is routed.
  • the node transmits to the cache node (17).
  • the root node since the IP address of the cache node is transferred to the root node when the public message of the content node is transferred, the root node corresponds to the IP address. Sends busy instruction information to all cache nodes.
  • the cache node uses the IP address indicating the stream type content node as the content request destination, Send to the request node of the query source (19)
  • the request node that has received the IP address of the content request destination transmits a content request to the stream type content node corresponding to the IP address (20).
  • the stream type content node starts distributing the content to the request node that has transmitted the content request (21).
  • FIG. Figure 12 shows that the cache node asks the content node about the busyness of the communication before the root node, and corresponds to the received busyness information. This shows the operation when it is determined that the communication busy level is outside the predetermined range, that is, the content node is very busy. In the following, items similar to those described with reference to FIG. 11 are omitted.
  • the cache node that has received the query searches the content ID included in the query from the index information that it manages (stores), determines that it is the cache node, and sends it to the content node. Inquire about the busyness of communication (32).
  • the content node recognizes its own communication busyness, and transmits communication busyness information corresponding to this to the cache node (33).
  • the cache node determines that the communication busy level corresponding to the received communication busy level information is out of the predetermined range, that is, the content node is very busy (34), the communication busy level is out of the predetermined range.
  • the busy communication report information to the effect is transmitted to the root node (35).
  • the cache node sends communication information to the root node during busy times, the query is sent in the same manner as the query is forwarded.
  • a stream type content node information table is created in the same manner as (4-13) when the communication busyness shown in Fig. 11 is outside the predetermined range. (36 to 44), a node device to be a stream type content node is selected, and the communication busy indication information similar to the above (17) is transmitted to the cache node (45).
  • the cache node transmits the IP address of the instructed stream type content node to the request node as a content request destination (46).
  • the request node Upon receiving the IP address of the content request destination, the request node transmits a content request to the stream type content node corresponding to the IP address (47). Upon receiving the content request, the stream type content node starts distributing the content to the request node that has transmitted the content request (48).
  • the cache node transmits the IP address of the instructed stream type content node as the content request destination to the request node (46), it transmits the transmitted information indicating that to the root node (49). .
  • the root node that has received the transmitted information updates the stream type content node information table in consideration that one request node is downloading content from the stream type content node corresponding to the IP address. (50).
  • the number of devices being downloaded and the IP address information of the device being downloaded are updated, and the node device 1 participating in the tree-type communication form is newly set as an information table as a stream-type content node.
  • the topology information in the tree-type communication mode is updated.
  • the request node does not update the topology information when the cache node responds to the query of the request node as described above. It is more preferable to update the information table when trying to start receiving. In this case, only the query is sent and content download is not actually started.
  • the root node can hold the information table more accurately.
  • the request node power instead of the processing of (49) in FIG. 12, the request node power also sends report information to the root node that “content download has started from a certain stream type content node”. Will be sent.
  • the cache node informs the return node of the stream type content node in the same way as the root node, so that the query concentrates on the root node, particularly when there are a plurality of node devices holding the content data. It is possible to prevent the processing from being delayed at the root node.
  • the root node that has received the query searches the content ID included in the query in the middle of the index information that it manages (stores), and determines that it is the root node.
  • the content node is inquired about communication busyness (52).
  • the content node recognizes its own busyness of communication, and the busy communication corresponding to this.
  • the degree information is transmitted to the root node (53).
  • the root node determines that the communication busyness corresponding to the received communication busyness information is within a predetermined range, that is, the content node is free (54)
  • the above-described stream type content node information table is created. If yes, delete this table and send the IP address of the content node as the content request destination to the request node of the query transmission source as usual (55).
  • the request node Upon receiving the IP address of the content request destination, the request node transmits a content request to the content node corresponding to the IP address (56). The content node that has received the content request starts delivering content to the request node that sent the content request (57).
  • the root node determines that the communication busyness is within a predetermined range (54), "Non-communication busy" indicating that the IP address indicating the content node should be sent to the request node that sent the query.
  • the root node transmits time indication information to the cache node (58).
  • the cache node queries the IP address indicating the content node as the content request destination. It is sent to the request node that is the sender of (60).
  • the request node Upon receiving the IP address of the content request destination, the request node transmits a content request to the content node corresponding to the IP address (61). Upon receiving the content request, the content node starts delivering content to the request node that sent the content request (62).
  • FIG. 14 shows that the cache node inquires the content node about the communication busyness before the root node, and the communication busyness corresponding to the received communication busyness information is within a predetermined range, that is, the content node becomes free. The operation when it is determined is shown.
  • the query is transferred to the cache node via an intermediate node (71).
  • the cache node Upon receiving the query, the cache node searches the index information managed (stored) for the content ID included in the query, and confirms that it is a cache node. Judgment is made, and the busyness of communication is inquired to the content node (72).
  • the content node inquired about the busyness of communication identifies its busyness and transmits the busyness information corresponding to this to the cache node (73).
  • the cache node determines that the communication busyness corresponding to the received communication busyness information is within a predetermined range, that is, the content node is free (74), the communication busyness is within the predetermined range.
  • the non-communication busy report information is transmitted to the root node (75).
  • the cache node transmits an IP address indicating the content node as a content request destination to the request node that is the source of the query (76).
  • the request node Upon receiving the IP address of the content request destination, the request node transmits a content request to the content node corresponding to the IP address (77). The content node that has received the content request starts delivering content to the request node that sent the content request (78).
  • the root node that has received the non-communication busy report information (75)
  • this table is deleted and The same non-communication busy instruction information is transmitted to the cache node (79).
  • the root node may send the non-communication busy instruction information only to a cache node other than the cache node that is the transmission source of the non-communication busy report information.
  • all the node devices 1 included in the content distribution system S are a request node, a cache node It can be any node device such as a root node, a content node, a node being downloaded, a stream type content node, an intermediate node on the route, or another node.
  • the request device transmits the query by the node device 1 And function.
  • the node device 1 that has received the query from the request node and inquired about the location of the content data stores the content information (node ID and the corresponding ID) in the index information stored in its storage unit 12. Function as a cache node or a root node.
  • the power of being a cache node and the power of being a V-rate node as described in [1. 4.
  • Each node device 1 recognizes whether it is the closest to the node ID (whether there is no other forwarding destination by looking at the routing table). Also, if it holds the content, it functions as a content node. Furthermore, the node device 1 that is the request node functions as a downloading node when the content is being downloaded, and the content being downloaded at that time is distributed to the other node devices 1. In this case, the node device 1 functions as a stream type content node.
  • FIG. 15 [0162]
  • processing performed by the node device 1 when functioning as each node will be described in detail with reference to FIGS. 15 to 21.
  • FIG. 15
  • FIG. 15 is a flowchart showing message analysis processing in the node device 1.
  • control unit 11 of the node device 1 When the control unit 11 of the node device 1 recognizes that the power has been turned on (power on: step S1), it initializes the UI display and the port setting on the display unit 16 of the node device 1 (step 1). S2) Is the power turned off? (Power off?) Is determined (step S3). Normally, the power supply is not suddenly turned off, so the control unit 11 determines that the power supply is turned off (step S3; NO), and there is an input of a content viewing request from the input unit 21. (Step S4). When the control unit 11 determines that there is an “input of content viewing request” from the input unit 21 (step S4; YES), the node device 1 operates as a request node and performs query transmission processing (step S5). ). Note that the request node then becomes a downloading node and may become a stream type content node.
  • step S4 when the control unit 11 determines that “input of content viewing request” from the input unit 21 is ineffective (step S4; NO), the control unit 11 sends a message from the communication unit 20. It is determined whether or not the received force is received (step S6). When the control unit 11 receives a message from the communication unit 20, If it is determined that there is no communication (step S6; NO), the process returns to step S3. If the control unit 11 determines that a message is received from the communication unit 20 (step S6; YES), the communication unit 20 is also received. Parse the message (step S7).
  • the node device 1 When the message analyzed by the control unit 11 is "query", the node device 1 itself determines whether or not the node device 1 stores the IP address corresponding to the content ID included in the query. It is determined whether or not power is a root node or a cache node (step S8). If the IP address corresponding to the content ID included in the query is memorized, the node unit 1 is not the root node and cache node of the content, so the control unit 11 makes such determination (step S8). ; NO), the received query is transferred (step S9). The process of transferring the query is as described above.
  • the control unit 11 of the node device 1 determines whether or not the inquired content ID is closest to its own node ID. (If there is no other forwarding destination with reference to the routing table) t, the power that is the root node of the content and the power that is the cache node are determined (step S8). From this, when the control unit 11 determines that the inquired content ID is closest to its own node ID (the root node of the content ID) (step S8 root node), the content node (stream type The process (1) for transmitting the IP address that is the node information of the content node (including the content node) is performed (step S10).
  • step S8 the control unit 11 of the node device 1 determines that the inquired content ID is not the closest to its own node ID and that there is another transfer destination, so that it is the cache node of the relevant content ID. If so (step S8 cache node), the process (2) for transmitting the IP address which is the node information of the content node (including the stream type content node) is performed (step S11).
  • the node device 1 When the message analyzed by the control unit 11 is “instruction information”, the node device 1 operates as a cache node or other node device 1 and performs an instruction information handling process (step S12). When the message analyzed by the control unit 11 is “report information”, the node device 1 operates as a root node, a cache node, or other node device 1 and performs report information handling processing (step S 13 ). [0169] If the message analyzed by the control unit 11 is a "content request (shared information request information)", the node device 1 operates as a content node or a stream type content node and performs content distribution processing (step S 14).
  • step S3 the control unit 11 determines that the power is turned off (step S3; YES), and ends this processing (end).
  • FIG. 16 is a flowchart showing processing performed when the program stored in the control unit 11 of the request node is executed by the control unit 11.
  • step S5 When the user inputs a content title or the like by operating the input unit 21 and an inquiry about the location of the desired content data is made (step S5: Start), the control unit 11 that recognizes this fact In addition, a content ID (unique identification information corresponding to shared information) indicating the content data is generated by hashing the content title and the like, and a query including the generated content ID is stored in the storage unit 12.
  • the routing table is referred to and transmitted to the other node device 1 (step S21).
  • the selection method of the other node device 1 is based on the method described in detail in the above-mentioned “1 3 Content data search method”.
  • step S22 upon receiving the IP address information (node information) of the content node from the root node or the cache node (step S22), the content request information is transmitted to the content node specified by the IP address information. (Step S23), and the content is received (Step S24). At this time, the node device 1 becomes a downloading node. Next, it is determined whether or not content reception has been completed (step S25). If content reception is completed as it is (step S25; YES), the received (downloaded) content is played back (step S26), and the process proceeds to the root node. Replica node (actually the same Registered as (not distinguishable from the content node)
  • step S25 determines whether or not the root node force reception status has been inquired (step S28). ) If there is no inquiry about the reception status (step S28; NO), the process returns to step S25 and continues to receive content while repeating the determination of S25 and S28.
  • step S28 If there is an inquiry about the reception status (step S28; YES), the control unit 11 inquires about the information about the received status and sends it to the root node of the matching (step). S29). Next, it is determined whether or not there has been an inquiry about “Ability to deliver content currently being received to other node devices” (step S30). Therefore, the control unit 11 makes such a determination (step S30; NO), continues the reception until the content reception is completed (step S31), and proceeds to step S26 described above.
  • control unit 11 makes such a determination (step S30; YES), and further, the content can be distributed to other node devices 1. It is determined whether or not the force is in an environment that can be used (step S32).
  • step S32 determines that the environment is such that the content can be distributed to the other node device 1 (step S32; YES)
  • the control unit 11 inquires about a message that the content can be distributed to the other node device 1. Transmit to the original root node (step S33) and proceed to step S31 described above.
  • step S34 a message indicating that the content cannot be delivered to other node devices is sent to the inquiry source route. Transmit to the node (step S34), and go to step S31 described above.
  • step S31 when the reception of the content is completed in step S31, the downloaded content is played back (step S26) in the same manner as described above, and the replica node (actually the same content as that of the content node) is obtained. Since it is held, it is registered as not distinguishable from the content node) (step S27), and this process ends (end).
  • FIGS. 17 and FIG. 18 are flowcharts showing processing performed when the program stored in the control unit 11 of the root node is executed by the control unit 11.
  • the control unit 11 of the root node determines that the content ID inquired from the content ID included in the query is not the transfer destination that is closest to its own node ID. It is determined that it is the root node of the ID (step S8 root node), and the process (1) for transmitting the IP address of the content node is started (step S10: start).
  • the control unit 11 searches for an IP address corresponding to the content ID included in the query and inquires the content node about the busyness of communication (step S41). Next, the control unit 11 determines whether the communication busyness information received from the content node is within a predetermined range (step S42). When the communication status of the content node is extremely congested and the control unit 11 determines that the communication busyness is outside the predetermined range (step S42; NO), the control unit 11 again distributes the content to the content node (the above-described download). Middle node) (step S43).
  • the control unit 11 Upon receipt of the node information being delivered (IP address) indicating the content downloading node (step S44), the control unit 11 starts creating a stream type content node information table, and the IP address Is inquired of the node device (node being downloaded) corresponding to the content reception status (step S45).
  • the control unit 11 sends information on the reception status of the content (territory transmission date and time of each downloading node, download start date and time, download source IP address, number of HOPs with the download source, download status, and assumed effective bandwidth. Etc.) from each downloading node (step S46), information for selecting a stream type content node based on this reception status information (environment evaluation value, number of downloadable devices, tree branching) The number of stages, new download source IP address, number of devices being downloaded) are determined (step S47). At the moment, the download source IP address is the IP address of the original content node, and the number of devices being downloaded is 0 (zero).
  • step S48 determines whether or not there is a downloading node that is determined to be a stream type content node.
  • step S48 determines whether or not there is a downloading node that is determined to be a stream type content node.
  • step S48 determines that there is a node being downloaded that is determined to be able to become a stream type content node with an environmental evaluation value of A, B, or C.
  • step S49 An inquiry is sent to the node being downloaded “Can the content currently being received be distributed to other node devices?”
  • control unit 11 determines that there is no node being downloaded that has an environmental evaluation value of A, B, or C and is determined to be a stream-type content node (step S48; NO).
  • a request node that can become a stream type content node again is selected through steps S44 to S47.
  • the control unit 11 of the root node determines that one or more request node powers of the inquiry transmission destination are “contents can be distributed to other node devices” as in step S33 described above or in step S34.
  • T receiving content to other node devices
  • t receiving a message
  • step S50 downloading the sender of the message “Contents can be distributed to other node devices”
  • the node is authorized as a stream type content node (step S51).
  • the control unit 11 selects one or a plurality of node devices 1 as the content request destination of the request node receiving the query from the stream type content nodes recognized as the content request destination (In step S52), the IP address of the selected node device 1 is transmitted to the request node (step S53). At this time, the control unit 11 makes the stream-type content node so that the topology of the tree-type communication form grows in a well-balanced manner (or matches the predetermined policy for selecting the stream-type content node). To inform the request node. Next, the control unit 11 The busy time indication information indicating that the IP address indicating the type content node should be sent to the requesting node that sent the query is sent to the cache node (step S54), and the processing ends (end).
  • step S42 when the control unit 11 determines that the communication status of the content node is relatively free and the communication busyness is within a predetermined range (step S42; YES), the control unit 11 1 One or more node devices 1 are selected as the content request destination of the request node receiving the request (step S55), and the IP address of the selected node device 1 is transmitted to the request node. (Step S56).
  • the control unit 11 performs processing for deleting this table (step S57). Specifically, even if content nodes are not busy, there is a high possibility that content is still being downloaded in a tree-type communication form. Therefore, when the root node deletes an information table, if there is a request node that downloads content in a tree-type communication mode, the connection should be changed so that the content is downloaded directly from the content node. An example is sending the instruction information to that effect to the request node.
  • the request node that has downloaded the content in the tree-type communication mode is allowed to continue the download, and until the download of the corresponding response node is completed,
  • One example is keeping an information table. Even if the information table is retained, after recognizing that the busyness of communication is within the predetermined range (step S42), the request node that has finished downloading without adding new information to the information table. Are deleted from the information table in order, and when all the request nodes are deleted from the information table, the information table itself is deleted. Note that in the case of V in which the stream type content node information table has not been created, the control unit 11 proceeds to the processing of step S58 with speed and power.
  • the control unit 11 transmits non-communication busy instruction information to the effect that "the IP address indicating the content node should be transmitted to the request source request node" to the cache node (step S58), End processing (END).
  • the root node receives the transmitted information after the cache node transmits the IP address of the stream type content node to the request node ( Step S87) described later. With this transmitted information, the root node can recognize which request node requests content from which stream type content node. Therefore, the information table can be updated based on the transmitted information in addition to the stream type content node information that the node itself has notified.
  • step S 13 in FIG. 15 the operation of node device 1 when node device 1 receives report information such as busy communication report information or non-communication busy report information. explain.
  • step S13 Upon receiving the report information from the other node device 1, the control unit 11 starts the report information handling process (step S13: Start). First, the control unit 11 determines whether or not it has received the busy report information (step S61). When the control unit 11 determines that the busy communication report information has been received (step S61; YES), it queries the content node for the node device that is delivering the content (the above-mentioned downloading node) (step S62). This step S62 is the same as step S43 in FIG. Subsequent steps S63 to S70 are the same as steps S44 to S51 in FIG.
  • the node device that becomes the stream type content node is authorized as the content request destination of the request node, and “the IP address indicating the stream type content node should be transmitted to the request node that sent the query” is busy.
  • the instruction information is transmitted to the cache node (step S71), and the process ends (end).
  • Step S72 when the control unit 11 receives the busy communication report information in step S61 and determines that the communication is busy (step S61; NO), the non-communication busy report information is received next.
  • Step S72 When the control unit 11 determines that the non-communication busy report information has been received (step S 72; YES), if the above-described stream type content node information table has been created, as in the above-described step S 57, Processing to delete this table is performed (step S 73), and the non-communication busy instruction information that “the IP address indicating the content node should be transmitted to the requesting request node” is transmitted to the cache node. Communication (step S 74), and the process ends (END).
  • step S72 if the control unit 11 determines that the non-communication busy report information has not been received (step S72; NO), since other report information has been received, it corresponds to the report information. (Step S75), and the process ends (END).
  • the root node receives a query after transmitting busy instruction information or non-communication busy instruction information, it operates as described with reference to FIG.
  • the IP address may be returned to the request source node of the query according to the instruction information transmitted by itself for a predetermined period.
  • FIG. 19 and FIG. 20 are flowcharts showing processing performed when the program stored in the control unit 11 of the cache node is executed by the control unit 11.
  • the cache node control unit 11 itself has a transfer destination in addition to the content ID included in the query after the query is transferred and there is a transfer destination that is closest to its own node ID. Is the cache node of the content ID (step S8 cache node), and the process for transmitting the IP address of the content node is started (step S11: start).
  • the control unit 11 searches the IP address corresponding to the content ID included in the query and inquires the content node of the busyness of communication (step S81). Next, the control unit 11 determines whether or not the communication busyness information received from the content node is within a predetermined range (step S82). When the communication status of the content node is extremely congested and the control unit 11 determines that the communication busyness is outside the predetermined range (step S82; NO), the control unit 11 notifies the root node that the communication busyness is outside the predetermined range. The communication busy report information is transmitted (step S83).
  • the cache node control unit 11 receives the busy instruction information indicating that the IP address indicating the stream type content node should be transmitted to the request node that is the transmission source of the query (step S84), The IP address corresponding to the stream type content node included in the instruction information is selected as the content request destination of the request node that receives the query (step S85), and the IP address of the selected node device 1 is Transmit to the request node (step S86).
  • the control unit 11 transmits the transmitted information that “the IP address of the stream type content node has been transmitted to the request node” to the root node (step S87), and ends the processing (end).
  • the transmitted information is information including the power of notifying which request node the IP address of which stream type content node.
  • step S82 when the control unit 11 determines that the communication status of the content node is relatively free and the communication busyness is within the predetermined range (step S82; YES), “the communication busyness is predetermined.
  • Non-communication busy report information is sent to the root node (step S88), and the content request destination of the request node receiving the query also includes one or more of the medium content nodes.
  • Node device 1 is selected (step S89), the IP address of the selected node device 1 is transmitted to the request node (step S90), and the process is terminated (end).
  • step S 12 in FIG. 15 the operation of node device 1 when node device 1 receives instruction information such as busy instruction information or non-communication busy instruction information. explain.
  • step S12 When receiving the instruction information from the other node device 1, the control unit 11 starts the instruction information handling process (step S12: start). First, the control unit 11 determines whether or not it has received the busy instruction information (step S91). If the control unit 11 determines that the communication busy instruction information has been received (step S91; YES), the IP address of the stream type content node included in the instruction information is stored as information to be returned when a query is received. (Step S92), the process ends (END).
  • control unit 11 receives the busy communication instruction information in step S91 and determines that there is no communication (step S91; NO), the non-communication busy instruction information is received next. (Step S93). Control unit 11 determines that it has received non-communication busy instruction information Then (step S93; YES), when a query is received, the normal IP address of the content node is returned (step S94), and the process ends (end).
  • step S93 if control unit 11 determines that it has not received non-communication busy instruction information (step S93; NO), it corresponds to the instruction information because it has received other instruction information. (Step S95), and the process ends (END).
  • a cache node when a cache node receives a query after receiving busy instruction information or non-communication busy instruction information, it operates as described with reference to FIG. Alternatively, the IP address may be returned to the request node that is the transmission source of the query according to the received instruction information for a predetermined period.
  • FIG. 21 is a flowchart showing processing performed when the program stored in the control unit 11 of the request node is executed by the control unit 11.
  • control unit 11 of the content node or the stream type content node recognizes that the request node has also received the content request, it starts the content distribution process (step S14: start).
  • the control unit 11 Upon receiving the content request from the request node, the control unit 11 starts content distribution to the request node that has transmitted the content request (step S101), and sets the IP address of the request node that is currently delivering the content. It is stored as the distributing node information of the downloading node (step S102). The stored delivering node information is transmitted from the root node to the content node when an inquiry is made about the node being downloaded.
  • control unit 11 continues the content distribution (step S103), determines whether or not the content distribution is completed (step S104), and until the content distribution is completed (step S104; NO) Then, the content distribution is continued (step S103), and when it is determined that the content distribution is completed (step S104; YES), the processing is ended (end).
  • the content distribution operation of the content node and the stream type content node is the same as that described above. As described in one chart, the stream type content node is different in that content is being received from other content nodes at the start of content delivery.
  • the content node when the content node is inquired about the communication busyness from the root node or the cache node, the content node recognizes the communication busyness of the content node itself, and communicates the communication busyness information to the inquiring node device. Send.
  • the root node and the cache node directly communicate the communication status to the content node.
  • Inquiry power It is not limited to this embodiment.
  • the root node and the cache node may be configured to inquire the communication status to the content node for the first time when the above-mentioned content IP address transmission count and the query reception count exceed a predetermined value. In this case, since the number of communications is reduced, the load on the content distribution system S is reduced.
  • the root node or cache node receives a query less than a certain number of times from the request node, or if there is no request node to make a distribution request again to one content node, etc. And can be appropriately determined according to the embodiment.
  • the predetermined range in the above-mentioned “communication busyness is within a predetermined range” and “communication busyness is outside the predetermined range” may not be the same.
  • the stream-type content node after the stream-type content node has received the content with the content-node power after the so-called tree-type communication mode using the stream-type content node is used, the stream-type content node Is disconnected from the content node and can function as a content node (replica node).
  • the node device that becomes the content node in this way the root node or the cache node can transmit the IP address of the new content node to the request node by a conventionally known method.
  • the root node takes this into consideration, and the node device that informs the request node of the IP address (original content node, new content node or stream type content node) ) Can be selected.
  • the “information storage node device” in the present invention may include a replica node that stores a copy of its content in addition to the force content node described above as the content node. Good.
  • the word “replica node” is used. Actually, the content node and the replica node have the same content data, and therefore, they are not distinguished from each other.
  • the “information storage node device” includes a replica node, for example, the root node and the cache node can inquire about the busyness of communication with the content node and all replica nodes. In addition, the number of content nodes and replica nodes is constant for the root node and cache node.
  • the communication busyness is set to only a certain number of node devices from the highest priority. It is good also as a form which inquires. This priority can be arbitrarily determined by the root node and the cache node based on the response speed of the communication busyness information.
  • the "information partial storage node device" in the present invention is a request node that requests content delivery at the beginning, is a downloading node while receiving content, and is authorized as a root node. It becomes a stream-type content node and sends content to other request nodes.
  • the content node lh As described in the lower frame of Fig. 8 and Fig. 10 (B), as the so-called tree type communication mode, the content node lh, the stream type content node le'lz (node number ⁇ 1> , ⁇ 2>; 1st stage), new request nodes lj, If ⁇ ld, la (node numbers 4>, ⁇ 5>, ⁇ 6>; 2nd stage) It is.
  • the root node manages using the topology information in Fig. 9 (A) and Fig. 10 (A), so that the request nodes lj, lf, ld, and la in the second stage are also stream-type contents. It is a node that is configured to communicate with a new request node (node number 7>; 3rd stage) downstream from it.
  • the cache node in order for the root node to know the location of the cache node, as described with reference to FIG. 6 in “1. 4. Content Data Registration Method”, the cache node has its own IP address. Transfer (node information) to public messages.
  • the method is not limited to the above method. For example, when registering content data, a process in which a public message is transferred to the root node via the content node power cache node. By storing the source IP address of each cache node power message, information can be transferred from the root node to the cache node in the reverse direction.
  • the root node is a busy communication instruction information transmitting means, a non-communication busy instruction information transmitting means, a busy communication report information receiving means, and a non-communication busy report information receiving means.
  • the cache node has a busy communication information transmission means, a non-communication busy Busy report information transmitting means, communication busy instruction information receiving means, and non-communication busy instruction information receiving means.
  • the cache node may transmit busy information indication information * non-communication busy indication information, so the cache node may receive communication busy report information receiving means and non-communication busy report information.
  • a program corresponding to each operation of the node device 1 described above is recorded on an information recording medium such as a flexible disk or a hard disk, or is acquired and recorded via a network such as the Internet.
  • an information recording medium such as a flexible disk or a hard disk
  • a network such as the Internet.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Information Transfer Between Computers (AREA)
  • Computer And Data Communications (AREA)
  • Two-Way Televisions, Distribution Of Moving Picture Or The Like (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

Système de délivrance de contenus et autres qui résout les problèmes tels que la dégradation de la qualité du contenu lorsqu’une pluralité d’appareils nœud requièrent simultanément un contenu auprès d’un appareil nœud. Dans un système de délivrance d’informations (S) ayant une pluralité d’appareils nœud qui constituent un réseau et qui sont connectés les uns aux autres, un appareil nœud de route qui connaît l’emplacement d’un contenu détermine un facteur d’activité de communication représentant la concentration locale de communications concernant un appareil nœud de contenu (1h) qui stocke le contenu. Lorsque l’activité de communication de cet appareil nœud de contenu est très importante, l’appareil nœud de route transmet une adresse IP désignant un appareil nœud stockant une partie des informations (1z) et qui a stocké une partie seulement du contenu déjà reçu, de façon à demander à des appareils nœud (1j, 1f) qui sont sources de transmission les informations requises du contenu.
PCT/JP2006/314657 2005-08-24 2006-07-25 Système de délivrance d’informations, méthode de délivrance d’informations, appareil nœud inclus dans le système de délivrance d’informations et support de stockage sur lequel un programme de traitement d’informations a été stocké WO2007023636A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
JP2005-243335 2005-08-24
JP2005243335A JP4715388B2 (ja) 2005-08-24 2005-08-24 情報配信システム、情報配信方法、情報配信システムに含まれるノード装置および情報処理プログラム

Publications (1)

Publication Number Publication Date
WO2007023636A1 true WO2007023636A1 (fr) 2007-03-01

Family

ID=37771387

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/JP2006/314657 WO2007023636A1 (fr) 2005-08-24 2006-07-25 Système de délivrance d’informations, méthode de délivrance d’informations, appareil nœud inclus dans le système de délivrance d’informations et support de stockage sur lequel un programme de traitement d’informations a été stocké

Country Status (2)

Country Link
JP (1) JP4715388B2 (fr)
WO (1) WO2007023636A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2008141547A1 (fr) * 2007-05-21 2008-11-27 Hong Kong Applied Science & Technology Research Institue Co., Ltd. Systèmes et procédés pour une transmission en continu p2p

Families Citing this family (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2008035337A (ja) * 2006-07-31 2008-02-14 Brother Ind Ltd ノード装置、配信装置、管理装置、情報処理プログラム、コンテンツ配信方法及びコンテンツ配信システム
JP4623030B2 (ja) * 2007-03-27 2011-02-02 ブラザー工業株式会社 ツリー型放送システム、接続先決定方法、接続管理装置、及び接続管理処理プログラム等
JP5462252B2 (ja) * 2008-07-02 2014-04-02 トムソン ライセンシング ２部ピアオーバレイを用いてｐ２ｐモードにおいてピア間でコンテンツデータを伝送する装置及び方法
JP5168055B2 (ja) * 2008-09-26 2013-03-21 ブラザー工業株式会社 通信システム、端末装置及びコンテンツ情報取得方法
CN101841553B (zh) * 2009-03-17 2014-03-12 日电（中国）有限公司 网络上请求资源的位置信息的方法、用户节点和服务器
JP5386763B2 (ja) * 2010-12-03 2014-01-15 株式会社日立製作所 ファームウェア更新システム、ファームウェア更新方法、及び管理計算機
JP5282795B2 (ja) * 2011-02-25 2013-09-04 ブラザー工業株式会社 情報通信システム、情報処理方法、ノード装置及びプログラム
JP6310264B2 (ja) * 2014-02-06 2018-04-11 日本放送協会 コンテンツ配信システム及びアドレス情報通知サーバ
KR102026423B1 (ko) * 2018-02-01 2019-10-01 주식회사 딸기커뮤니케이션 저작권 보호를 위한 콘텐츠 권한 설정을 통한 실시간 콘텐츠 판매 서비스 제공 방법

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2003249960A (ja) * 2002-02-01 2003-09-05 Microsoft Corp サービス品質のプロービングと解析を行うピアツーピアの方法およびこの方法を使用する基盤
JP2004213508A (ja) * 2003-01-08 2004-07-29 Hitachi Software Eng Co Ltd ピアツーピア技術を用いたファイルダウンロード方法及びシステム

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP3698073B2 (ja) * 2001-06-13 2005-09-21 日本電信電話株式会社 サーバ選択装置、方法、プログラム及び該プログラムを記録した記録媒体
JP2004127189A (ja) * 2002-10-07 2004-04-22 Matsushita Electric Ind Co Ltd ゲートウェイ装置、コンテンツ転送システム及びコンテンツ転送方法
JP2005196676A (ja) * 2004-01-09 2005-07-21 Nippon Telegr & Teleph Corp <Ntt> サービス生成方法、サービス生成システムおよびプログラム

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2003249960A (ja) * 2002-02-01 2003-09-05 Microsoft Corp サービス品質のプロービングと解析を行うピアツーピアの方法およびこの方法を使用する基盤
JP2004213508A (ja) * 2003-01-08 2004-07-29 Hitachi Software Eng Co Ltd ピアツーピア技術を用いたファイルダウンロード方法及びシステム

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
NAKAMURA Y. ET AL.: "A basic study on Content Drift method based on popularity for Content Basd Network", IEICE TECHNICAL REPORT, vol. 103, no. 650, 5 February 2004 (2004-02-05), XP003008679 *
NAKAUCHI K. ET AL.: "Distributed Content Location for Ubiquitous Environments", IEICE TECHNICAL REPORT, vol. 102, no. 352, 23 September 2002 (2002-09-23), pages 7 - 12, XP002998442 *
ZHAO B.Y. ET AL.: "Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and Routing", TECHNICAL REPORT UCB/CSD-01-1141, April 2001 (2001-04-01), pages 1 - 27, XP002995768 *

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2008141547A1 (fr) * 2007-05-21 2008-11-27 Hong Kong Applied Science & Technology Research Institue Co., Ltd. Systèmes et procédés pour une transmission en continu p2p

Also Published As

Publication number Publication date
JP4715388B2 (ja) 2011-07-06
JP2007058597A (ja) 2007-03-08

Similar Documents

Publication Publication Date Title
JP4715388B2 (ja) 情報配信システム、情報配信方法、情報配信システムに含まれるノード装置および情報処理プログラム
US7882168B2 (en) Contents distribution system, node apparatus and information processing method thereof, as well as recording medium on which program thereof is recorded
US8195764B2 (en) Information delivery system, delivery request program, transfer program, delivery program, and the like
JP4375303B2 (ja) 情報通信システム、情報通信方法、情報通信システムに含まれるノード装置、情報処理プログラムおよびノード装置のプログラム
JP2006197400A (ja) 情報配信システム、情報更新プログラム、及び情報更新方法等
WO2007060862A1 (fr) Systeme de distribution d&#39;informations, procede de distribution d&#39;informations, dispositif de nœud et support d&#39;enregistrement
WO2007119413A1 (fr) Système de communication d&#39;informations, procédé de distribution d&#39;informations de catalogue de contenu, dispositif de noeuds et autres
WO2006103800A1 (fr) Dispositif de traitement d’informations et dispositif de stockage, procede de traitement d’informations et procede de stockage, et programme de traitement d’informations et dispositif de programme pour le stockage
WO2008013036A1 (fr) Dispositif de nœud, support d&#39;enregistrement contenant un programme de traitement d&#39;informations, procédé de distribution de contenu et système de distribution de contenu
JP2006195744A (ja) 情報配信システム、配信要求プログラム、転送プログラム、配信プログラム等
US8903906B2 (en) Information communications system, node device, method of communicating contents, computer readable recording medium storing a program
US8819295B2 (en) Information communication system, first information processing device, method for processing information, and computer readable storage medium
US8332463B2 (en) Distributed storage system, connection information notifying method, and recording medium in which distributed storage program is recorded
JP2010271933A (ja) 分散保存システム、ノード装置、ノード処理プログラム及びデータファイル保存方法
JP4692278B2 (ja) コンテンツ配信システム、端末装置及びその情報処理方法並びにそのプログラム
JP4765876B2 (ja) コンテンツ配信システムにおける端末装置及びその情報処理方法並びにプログラム
JP4877107B2 (ja) 情報配信システムにおける端末装置及び情報処理プログラム、並びに端末装置の情報処理方法
JP4797679B2 (ja) コンテンツ配信システム、コンテンツデータ管理装置及びその情報処理方法並びにそのプログラム
US20100250593A1 (en) Node device, information communication system, method for managing content data, and computer readable medium
JP2008059398A (ja) 識別情報割当装置及びその情報処理方法並びにそのプログラム
JP2009232272A (ja) コンテンツ分散保存システム、コンテンツ再生方法、ノード装置、管理装置、ノード処理プログラム、及び管理処理プログラム
JP5434268B2 (ja) 分散保存システム、データファイル分散保存方法及びプログラム
JP5007624B2 (ja) コンテンツ分散保存システム、コンテンツデータ取得方法、ノード装置、及びノード処理プログラム
JP2011008657A (ja) コンテンツ配信システム、ノード装置、コンテンツ配信方法及びノードプログラム
JP4867845B2 (ja) コンテンツ分散保存システム、コンテンツデータ取得方法、ノード装置、及びノード処理プログラム

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application
NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 06781569

Country of ref document: EP

Kind code of ref document: A1