JP4670433B2 - Distribution system, node device, information processing method, and program for node device - Google Patents

Description

The present invention, distribution system, the node device belongs to the technical field of information processing how and node apparatus for program, and more particularly, to delivery of content such as a movie to be distributed via a network (distribution information) delivery system for mutually node device included in the distribution system, information processing method, belonging to the technical field of the node device for programs to be used as the node device.

  In recent years, so-called content distribution in which a terminal device accesses a server or the like storing the above content via a network such as the Internet, and distributes the content desired to be viewed on the terminal device to the terminal device. Research and development on the distribution system that performs is active.

  Then, one of the distribution systems is a distribution system in which the content is directly exchanged between terminal devices belonging to the network (in other words, a distribution system in which each content is distributed and shared among a plurality of terminal devices). There is a P2P (Pear to Pear) type distribution system. This P2P type distribution system is attracting attention as a technique for solving concentration of access to servers and high management costs, which are disadvantages of a conventional client / server model.

  Also, in this field of research, as one of the above P2P type distribution systems, a plurality of copies are prepared for one content and distributed to a plurality of terminal devices, so that fault tolerance and access can be achieved. A “distributed storage system”, which is a technique for improving the dispersibility of content, has been proposed, and content distribution services using this distributed storage system are also expanding.

  Here, in the conventional distribution service, the content main body is distributed and stored on a plurality of terminal devices as described above. However, since the management information used for authentication and billing necessary for the distribution needs to be managed centrally, it is necessary to go through a centralized server that handles the management information exclusively. It is configured to be transferred.

  At this time, in recent years, for authentication on the Internet, instead of performing authentication processing for each distribution service for one content, the authentication processing is performed by first performing authentication processing once and issuing an electronic certificate. Although there is a proposal for a method to distribute the content, the charge information as the management information has a distribution fee (use of the content) because the content attributes and the content itself are often different from each other. In many cases, the amount of the fee is different for each distribution, so that the centralized server still has to be centrally managed.

Accordingly, the present invention has been made in view of the above problems, and its purpose is to efficiently distribute and manage management information such as billing information necessary for the operation of the distribution system. capable distribution system to the node device included in the distribution system, information processing method, and to provide a node device for a program to be used as the node device.

In order to solve the above problems, the invention according to claim 1 is a distribution system including a node device of multiple delivery of P2P type wherein a plurality of node devices are connected to each other via a network A distribution system in which distribution information distributed in the distribution system is distributed and stored in each of the plurality of node devices by the system, and the distribution system is request information for requesting the distribution information, First request means for requesting the distribution information by request information including name information indicating the name of the distribution information and user information indicating the user who receives the distribution. Requested by the first request means. First receiving means for receiving the distributed distribution information, and a first node device for storing at least one distribution information distributed and stored in the distribution system And憶means, a fourth reception means for receiving the request information that requests the distribution information from the first node apparatus, the distribution information stored in the first storing means, said by the first requesting means A first transmission unit that transmits the distribution information to the first node device, and information related to a distribution fee of the distribution information transmitted by the first transmission unit , the name indicating the name of the distribution information Generating means for generating management information including information , user information indicating the user who receives the distribution, and date / time information indicating use date / time related to distribution of the distribution information, and distribution that can be distributed in the distribution system A plurality of node devices that randomly select one distribution information from the information and store the selected distribution information, and a plurality of third node devices that serve as storage destinations of the generated management information And determining means for determining, the management information generated by the generation unit, the plurality of the third node device determined by the determination means, second transmission means for transmitting, and a second node device comprising a, A second receiving means for receiving the management information transmitted by the second transmitting means; a second storage means for storing the management information received by the second receiving means; and in response to a request for the management information A plurality of third node devices comprising: a third transmission device for transmitting the management information stored in the second storage device to a fourth node device including the plurality of node devices; and the distribution information When a plurality of management information about distribution is stored in each of the plurality of third node devices, the third node device stores the management information corresponding to the distribution information to be distributed. Search means for searching for the location based on the date and time information of the management information, second request means for requesting the management information to the third node device searched by the search means, and the second request A third receiving means for receiving the management information requested by the means, and management information stored in a plurality of the third node devices included in each of the management information received by the third receiving means; The comparison means for comparing the contents of the management information having the same date and time information and the comparison result in the comparison means determine whether or not the contents of the management information may have been falsified And a fourth node device including a determination unit as the plurality of node devices .

Accordingly, since management information related to the distribution fee is distributed and stored in a plurality of third node devices in the same manner as the distribution information, the management information is efficiently stored while preventing the management information from being stored in a concentrated manner. Can be distributed and managed. In addition, in the second node device, when there is a distribution request by request information including name information and user information, management information corresponding to the distribution information to be distributed is generated, and the storage destination of the generated management information is further stored Since the management information is transmitted to the third node device after the third node device is determined, the management information corresponding to the distribution request is generated and arranged in each third node device. Accordingly, only the minimum necessary management information can be efficiently distributed and managed. Also, a plurality of management information for the same distribution is read out, the contents of each are compared with each other, and it is determined whether there is a possibility that each management information is falsified during each recording based on the comparison result As a result, it is possible to effectively and quickly find tampering by a third party with respect to any management information distributed.

Therefore, in the second node device , when there is a distribution request based on request information including name information and user information, management information corresponding to the distribution information to be distributed is generated, and the storage location of the generated management information is also stored. and transmits the management information to the third node device over the designated third node device as a, that you placed in each third node device generates a management information corresponding to when there is a distribution request Accordingly, only the minimum necessary management information can be efficiently distributed and managed.

In order to solve the above problems, the invention according to claim 2, in the second node apparatus according to claim 1, wherein the generating means, decoding cryptographic the fourth node device receiving the management device The process is configured to apply the process to the generated management information.

Accordingly, since the encryption processing that can be decrypted in the fourth node device is performed on the management information, it is transmitted to the third node device , so that the management information is generated based on the user information and the like. Coupled with this, the management information can be distributed and distributed while more securely protecting the confidentiality of the management information.

In order to solve the above-described problem, the invention according to claim 3 is the second node apparatus according to claim 1 or 2 , wherein the management information is transmitted after the management information is transmitted to the third node apparatus. further comprising erasing means for erasing the information from the second node apparatus.

Accordingly, since the transmitted management information is deleted from the second node device after the management information is transmitted to the third node device, the integrity of the management information can be further improved.

In order to solve the above problems, the invention according to claim 4, in the fourth node device according to claim 1, wherein the management information received by the third reception means of the fourth node apparatus Encryption processing that can be decrypted only by the fourth node device is performed, and the fourth node device further comprises decryption means for decrypting the encrypted management information.

Therefore, since the management information is encrypted and can be decrypted only in the fourth node device, the confidentiality of the management information can be reliably maintained.

In order to solve the above-mentioned problem, the invention according to claim 5 is the fourth node device according to claim 1 or 4 , wherein the determination means is the result of the comparison by the comparison means, the other majority of the When there is the management information having a content different from the management information, it is determined that the management information having the different content may be falsified.

  Therefore, when there is management information that differs from the majority of other management information, it is determined that the management information may have been tampered with, so management information that may have been efficiently tampered with simple processing Can be determined.

In order to solve the above problem, the invention according to claim 6 is a distribution system including a plurality of node devices, wherein the plurality of node devices are connected to each other via a network. The information processing method executed in the distribution system in which distribution information distributed in the distribution system is distributed and stored in each of the plurality of node devices, and the name of the distribution information by the first node device From the first node device by a first requesting step for requesting the distribution information by request information including name information indicating the user and user information indicating the user receiving the distribution, and a second node device. the fourth receiving step of receiving the request information for requesting delivery information, the second node device, at least one that is stored dispersed in the distribution system The distribution information stored in the first storage means for storing distribution information, said requested the distribution information by the first request step to the first node apparatus, a first transmission step of transmitting, the first node apparatus By the first reception step of receiving the distribution information requested by the first request step, and information related to the distribution fee of the distribution information transmitted by the first transmission step by the second node device. And generating the management information including name information indicating a name of the distribution information, user information indicating the user who receives the distribution, and date / time information indicating a use date / time related to distribution of the distribution information a step, by the second node device, randomly selects one of the distribution information from the distributable distribution information in the distribution system, a plurality of stores distribution information which the selected The over de device, a determining step of determining a plurality of third node devices comprising a storage destination of the generated management information, by the second node apparatus, the management information generated by said generating step, said determining A second transmission step of transmitting to the plurality of third node devices determined by the step; a second reception step of receiving the management information transmitted by the second transmission step by the third node device ; A second storage step for storing the management information received in the second reception step by the third node device; and a plurality of the management information for the distribution of the distribution information by the fourth node device. When each of the third node devices is stored in the third node device, the third node device in which the management information corresponding to the distribution information to be distributed is stored is designated as the date / time information of the management information. A search step for searching based on information, a second request step for requesting the management information to the third node device searched by the search step by the fourth node device, and a third node device A third transmission step for transmitting the management information stored in the second storage step to a fourth node device including the plurality of node devices, and a request for the second request step by the fourth node device. A third receiving step for receiving the management information; and management information stored in a plurality of the third node devices by the fourth node device for each of the management information received in the third receiving step. The comparison process for comparing the contents of the management information having the same date and time information included, and the contents of each management information may be falsified based on the comparison result in the comparison process. A determination step of determining whether there is a sex, an information processing method characterized by.

Therefore, when there is a distribution request based on the request information , management information corresponding to the distribution information to be distributed is generated, and further, the management information is transmitted to the node device that stores the generated management information. By generating management information corresponding to the occurrence of a problem and placing it in each node device , only the minimum necessary management information can be efficiently distributed and managed.

According to the first aspect of the present invention, the management information related to the distribution fee is distributed and stored in the plurality of third node devices in the same manner as the distribution information, so that the management information is stored in a concentrated manner. The management information can be efficiently distributed and managed while preventing it. According to the first aspect of the present invention, when there is a distribution request by request information including name information and user information in the second node device, management information corresponding to the distribution information to be distributed is generated. In addition, since the management information is transmitted to the third node device after determining the third node device as the storage destination of the generated management information, the management information corresponding to the distribution request is generated. By arranging in each third node device, only the minimum necessary management information can be efficiently distributed and managed. Further, since management information for distribution of the distribution information is generated based on the name information and user information, the management information having confidentiality is prevented from leaking to a third party. Information can be distributed. According to the first aspect of the present invention, a plurality of management information corresponding to the distribution information is read, the date and time information included in each is compared with each other, and each management information is based on the comparison result. Since it is determined whether or not there is a possibility of falsification during storage, it is possible to effectively and quickly find out falsification by a third party with respect to any management information distributed.

  Therefore, it is possible to efficiently distribute and manage management information necessary for distribution of distribution information.

  Therefore, it is possible to efficiently distribute and manage management information necessary for distribution of distribution information.

According to the second aspect of the invention, in addition to the effect of the first aspect of the invention, the third node device is subjected to the encryption processing that can be decrypted only by the fourth node device, and then the third node device. Since the management information is generated based on the user information or the like, the management information can be distributed and distributed while more securely protecting the confidentiality of the management information. .

According to the invention described in claim 3 , in addition to the effect of the invention described in claim 1 or 2 , after the management information is transmitted to the third node device, the transmitted management information is deleted from the second node device. Therefore, the integrity of management information can be further improved.

  Therefore, each management information can be efficiently distributed and distributed while effectively and quickly discovering the falsification by a third party for each management information required for distribution of distribution information and improving the confidentiality of each management information. This can be managed.

According to the invention described in claim 4 , in addition to the effect of the invention described in claim 1 , since the management information is encrypted and can be decrypted only in the fourth node device , the management information is encrypted. The confidentiality of information can be reliably maintained.

According to the invention described in claim 5 , in addition to the effect of the invention described in claim 1 or 4 , when there is management information having a content different from the majority of other management information, the management information may be falsified Therefore, it is possible to determine management information that may have been efficiently tampered with simple processing.

According to the sixth aspect of the present invention, when there is a distribution request based on the request information, the management information corresponding to the distribution information to be distributed is generated, and a plurality of second storage destinations of the generated management information are stored . Since the management information is transmitted to the three- node device, the management information corresponding to the distribution request is generated and arranged in each third node device, so that only the minimum necessary management information can be efficiently obtained. It can be distributed and managed. According to the sixth aspect of the present invention, in the second node device, when there is a distribution request by request information including name information and user information, management information corresponding to the distribution information to be distributed is generated. In addition, since the management information is transmitted to the third node device after determining the third node device as the storage destination of the generated management information, the management information corresponding to the distribution request is generated. By arranging in each third node device, only the minimum necessary management information can be efficiently distributed and managed. Further, since management information for distribution of the distribution information is generated based on the name information and user information, the management information having confidentiality is prevented from leaking to a third party. Information can be distributed. According to the sixth aspect of the present invention, the plurality of management information corresponding to the distribution information is read, the date and time information included in each is compared with each other, and each management information is based on the comparison result. Since it is determined whether or not there is a possibility of falsification during storage, it is possible to effectively and quickly find out falsification by a third party with respect to any management information distributed.

  Therefore, it is possible to efficiently distribute and manage management information necessary for distribution of distribution information.

  Therefore, each management information can be efficiently distributed and distributed while effectively and quickly discovering the falsification by a third party for each management information required for distribution of distribution information and improving the confidentiality of each management information. This can be managed.

  Therefore, it is possible to efficiently distribute and manage management information necessary for distribution of distribution information.

  Therefore, each management information can be efficiently distributed and distributed while effectively and quickly discovering the falsification by a third party for each management information required for distribution of distribution information and improving the confidentiality of each management information. This can be managed.

  Therefore, it is possible to efficiently distribute and manage management information necessary for distribution of distribution information.

  Therefore, each management information can be efficiently distributed and distributed while effectively and quickly discovering the falsification by a third party for each management information required for distribution of distribution information and improving the confidentiality of each management information. This can be managed.

  Next, the best mode for carrying out the present invention will be described with reference to the drawings. In the embodiment described below, the present invention is applied to the P2P type distribution system (hereinafter simply referred to as a distribution system) that distributes the content using a network such as the Internet. It is a form. In the following description, the terminal device is generally referred to as a “node”.

Initially the principle of (I) the present invention, before the specifically described embodiments of the present invention, per the principles of the present invention, by referring to outline of a distribution system according to the embodiment.

(A) Overview of Distribution System First, an overview of the entire distribution system according to the embodiment, which is a premise of the present invention, will be described with reference to FIG. FIG. 1 is a schematic diagram showing an outline of the distribution system.

  Generally, when content is exchanged between specific nodes connected to the network, for example, when the network is the Internet, the IP (Internet Protocol) address of the node storing the requested content It is necessary to send and receive content using as a clue. Therefore, in a distribution system in which an unspecified number of nodes share content such as the distribution system according to the embodiment, each node recognizes the IP addresses of all the nodes and the contents stored in the nodes. It will be necessary.

  However, when the number of nodes connected to the network increases, the IP addresses of all the nodes and the stored content names are assigned to each node because of limitations on the physical recordable amount at each node. It is not realistic to record each node (for example, when million nodes are connected to the network, the IP addresses for the million units and the names of the contents stored in them are respectively It is not realistic for nodes to keep track of each other).

  In addition, when each node records the IP addresses and stored content names of all nodes, every time a new node joins / leaves or a stored content is added / deleted at a certain node, all nodes Must update the recorded information. If all nodes are notified at each update, the update is frequent and the power switch at each node in the network is frequently turned on and off (for example, when the node is realized by a personal computer, the power switch is frequently In practice, it is difficult to operate the entire network.

  Therefore, in order to cope with the above-mentioned problems, only the IP address of the minimum necessary node is recorded, and when requesting the content, the node of the node storing the requested content is recorded among the recorded nodes. A distribution system having a mechanism for resolving the IP address of a node storing content by inquiring to a node that seems to know the IP address has been studied, and one of them is a so-called DHT (Distributed Hash Table). There is a distribution system using a discrete hash table.

  Next, an outline of the distribution system using the DHT will be described.

In the distribution system using the DHT, a node ID (Identification) for identifying each node is assigned to each node. At this time, the node ID is assigned a unique number for each node, that is, a number different from other nodes. This number has a number of bits (bit length) that can accommodate the maximum number of nodes in the network. More specifically, for example, when a 128-bit node ID is used, a maximum of 2 ¹²⁸ = 340 × 10 ³⁶ nodes can be connected in one network. The node ID is generally a hash value for a unique value for each node, such as an IP address assigned to the node itself, a so-called MAC (Media Access Control) address, or a serial number of the node itself. Use the value obtained by multiplying the function.

  Next, in the distribution system using the DHT, a unique content ID different from other contents is assigned to the content itself distributed by the distribution system. The bit length of the content ID is also the same as the bit length of the node ID. As the content ID, generally, for example, title data indicating the title of the content, attribute data indicating the attribute of the data constituting the content, data for several bytes from the top of the data constituting the content, etc. Use the value obtained by multiplying the hash function.

  Here, in relation to the fact that corresponding node IDs and content IDs are expressed with the same bit length, the nodes and content are assumed to be scattered in the same ring-shaped virtual ID space. Can think. That is, as shown in FIG. 1A in which one node is displayed with ● and one content is displayed with ○, the ring Rc to which the content belongs and the ring Rn to which the node belongs are assumed concentrically in a virtual space. Further, if it is defined that the value of each ID increases counterclockwise in each ring Rc and Rn, it can be assumed that each node or each content exists without overlapping on each ring Rc and Rn. Note that if each ID is expressed in 128-bit length as in the above example, the number of digits becomes too large and the explanation becomes complicated. Therefore, in FIG. The bit length is expressed as 32 bits (the same applies hereinafter). Then, as described above, due to the use of the hash function in determining the value of each ID, each node and each content are present in a substantially distributed manner on each of the above rings Rc and Rn. Become.

  On the other hand, in the distribution system using the DHT, “a node that manages content to which a certain content ID is assigned is a node to which a node ID having a value closest to the value of the content ID is assigned”. ing.

  Here, “near” means any definition as long as it is consistent within various regulations and standards regarding the distribution system. Specifically, for example, “the value of the content ID is It is a value that does not exceed and has the smallest difference between values as IDs ”.

  More specifically, for example, as illustrated in FIG. 1A, a node having a node ID value “A0334055” and a node having a node ID value “A03340FF” are adjacent to each other on the ring Rn. If it exists, the content ID value “A0334080” is managed by the node whose node ID value is “A0334055”. In FIG. 1A, the terminal information for managing the content of “◯” is indicated by an arrow extending from each “◯”. In this way, various contents can be managed by being distributed among a large number of nodes.

  At this time, “management” does not mean that the content assigned with the content ID is recorded therein, but “the location of the node where the content is recorded (for example, the IP address) This means that the node that manages the content recognizes. The node where the content is actually recorded and the managed node may be different, or conversely, the managed content may be recorded in the managed node.

  The above-described content management node is referred to as a “root node”. The root node records index information consisting of a pair of a content ID indicating the content that is to be managed and the IP address of the node in which the content indicated by the content ID is recorded. Record so that it can be referred to by other nodes in the distribution system. In some cases, the index information includes the title of the content, the attribute (genre), and the like.

  In addition, when the content IDs indicating different contents are close to coincidence, and there is no other node having a node ID close to that value, a plurality of indexes corresponding to a plurality of contents by one root node Information will be recorded. Furthermore, when the same content is recorded in a plurality of different nodes and the node recording the same content is close to one root node by chance, The index information of a plurality of nodes each recording content is recorded. An example of the index information EX in the root node described above is shown in FIG.

  Further, a node that actually records each content itself is referred to as a “content holder”. At this time, since the content holder itself is a node, the node ID exists on the ring Rn in FIG.

  Next, in the distribution system using the DHT, the DHT (routing table) itself, which is one of the devices for eliminating the necessity for each node to record the IP addresses of all the nodes as described above, will be described. To do.

  In the DHT according to the embodiment, the ID space illustrated in FIG. 1 is subdivided while increasing the number of levels for each stepped level (for example, in the case of level 1, the ID space (the entire ring Rn) is divided into four). Then, for each level (each area subdivided in stages), routing information in which a node ID of an arbitrary node and its IP address are paired is described. For example, when request information for requesting the IP address of the content holder storing the requested content is transferred to the root node where the content is managed, the request information is changed to the target information while referring to the routing information. Transfer to the root node that manages the content. That is, each time the level in DHT increases, the node ID of the routing destination matches the node ID of the root node to be reached one digit at a time, and finally reaches the root node that manages the content. By transmitting the IP address of the content holder managed by the root node to the requesting node, the requesting node can know the IP address of the content holder.

  In addition, in the distribution system using DHT, in addition to the search information as described above, general inquiry information related to the content that requests distribution, a message such as a distribution request message that requests distribution of the content itself, and a public message that will be described later Can be efficiently transferred to the target node in the ID space as illustrated in FIG. In the following description, when a new content is recorded in the content holder, a message generated in the content holder is referred to as a public message, and is transmitted from a requester described later to a root node or a cache node described later. The query is hereinafter referred to as a shared data search message.

  Here, as described above, since the value of the node ID of the root node is closest to the value of the content ID managed by the root node, the shared data search message indicates the content to be distributed. The root node to be managed is reached. Then, the root node that has received the shared data search message returns the IP address of the content holder storing the content requested by the shared data search message to the sender of the shared data search message. That is, from the index information (see FIG. 1B) recorded in the root node, the title indicating the content requested by the shared data search message, the attribute information, and the IP of the node as its content holder The address or the like is returned to the node that is the source of the shared data search message. By utilizing such DHT, the location of the desired content can be efficiently recognized at the distribution request source, for example. The node that is the content distribution request source described above is hereinafter referred to as a “requester”.

  Next, a description will be given of content registration processing when new content is accumulated in a certain node.

  When new content is stored in a node, that is, the content holder for that content, the content holder will publish that the content has been stored to other nodes in the distribution system.

  That is, when new content is stored in a certain node, the node serving as a content holder for the stored content generates a content ID corresponding to the content based on the title of the stored content.

  Next, the content holder uses the node having the node ID having the same value as the generated content ID as the destination, and makes the disclosure for the above disclosure (regardless of whether or not the node having the node ID actually exists). The message is transmitted in the same manner as the delivery request message. This public message includes a title indicating the content, attribute information, an IP address of the node as the content holder, and the like, and is transmitted to the node as the destination of each level via each routing destination according to the description of the DHT. Sequentially transferred.

  When the node having the closest node ID is reached, the node recognizes that the node to which the public message is to be forwarded does not exist in the ID space thereafter (ie, performs digit alignment with DHT). Then, the node to be transferred next is recognized by itself), and at this point, the node to which the public message has reached becomes the root node for managing new content. Then, the node that has become the root node records the content ID including the public message, the IP address indicating the content holder, the attribute information, and the like as index information EX illustrated in FIG. 1B.

  As described above, if the distribution system using the DHT according to the embodiment is used, it is possible to distribute the content by allowing the necessary shared data search message or public message to reach the transfer destination while simplifying the configuration of each node. It can be carried out.

(B) Principle of the present invention Next, an outline of the principle of the present invention based on the distribution system described above will be described.

  In the outline description of the distribution system described above, the distributed arrangement of content using the distribution system and the operation associated with the distribution have been described. In the present invention, in addition to the distributed arrangement of the content to be distributed, A distribution fee that is generated in the contract between the user who made a distribution request by operating the content distribution destination node and the distributor who actually distributes the content in response to the distribution request. Management information (hereinafter, the management information is generally referred to as billing data), two nodes that directly exchange the content (that is, a node serving as a distribution requestor operated by the user) And other nodes T other than the distribution source content holder belonging to the distributor). At this time, the content data itself corresponding to the content and the billing data are equivalent in the sense that they are shared between nodes belonging to the distribution system. Therefore, in the distribution system according to the present invention, they are both “shared”. It is treated equally as “data”.

  In addition to these, a billing processing node for centrally processing the distributed billing data is provided in the distribution system, and the billing processing node collects billing data distributed as needed. Then, by determining the tampering status, etc., confidentiality as billing data is ensured. In addition, the charging processing node collects the charging data from the location where the charging processing node actively collects, thereby avoiding concentration of processing on the charging processing node, thereby simultaneously realizing access concentration avoidance as a P2P type distribution system.

(II) Embodiment Next, an embodiment according to the present invention based on the above-described principle will be specifically described with reference to FIGS.

  First, a schematic configuration of a node according to the embodiment will be described with reference to FIG. FIG. 2 is a block diagram illustrating a schematic configuration of the node according to the embodiment. In addition, since each node belonging to the P2P type distribution system according to the present embodiment has basically the same hardware configuration, the configuration of a general node representing them is shown in FIG. The outline will be explained.

  As shown in FIG. 2, the node T included in the distribution system according to the embodiment includes a CPU having a calculation function, a working RAM (Random Access Memory), and a ROM (Read Only Memory) for recording various data and programs. The control unit 11 as processing means, reading means, determination means, generation means, erasure means, and search means, and the like, accounting data, content data as the content itself, and various routing data necessary for the distribution And a recording unit 12 as recording means composed of an HDD (Hard Disc Drive) or the like for recording and storing (storing) other necessary programs, etc., a buffer memory 13 for temporarily storing received content data, Encoded video data (video information) and audio data (included in the content data) Voice information) and the like, a video processing unit 15 that performs a predetermined rendering process on the decoded video data and outputs the video signal, and the video processing A display unit 16 composed of a CRT (Cathode Ray Tube) or a liquid crystal display for displaying an image based on the video signal output from the unit 15, and D / A (Digital / Analog) conversion of the decoded audio data into an analog audio signal After that, an audio processing unit 17 that amplifies and outputs the amplified signal by an amplifier, a speaker 18 that outputs an audio signal output from the audio processing unit 17 as a sound wave, and another node device 1 through the network 8. Communication unit 20 as transmission means and reception means for performing communication control of information, and receives instructions from respective users And an input unit (for example, a keyboard, a mouse, or an operation panel) 21 that outputs an instruction signal corresponding to the instruction to the control unit 11, and includes a control unit 11, a recording unit 12, a buffer memory 13, and a decoder. The unit 14 and the communication unit 20 are connected via a bus 22 so as to be able to exchange data with each other.

  Then, when the CPU in the control unit 11 executes various programs recorded in the recording unit 12 or the like, the control unit 11 performs overall control of the entire operation as the node T according to the embodiment.

(III) Operation in Each Node According to Embodiment Next, the content distribution operation and the charging data processing operation according to the embodiment in the node T will be described with reference to FIGS. 3 to 9 are diagrams specifically illustrating the operations, and FIGS. 10 to 17 are flowcharts showing the operations.

  First, as a content distribution operation in the distribution system according to the embodiment described below, an operation for requesting distribution of the content (hereinafter, the content that is the distribution request target is referred to as content X) is a node T as a requester. When executed in (hereinafter, the node T as the requester is referred to as a node RQ), a shared data search message is issued and reaches the root node that manages the content X. The root node that manages the content X transmits information of the content holder toward the node RQ, a distribution request message is transmitted from the node RQ to the node T as the content holder, and the node from the content holder that has received the message The content X is distributed to the RQ. Then, in the node RQ that has received the distribution of the content X, the reproduction process or the like is executed using the content data of the distributed content X.

  In parallel with this distribution process, the content holder that has received the distribution request message includes the distribution fee generated when distributing the content X to be distributed and information related to its transmission / reception as the operation related to the accounting data processing. Billing data is generated. Then, the billing data is transmitted after being encrypted to the node designated to store the billing data (in other words, the content holder when the billing data is regarded as content data). Saved.

  Further, the stored billing data is accumulated in the billing processing node in response to a request from the billing processing node, and falsification determination is executed by a process described later.

  Next, how content and billing data are exchanged between the nodes T existing in the distribution system according to the embodiment will be described with reference to FIGS. 3 to 9. .

  3 to 9 are diagrams schematically showing exchange of the content and billing data, and the network itself connecting each node is not shown in each figure.

In the example described with reference to FIGS. 3 to 9, ten nodes T are included in the distribution system BS, and each node T is designated as nodes A, B, C, D, E, F. , G, H, I and J. Assume that the requester requesting distribution of the content X is the node C, and the root node managing the distribution of the content X is the node I. Furthermore, it is assumed that the charging processing node is node A and the root node that manages distribution of charging data K is node J.

  First, transmission / reception of content data and billing data at a stage where content distribution is executed will be described with reference to FIGS.

  In the content distribution stage, as shown in FIG. 3, from node C as the requester to node I as the root node of the desired content, node T as the content holder that stores the content is any. When the shared data search message MG1 for inquiring is transmitted, information indicating the node T including the recording unit 12 for storing the content is returned to the node C as a response message MG2 (see step S10 in FIG. 11 described later). ). Here, in the example shown in FIG. 3, if the content holders of the content are nodes D, F, and H, the response message MG2 includes information indicating the nodes D, F, and H. become.

  Next, as shown in FIG. 4, the node C that has received the reply message MG2 refers to the information contained in the reply message MG2, and sends a request message R for requesting distribution of the content to the node D, Transmit to F and H, respectively (see steps S13 and S14 in FIG. 11 described later). Then, in the nodes D, F, and H that have received the request message R, the charging data corresponding to the distribution is based on the user information and the name data N (X) included in the received request message R. Each of K is generated, and a node T that is a storage destination of the generated charging data K is determined (see step S28 in FIG. 13, steps S35 to S41 in FIG. 14, and FIG. 15 described later). In the example shown in FIG. 4, the storage destination of charging data K corresponding to distribution from node D is determined as node E, the storage destination of charging data K corresponding to distribution from node F is determined as node G, It is assumed that the storage destination of the accounting data K corresponding to the distribution from H is determined as the node B.

Next, as shown in FIG. 5, node from D, F and H, 1 4 of each accounting data K is node E is the storage destination after being encrypted, respectively sent to B and G (described later (See step S44), and stored in the recording unit 12 in each of the nodes E, B, and G (see step S24 in FIG. 12 described later). Thereafter, a public message MG3 indicating that the accounting data K is stored in the nodes E, G, and B is transmitted from the nodes E, G, and B to the node J that is the corresponding root node.

After that, as shown in FIG. 6, the shared data X (contents) corresponding to the content desired by the node C from any one of the nodes D, F, or H (in the case of FIG. 6, the node H) as the content holder. (Data) is transmitted to the node C and stored (see step S29 in FIG. 13 and steps S20 to S22 in FIG. 12). Here, as to whether the shared data X is transmitted from the node D, F, or H as the content holder, for example, the node C may select to transmit from the node T that has responded earliest. , may be selected at the node C as get transmitted from the nearest node T to have you from the node C to the network, or to one portion receives the shared data X from all the nodes D, F and H The node C may be coupled.

  3 to 6, the content requested by the requester (node C) is distributed to the requester, and the charging data K corresponding to the distribution is not related to the content itself. This means that they are distributed in G and B.

  Next, transmission / reception of charging data at the stage of charging processing of the distributed charging data K at node A which is a charging processing node will be described with reference to FIGS.

  In the distribution stage of the billing process, as shown in FIG. 7, the billing data K is sent from the node A serving as the requester to the node J serving as the root node of the desired billing data K. When a shared data search message MG4 inquiring which node T is a content holder for storing the accounting data K is transmitted, the node T including the recording unit 12 for storing the accounting data K as a response message MG5 is transmitted. Is returned to the node A (step S50 in FIG. 17 described later). Here, in the example shown in FIG. 7, since the content holders of the accounting data K are the nodes E, G, and B, the response message MG5 includes information indicating the nodes E, B, and G. It will be.

  Next, the node A that has received the reply message MG5 refers to the information contained in the reply message MG5 and sends a request message R for requesting delivery of the accounting data K to the node as shown in FIG. Transmit to E, G, and B, respectively (see steps S36 and S3 in FIG. 17 described later). Then, the nodes E, G, and B that have received the request message R transmit the requested charging data K to the node A based on the received request message R (step S30 in FIG. 13 described later). And a charging process using the transmitted charging data K in the node A (see steps S53 to S59 in FIG. 17 described later).

Next, as shown in FIG. 9, (see Fig. 17 step S 58 to be described later) node E, billing data K transmitted in G and B are deleted, the root of the deletion message MG6 billing data K indicating that It is transmitted to node J, which is a node, and a series of charging processes is completed.

  Next, the content distribution operation and the operation related to the billing data processing to be executed in each node in order to execute the specific processing described above will be specifically described with reference to FIGS.

  First, the entire operation will be described with reference to FIG. In the distribution system according to the embodiment, since any node T can be a content holder for the node RQ or content data or billing data, FIG. 10 shows a case where one node T becomes a node RQ. The case where it becomes that content holder is shown collectively.

  As shown in FIG. 10, in the content distribution operation and the accounting data processing according to the embodiment, one node T operates the node T as an initial operation, for example, when the power is turned on. User information indicating the user is acquired (step S1), and the acquired user information is stored in the recording unit 12. Here, the user information includes a user ID for identifying the user, and the user information itself is input by an operation on the input unit 21. In addition, the user in the embodiment includes a user who wants to view content and a user who wants to collect billing data in the billing processing node.

  When the acquisition of user information is completed, whether or not a content distribution request operation or a billing data collection request operation has been executed by the user is continuously monitored at the node T (step S2). When the request operation is executed at the one node T, that is, when the one node T becomes a requester U or a billing processing node (step S2; YES), the requested content X or billing data ( Hereinafter, processing for requesting the node RQ to distribute the content X and the billing data together (referred to as shared data X) is executed in the node RQ (step S3).

  In the following description, name data indicating the name of the shared data X is N (X), and a message (request information) for requesting transmission of the shared data X to the node RQ is a request message R. At this time, the request message R includes name data N (X) corresponding to the shared data X and information for identifying the node RQ to which the shared data X is distributed.

  After the acquisition process of the shared data X is completed, it is confirmed whether or not the power of the node RQ is turned off (step S8). When the power is turned off (step S8; YES), the node RQ is left as it is. When each operation is completed and the power supply remains on (step S8; NO), the process returns to the determination of step S2 to shift to the next content acquisition process.

  On the other hand, when the distribution request operation for shared data X is not executed in the determination in step S2 (step S2; NO), next, whether or not the shared data X corresponding to the request message R has been received at the node RQ. Is determined (step S4). When the shared data X is received (step S4; YES), the shared data storage process for storing the received shared data X in the recording unit 12 is executed in the node RQ (step S5). After moving to step S8, the above-described processing is executed.

  On the other hand, when the shared data X has not yet been received in the determination in step S4 (step S4; NO), it is next determined whether or not the request message R has been transmitted from the node RQ which is another node T. Determination is made (step S6). If the request message R has been transmitted (step S6; YES), the corresponding reception process is executed (step S7), and the process proceeds to the above step S8 to execute the above-described process.

  Furthermore, when the request message R has not been received in the determination in step S6 (step S6; NO), the process proceeds to step S8 as it is.

  Next, details of the shared data X request processing as step S3 will be described with reference to FIG. FIG. 11 is a flowchart showing details of request processing.

  As shown in FIG. 11, in the shared data X request processing according to the embodiment, first, the shared data X that is the distribution request target is stored in another recording node 12 (that is, the shared data X). The node T) as the X content holder is searched for by transmitting the shared data search message in the distribution system. Then, assuming that M nodes T can be searched, the M nodes T that can be searched are referred to as node T [i] (i = 0, 1, 2, 3,..., (M−1)). (Step S10).

  Next, a parameter i indicating the number of the node T as the acquired content holder is initialized (step S11), and it is further checked whether or not the current parameter i is less than “M” (step S12). . If the value of the current parameter i is less than “M” (step S12; YES), a request message R is generated (step S13), and the node T [i] indicated by the current parameter i is set. The generated request message R is transmitted (step S14). At this time, the request message R includes name data N (X) corresponding to the shared data X for which distribution is requested, and user information indicating the distribution destination.

  After the request message R is transmitted, the parameter i is incremented by “1” (step S15) and the process returns to the determination in step S12.

  On the other hand, when it is determined in step S12 that the current value of the parameter i is not less than “M”, that is, when the transmission of the request message R to all the searched nodes T (step S10) is completed ( Step S12; NO), the process proceeds to step S8 shown in FIG.

  As described above, when the shared data request process shown in FIG. 11 is executed, the request message R is sent from the node RQ as the requester to all the nodes T storing the shared data X to be distributed. Will be sent.

  Next, the storage process of the shared data X as step S5 will be described in detail with reference to FIG. FIG. 12 is a flowchart showing details of the storage process.

  As shown in FIG. 12, in the shared data X storing process according to the embodiment, when it is determined that the shared data X is received by the determination in step S4 shown in FIG. 10 (step S4; YES), first, The node RQ confirms whether or not the shared data X having the same name as the received shared data X is already stored in the recording unit 12 (step S20), and if it is not stored (step S20; NO). When the shared data X is content data, it is usually determined here), the received shared data X is stored in the recording unit 12 (step S21), and the shared data X is stored in its own recording unit 12 It is disclosed to other nodes T in the distribution system by using the above-mentioned public message or the like (step S22), and step S shown in FIG. To shift to the processing.

  On the other hand, when the shared data X having the same name as the received shared data X is already stored in its own recording unit 12 in the determination in step S20 (step S20; YES), the node RQ is a charging processing node. Since the newly received shared data X may be charging data related to additional charging, it is next checked whether or not the shared data X is charging data (step S23). If it is not billing data (step S23; NO), the content data already stored in the recording unit 12 for some reason has been requested and received again. The process proceeds to step S8 shown in FIG. 10 without updating the shared data X (content data).

  On the other hand, if it is determined in step S23 that the received shared data X is billing data (step S23; YES), the past billing data already stored in the recording unit 12 of the node RQ as the billing processing node. The received billing data is additionally stored (step S24), and the process proceeds to step S8 shown in FIG.

  If the received shared data X is content data by executing the storage process of the shared data X described above, the stored shared data X is stored in the recording unit 12 and then used for the reproduction process. On the other hand, if the shared data X is new billing data, it is stored in the recording unit 12 of the node RQ as the billing processing node and used for necessary billing processing (billing processing for the user, etc.). Will be.

  Next, the reception process of the request message R as step S7 will be described in detail with reference to FIG. FIG. 13 is a flowchart showing details of the reception process.

  As shown in FIG. 13, in the reception process of the request message R according to the embodiment, when it is determined that the request message R is received by the determination in step S <b> 6 shown in FIG. 10 (step S <b> 6; YES), From the received request message R, the name data N (X) and user information contained therein are extracted (step S25), and further distribution is requested by the request message R from within the recording unit 12 of itself. The shared data X (content data or billing data) being taken out is extracted (step S26).

  Next, the attribute of the extracted shared data X is confirmed (step S27). If it is not billing data, that is, content data (step S27; NO), the distribution destination of the content data is distributed. The billing data indicating the billing of the distribution fee generated between the user and the distributor of the distribution source is generated for the distribution of the content data (step S28), and then the node that has transmitted the request data R The requested content data, which is the shared data X, is transmitted to the RQ (in this case, the node RQ as the content requester) (step S29), and the process proceeds to step S8 shown in FIG. Details of the billing data generation process will be described later.

  On the other hand, if it is determined in step S27 that the distribution request target shared data X is billing data (step S27; YES. In this case, the requesting node RQ is a billing processing node), then It is confirmed whether or not the distribution system node RQ itself is authorized in the distribution system to collect charging information (step S30).

  Here, specifically, for example, when the billing processing node in the distribution system according to the embodiment is specified in advance as the confirmation processing in step S30, the IP address of the node RQ that is the distribution destination is specified. The confirmation is made by comparing with the IP address of the charging processing node. In addition, this confirmation may be performed by separately performing a special authentication process, for example.

  If the node RQ itself is not authorized to collect charging information in the determination of step S30 (step S30; NO), it is not allowed to distribute the charging data requested for distribution to the node RQ. Without executing the requested billing data transmission process, the process proceeds to step S8 shown in FIG.

  On the other hand, if it is determined in step S30 that the node RQ itself is authorized to collect billing information (step S30; YES), the billing data that is the shared data X requested for the node RQ. Is transmitted (step S31), and the transmitted billing data is deleted from the recording unit 12 (step S32). Then, the process proceeds to step S8 shown in FIG.

  At this time, the deletion process (step S32) includes a process of deleting the accounting data from its own recording unit 12, and a process of notifying the root node corresponding to the accounting data of the deletion. It is.

  When the distribution request target is content data by executing the above-described request message R reception processing, the accounting data for the distribution destination node RQ is newly generated and the corresponding node RQ is handled. Content data to be transmitted is sent, and on the other hand, when the distribution request target is billing data, the billing data is sent to the billing processing node after confirming the authority for billing data collection of the billing processing node of the distribution destination Will be sent.

  Next, the billing data generation process as step S28 will be specifically described with reference to FIG. FIG. 14 is a flowchart showing details of the generation process.

  As shown in FIG. 14, in the billing data generation process according to the embodiment, first, from the received request message R (see step S6 in FIG. 10), the name data N (X) and user information contained therein. Is extracted again (step S35), and the charging data name corresponding to the newly distributed content data is acquired using the extracted user information (step S36). Details of the process in step S36 will be described later.

  When the billing data name is acquired (step S36), new billing data K (content is emptied) is generated in the recording unit 12, and the name is billed data N (K) (step). S37). This empty billing data K is generated in advance so that billing data for each time can be added one after another in preparation for the case where content data is distributed over a plurality of times.

  Next, the billing information k for the current time corresponding to the content data distributed this time by collecting the user information extracted in step S35, the name data N (X), and the time information indicating the current date and time. Is encrypted in accordance with a predetermined encryption method (step S38), and the billing information k after the encryption is stored (additionally stored) in the billing data K (step S39).

  Here, the encryption method used in the encryption processing applied to the billing information k in the process of step S38 is an encryption method that can be decrypted only by the billing processing node described later, even if step S38 itself is executed. It is desirable that the encryption method cannot be decrypted even by the node T (the node T as the content holder). For example, if a billing processing node stores a secret key using a public key cryptosystem and a corresponding public key is stored in all nodes, and the billing information is encrypted with this public key, billing The billing information cannot be decrypted except for the processing node.

  When the encrypted billing information k is stored in the billing data K in the process of step S39, the current billing data K is stored in the distribution system in order to determine the storage destination node in the billing data K distribution system. A list indicating the contents that can be distributed (this list is distributed to all nodes in advance by, for example, being incorporated in the storage unit 12 in the manufacturing process of the node device). A content (hereinafter, the selected content is referred to as content Z and data corresponding thereto is referred to as shared data Z), and name data N (Z) indicating content data corresponding to the selected content Z is acquired. (Step S40).

  Next, another node T storing the shared data Z in the recording unit 12 (that is, the node T as a content holder of the shared data Z) transmits the shared data search message to the distribution system. Search for multiple items. Then, assuming that M nodes T can be searched, the M nodes T that can be searched are referred to as node T [i] (i = 0, 1, 2, 3,..., (M−1)). (Step S41).

  Next, the parameter i indicating the number of the node T as the acquired content holder is initialized (step S42), and further, it is confirmed whether or not the current parameter i is less than “M” (step S43). . If the current parameter i is less than “M” (step S43; YES), the generated accounting data K is transmitted to the node T [i] indicated by the current parameter i (step S43; YES). Step S44).

  After the charging data K is transmitted, the parameter i is incremented by “1” (step S45) and the process returns to the determination in step S43.

  On the other hand, when the current parameter i is not less than “M” in the determination in step S43, that is, when the transmission of the accounting data K to all the searched nodes T (see step S41) is completed. (Step S43; NO) After deleting the post-transmission accounting data K itself in the recording unit 12 (Step S46), the process proceeds to Step S29 shown in FIG. Distribute content data.

  In the embodiment of FIG. 14, when selecting a plurality of nodes for holding billing data, the method of selecting “a plurality of nodes storing the content data for a specific content arbitrarily selected” is used. However, the present invention is not limited to this, and for example, a constant 10 kinds of characters added to the end of the user information may be applied to the hash function and used as the node ID of the charging data transmission destination. Or, more simply, several to several tens of cuts or concatenations of the output of the pseudo random number function in accordance with the bit length of the node ID may be prepared and used as the node ID of the charging data transmission destination. The greater the number of nodes that store billing data in a distributed manner, the more reliable the billing information with respect to withdrawal of the node.

  Next, the billing data name acquisition process as step S36 will be specifically described with reference to FIG. FIG. 15 is a flowchart showing details of the acquisition process.

  As shown in FIG. 15, in the accounting data name acquisition process according to the embodiment, first, a user ID for identifying the user is acquired from the acquired user information (see step S35 in FIG. 14). (Step S47) Based on the acquired user ID, the name of the new billing data K is generated, for example, as “[User ID] .kkn” (Step S48), and the name of Step S37 shown in FIG. Transition to processing. Here, specifically, for example, when the user ID is “2376” as the process of step S48, the name of the billing data K is “2376.kkn”.

  Here, the contents of the accounting data K generated by the processing shown in FIGS. 14 and 15 will be described with reference to FIG.

  As illustrated in FIG. 16, the billing data K includes billing information k (encrypted) corresponding to each of a plurality of content distributions one-to-one as described above. In addition to the encrypted billing information as the billing information k body, a so-called electronic signature of the distributor who generated the billing information is added.

  At this time, as described above, the billing information includes information such as the user ID, the name of the distributed content, and the distribution date and time as encrypted. Then, by adding the electronic signature to the billing information, the billing information k can be grounds for billing data that has not been altered by a third party.

  By executing the billing data generation process described above, the billing data K including the encrypted billing information k is randomly selected regardless of the content distributed by the distribution corresponding to the billing information k. It is stored in a plurality of nodes T.

  Next, specific processing in the above-described charging processing node that collects the charging data K distributed by the processing described with reference to FIGS. 14 and 15 and confirms their falsification status will be described with reference to FIG. This will be described in detail. FIG. 17 is a flowchart showing details of the accounting process.

  As shown in FIG. 17, in the billing process according to the embodiment, first, a list of user information indicating users to be billed is presented from the system operator. (It is assumed that the system operator manages information necessary for billing, such as the user's name and address, and the user ID assigned to each user in advance and stores them as a list. .) When I pieces of user information are presented, the I pieces of user information are designated as user information S [i] (i = 0, 1, 2, 3,..., (I-1)). (Step S50).

  Next, the parameter i indicating the number of the user information S is initialized (step S51), and it is further confirmed whether or not the current parameter i value is less than “I” (step S52). If the current value of the parameter i is less than “I” (step S52; YES), a billing data name generation process similar to step S36 is performed (step S36), and the generated name is further changed. The charge data K distribution request is executed in the same manner as the shared data X request process in step S3 (step S3).

  Then, it confirms whether or not the requested charging data K has been transmitted from the node T that is the storage destination (the node T to which the charging data K has been transmitted by the processing of step S44 in FIG. 14) (step S53). If it has been done (step S53; YES), the billing data K is stored in the temporary buffer in the billing processing node (step S53-1), and the process proceeds to step S54 described later.

  On the other hand, if it is determined in step S53 that the requested charging data K has not yet been transmitted (step S53; NO), whether or not a waiting time set in advance as the waiting time for receiving the charging data K has been exceeded. (Step S54; NO), if it does not exceed (step S54; NO), the system waits for reception (step S53). If it exceeds (step S54; YES), the received billing data K is then received. Decryption is performed with the billing processing node's own decryption key (step S55), and tampering of the contents is determined (step S56).

  Here, as the processing of step S56, specifically, for example, the contents of the charging information k having the same use date and time are compared among the charging information k included in each of the received plurality of charging data K, Check for differences. That is, when there is billing information k having the same usage date and different contents in the other billing data K, the billing information k having the same content most frequently is the billing information k having the correct contents (majority decision). The other charging information k is determined as the charging information k that may have been falsified.

  Thereafter, the charging information k having the content determined to be correct is additionally stored in the charging data K having the same name stored in the recording unit 12 in the charging processing node (step S57), and then the previous charging collection It is confirmed whether or not the processes in steps S56 and S57 have been executed for the use date and time from the date and time when the process was executed to the current time (step S57-1). If the collection process has not been completed for the use time up to the current time (step S57-1; NO), the processes in steps S56 and S57 should be executed for all the billing data K up to the current time. Returning to the step S56, on the other hand, if the collection process has been completed for all the use times up to the current time (step S57-1; YES), then the accounting data K in the temporary buffer is deleted (step S57-1). S58).

  Thereafter, the current parameter i is incremented by “1” (step S59), and the process proceeds to step S52 to repeat the same processing for the next user information S.

  By executing the accounting process described above in the accounting process node, the accounting data K distributed and arranged can be collected and used for necessary accounting processes without losing the confidentiality of each accounting data K. it can.

  As described above, according to the operation of the distribution system BS according to the embodiment, the accounting data K that should be concealed is distributed to the plurality of nodes T and recorded, and these are recorded via the network as necessary. Since it is read and processed, the accounting data K can be efficiently distributed and managed while preventing the processing of the accounting data K from being concentrated on one node T.

  Further, the management of the billing data K in the P2P type distribution system BS can be efficiently performed by distributing and arranging the same as the contents.

  Further, in the node T as the content holder, when there is a distribution request, the accounting data K corresponding to the content to be distributed is generated, and further, the node T as the storage destination of the generated accounting data K is determined. Since the accounting data K is transmitted, the accounting data K corresponding to the distribution request is generated and arranged in each node T, whereby the accounting data K is efficiently distributed and managed. be able to.

  Furthermore, since the accounting data K for distribution of the content is generated based on the user information for identifying the user who has requested the distribution of the content, the content of the accounting data K having secrecy is a third party. The billing data K can be distributed while being prevented from leaking.

  Further, since the encryption processing that can be decrypted only at the accounting processing node is performed on the accounting data K, it is transmitted to the node T that stores the data, so that the accounting data K is generated based on the user information. In combination with this, the accounting data K can be distributed and arranged while the confidentiality of the accounting data K is more reliably protected.

  Further, since the transmitted charging data K is deleted from the storage source node T after the charging data K is transmitted to the charging processing node, the integrity of the charging data K can be further improved.

  Furthermore, in the billing processing node, a plurality of billing data K for the same distribution is read from the node T storing each, the contents are compared with each other, and each billing data K is determined based on the comparison result. Since it is determined whether or not there is a possibility of falsification during each recording, it is possible to effectively and quickly find out falsification by a third party with respect to any of the distributed charging data K.

  Therefore, each billing data K can be efficiently identified while effectively and quickly discovering each billing data K required for content distribution by a third party to improve the secrecy of each billing data K. This can be managed in a distributed manner.

  Further, since the billing data K is encrypted and can be decrypted only at the billing processing node, the confidentiality of the billing data K can be reliably maintained.

  Further, in the charging processing node, when there is charging information k having contents different from the majority of the charging information k, it is determined that the charging information k may have been falsified. The charging data K including the charging information k that may have been determined can be determined.

  In the embodiment described above, the method of using the DHT is also used for the search of the billing data K and the distribution to the billing processing node. However, in addition to this, the storage destination of the billing data K is centrally managed. A management node may be provided separately.

  In the above-described embodiment, the transmission / reception of the billing data K for the distribution fee generated by the distribution of the content and the distributed arrangement have been described. However, in addition to this, management information related to the distribution having confidentiality (for example, reproduction of the content) It is also possible to handle age restriction information regarding permission) as the accounting data K.

  Further, programs corresponding to the flowcharts shown in FIGS. 10 to 15 and FIG. 17 are recorded on an information recording medium such as a flexible disk or a hard disk, or acquired and recorded via the Internet or the like. These can be read out and executed by a general-purpose computer so that the computer functions as the control unit 11 according to the embodiment.

  As described above, the present invention can be used in the field of content distribution via a network, and has a particularly remarkable effect when applied to the field of content distribution in a download format and its charge management. can get.

It is a schematic diagram (I) which shows the outline | summary of the delivery system which concerns on embodiment, (a) is a schematic diagram which shows ID space in the said delivery system, (b) is a figure which illustrates index information. It is a block diagram which shows the outline structure of the node which concerns on embodiment common about a content holder etc. It is a figure (I) which illustrates typically exchanging contents and billing data concerning an embodiment. It is a figure (II) which illustrates typically exchanging of contents and billing data concerning an embodiment. It is a figure (III) which illustrates typically exchanging of contents and billing data concerning an embodiment. FIG. 4D is a diagram (IV) schematically illustrating transfer of content and billing data according to the embodiment. It is a figure (V) which illustrates typically exchanging of contents and billing data concerning an embodiment. It is a figure (VI) which illustrates typically exchanging of contents and billing data concerning an embodiment. It is a figure (VII) which illustrates typically exchanging of contents and billing data concerning an embodiment. It is a flowchart which shows the content delivery operation | movement and billing data process which concern on embodiment. It is a flowchart which shows the detail of the request process of the shared data which concerns on embodiment. It is a flowchart which shows the detail of the preservation | save process of the shared data which concerns on embodiment. It is a flowchart which shows the detail of the reception process of the request message R which concerns on embodiment. It is a flowchart which shows the detail of the accounting data generation process which concerns on embodiment. It is a flowchart which shows the detail of the acquisition process of the accounting data name which concerns on embodiment. It is a figure which shows the specific example of the accounting data which concern on embodiment. It is a flowchart which shows the detail of the accounting process which concerns on embodiment.

Explanation of symbols

DESCRIPTION OF SYMBOLS 11 Control part 12 Recording part 13 Buffer memory 14 Decoder part 15 Image | video processing part 16 Display part 17 Audio | voice processing part 18 Speaker 20 Communication part 20
21 Input unit 22 Bus Rc, Rn Ring EX Index information T, A, B, C, D, E, F, G, H, Inode BS distribution system MG1, MG4 Shared data search message MG2, MG5 Reply message MG3 Public message MG6 Delete message K Billing data k Billing information

Claims (6)

A distribution system including a plurality of node devices, wherein distribution information distributed in the distribution system by the P2P type distribution system in which the plurality of node devices are connected to each other via a network is the plurality of node devices. Distribution system that is stored in a distributed manner,
The distribution system includes:
Request information for requesting the distribution information, request information including name information indicating a name of the distribution information and user information indicating the user who receives the distribution . 1 request means,
A first node device comprising: first receiving means for receiving the distribution information requested by the first request means;
First storage means for storing at least one piece of distribution information distributed and stored in the distribution system;
Fourth receiving means for receiving the request information for requesting the distribution information from the first node device;
First transmission means for transmitting the distribution information stored in the first storage means to the first node device that requested the distribution information by the first request means;
Information related to the distribution fee of the distribution information transmitted by the first transmission unit, the name information indicating the name of the distribution information, the user information indicating the user who receives the distribution, and the distribution Generating means for generating management information including date and time information indicating use date and time related to information distribution;
One distribution information is randomly selected from distribution information that can be distributed in the distribution system, and a plurality of node devices that store the selected distribution information become storage destinations of the generated management information. Determining means for determining a plurality of third node devices;
Second transmission means for transmitting the management information generated by the generation means to the plurality of third node devices determined by the determination means ;
A second node device comprising:
Second receiving means for receiving the management information transmitted by the second transmitting means;
Second storage means for storing the management information received by the second receiving means;
Third transmission means for transmitting the management information stored in the second storage means to a fourth node device including the plurality of node devices in response to a request for the management information;
A plurality of third node devices comprising:
The third node in which the management information corresponding to the distribution information to be distributed is stored when the plurality of management information for the distribution of the distribution information is stored in the plurality of third node devices, respectively. Search means for searching for a device based on the date and time information of the management information;
Second request means for requesting the management information to the third node device searched by the search means;
Third receiving means for receiving the management information requested by the second request means;
Comparison comparing the management information stored in a plurality of the third node devices with the management information having the same date and time information included in the management information received by the third receiving means. Means,
Determination means for determining whether or not the content of each of the management information may be falsified based on a comparison result in the comparison means;
A fourth node device comprising:
A distribution system comprising the plurality of node devices . 2. The second node included in the distribution system according to claim 1, wherein the generation unit performs encryption processing that can be decrypted in a fourth node device that receives the management device, on the generated management information. apparatus. The second node device included in the distribution system according to claim 1,
After transmitting the management information to the third node apparatus, a second node according to claim 1 or 2, further comprising an erasing means for erasing the transmitted management information from the second node apparatus apparatus. The management information received by the third receiving means of the fourth node device is subjected to an encryption process that can be decrypted only by the fourth node device,
The fourth node apparatus, the fourth node device according to claim 1, further comprising a decoding means for decoding the management information that has been processed the encryption. The determination means determines that there is a possibility that the management information having the different contents may be falsified when there is the management information having a different content from the other majority of the management information as a result of the comparison in the comparison means. The 4th node apparatus of Claim 1 or 4 characterized by the above-mentioned. A distribution system including a plurality of node devices, wherein distribution information distributed in the distribution system by the P2P type distribution system in which the plurality of node devices are connected to each other via a network is the plurality of node devices. An information processing method executed in a distribution system that is stored in a distributed manner,
A first requesting step of requesting the distribution information by request information including name information indicating a name of the distribution information and user information indicating the user receiving the distribution by a first node device;
A fourth receiving step of receiving, by a second node device, the request information for requesting the distribution information from the first node device;
The distribution information stored in the first storage means for storing at least one distribution information distributed and stored in the distribution system by the second node device, the distribution information requested by the first request step. A first transmission step of transmitting to the first node device;
A first reception step of receiving the distribution information requested by the first request step by the first node device ;
Information related to the distribution fee of the distribution information transmitted in the first transmission step by the second node device, the name information indicating the name of the distribution information, and the user who receives the distribution a user information, a generation step of generating management information including the date and time information indicating the usage date and time relating to the distribution of the distribution information,
The second node device randomly selects one piece of distribution information from distribution information that can be distributed in the distribution system, and generates the plurality of node devices that store the selected distribution information. A determination step of determining a plurality of third node devices that are storage destinations of management information;
A second transmission step of transmitting the management information generated by the generation step to the plurality of third node devices determined by the determination step by the second node device ;
A second reception step of receiving the management information transmitted by the second transmission step by the third node device ;
A second storage step of storing the management information received by the second reception step by the third node device ;
When the fourth node device stores a plurality of the management information regarding the distribution of the distribution information in the plurality of third node devices, the management information corresponding to the distribution information to be distributed is stored. A search step of searching for the third node device to be performed based on the date and time information of the management information;
A second requesting step for requesting the management information to the third node device searched by the searching step by the fourth node device;
A third transmission step of transmitting, by the third node device, the management information stored in the second storage step to a fourth node device including the plurality of node devices;
A third receiving step of receiving the management information requested by the second requesting step by the fourth node device;
For the management information stored in the plurality of third node devices by the fourth node device, the date information included in each management information received in the third receiving step is the same as the management information. A comparison process for comparing differences in content;
A determination step of determining whether or not the contents of each of the management information may have been falsified based on the comparison result in the comparison step;
An information processing method characterized by the above.

Images