JP2013178609A - Node device, information communication system, upload method and program - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a node device, an information communication system, an information communication method and a program or the like in which an upload of content from a first node device to a second node device is prevented from being abnormally repeated.SOLUTION: During a fixed period of time for determining whether an upload amount to a specific node device becomes equal to or more than a predetermined threshold value within a fixed period of time, if the presence of a node device for which the upload amount becomes equal to or more than the predetermined threshold value is determined, an upload-side broadband router BR3 restricts the upload to the node device for which the upload amount becomes equal to or more than the predetermined threshold value. Specifically, during a predetermined period of time, an upload to the node device for which the upload amount becomes equal to or more than the predetermined threshold value is prohibited by the broadband router BR3.

Description

  The present invention relates to a technical field of a peer-to-peer (P2P) communication system including a plurality of node devices that can communicate with each other via a network.

  In recent years, a peer-to-peer communication system as disclosed in Patent Document 1 has attracted attention. The peer-to-peer communication system is attracting attention as a new form that replaces the server client system, which is the mainstream form of current content distribution. In this peer-to-peer communication system, content requests to the server device at the center are not concentrated. Therefore, content can be acquired in a short time compared to the server client method. On the other hand, since the amount of data transmitted from a specific node device may increase, communication carriers such as ISPs (Internet Service Providers) that provide network connection services need to make capital investments such as line enhancement. . As a countermeasure, Patent Document 1 discloses a technology in which a node device whose content upload amount exceeds a predetermined amount is prohibited from uploading content to another node device.

JP 2011-192132 A

  In an actual peer-to-peer network environment, uploading from a specific first node device to a specific second node may be repeatedly executed. This is considered to be caused by a failure of the storage unit of the second node device or when the storage unit has insufficient capacity. When the storage unit fails, the specific second node device cannot store the content. At this time, if the software error processing is incomplete, the content request from the second node device to the first node device is repeatedly transmitted. Alternatively, the operator of the distribution system needs to input content having a size corresponding to the capacity of the storage means of each node device. However, if an excessively large content is input by an incorrect operation, the capacity of the storage means is reduced. Similarly, content requests from the second node device to the first node device may be repeatedly transmitted. In these situations, uploading of content from the first node device to the second node device is abnormally repeated.

  The present invention has been made in view of the above points. It is an object of the present invention to provide a node device, an information communication system, an upload method, a program, and the like that can prevent the content upload from the first node device to the second node device from being repeated abnormally.

  According to the first aspect of the present invention, a node device of an information communication system capable of transmitting and receiving content using an overlay network composed of a plurality of node devices, which stores content transmitted and received on the overlay network Storage means for receiving, receiving means for receiving a content upload request from any other node device of the plurality of node devices, and the specific other node device of the request source of the upload request received by the receiving means A first determination unit that determines whether or not the content upload processing to the threshold value is executed within a predetermined period, and the first determination unit determines whether the content upload processing to the specific other node device is predetermined If it is determined that the process has been executed over the threshold within the period, to the specific other node device A node device, comprising a first limiting means for limiting the upload content and.

  According to a second aspect of the present invention, the first restricting unit is configured such that the first determination unit has executed the content uploading process to the specific other node device within a predetermined period at a threshold value or more. If it is determined, uploading of the content to the specific other node device is prohibited for a predetermined period.

  According to a third aspect of the present invention, there is provided an information communication system capable of transmitting / receiving content using an overlay network including a plurality of node devices, wherein the node device transmits / receives content via the overlay network. Storing means for storing, receiving means for receiving an upload request for content from any other node device of the plurality of node devices, and the specific other of the request source of the upload request received by the receiving means A first determination unit that determines whether or not content upload processing to the node device has been executed within a predetermined period, and a content upload processing to the specific other node device is performed by the first determination unit. If it is determined that the processing is executed within a predetermined period, the specific other node A first limiting means for limiting the upload content to location, information communication system comprising: a.

  According to a fourth aspect of the present invention, the first restricting unit is configured such that the first determination unit has executed the content uploading process to the specific other node device within a predetermined period at a threshold value or more. If it is determined, uploading of the content to the specific other node device is prohibited for a predetermined period.

  According to the invention described in claim 5, the other node device acquires the content uploaded by the node device, and the acquisition unit acquires the content uploaded by the node device. When the second determination unit that determines whether or not the failure has been repeated a plurality of times and the second determination unit determines that the acquisition of the content uploaded by the node device has failed a plurality of times, the specific other And second restriction means for restricting a content request by a node device for a predetermined period.

  According to the invention described in claim 6, the node device and the other node device can communicate with each other by at least one of IPv4 (Internet Protocol Version 4) and IPv6 (Internet Protocol Version 6), The overlay network includes a first overlay network composed of node devices communicable with IPv4, and a second overlay network composed of node devices communicable with IPv6, and the other node devices are the other The node device includes a third determination unit that determines whether communication is possible with both IPv4 and IPv6, and the second determination unit repeatedly fails to acquire the content uploaded by the node device a plurality of times. And when the third determination unit determines that communication is possible with both IPv4 and IPv6, the acquisition unit is configured to connect an overlay network to which the node device to which content acquisition is restricted is connected. The content is requested to either the first overlay network or the second overlay network different from the above.

  According to the seventh aspect of the present invention, there is provided an information communication system upload method capable of transmitting and receiving content using an overlay network composed of a plurality of node devices, the method being any one of the plurality of node devices. A reception step of receiving a content upload request from the node device, and a process of uploading the content to the specific other node device of the request source of the upload request received by the reception step within a predetermined period When it is determined by the first determination step that determines whether or not the upload process of the content to the specific other node device has been executed in a predetermined period or more by the first determination step, A restriction step that restricts the uploading of content to certain other node devices; It is an upload method, including.

  According to an eighth aspect of the present invention, a computer of a node device of an information communication system capable of transmitting / receiving content using an overlay network composed of a plurality of node devices is provided with any one of the plurality of node devices. A reception step of receiving a content upload request from the node device, and a process of uploading the content to the specific other node device of the request source of the upload request received by the reception step within a predetermined period When it is determined by the first determination step that determines whether or not the upload process of the content to the specific other node device has been executed in a predetermined period or more by the first determination step, A restriction step for restricting the uploading of content to certain other node devices; Is a program for causing executed.

  According to the first aspect of the present invention, the first restricting unit determines that the content uploading process to the specific other node device is executed by the first determining unit over a threshold value within a predetermined period. In this case, uploading of content to a specific other node device is restricted. As a result, even if the upload of content from the node device to a specific other node device is repeated abnormally, the upload of the content is restricted, and therefore it is possible to prevent the upload from being repeated abnormally.

  According to the second aspect of the present invention, the first restricting unit determines that the content uploading process to the specific other node device has been executed by the first determining unit over a threshold within a predetermined period. In this case, uploading of content to a specific other node device is prohibited for a predetermined period. As a result, even when uploading of content from a node device to a specific other node device is abnormally repeated, uploading of content is prohibited for a predetermined period, thus preventing abnormal uploading from being repeated. it can.

  According to the third aspect of the present invention, the first restricting unit determines that the content uploading process to the specific other node device is executed by the first determining unit over a threshold value within a predetermined period. In this case, uploading of content to a specific other node device is restricted. As a result, even if the upload of content from the node device to a specific other node device is repeated abnormally, the upload of the content is restricted, and therefore it is possible to prevent the upload from being repeated abnormally.

  According to the fourth aspect of the present invention, the first restricting unit determines that the content uploading process to the specific other node device has been executed by the first determining unit over the threshold within a predetermined period. In this case, uploading of content to a specific other node device is prohibited for a predetermined period. As a result, even when uploading of content from a node device to a specific other node device is abnormally repeated, uploading of content is prohibited for a predetermined period, thus preventing abnormal uploading from being repeated. it can.

  According to the fifth aspect of the present invention, when the second determination unit determines that the acquisition of the content uploaded by the node device has failed repeatedly a plurality of times, a request for the content by a specific other node device is made. And a second limiting means for limiting for a predetermined period. As a result, even when uploading of content from a node device to a specific other node device is abnormally repeated, requesting content on the specific other node device side is limited for a predetermined period of time. , Can prevent repeated uploads abnormally.

  According to the sixth aspect of the present invention, the node device and other node devices can communicate with each other by at least one of IPv4 (Internet Protocol Version 4) and IPv6 (Internet Protocol Version 6). The overlay network includes a first overlay network composed of node devices communicable with IPv4 and a second overlay network composed of node devices communicable with IPv6. When it is determined by the second determination means that the acquisition of the content uploaded by the node device has failed repeatedly, and it is determined by the third determination means that communication is possible with both IPv4 and IPv6 The acquisition unit requests the content from either the first overlay network or the second overlay network different from the overlay network to which the node device to which the content acquisition is restricted is connected. Therefore, even when uploading is abnormally repeated between nodes in either the IPv4 or Ipv6 overlay network, the content is requested to an overlay network different from the overlay network in which the upload is repeated. As a result, even if uploading of content from a node device to another node device is repeated abnormally, the content is requested to an overlay network different from the overlay network in which the upload is repeated, so that upload abnormalities are prevented. be able to.

  According to the invention described in claim 7 and claim 8, in the limiting step, it is determined in the first determination step that the uploading process of the content to the specific other node device is executed within a predetermined period or more. If so, the uploading of content to a specific other node device is restricted. As a result, even if the upload of content from the node device to a specific other node device is repeated abnormally, the upload of the content is restricted, and therefore it is possible to prevent the upload from being repeated abnormally.

It is a schematic block diagram of the information communication system S of this embodiment. It is explanatory drawing explaining the upload restriction | limiting method of this embodiment. It is a block diagram which shows the electric constitution of the broadband router of this embodiment. It is a flowchart which shows the process sequence of the main operation | movement in the broadband router of this embodiment. It is a flowchart which shows the process sequence of the download request process in the broadband router of this embodiment.

[Best Embodiment]
DESCRIPTION OF EXEMPLARY EMBODIMENTS Hereinafter, the best embodiment of the invention will be described with reference to the drawings. The embodiment described below is an embodiment when the present invention is applied to a peer-to-peer information communication system.

[Outline configuration of information communication system S]
First, the schematic configuration of the information communication system S in the present embodiment will be described with reference to FIG. FIG. 1 is a diagram illustrating an example of a connection mode between the broadband router BR and each terminal device in the information communication system S according to the present embodiment. As shown in FIG. 1, the information communication system S includes a plurality of broadband routers BR (BR1, BR2, BR3) and terminal devices Tm-n (m = 1, 2, 3,..., N = 1. , 2, 3... The terminal devices Tm-n can communicate with each other via the network NW. This network NW is a real-world communication network. For example, the Internet.

The network NW is a network for interconnecting the base networks NLm. This network NW is, for example, the Internet or WAN (Wide Area Network).
) Etc. The network NW includes, for example, an IX (Internet Exchange), an ISP (Internet Service Provider), a DSL (Digital Subscriber Line) line provider apparatus, an FTTH (Fiber To The Home) line provider apparatus, and a communication line. Is built by. The network NW may be a network dedicated to the information communication system S.

  In the present embodiment, one or more base networks NLm are formed in the network NW. In addition, a broadband router BR is connected to each base network NLm. A plurality of terminal devices Tm-n are connected to the broadband router BR at each base. Each base network NLm is a network constructed in the site of the base m. Examples of the base include a company, a school, a hospital, a cram school, and a karaoke BOX. This base network NLm is constructed by a LAN or the like, for example. Alternatively, the base network NLm may be a network constructed by interconnecting a plurality of LANs. In this case, the plurality of LANs are connected via a network device such as a router. An example of a network in which a plurality of LANs are interconnected is CAN (Campus Area Network). A broadband router BR is connected to each base network NLm. A firewall may be connected instead of the broadband router BR. The broadband router BR is a communication device that enables communication between the terminal device Tm-n connected in the base and the terminal device Tm-n other than the terminal device Tm-n connected to the base. Since the firewall or the broadband router BR is publicly known, detailed description thereof is omitted. Whether the broadband router BR or the firewall is installed at the base is arbitrarily determined for each base. The base network NLm of this embodiment is, for example, a LAN (Local Area Network). When the base network NLm is a karaoke BOX, the terminal device Tm-n is a karaoke device (commander).

  A center server SV is connected to the network NW. The center server SV stores an original of content data transmitted / received in a first overlay network OL or a second overlay network PL described later. The center server SV transmits content catalog information to the broadband router BR. Details of the content catalog information will be described later. The center server SV manages the content ID used when content data is input to the first overlay network OL or the second overlay network PL described later. Here, the input of the content data means that the terminal device Tm-n is in a state where it can be acquired from the broadband router BR. The content data is hereinafter referred to as “content”. Details of the center server SV will be described later.

  Each broadband router BR is assigned a unique serial number and an IP (Internet Protocol) address. Each broadband router BR connected to the information communication system S is assigned a node ID, which is unique identification information having a predetermined number of digits. In the information communication system S of the present embodiment, a first overlay network OL and a second overlay network PL for content distribution are constructed. The first overlay network OL and the second overlay network PL are overlay networks constructed on the network NW. In other words, the first overlay network OL and the second overlay network PL are logical networks generated on a physical network. The first overlay network OL and the second overlay network PL are realized by a specific algorithm, for example, an algorithm using a distributed hash table. Hereinafter, the distributed hash table is referred to as “DHT (Distributed Hash Table)”. Note that a routing table using DHT is known in Japanese Patent Application Laid-Open No. 2006-197400. Note that the broadband router BR of the present embodiment is an example of the node device of the present invention. In the present embodiment, the first overlay network OL is configured by a node device that can communicate by IPv4 (Internet Protocol Version 4). In addition, the second overlay network PL is configured by a node device that can communicate by IPv6 (Internet Protocol Version 6). Note that the node device of the present embodiment participates in at least one of the first overlay network OL and the second overlay network PL.

[How to participate in the first overlay network OL and the second overlay network PL]
Hereinafter, a method of participating in the first overlay network OL and the second overlay network PL will be described.

  In connection with the information communication system S, a broadband router not connected to the information communication system S transmits a participation message indicating a request for participation in the information communication system S to any connected broadband router. Is done by. Participation in the information communication system S means that a broadband router is connected to the information communication system S and content can be acquired from the information communication system S. That is, participating in the first overlay network OL or the second overlay network PL means various types of communication with other broadband routers via the first overlay network OL or the second overlay network PL based on the routing table using DHT. It means to operate in a state where messages can be sent and received. The arbitrary broadband router is, for example, a broadband router that is always connected to the information communication system S. Hereinafter, the broadband router that is always connected is referred to as a contact node.

  The broadband router participating in the information communication system S transmits the participation message to the contact node, so that the broadband router can acquire the DHT routing table from the contact node. In the present embodiment, there are two contact nodes, a first contact node that can communicate with IPv4 and a second contact node that can communicate with IPv6. Instead of installing two contact nodes, the first contact node and the second contact node, the center server SV may function as the first contact node and the second contact node. In this case, the center server SV is a server device that can communicate with both IPv4 and IPv6.

  In the present embodiment, the first contact node stores a first routing table, and the second contact node stores a second routing table. Further, when the center server SV is used instead of installing the two contact nodes of the first contact node and the second contact node, the center server SV stores the first routing table and the second routing table. A detailed description of the first routing table and the second routing table will be described later.

  First, it is determined whether or not a broadband router that is not connected to the information communication system S can communicate with IPv4, and whether or not the broadband router can communicate with IPv6.

  When it is determined that the broadband router can communicate only with IPv4, a participation message is transmitted to the first contact node in order to participate in the first overlay network OL. Then, the broadband router acquires the first routing table from the first contact node. The first routing table is a routing table that can communicate with a node device connected to the first overlay network OL. When it is determined that the broadband router can communicate only with IPv6, the participation message is transmitted to the second contact node in order to participate in the second overlay network PL. Then, the broadband router acquires the second routing table from the second contact node. The second routing table is a routing table that can communicate with a node device connected to the second overlay network PL.

  When it is determined that the broadband router can communicate with both IPv4 and IPv6, in order to participate in at least one of the first overlay network OL and the second overlay network PL, A participation message is transmitted to at least one of the second contact nodes. The broadband router may participate in both the first overlay network OL and the second overlay network PL. In this case, the broadband router acquires the first routing table from the first contact node and acquires the second routing table from the second contact node.

[Details of routing table]
Details of the routing table of this embodiment will be described below. Each broadband router stores a routing table using DHT (Distributed Hash Table). This routing table defines the transfer destinations of various control messages on the information communication system S. The control message is a message for controlling the operation of the peer-to-peer information communication system. In other words, the control message is a message for use in content search or content acquisition in a peer-to-peer information communication system. The control message is a message transmitted / received according to the DHT routing table. Specifically, a plurality of pieces of node information including node IDs, IP addresses, and port numbers of broadband routers that are moderately separated in the ID space are registered in this routing table. One broadband router connected to the information communication system S stores the minimum necessary broadband router node information as a routing table. By transferring control messages between the broadband routers, node information about broadband routers that do not store node information is acquired. Further, the information communication system S can operate as a peer-to-peer information communication system by transmitting and receiving control messages by each broadband router. The DHT routing is known in Japanese Patent Application Laid-Open No. 2006-197400 and the like, and thus detailed description thereof is omitted. In the present embodiment, a first routing table for transmitting / receiving information via the first overlay network OL and a second routing table for transmitting / receiving information via the second overlay network PL are used.

[Outline of content acquisition operation]
In the information communication system S, various contents having different contents are distributed and stored in a plurality of broadband routers. Each content is given a content ID, which is unique identification information for each content name and content data, by the center server SV. Attribute information such as content name and content ID of each content is described in the content catalog information. The content catalog information is created by the center server SV and distributed to all node devices. Each content is divided into a plurality of data. The divided data is hereinafter referred to as “chunk”.

<Content ID assignment processing>
When the content input process is executed by the broadband router or the center server SV, first, the broadband router or the center server SV gives a content ID to the content to be input. The content ID assigned at this time may be randomly generated by the broadband router or the center server SV. In addition, the range of content IDs that can be assigned by each broadband router may be determined. For example, the grant range is a content ID that matches a predetermined number of bits from the upper bits of the node ID assigned to each broadband router. In this case, the content ID may be determined at random from the given range.

<Chunk division processing>
In the present embodiment, each chunk is generated by, for example, dividing a content with a predetermined data size by a broadband router or a center server SV. In the present embodiment, the minimum data size of a chunk is 2 MB (Mega Byte). The maximum data size of the chunk is 128 MB. However, as a result of division into chunks, some chunks may be smaller than 2 MB. In addition, if the data size before being divided into chunks is originally smaller than 2 MB, the chunk may have a data size of less than 2 MB. In the present embodiment, the content data is divided into a plurality of chunks. However, as described in the present embodiment, the content data may not be divided into a plurality of chunks. Content data that is not divided may be applied to the present embodiment. Each chunk is distributed and stored in a plurality of broadband routers. As a result, the original content is distributed and stored in a plurality of broadband routers. The original of each chunk is stored in the center server SV.

<Chunk ID assignment process>
Each chunk is assigned a sequence number and a chunk ID by the broadband router or the center server SV. The sequence number corresponds to, for example, an arrangement order when a plurality of divided chunks are arranged so as to constitute the original content. The chunk ID is identification information unique to each chunk.

<Chunk hash value generation processing>
When the broadband router or the center server SV assigns the chunk ID, the hash value of the chunk is generated. The hash value is generated using a predetermined hash function. The hash value is used to check, for example, chunk tampering.

<Meta information file generation processing>
When the chunk ID and the hash value of the chunk are generated, a meta information file is generated. The meta information file is information for searching for content composed of divided chunks. The meta information file includes a given chunk ID, a sequence number, and a hash value of the chunk. The meta information file is given a content ID of content composed of divided chunks. When each broadband router acquires a content ID of a certain content, it acquires a meta information file. Specifically, the broadband router acquires the meta information file based on the content ID assigned to the meta information file. When the broadband router acquires the meta information file, the broadband router acquires a chunk ID included in the meta information file. Based on the acquired chunk ID, a chunk of content is acquired. Thereby, the chunk ID of each chunk constituting the content can be acquired in association with the sequence number.

  The broadband router that stores the chunks of the present embodiment is referred to as a “content holding node”. The location of the chunk is stored as index information by a broadband router that manages or stores the location of the chunk. Hereinafter, the broadband router that manages the location of the chunk is referred to as a “root node”. The index information includes a set of broadband router node information that stores the chunk, chunk ID of the chunk, and the like. Such a root node is determined to be a node having a node ID closest to the chunk ID, for example. The node ID closest to the chunk ID is, for example, a node ID with the highest number of upper digits of the ID.

  When the meta information file is generated by the above-described processing, the broadband router transmits the generated meta information file to the center server SV. When the meta information file is generated by the center server SV, the meta information file may not be transmitted. The meta information file received and stored by the center server SV is stored in one of the plurality of node devices.

<Detailed description of content acquisition operation>
Details of the content acquisition operation of this embodiment will be described below. When a certain broadband router wants to acquire desired content, the broadband router searches for a content holding node that stores each chunk constituting the desired content. Hereinafter, a broadband router that desires to acquire a chunk is referred to as a “user node”. Specifically, the user node transmits a search message. This search message includes the content ID of the content desired to be acquired and the node information of the user node. This search message is transmitted to other broadband routers according to the DHT routing table stored in the user node. That is, the user node transmits a search message toward the root node. As a result, the search message finally arrives at the root node by DHT routing using the content ID as a key. The DHT routing is known in Japanese Patent Application Laid-Open No. 2006-197400 and the like, and thus detailed description thereof is omitted.

  The root node that receives the search message acquires one or more index information corresponding to the content ID included in the search message from the index information cache. The acquired index information is returned to the user node that is the transmission source of the search message based on the node information of the user node. The user node that has acquired the index information in this way acquires or downloads the meta information file corresponding to the content ID based on the index information. Specifically, the user node transmits a content request message to the content holding node based on the IP address and port number of the content holding node included in the index information. The content request message includes the node information of the user node and the content ID of the desired content. When receiving the content request message, the content holding node transmits or uploads a meta information file corresponding to the content ID included in the content request message to the user node. On the other hand, when there is no content holding node that stores the desired meta information file, the user node cannot acquire the index information of the content holding node. In this case, the user node may acquire the meta information file from the center server SV.

  Alternatively, the root node transmits a content transmission request message to the content holding node indicated by the IP address or the like included in the index information. The content transmission request message includes node information of a transmission source of the content request message. The content holding node that has received the content transmission request starts transmitting or uploading the meta information file to the user node indicated by the node information included in the received message. As a result, the user node can acquire the meta information file from the content holding node.

  Then, when the user node acquires and stores the meta information file from the content holding node, the user node releases the meta information file. Release of the meta information file means notifying the root node that the user node has saved the meta information file as a content holding node. By publishing the meta information file, other node devices can acquire the published meta information file from the published content holding node. Specifically, the user node that stores the meta information file transmits a publish message. The publish message includes the content ID of the meta information file and the node information of the user node storing the meta information file. The publish message is sent toward the root node. As a result, the publish message arrives at the root node by DHT routing using the content ID as a key, like the search message. The root node stores index information including a set of node information and content ID included in the received publish message in the index information cache. In this way, the user node becomes a new content holding node for storing the meta information file.

  When the user node acquires the meta information file, the user node transmits a chunk search message based on the chunk ID included in the acquired meta information file. The chunk search message includes a chunk ID and node information of the user node. The chunk search message is transmitted to another broadband router according to the DHT routing table stored in the user node. That is, the user node transmits a chunk search message toward the root node of the chunk. As a result, the chunk search message finally arrives at the root node of the chunk by DHT routing using the chunk ID as a key. The DHT routing is known in Japanese Patent Application Laid-Open No. 2006-197400 and the like, and thus detailed description thereof is omitted.

  The root node that has received the chunk search message acquires one or a plurality of index information corresponding to the chunk IDs included therein from the index information cache. The acquired index information is returned to the user node that is the transmission source of the chunk search message based on the node information of the user node. The user node that has acquired the index information in this way acquires or downloads a chunk based on the index information. Specifically, the user node transmits a chunk request message to the content holding node based on the IP address and port number of the content holding node included in the index information. The chunk request message includes the node information of the user node and the chunk ID of the chunk that is desired to be acquired. The content holding node that has received the chunk request message transmits or uploads a chunk corresponding to the chunk ID included in the chunk request message to the user node. On the other hand, when there is no content holding node that stores a desired chunk, the user node cannot acquire the index information of the content holding node. In this case, the user node may acquire a chunk from the center server SV.

  Alternatively, the root node transmits a chunk transmission request message to the content holding node indicated by the IP address or the like included in the index information. The chunk transmission request message includes node information of a transmission source of the chunk request message. The content holding node that has received the chunk transmission request starts transmitting or uploading the chunk to the user node indicated by the node information included in the received message. As a result, the user node can acquire a chunk from the content holding node.

  Then, when the user node acquires the chunk from the content holding node and stores it, the user node discloses the chunk. Chunk disclosure refers to notifying a root node that a user node has saved a chunk as a content holding node. By publishing the chunk, other node devices can acquire the published chunk from the published content holding node. Specifically, the user node that stores the chunk transmits a publish message. The publish message includes the chunk ID of the chunk and the node information of the user node storing the chunk. The publish message is sent to the root node of the chunk. As a result, the publish message arrives at the root node by DHT routing using the chunk ID as a key, like the search message. The root node stores index information including a set of node information and chunk ID included in the received publish message in the index information cache. Thus, the user node becomes a new content holding node that stores chunks.

[Upload limit method]
Hereinafter, the upload restriction method of the present embodiment will be described with reference to FIG. In the example illustrated in FIG. 2, the broadband router BR1 and the broadband router BR3 participate in the overlay network OL, and the broadband router BR2 participates in the overlay network PL.

  In order to request the desired content, the broadband router BR1 inquires the content holding node to the root node of the requested content. As a result, it is assumed that the broadband router BR1 acquires the node information of the broadband router BR3 as a content holding node from the root node of the requested content. Next, the broadband router BR1 requests content from the broadband router BR3 which is a content holding node (FIG. 2 (1)). In this embodiment, the broadband router BR3 uploads content toward the broadband router BR1 (FIG. 2 (2)). In other words, the broadband router BR1 downloads content from the broadband router BR.

  When the content is successfully downloaded by the broadband router BR1 by the process (2) in FIG. 2, the broadband router BR1 can acquire the requested content. A successful download indicates that the content could be stored in the storage means of the broadband router BR1. On the other hand, when the content download fails due to the process (2) in FIG. 2, the broadband router BR1 cannot acquire the requested content. The download failure indicates that the content could not be stored in the storage unit of the broadband router BR1. In this case, the broadband router BR1 makes a content request to the broadband router BR3 again (FIG. 2 (1)). Then, the broadband router BR3 uploads the requested content to the broadband router BR1 again by the process (2) in FIG. As a result, the broadband router BR1 downloads the content from the broadband router BR3 again.

  As a cause of the content download failure, for example, it is conceivable that the content cannot be stored in the storage unit due to a failure of the storage unit of the broadband router BR1. In this case, the uploading of content from the broadband router BR3 to the broadband router BR1 is repeated. In other words, the broadband router BR1 repeats downloading contents from the broadband router BR3.

  In order to solve this problem, in the present embodiment, the broadband router BR3 on the uploading side determines whether or not the upload amount toward a specific node device has exceeded a predetermined threshold value during a certain period. (FIG. 2 (3)). Specifically, the broadband router BR3 associates the node information including the node ID of the upload destination broadband router with the upload amount of the content uploaded within a predetermined period to the upload destination and stores it as upload information. To do. Specifically, every time content is uploaded, the broadband router BR3 stores the node information of the upload destination broadband router in association with the upload amount as upload information. Each time content is uploaded, the upload information is updated and stored in the broadband router BR3.

  If it is determined by the process of (3) in FIG. 2 that there is a node device whose upload amount is equal to or greater than a predetermined threshold during a certain period, Upload is restricted by the broadband router BR3. Specifically, for a predetermined period, the broadband router BR3 prohibits uploading to a node device whose upload amount is equal to or greater than a predetermined threshold.

  In the present embodiment, the broadband router BR1 on the download side associates the requested content ID, the requested content holding node, and the number of download failures with each other, and stores it as failure count information. The number of download failures indicates the number of times that the broadband router BR1 has failed to store the requested content in the storage means of the broadband router BR1. Each time content download fails, the broadband router BR1 updates the failure count information. Based on the failure frequency information, the broadband router BR1 determines whether the number of failed downloads is equal to or greater than a predetermined value (FIG. 2 (4)). When it is determined by the broadband router BR1 that the number of failed downloads has become a predetermined value or more, the broadband router BR1 determines that there is an abnormality in the storage means of the broadband router BR1. The broadband router BR1 is restricted from acquiring content. The content acquisition restriction indicates that the content request is prohibited for a predetermined period. After a predetermined period, the content request may be permitted again. Note that the content acquisition restriction may limit the download request of the broadband router BR1 during a predetermined period. In addition, during a predetermined period, the content request from the broadband router BR1 to the overlay network OL in which the broadband router BR participates may be restricted. Further, acquisition of content from a requesting broadband device that has repeatedly failed to download may be restricted. In addition, acquisition of content that has been repeated and failed to be downloaded may be restricted.

  In the present embodiment, the limitation on content acquisition is that the request for content to the overlay network OL in which the broadband router BR1 participates is limited. In this case, the restriction on content acquisition indicates that a content request to the overlay network OL is prohibited for a predetermined period. After a predetermined period, the content request may be permitted again.

  Further, when the broadband router BR1 is a name that can be communicated by both IPv4 and IPv6, as a restriction on the acquisition of content, a request for content to the overlay network OL may be prohibited and participation in the overlay network PL may be permitted. In this case, the broadband router BR1 executes a participation process for the overlay network PL. Then, the broadband router BR1 requests content from the overlay network PL.

  Specifically, the broadband router BR1 inquires the content holding node to the root node of the requested content using the overlay network PL. As a result, it is assumed that the broadband router BR1 acquires the node information of the broadband router BR2 as a content holding node from the root node of the requested content. Next, the broadband router BR1 requests content from the broadband router BR2 which is a content holding node (FIG. 2 (5)). In this embodiment, the broadband router BR2 uploads content to the broadband router BR1 (FIG. 2 (6)). Thereby, the broadband router BR1 can download content from the broadband router BR2.

  When the content is successfully downloaded by the process of (6) in FIG. 2, the broadband router BR1 can acquire the requested content. On the other hand, if the content download fails due to the process (6) in FIG. 2, the broadband router BR1 cannot acquire the requested content. In this case, the broadband router BR1 makes a content request to the broadband router BR2 again (FIG. 2 (5)). Then, the broadband router BR2 uploads the requested content to the broadband router BR1 again by the process of FIG. 2 (6). In other words, the broadband router BR1 repeatedly downloads content from the broadband router BR2.

  Similar to the processing of (1) and (2) in FIG. 2, it is conceivable that the content cannot be stored in the storage means due to a failure of the storage means of the broadband router BR1, for example, as a cause of the content upload or download failure. . In this case, uploading of content from the broadband router BR2 to the broadband router BR1 is repeated. For this reason, as in the process of FIG. 2 (3), the broadband router BR2 on the upload side determines whether or not the upload amount toward a specific node device has exceeded a predetermined threshold value during a certain period. You may judge. Specifically, the broadband router BR2 associates the node information including the node ID of the upload destination broadband router with the upload amount of the content uploaded within a predetermined period, and stores it as upload information. To do. Accordingly, when it is determined that there is a node device whose upload amount is equal to or greater than a predetermined threshold during a certain period, upload to the node device whose upload amount is equal to or greater than the predetermined threshold is transmitted by the broadband router BR2. Limited. Specifically, for a predetermined period, the broadband router BR2 prohibits uploading to a node device whose upload amount is equal to or greater than a predetermined threshold.

  Similarly to the processing of FIG. 2 (4), in the present embodiment, the broadband router BR1 associates the requested content ID, the requested content holding node, and the number of failed downloads with the failure frequency information. Remember as. Each time content download fails, the broadband router BR1 updates the failure count information. When it is determined by the broadband router BR1 that the number of failed downloads has become a predetermined value or more, the broadband router BR1 determines that there is an abnormality in the storage means of the broadband router BR1. The broadband router BR1 is restricted from acquiring content in the same manner as the process (4) in FIG.

  Thereby, even when the broadband router BR1 can participate in both the overlay network OL and the overlay network PL, the acquisition of content is limited. Therefore, since downloading or uploading of content is restricted, it is possible to prevent abnormal downloading or uploading from being repeated.

[Electric configuration of broadband router BR]
Next, the electrical configuration of the broadband router BR will be described with reference to FIG. FIG. 3 is a block diagram showing an electrical configuration of the broadband router BR of the present embodiment. As shown in FIG. 3, the broadband router BR according to the present embodiment includes a CPU 1 that controls the broadband router BR. An HDD 2, a RAM 3, a decoder unit 4, and a communication unit 9 are electrically connected to the CPU 1. The storage means such as the HDD 2 and the RAM 3 and the CPU 1 constitute a computer of the broadband router BR. The timekeeping operation is executed by the computer of the broadband router BR. By the clocking operation, the broadband router BR can measure the date and time or the time. The CPU 1, HDD 2, RAM 3, decoder unit 4, and communication unit 9 are connected to each other via a bus. In addition to the broadband router BR, the present invention can be applied to a personal computer, an STB (Set Top Box), a firewall, or the like.

  The HDD 2 includes a program storage area 21, a first routing table storage area 23, a second routing table storage area 24, and a contact node storage area 25. The program storage area 21 includes a main operation processing program storage area 22. The main operation processing program storage area 22 stores a main operation processing program. The main operation processing program is a program that causes the broadband router BR to execute main operation processing. The main operation processing program of the broadband router BR may be downloaded from a predetermined server on the network NW, for example, or may be recorded on a recording medium such as a CD-ROM and a drive of the recording medium may be used. You may make it read via.

  The first routing table storage area 23 stores the first routing table of the present embodiment. The second routing table storage area 24 stores the second routing table of the present embodiment. The contact node storage area 25 stores the IP addresses of the first contact node and the second contact node. The IP addresses of the first contact node and the second contact node expressed in IPv4 or IPv6 are stored in the contact node storage area 25. A participation message is transmitted based on the IP addresses of the first contact node and the second contact node stored in the contact node storage area 25. Note that the IP addresses of the first contact node and the second contact node may be stored in advance, or may be acquired when the main operation processing program is downloaded. When a center server SV capable of communicating with both IPv4 and IPv6 is installed instead of the first contact node and the second contact node, the IPv4 IP address and the IPv6 IP address of the center server SV are in contact with each other. Stored in the node storage area 25.

  The RAM 3 includes a content data temporary storage area 31, a control message temporary storage area 32, a restriction list temporary storage area 33, a failure count information temporary storage area 34, a date / time information temporary storage area 35, and an upload information temporary storage area 36. The content data temporary storage area 31 temporarily stores content data transmitted / received in the overlay network OL or the overlay network PL in association with the content ID. Instead of the RAM 3, a known storage device such as a flash memory may be used. Note that the content data temporary storage area 31 of this embodiment is an example of the storage means of the present invention.

  In the control message temporary storage area 32, a control message for controlling the information communication system S is temporarily stored. The restriction list temporary storage area 33 temporarily stores a restriction list. The restriction list temporarily stores node information including the node ID of the upload destination broadband router whose upload amount has become a predetermined threshold abnormality.

  The failure count information temporary storage area 34 temporarily stores the above-described failure count information. The date and time information temporary storage area 35 temporarily stores the date and time used for initializing the restriction list. The upload information temporary storage area 36 temporarily stores upload information. Specifically, each time content is uploaded, the broadband router temporarily stores the node information of the upload destination broadband router in association with the upload amount as upload information. Each time content is uploaded, the upload information is updated and temporarily stored in the upload information temporary storage area 36.

  The communication unit 9 controls communication of information with the broadband router BR or an external device through the network NW.

  The broadband router BR performs reception processing for receiving content, chunks, or meta information files transmitted in response to requests via the communication unit 9. The content, chunk, or meta information file of the present embodiment is packetized and transmitted. Each packet is received through the communication unit 9 and temporarily stored in the content data temporary storage area 31 of the RAM 3. Alternatively, the content stored in the RAM 3 may be read from the RAM 3 and stored in the HDD 2. Alternatively, the content data may be stored directly in the HDD 2 without going through the RAM 3. Thereafter, the content is read from the RAM 3 or the HDD 2 in accordance with a request from the terminal device Tm-n. The read content is transmitted from the broadband router to the requesting terminal device Tm-n via the communication unit 9.

[Main operation of broadband router]
The operation and action of the broadband router of the present embodiment having the above-described configuration will be described with reference to the accompanying drawings. First, the operation and action of the broadband router will be described with reference to the accompanying drawings. FIG. 4 is a flowchart showing a processing procedure of the main operation in the broadband router. The main operation of the broadband router is performed by connecting an external power source such as a commercial power source and the broadband router via a power source or an outlet. The processing shown below is processed by the CPU 1. Note that, based on the execution of the main operation process, the date and time when the main operation process was executed is determined by the timekeeping function of the broadband router. The determined date / time is temporarily stored in the date / time information temporary storage area 35.

  First, in step S101, it is determined whether a download request has been received from another broadband router. In other words, it is determined whether an upload request has been received from another broadband router. If it is determined that a download request has been received from another broadband router (step S101: YES), step S102 is executed. If it is not determined that a download request has been received from another broadband router BR (step S101: NO), step S107 is executed. Note that the computer of this embodiment and step S101 are examples of the receiving means of the present invention. Moreover, step S101 of this embodiment is an example of the receiving step of this invention.

  In step S102, based on the upload information, it is determined whether the upload amount to the broadband router that requested the download in step S101 is within a predetermined threshold. When it is determined that the upload amount is within a predetermined threshold (step S102: YES), step S106 is executed. When it is not determined that the upload amount is within the predetermined threshold (step S102: NO), step S103 is executed. The computer of this embodiment and step S102 are an example of the first determination unit of the present invention. Moreover, step S102 of this embodiment is an example of a first determination step of the present invention.

  In step S103, the node information of the broadband router that requested the download in step S101 is added to the restriction list. As a result of the addition, the restriction list is updated and stored in the restriction list temporary storage area 33.

  In step S104, the date and time when the node information is registered in the restriction list in step S103 is determined by the timekeeping function of the broadband router. The determined date and time is associated with the node information added in step S103 and stored in the restriction list temporary storage area 33. In the present embodiment, only the time measured by the time measuring function may be determined as the date and time. In the present embodiment, only the date measured by the timing function may be determined as the date and time. In the present embodiment, both the date and time measured by the clock function may be determined as the date and time.

  In step S105, upload restriction setting is executed. Specifically, upload to the broadband router indicated by the node ID of the node information registered in the restriction list is restricted by the broadband router. The upload limitation in the present embodiment indicates that uploading is prohibited for a predetermined period. Also, uploading may be permitted again after uploading is prohibited for a predetermined period. In addition, the computer of this embodiment and step S105 are an example of the 1st restriction | limiting means of this invention. Moreover, step S105 of this embodiment is an example of the limiting step of the present invention.

  In step S106, uploading is permitted. Based on the approval of the upload, the requested content is uploaded to the broadband router that requested the download. Then, the node information of the upload destination broadband router and the upload amount of the uploaded content are associated with each other and temporarily stored in the upload information temporary storage area 36 as upload information.

  In step S107, it is determined whether or not the restriction list is temporarily stored in the restriction list temporary storage area 33. If it is determined that the restriction list is temporarily stored (step S107: YES), step S108 is executed. If it is determined that the restriction list is not temporarily stored (step S107: NO), step S110 is executed.

  In step S108, the date and time registered in the restriction list in step S104 and the current date and time are compared. As a result of the comparison, it is determined whether or not node information that has passed for a certain period after uploading is restricted is in the restriction list. Specifically, it is determined whether or not the date and time when a predetermined period has elapsed from the current date and time is registered in the restriction list. When the date and time when a predetermined period has elapsed from the current date and time is registered in the restriction list, it is determined that the node information that has passed for a certain period after the upload is restricted is in the restriction list. On the other hand, if the date and time when a predetermined period has elapsed from the current date and time is not registered in the restriction list, it is determined that the node information that has passed for a certain period after the upload is restricted is not in the restriction list. The If it is determined that node information that has passed for a certain period of time after uploading is restricted is in the restriction list (step S108: YES), step S109 is executed. If it is not determined that the node information that has passed for a certain period after the upload is restricted is in the restriction list (step S108: NO), step S114 is executed.

  In step S109, the upload restriction is removed. Specifically, the node information determined to have passed for a certain period in step S108 is deleted from the restriction list. The restriction list from which the node information has been deleted is stored in the restriction list temporary storage area 33, whereby the restriction list is updated. As a result, the upload restriction is removed.

  In step S110, it is determined whether or not a certain period has elapsed from the date and time temporarily stored in the date and time information temporary storage area 35. Specifically, the date and time temporarily stored in the date and time information temporary storage area 35 is compared with the current date and time measured by the time measuring function of the broadband router. As a result of the comparison, if it is determined that the predetermined period has elapsed (step S110: YES), step S111 is executed. If it is not determined that the predetermined period has elapsed (step S110: NO), step S112 is executed.

  In step S111, the upload information is initialized. Specifically, the upload information stored in the upload information temporary storage area 336 is deleted. The deleted date / time is temporarily stored in the date / time information temporary storage area 35 again.

  In step S112, it is determined whether download is requested. Specifically, it is determined whether or not the broadband router BR has requested content download to another broadband router. If it is determined that the download is requested (step S112: YES), step S113 is executed. If it is not determined that the download has been requested (step S112: NO), step S114 is executed. In step S113, a download request process is executed. Details of the download request process will be described later.

  In step S114, it is determined whether the power of the broadband router has been turned off. When it is determined that the power of the broadband router has been turned off (step S114: YES), the main operation process is terminated. If it is not determined that the power of the broadband router is turned off (step S114: NO), step S101 is executed.

[Download request processing]
Hereinafter, the operation of the download request process of the present embodiment will be described with reference to FIG. First, in step S201, it is determined whether or not the number of download failures of the content requested to be downloaded in step S112 is greater than or equal to a threshold value. Specifically, based on the failure frequency information stored in the failure frequency information temporary storage area 34, it is determined whether or not the download failure frequency is greater than or equal to a threshold value. First, in step S112, the content ID of the content requested to be downloaded is determined. Based on the failure count information, it is determined whether or not the download failure count of the content indicated by the determined content ID is equal to or greater than a threshold value. If it is determined that the number of download failures is equal to or greater than the threshold (step S201: YES), step S202 is executed. If it is not determined that the number of download failures is equal to or greater than the threshold (step S201: NO), step S206 is executed. In addition, the computer of this embodiment and step S201 are an example of the 2nd determination means of this invention.

  In step S202, it is determined whether or not the broadband router can use both IPv4 and IPv6. For example, based on the setting file stored in the HDD 2 of the broadband router, it is determined whether or not the broadband router can use both IPv4 and IPv6. When it is determined that both IPv4 and IPv6 can be used (step S202: YES), step S203 is executed. If it is not determined that both IPv4 and IPv6 can be used (step S202: NO), step S205 is executed. In addition, the computer of this embodiment and step S202 are an example of the 3rd determination means of this invention.

  In step S203, it is determined whether or not the mobile station has already joined the overlay network of a protocol different from the currently used protocol. Specifically, in this embodiment, in order to participate in the overlay network, the broadband router needs to access the contact node. By accessing the contact node, the broadband router can obtain a routing table necessary for participating in the overlay network. For this reason, when the routing table is stored in both the first routing table storage area 23 and the second routing table storage area 24, it is determined that the mobile terminal has already joined the overlay network of a protocol different from the currently used protocol. Is done. On the other hand, if the routing table is stored only in one of the first routing table storage area 23 and the second routing table storage area 24, it has not participated in the overlay network of a protocol different from the currently used protocol. Determined. When it is determined that the mobile phone has already joined the overlay network of a protocol different from the currently used protocol (step S203: YES), step S205 is executed. If it is not determined that the mobile phone has already joined the overlay network of a protocol different from the currently used protocol (step S203: NO), step S204 is executed.

  In step S204, a participation message is transmitted to participate in the overlay network that did not store the routing table in step S203. Specifically, the participation message is transmitted to a contact node corresponding to a protocol different from the protocol storing the routing table. Thereby, the broadband router can acquire the routing table for participating in the overlay network that was not stored in step S203. For example, if it is determined in step S203 that the first routing table corresponding to IPv4 is not stored, a participation message is transmitted to the first contact node. If it is determined in step S203 that the second routing table corresponding to IPv6 is not stored, a participation message is transmitted to the second contact node.

  In step S205, a storage abnormality of the broadband router is notified. Specifically, it is notified that there is an abnormality in the storage means such as HDD 2 or RAM 3 of the broadband router. The notification method may be notified by an LED or the like provided in the broadband router. As a result of notification of storage abnormality, downloading of the broadband router BR is restricted. That is, downloading is restricted for a certain period. Note that the computer of this embodiment and step S205 are an example of the second limiting means of the present invention.

  In step S206, the node information of the content holding node is inquired to the root node based on the download request in step S112.

  In step S207, it is determined whether node information has been received from the root node. If it is determined that the node information has been received (step S207: YES), step S208 is executed. If it is not determined that the node information has been received (step S207: NO), step S209 is executed.

  In step S208, a download request is transmitted to the content holding node indicated by the node information received in step S207.

  In step S209, a download request is transmitted to the center server SV.

  In step S210, it is determined whether or not the free space is greater than or equal to a predetermined value. Specifically, it is determined whether or not the free space in the content data temporary storage area 31 is greater than or equal to a predetermined value. If it is determined that the free space is greater than or equal to the predetermined amount (step S210: YES), step S211 is executed. If it is not determined that the free space is greater than or equal to the predetermined amount (step S210: NO), step S213 is executed.

  In step S211, content download is started from the request destination in step S208 or step S209. In addition, the computer of this embodiment and step S211 are an example of the acquisition means of this invention.

  In step S212, it is determined whether the content has been successfully downloaded. Specifically, it is determined whether or not the content requested in step S208 or step S209 has been downloaded and stored in the content temporary storage area 31. If it is determined that the requested content is stored in the content temporary storage area 31, it is determined that the download is successful. If it is determined that the requested content is not stored in the content temporary storage area 31, it is determined that the download has not been successful, that is, has failed. If it is determined that the download is successful (step S212: YES), the download request process is terminated. If it is not determined that the download was successful (step S212: NO), step S213 is executed.

  In step S213, the failure frequency information is updated based on the fact that the download has failed. Specifically, the number-of-failures information is updated in association with the content ID of the requested content in step S112 and the number of failures. The updated failure frequency information is temporarily stored in the failure frequency information temporary storage area 34.

  In the present embodiment, as an example of processing for determining whether or not the content upload processing has been executed within a predetermined period, whether the upload amount to a specific broadband router is within a predetermined threshold in step S102. It was determined whether or not. In the present embodiment, the node information and the upload amount are associated as the upload information, but the present invention is not limited to this. As the upload information, for example, the number of requests received within a predetermined period from a specific node device may be used instead of the upload amount. In this case, the broadband router stores node information of the upload destination broadband router and the number of requests from the upload destination broadband router in association with each other as upload information. In step S102, it is determined whether or not a content request has been made more than once for a predetermined period from a specific node device. If it is determined that there has been a request for a content more than once from a specific node device for a predetermined period, step S102 is determined as “YES”. On the other hand, when it is not determined that a content request has been made more than once for a predetermined period of time from a specific node device, step S102 is determined as “NO”.

  In the present embodiment, as an example of processing for determining whether or not the content upload processing has been executed within a predetermined period, whether the upload amount to a specific broadband router is within a predetermined threshold in step S102. It was determined whether or not. As a modification of the present embodiment, for example, the number of requests for specific content received from a specific node device within a predetermined period may be used as upload information. In this case, the broadband router stores the content ID of the requested content, node information of the upload destination broadband router, and the number of requests from the upload destination broadband router in association with each other as upload information. In step S102, it is determined whether or not a specific node device has requested content for a specific content more than once for a predetermined period. If it is determined that there has been a content request for a specific content more than once for a specific period of time from a specific node device, step S102 is determined as “YES”. On the other hand, if it is not determined that there has been a request for content for a specific content more than once from a specific node device for a predetermined period, step S102 is determined as “NO”.

  Further, as a modification of step S102 of the present embodiment, as upload information, the content ID of the uploaded content, the node information of the upload request destination, and the content upload amount indicated by the content ID are associated with each other. good. In this case, the broadband router stores the content ID of the requested content, node information of the upload destination broadband router, and the upload amount to the upload destination broadband router in association with each other as upload information. In step S102, it is determined whether the upload amount to a specific node device is within a predetermined threshold within a predetermined period for the specific content. When it is determined that the upload amount to the specific node device is within a predetermined threshold within a predetermined period for the specific content, step S102 is determined as “YES”. On the other hand, if it is not determined that the upload amount to the specific node device is within the predetermined threshold within a predetermined period for the specific content, step S102 is determined as “NO”.

  In this embodiment, the peer-to-peer communication system using the DHT routing table is applied to the first overlay network OL or the second overlay network PL. However, the present invention is not limited to this. The present invention may be applied to other peer-to-peer communication systems or systems using overlay networks. For example, the present invention may be applied to a communication system using a routing table other than DHT or a peer-to-peer communication system. An example of a peer-to-peer communication system that does not use DHT is a hybrid peer-to-peer communication system. The present invention may be applied to a hybrid peer-to-peer communication system or a pure peer-to-peer communication system.

  In this embodiment, an example in which the present invention is applied to a broadband router has been described, but the present invention is not limited to this. As the node device, the terminal device Tm-n of the present embodiment may be used. The first overlay network OL or the second overlay network PL may be configured by the terminal device Tm-n connected to each base or the terminal device Tm-n that can be directly connected to the network NW. In this case, the terminal device Tm-n can communicate with either IPv4 or IPv6, or both IP protocols of IPv4 and IPv6.

  In step S114 in FIG. 4 of the present embodiment, it is determined whether or not the power is turned off. In addition to determining whether the power is turned off, it may be determined whether there is an instruction to leave the overlay network. When it is determined that there is an instruction to leave the overlay network, the main operation process is ended as in step S114 of FIG. On the other hand, when it is not determined that there is an instruction to leave the overlay network, step S101 is executed as in step S114 of FIG. When it is determined in step S114 whether or not there is an instruction to leave, the main operation process may be executed based on an instruction to join the overlay network.

1 CPU
2 HDD
3 RAM
9 Communication unit 21 Program storage area 22 Main operation processing program storage area 23 First routing table storage area 24 Second routing table storage area 25 Contact node storage area 31 Temporary content storage area 32 Control message temporary storage area 33 Restriction list temporary storage area 34 Number of times information temporary storage area 35 Date and time information temporary storage area 36 Upload information temporary storage area Tm-n Terminal device NLm Base NW network BR, BR1, BR2, BR3 Broadband router S Information communication system OL First overlay network PL Second overlay Network SV center server

Claims (8)

A node device of an information communication system capable of transmitting and receiving content using an overlay network composed of a plurality of node devices,
Storage means for storing content transmitted and received on the overlay network;
Receiving means for receiving a content upload request from any other node device of the plurality of node devices;
First determination means for determining whether or not content upload processing to a specific other node device that is a request source of the upload request received by the reception means has been executed within a predetermined period,
When it is determined by the first determination means that the content uploading process to the specific other node device has been executed within a predetermined period, the content uploading to the specific other node device is performed. First limiting means for limiting;
A node device comprising:   The first restricting unit may be configured to perform the specified period of time when the first determining unit determines that the upload process of the content to the specific other node device has been executed within a predetermined period. The node device according to claim 1, wherein uploading of content to another node device is prohibited. An information communication system capable of transmitting and receiving content using an overlay network composed of a plurality of node devices,
The node device is
Storage means for storing content transmitted and received on the overlay network;
Receiving means for receiving a content upload request from any other node device of the plurality of node devices;
First determination means for determining whether or not content upload processing to the specific other node device that is the request source of the upload request received by the reception means has been executed within a predetermined period,
When it is determined by the first determination means that the content uploading process to the specific other node device has been executed within a predetermined period, the content uploading to the specific other node device is performed. First limiting means for limiting;
An information communication system comprising:   The first restricting unit may be configured to perform the specified period of time when the first determining unit determines that the upload process of the content to the specific other node device has been executed within a predetermined period. 4. The information communication system according to claim 3, wherein uploading of content to another node device is prohibited. The other node device is:
Obtaining means for obtaining content uploaded by the node device;
Second determination means for determining whether the acquisition of the content uploaded by the node device has failed a plurality of times by the acquisition means;
When the second determination unit determines that the acquisition of the content uploaded by the node device has failed repeatedly a plurality of times, the second request unit restricts the content request by the specific other node device for a predetermined period. Limiting means,
The information communication system according to claim 3 or 4, further comprising: The node device and the other node device can communicate by at least one of IPv4 (Internet Protocol Version 4) and IPv6 (Internet Protocol Version 6),
The overlay network includes a first overlay network composed of node devices communicable with IPv4, and a second overlay network composed of node devices communicable with IPv6,
The other node device is:
A third determination unit that determines whether the other node device can communicate with both IPv4 and IPv6;
It is determined by the second determination means that acquisition of the content uploaded by the node device has failed several times, and the third determination means determines that communication is possible with both IPv4 and IPv6. In this case, the acquisition means requests the content from either the first overlay network or the second overlay network that is different from the overlay network to which the node device to which acquisition of the content is restricted is connected. The information communication system according to claim 5, wherein An information communication system upload method capable of transmitting and receiving content using an overlay network composed of a plurality of node devices,
A receiving step of receiving a content upload request from any other node device of the plurality of node devices;
A first determination step of determining whether or not the content upload processing to the specific other node device of the request source of the upload request received by the reception step has been executed over a threshold value within a predetermined period;
If it is determined in the first determination step that the content upload process to the specific other node device has been executed within a predetermined period, the content upload to the specific other node device is performed. A limiting step to limit,
Upload method including. Using an overlay network composed of a plurality of node devices, the computer of the node device of the information communication system capable of transmitting and receiving content,
A receiving step of receiving a content upload request from any other node device of the plurality of node devices;
A first determination step of determining whether or not the content upload processing to the specific other node device of the request source of the upload request received by the reception step has been executed over a threshold value within a predetermined period;
If it is determined in the first determination step that the content upload process to the specific other node device has been executed within a predetermined period, the content upload to the specific other node device is performed. A limiting step to limit,
A program characterized by being executed.