JP2009205398A - Information processor, information processing method and information-processing program - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide a terminal device or the like capable of rapidly and certainly transmitting a necessary go-around message RM to terminal devices in a necessary range while wholly reducing a load in a P2P (Pear-to-Pear) network S system. <P>SOLUTION: In the grid type network system S using a P2P network, after designating a go-around range by use of a node ID in the go-around message RM2, the go-around message RM2 is made to go around inside a corresponding ID space. In a node 1 inside the go-around range, when the node ID stored by itself is present inside the go-around range corresponding to the transferred go-around message RM2, the go-around message RM2 after corresponding processing is transferred to the other node 1 storing the adjacent node ID. <P>COPYRIGHT: (C)2009,JPO&INPIT

Description

  The present invention belongs to the technical fields of an information processing device, an information processing method, and an information processing program, and more specifically, an information processing device that forms a network system by being connected to each other via a network, and the information processing The present invention belongs to the technical field of an information processing method executed in an apparatus and an information processing program for the information processing apparatus.

  In recent years, with the spread of so-called broadband lines, content distribution services such as VOD (video on demand) and Internet television are becoming widespread.

  Here, tree-type and grid-type networks using a so-called P2P (Pear-to-Pear) network are attracting attention as a new form that replaces the server-client system that is the mainstream form of distribution in the current content distribution service. Yes. In the P2P network, all terminal devices that participate in it and receive data distribution are connected via a network such as the Internet. Specifically, these terminal devices are realized by, for example, a set top box or a personal computer provided in each home and connected to the network.

  In the P2P network, all or part of the processing unit and storage unit provided in each of the terminal devices is provided to the entire network, and the load generated by the search and transmission / reception of the content data to be distributed is all It is the structure which shares and bears between terminal devices. With such a configuration, the P2P network can eliminate the concentration of access from each terminal device to the server that is the distribution source and the high management cost of the server, which are disadvantages of the conventional server client method. It becomes. In addition, as a prior art regarding the grid type network using the said P2P network, what was described in the following patent document 1, for example is mentioned.

  Here, in the P2P network, it may be necessary to simultaneously deliver a certain type of the same message from one terminal device to all or part of other terminal devices participating in the P2P network. is there. More specifically, for example, when it becomes necessary to know the number of all terminal devices currently participating in the P2P network, or for users of terminal devices currently participating in the P2P network. This is the case when conducting some kind of questionnaire survey.

  One of the conventional message transmission methods in the P2P network suitable for use in such a case is a “DHT (Distributed Hash Table) multicast method” as exemplified in Patent Document 1 below.

  Here, the DHT itself and the so-called “routing table” used therein are detailed in, for example, paragraph numbers [0026] to [0044] and FIGS. The DHT multicast method is detailed in, for example, paragraph numbers [0048] to [0120] and FIGS. 5 to 16 of Patent Document 1 below.

On the other hand, as a patent document disclosing a transmission method of control information or the like when the P2P network system is not assumed, there is, for example, the following Patent Document 2. This patent document 2 describes a method for transmitting a token for initializing the entire network system to all devices in the network by a so-called token passing system.
JP 2007-235243 A JP-A-60-96941

  However, in the DHT multicast method described in Patent Document 1, messages are transmitted from a plurality of terminal devices at the same time step by step based on the routing table related to DHT. There is a problem in that the applied load may temporarily increase.

  In the DHT multicast method, a reply message corresponding to the transmitted message is returned from each of the other terminal devices as the transmission destinations. In this case, there is a problem that the response messages are concentrated as a result in the terminal device that receives them (the terminal device that first started message transmission), and the processing load on the terminal device may be excessive. .

  On the other hand, the technology described in Patent Document 2 only discloses a configuration in which tokens are transferred in the order of addresses possessed by each device to all the devices configuring the network. There is no disclosure or suggestion regarding the transfer of tokens for some areas of.

  Therefore, the present invention has been carried out in view of the above-mentioned problems, and an example of the purpose thereof is a message required for terminal devices within a necessary range while reducing the load on the P2P network system as a whole. Can be transmitted, and the terminal device that can suppress the occurrence of an overload state in the terminal device that should be received even in the reception of the corresponding response message, the information processing method executed in the terminal device, and the terminal device The object is to provide an information processing program.

  In order to solve the above-described problem, the invention according to claim 1 is directed to an information processing apparatus constituting a network system in which a plurality of information processing apparatuses are connected to each other via a network. Circulates between each of the information processing devices according to the continuity of the identification information, and storage means such as a storage unit for storing identification information that is unique identification information and expressed using a continuous number When a message to be transferred is transferred via the network, a receiving unit such as a communication unit that receives the transferred message and a control that executes a corresponding process corresponding to the content of the received message A range information indicating a range of the identification information corresponding to a range of the information processing apparatus to which the messages are to be sequentially transferred. The range information is extracted from the received message, the range indicated by the extracted range information, and the stored identification information. When the comparison information such as a control unit to be compared and the stored identification information are within the range, the message after the execution of the corresponding process is adjacent to the value of the stored identification information in the continuity Transfer means such as a communication unit that transfers the identification information having the value to be transferred to the other information processing apparatus that stores the identification information.

  Therefore, when there is identification information stored in the range of identification information indicated by the range information included in the forwarded message, the message after the corresponding processing is adjacent in the continuity of each identification information Since the identification information is transferred to another information processing device, the message is transferred to the range while reducing the load required for information transmission in the network by sequentially repeating the transfer of the message in each information processing device. Can be transmitted to the information processing apparatus.

  In order to solve the above-mentioned problem, the invention according to claim 2 is the information processing apparatus according to claim 1, wherein the transfer means is configured such that when the stored identification information is not within the range, The message after the execution of the handling process is configured to be transferred to the information processing apparatus that is the transmission source of the message.

  Therefore, when there is no identification information stored in the range of the identification information indicated by the range information included in the message, the message after the response processing is transferred to the transmission source, so that the message is transferred. A message with a specified power range can be sent back to the sender.

  In order to solve the above problem, the invention according to claim 3 is included in the network system including the information processing apparatus according to claim 1 or 2 and is a sender of the message The message is transferred based on storage means such as a storage unit for storing the identification information for identifying the information processing apparatus itself and the attribute of the message to be circulated. Generating and adding means such as a control unit for generating the range information indicating the range to be added to the message, and identifying the message to which the range information is added corresponding to the head of the range in the continuity Transfer means such as a communication unit that transfers the information to another information processing apparatus that stores information.

  Therefore, in the network system including the information processing apparatus according to claim 1 or 2, a range to which a message should be transferred is specified in the continuity of each identification information, and identification information corresponding to the head of the range is stored. Since the transfer is started by transferring the message to another information processing apparatus, the message circulation is repeated within the range, thereby reducing the load necessary for information transmission in the network and the message. It can be transmitted to an information processing device within the range.

  In order to solve the above-mentioned problem, the invention according to claim 4 is the information processing apparatus according to claim 3, wherein the attribute is the information amount of the message itself, and the transfer should be terminated quickly. Whether the message is a message, or whether the message requires a reply from the information processing apparatus as a transfer destination.

  Therefore, the attribute of the message that is the basis for determining the range of the identification information is the information amount of the message itself, whether or not the transfer should be promptly terminated, or the message from the information processing apparatus of the transfer destination Therefore, it is possible to determine the circulation range according to various attributes in the message and transfer them efficiently.

  In order to solve the above-described problem, the invention according to claim 5 is the information processing apparatus according to claim 3 or 4, wherein the generation and addition means stores the value of the identification information stored in the continuity. Starting the transfer of the message from the other information processing apparatus storing the identification information having a value adjacent to the network, and transferring only within a part of the information processing apparatus included in the network system The range information is generated, and the transfer unit transfers the message to which the generated range information is added to the other information processing apparatus storing the identification information having the adjacent value. Configured.

  Therefore, in the network system including the information processing device according to claim 1 or 2, transfer is started from the information processing device storing the next identification information of the information processing device of the transmission source, and the network system Since only the part of the included information processing apparatus is transferred, it is possible to more quickly execute the transfer of the message having the contents sufficient for the transfer only within the part.

  In order to solve the above-described problem, the invention according to claim 6 is the information processing apparatus according to claim 3 or 4, wherein the generation and addition unit uses the identification information for identifying each information processing apparatus as the identification information. The transfer of the message is started from the head information processing apparatus that is the information processing apparatus that stores the identification information at the head of each of the identification information groups obtained by dividing into a plurality of pieces of continuity, and the head information processing The range information is generated so as to transfer only within the information processing device group corresponding to the identification information group including the identification information stored in the device, and the transfer means includes each of the generated range information. The number of messages corresponding to the number of identification information groups added are configured to be transferred toward the corresponding first information processing apparatus.

  Therefore, in the network system including the information processing device according to claim 1 or 2, since the transfer of the message is started from the top information processing device and only within the corresponding information processing device group, the information It is possible to more quickly execute the transfer of a message having a content sufficient for the transfer only within the processing device group or a message that requires a quick transfer.

  In order to solve the above-described problem, the invention according to claim 7 is the information processing apparatus according to any one of claims 3 to 6, such as a control unit that starts timing when the message is transferred. And the transfer means, when a reply message corresponding to the transferred message is not transmitted by the timing when the preset waiting time is measured by the time measuring means, the message is again transmitted. Configured to initiate a transfer of.

  Therefore, when the reply message is not transmitted before the preset waiting time elapses, the transfer is performed again. Therefore, even if there is a failure or the like during the lap, the message can be circulated. .

  In order to solve the above problem, according to an eighth aspect of the present invention, in the information processing apparatus according to the seventh aspect, the transfer unit is configured to send the response before the timing at which the waiting time is counted by the timing unit. When the message is not sent back, the message transfer is started again for the preset number of retransmissions.

  Therefore, when the reply message is not sent back by the time when the waiting time elapses, the circulation of the message is repeated again for the preset number of retransmissions. When the message is circulated, the message can be circulated even if there is a failure or the like during the circulation.

  In order to solve the above-described problem, the invention according to claim 9 is the information processing apparatus according to claim 7 or 8, wherein the generation and addition unit retransmits the message by the number of times of retransmission. When the reply message is not transmitted, new range information in which the content of the range information is changed is generated and added to the message.

  Therefore, when a reply message is not sent, new range information with different contents of the range information is generated and added to the message for transfer. Can be done.

  In order to solve the above-described problem, an invention according to claim 10 is an information processing method executed in an information processing apparatus constituting a network system in which a plurality of information processing apparatuses are connected to each other via a network. The information processing apparatus includes a storage unit such as a storage unit that stores identification information that is unique to each information processing apparatus and that is expressed using a continuous number. When a message to be transferred between each of the information processing devices according to the continuity of information is transferred via the network, a receiving step of receiving the transferred message, and the received An execution step of executing a corresponding process corresponding to the content of the message, and the identification information corresponding to a range of the information processing device to which the message is to be sequentially transferred. When range information indicating the range of the message is added to the received message, an extraction step of extracting the range information from the received message, the range indicated by the extracted range information, and the stored A comparison step for comparing the identification information being stored, and when the stored identification information is within the range, the message after the execution of the corresponding process is the value of the stored identification information in the continuity A transfer step of transferring the identification information having a value adjacent to the other information processing apparatus storing the identification information.

  Therefore, when there is identification information stored in the range of identification information indicated by the range information included in the forwarded message, the message after the corresponding processing is adjacent in the continuity of each identification information Since the identification information is transferred to another information processing device, the message is transferred to the range while reducing the load required for information transmission in the network by sequentially repeating the transfer of the message in each information processing device. Can be transmitted to the information processing apparatus.

  In order to solve the above problem, an invention according to claim 11 is included in the network system including the information processing apparatus according to claim 1 or 2, and is a sender of the message The information processing method is executed by the information processing apparatus, and the information processing apparatus includes a storage unit such as a storage unit that stores the identification information for identifying the information processing apparatus itself. Generating and adding the range information indicating the range to which the message is to be transferred based on the attribute of the message to be transferred, and adding the message to which the range information is added, A transfer step of transferring the identification information corresponding to the head of the range in the continuity toward the other information processing apparatus storing the identification information.

  Therefore, in the network system including the information processing apparatus according to claim 1 or 2, a range to which a message should be transferred is specified in the continuity of each identification information, and identification information corresponding to the head of the range is stored. Since the transfer is started by transferring the message to another information processing apparatus, the message circulation is repeated within the range, thereby reducing the load necessary for information transmission in the network and the message. It can be transmitted to an information processing device within the range.

  In order to solve the above problem, an invention according to a twelfth aspect causes a computer to function as the information processing apparatus according to any one of the first to ninth aspects.

  Therefore, when there is identification information stored in the range of identification information indicated by the range information included in the forwarded message, the message after the corresponding processing is adjacent in the continuity of each identification information Since the computer functions to transfer the identification information to other information processing devices, the computer as each information processing device functions so as to sequentially repeat the message transfer in each information processing device. Thus, the message can be transmitted to an information processing device within the range while reducing the load necessary for information transmission in the network.

  According to the present invention, when there is identification information stored in the range of the identification information indicated by the range information included in the transferred message, the message after the corresponding process is continuously displayed. The information is transferred to other information processing devices that store adjacent identification information, so that it is possible to reduce the load required for information transmission in the network by sequentially repeating the transfer of messages in each information processing device. The message can be transmitted to an information processing device within the range.

  Accordingly, by utilizing the characteristics as identification information in the network system according to the present invention, a necessary message is transmitted to an information processing apparatus within a necessary range while reducing a load necessary for information transmission on the network. Can do.

Next, the best mode for carrying out the present invention will be described with reference to the drawings. Each embodiment described below is a case where the present invention is applied to message transmission processing in a P2P network using the DHT disclosed in Patent Document 1, particularly in FIGS. 1 to 3. It is an embodiment.
(I) First Embodiment First, a first embodiment according to the present invention will be described with reference to FIG. 1 to 3 described below all relate to the present invention between terminal devices 1 arranged on an ID space (see FIG. 2 of Patent Document 1) corresponding to the P2P network according to the present invention. It is a figure which shows the transmission method of a message notionally.

  In the following description, a terminal device participating in the P2P network according to the present invention is simply referred to as a “node”. Further, the P2P network itself according to the present invention is hereinafter simply referred to as “network system S”.

  Similar to that described in Patent Document 1, the node 1 according to the present invention also has a unique node ID for each of the other nodes 1 (paragraph number [0036] in Patent Document 1). ]reference). Then, the node IDs are substantially evenly increased with respect to a single direction (clockwise in the example shown in FIG. 1) in the ID space corresponding to the network system S illustrated in FIG. Thus, it will be allocated to each node 1. Note that in Patent Document 1, the increasing direction of the node ID in the ID space is described as the counterclockwise direction (see, for example, FIG. 2 of Patent Document 1).

  Therefore, in the present invention that exemplifies embodiments below, the characteristics of the node ID itself, that is, there is no other node ID having the same value in the ID space, and the value is a single ID space. By using the simple increase with respect to the direction, the messages are sequentially transferred and circulated in the ID space. In the embodiments described below, not only the case of making a round in the ID space but also the case of sequentially transferring a part of the ID space are expressed using the word “round”.

  First, as a first embodiment according to the present invention, as illustrated in FIG. 1, it is assumed that the transmission source of the circulation message RM1 (see the solid line arrow in FIG. 1) to be circulated is the node 1A, for example. Then, the node 1A as the transmission source refers to the routing table stored in the node 1A, and another node 1 indicated by the node ID having a value adjacent to the node ID indicating the node 1A in the ID space (that is, the node 1A). , A round message RM1 is transmitted to the node 1B) in FIG. In the circulation message RM1, a node ID indicating the transmission source node 1A is described. In the following description, a node ID indicating the transmission source node 1 is generally referred to as a “transmission source node ID”.

  Next, the node 1B performs processing corresponding to the circulation message RM1 transferred from the node 1A. Thereafter, the node 1B refers to the routing table stored in the node 1B, and another node 1 indicated by the node ID having a value adjacent to the node ID indicating the node 1B in the ID space (that is, FIG. 1). The round message RM1 is transmitted to the node 1C). Thereafter, the processing corresponding to the above-described circulation message RM1 is executed, and the processing for transmitting the circulation message RM1 after the processing to the node 1 indicated by the node ID having an adjacent value in the ID space is performed in the network system S. Iterates sequentially at each node 1 participating in.

  By the above sequential processing / transfer operation (hereinafter referred to as “circular operation” as appropriate), finally, the corresponding processing is performed in all the nodes 1 participating in the network system S, and then the nodes The circular message RM1 that starts the transfer from 1A goes around the ID space and returns to the original node 1A. At this time, at a certain timing in FIG. 1, there is one circulation message RM1 transferred on the network system S. In addition, the circulation message RM1 returns to the node 1A as the transmission source only once from the node 1S having a node ID having an adjacent value in the ID space. Therefore, it is possible to quickly and surely transmit the necessary circulation message RM1 to all the nodes 1 participating in the network system S while reducing the load necessary for the transmission of the circulation message RM1 as a whole network system S. It can be done. Also, the node 1A as the transmission source executes other processing that the circulation message RM1 has been transmitted to another node 1 while reducing the processing load for receiving the circulation message RM1 after the circulation in the ID space. It can be recognized without any problems.

In addition, when it is necessary to transmit information obtained by circulating the circulation message RM1 in the ID space to the node 1 in the network system S again as a reply message, the node 1A as the transmission source again sets the transmission source as the transmission source. The sequential transfer of the response messages AM1 is started. As a result, the reply message AM1 circulates in the ID space corresponding to the network system S in the same procedure as the circulatory message RM1, and returns to the node 1A again (see the two-dot chain line arrow in FIG. 1). Therefore, also for this reply message AM1, the node 1A as the transmission source can recognize that it has been transmitted to all the other nodes 1 without performing any other processing.
(II) Second Embodiment Next, a second embodiment which is another embodiment according to the present invention will be described with reference to FIG.

  In the first embodiment described above, as illustrated in FIG. 1, the transfer of the circulation message RM1 is started from the node 1A as the transmission source, and all the nodes 1 participating in the network system S are circulated. The configuration for returning the circulation message RM1 to the node 1A is illustrated.

  In contrast, as a second embodiment according to the present invention, as illustrated in FIG. 2, the circulation range of the circulation message RM2 (see the solid arrow in FIG. 2) to be circulated is, for example, from the node 1B to the node in FIG. It is specified in the range of 1K. For this reason, in the circulation message RM2 according to the second embodiment, in addition to the message body as the circulation message RM2, the node 1 corresponding to the end of the circulation range (node 1K in the case of FIG. 2) is shown. A node ID and a transmission source node ID indicating the node 1A are described.

  Note that the node ID indicating the node 1 corresponding to the end of the circulation range is determined based on the definition mode (for example, the number of digits) of the node ID in the ID space corresponding to the network system S. Specifically, for example, a half value of the maximum value as the node ID is set as a node ID indicating the node 1 corresponding to the last. In this case, it is predicted that the round message RM2 is participating in the network system S (it is unknown whether or not it is actually participating) of all the nodes 1 (predicted). A number of nodes 1 are sequentially transferred.

  Specifically, as illustrated in FIG. 2, the transmission source node 1A is indicated by a node ID having a value adjacent to the node ID indicating the node 1A in the ID space, as in the first embodiment. A round message RM2 is transmitted to the node 1B. Here, in the circulation message RM2, a node ID indicating the node 1 (node 1K in the case of FIG. 2) corresponding to the end of the rotation range and a transmission source node ID indicating the node 1A are described. ing.

  Next, the node 1B that has received the transfer of the circulation message RM2 from the node 1A performs processing corresponding to the circulation message RM2 as in the case of the first embodiment. Thereafter, similarly to the case of the first embodiment, the node 1B transmits the circulation message RM2 toward the node 1C indicated by the node ID having a value adjacent to the node ID of the node 1B in the ID space. Thereafter, the processing corresponding to the above-described circulation message RM2 is executed, and the processing for transmitting the circulation message RM2 after the processing to the node 1 indicated by the node ID having an adjacent value in the ID space is performed in the network system S. It repeats in each node 1 in the circulation range in FIG. This rounding operation is sequentially repeated until the rounding message RM2 reaches the node 1K corresponding to the end of the rounding range.

  When the circulation message RM2 reaches the node 1K, the node 1K recognizes that it is within the circulation range. This is because the node 1K itself recognizes that its own node ID is the same as the node ID indicating the node 1 corresponding to the end of the circulation range included in the circulation message RM2. Then, the node 1K performs the corresponding processing on the circulation message RM2, and further transmits the circulation message RM2 to the node 1L indicated by the adjacent node ID.

  Thus, the node 1L that has received the transfer recognizes that the node ID indicating the node 1 corresponding to the end of the circulation range included in the circulation message RM2 is smaller than the node ID stored in the node 1L. Thereby, the node 1L recognizes that it is outside the circulation range of the circulation message RM2, and transmits the circulation message RM2 to the node 1A that is the transmission source without performing the corresponding processing. At this time, the node 1L transmits the circulation message RM2 toward the node ID indicating the node 1A included in the circulation message RM2.

  By the above rounding operation, finally, the corresponding processing is performed in each node 1 within the designated rounding range in the network system S (in the example of FIG. 2, the range from the node 1B to the node 1K). The round message RM2 that has started the transfer from the node 1A is transferred to the node 1K, and further returns from the node 1L to the original node 1A.

  Even in the case of the second embodiment, there is only one round message RM2 transferred on the network system S at a certain timing, and the round message RM1 is returned to the node 1A that is the transmission source. Only once. Therefore, even in the case of the revolving operation according to the second embodiment, the same operational effects as in the case of the first embodiment can be obtained.

  In addition, according to the circulatory operation according to the second embodiment, the circulatory message RM2 is transferred within the specified circulatory range to be transferred, and the range that does not need to be transferred is not transferred and is not transferred. Transferred to node 1A. Therefore, when it is not necessary to transfer a message to all the nodes 1 participating in the network system S, a necessary message can be returned to the node 1A as a transmission source more quickly.

In addition, when it is necessary to transmit the information obtained by circulating in the circulation range designated by the circulation message RM2 to the node 1 in the network system S again as a reply message, the node 1A as the transmission source again Sequential transfer of the response messages AM2 is started as a transmission source. In this case, unlike the circulation message RM2, the reply message AM2 circulates all within the ID space corresponding to the network system S in the same procedure as the reply message AM1 according to the first embodiment, and returns to the node 1A again. (See the two-dot chain arrow in FIG. 2). Therefore, also for this reply message AM2, the node 1A can recognize that it has been transmitted to all other nodes 1 as in the case of the first embodiment without performing any other processing. .
(III) Third Embodiment Next, a third embodiment which is still another embodiment of the present invention will be described with reference to FIG.

  In the second embodiment described above, as illustrated in FIG. 2, a partial message RM <b> 2 is transferred from the transmission source node 1 </ b> A after designating a partial range of the node 1 participating in the network system S as the circulation range. The configuration is illustrated in which the circulatory message RM2 is finally returned to the node 1A after the circulatory range is started and the circulatory range is sequentially circulated.

  On the other hand, as a third embodiment according to the present invention, as illustrated in FIG. 3, a different circulation range is designated for each circulation message RM3 to be circulated. More specifically, for example, as illustrated in FIG. 3, the circulation message RM3-1 includes the rotation range from the node 1B to the node 1E, and the rotation message RM3-2 includes the node 1F to the node 1J. It is considered as a lap range. Further, for the circulation message RM3-3, the circulation range is from the node 1K to the node 1O, and for the circulation message RM3-4, the circulation range is from the node 1P to the source node 1A. Then, the node 1A, which is the transmission source of each circulation message RM3, transmits each circulation message RM3 toward the node 1 corresponding to the beginning of each circulation range, and starts the circulation for each circulation range. Specifically, the node 1A transmits a circulation message RM3-1 toward the node 1B to start circulation within the circulation range, and transmits a circulation message RM3-2 toward the node 1F to transmit the circulation range. Start the lap in. Similarly, the node 1A transmits a circulation message RM3-3 toward the node 1K to start circulation within the circulation range, and transmits a circulation message RM3-4 toward the node 1P to transmit within the circulation range. Start the lap.

  Furthermore, in each of the round messages RM3-1 to RM3-4 according to the third embodiment, in addition to the message body of each of the round messages RM3, in order to designate the round range for each of the round messages RM3 described above, respectively. , A node ID indicating the node 1 corresponding to the end of each corresponding circulation range and a transmission source node ID indicating the node 1A are described. Specifically, in the case illustrated in FIG. 3, a node ID indicating the node 1E and a transmission source node ID indicating the node 1A are described in the circulation message RM3-1, and a node indicating the node 1J is described in the circulation message RM3-2. The transmission source node ID indicating the ID and the node 1A is described. Further, a node ID indicating the node 1O is described in the circulation message RM3-3. Further, in the circulation message RM3-4, the node ID indicating the node 1A is described in the meaning of both the node ID indicating the node 1 corresponding to the end of the circulation range and the transmission source node ID.

  Note that the node ID indicating the node 1 corresponding to the end of each circulation range is determined based on the definition of the node ID in the ID space corresponding to the network system S, as in the second embodiment. . Specifically, for example, each of the values corresponding to a quarter of the maximum value as the node ID is set as a node ID indicating the node 1 corresponding to the last of each corresponding circulation message RM3.

  Next, the circulation mode of each circulation message RM3 will be described using the circulation message RM3-2 as an example with reference to FIG.

  As illustrated in FIG. 3, the node 1A that is the transmission source of the circulation message RM3-2 transmits the circulation message RM3-2 toward the node 1F corresponding to the head of the circulation range in the ID space.

  Next, the node 1F that has received the transfer of the circulation message RM3-2 from the node 1A performs processing corresponding to the circulation message RM3-2 in the same manner as in the first embodiment or the second embodiment. . Thereafter, the node 1F sends a circulatory message toward the node 1G indicated by the node ID having a value adjacent to the node ID of the node 1F in the ID space in the same manner as in the first embodiment or the second embodiment. RM3-2 is transmitted. Thereafter, the processing corresponding to the above-described circulation message RM3-2 is performed, and the circulation message RM3-2 after the processing is further transmitted to the node 1 indicated by the adjacent node ID in the circulation range in the ID space. The transfer process is repeated at each node 1 in the circulation range. This rounding operation is sequentially repeated until the rounding message RM3-2 reaches the node 1J corresponding to the end of the rounding range.

  When the circulation message RM3-2 reaches the node 1J, the node 1J recognizes that the node 1J is within the circulation range of the circulation message RM3-2. This recognition operation is performed in the same manner as the node 1K according to the second embodiment to which the circulation message RM2 according to the second embodiment has been transferred. Then, the node 1J performs the corresponding process on the circulation message RM3-2, and further transfers the circulation message RM3-2 to the node 1K indicated by the adjacent node ID.

  Accordingly, the node 1K that has received the transfer recognizes that the node ID indicating the node 1 corresponding to the end of the circulation range included in the circulation message RM3-2 is smaller than the node ID stored in the node 1K. To do. As a result, the node 1K recognizes that it is outside the circulation range of the circulation message RM3-2, and transmits the circulation message RM3-2 to the node 1A that is the transmission source without performing the corresponding processing. At this time, the node 1K transmits the circulation message RM3-2 toward the node ID indicating the node 1A included in the circulation message RM3-2.

  By the above rounding operation, finally, the corresponding processing is performed in each node 1 within the designated rounding range in the network system S (in the example of FIG. 3, the range from the node 1F to the node 1J). The circulatory message RM3-2 that has started the transfer from the node 1F is transferred to the node 1J, and further returns from the node 1K to the original node 1A. Further, with respect to the circulation messages RM3 other than the circulation message RM3-2, the same processing / transfer operations as those of the circulation message RM3-2 are sequentially repeated within the corresponding circulation ranges, so that the respective circulation ranges. Go around the inside.

  In the case of the third embodiment, there are a total of four circulation messages RM3 transferred on the network system S at a certain timing. However, the processing load of the network system S as a whole is described in Patent Document 1 above. Significantly less than in the case of existing P2P networks.

  Also, when the round message RM3 returns to the node 1A that is the transmission source, only the four nodes 1 return. Therefore, the node 1A also recognizes that the circulation message RM3 has been transmitted to the other node 1 without performing other processes while reducing the processing load for receiving the circulation message RM3 after the ID space circulation. can do.

  Therefore, according to the circulatory operation according to the third embodiment, the circulatory messages RM3 are simultaneously transferred within the specified circulatory ranges, so that messages can be sent to all the nodes 1 participating in the network system S. Even if it is necessary to transfer the message, the necessary message can be returned to the node 1A as the transmission source more quickly.

In addition, when it is necessary to transmit the information obtained by circulating each round message RM3 within the designated round range to the node 1 in the network system S as a reply message again, the node 1A as the transmission source Circulates the answer message all within the ID space corresponding to the network system S in the same procedure as the answer message AM1 according to the first embodiment and returns it to the node 1A again (not shown in FIG. 3). Thereby, the node 1A can recognize that the reply message has been transmitted to all the other nodes 1 without performing any other processing.
(IV) Different Use of Circulation Operation According to Each Embodiment Next, an example of how to use the circulation operation according to any of the first to third embodiments will be described.

  The circulation operation is preferably used properly based on the contents of the circulation message RM and the purpose of circulating the message in the network system S (in the ID space). In addition, it is preferable to select which circulation operation is selected by the user of the node 1 of the transmission source at the stage where each circulation message RM is transferred from the transmission source.

  More specifically, for example, when the amount of data as the circulation message RM gradually increases every time the corresponding processing is executed in each node 1, or the result of circulating in the desired circulation range is more When the transmission source needs to be acquired quickly, the circulation operation according to the second embodiment or the third embodiment is adopted from the viewpoint of ending the circulation in a short time while limiting the circulation range in the ID space. Is preferred.

  On the other hand, when the data amount as the circulation message RM does not change in the circulation operation in each node 1, or when a certain amount of time may be required to acquire the circulation result, the burden on the entire network system S is reduced. From the viewpoint, it is preferable to adopt the circular operation according to the first embodiment.

  Furthermore, it is preferable to adopt the orbiting operation according to the first embodiment or the third embodiment when accuracy is required for the orbiting result, and the orbiting operation according to the second embodiment when the accuracy is not required. Is preferably adopted.

  Next, the proper use of the circulation operation based on the circulation purpose will be exemplified.

  Specifically, when the circulation message RM is circulated for the purpose of grasping the number of all the nodes 1 participating in the network system S, the circulation operation according to any of the above embodiments may be selected. Absent. In this case, when the circulation operation according to the second embodiment or the third embodiment is adopted, the total number of participating nodes is predicted from the circulation result of only a part of the ID space.

  Next, when the circulation message RM is circulated for the purpose of grasping the number of content files, for example, stored in each node 1 participating in the network system S, the data amount of the circulation message RM itself is determined. Since it increases at every round operation, it is preferable to select the round operation according to the second embodiment or the third embodiment.

  Further, when the circulation message RM is circulated for the purpose of grasping, for example, the type of content file stored in each node 1 participating in the network system S, the data amount of the circulation message RM itself is increased. Therefore, it is preferable to select the circular motion according to the third embodiment.

  On the other hand, when the circulation message RM is circulated for the purpose of grasping the total amount of the hard disk used in each node 1 participating in the network system S as a whole, the network system S is preferably used. Since it is necessary to go around the wide range, it is preferable to select the turning operation according to the first embodiment or the second embodiment.

  In addition, when the circulation message RM is circulated for the purpose of grasping the usage rate of the network system S as a whole at a certain timing and the number of times content is viewed by each node 1 user, the speed of the results Therefore, it is preferable to select the circulation operation according to the second embodiment or the third embodiment.

Finally, when the circulation message RM is circulated for the purpose of grasping the number of times of viewing / listening in the specific content of each node 1, since the quickness of the result is most demanded, the circulation operation according to the third embodiment Is preferably selected.
(V) Retransmission of circulation message The network system S according to each embodiment described above is a set-top box or a personal computer installed in each home, for example, in which each node 1 is capable of centralized power management. There is a possibility that the circulation operation for the circulation message RM that has started the transfer is interrupted in the middle of the circulation due to the characteristic that there is no transfer.

  Therefore, for example, if the circulation message RM does not return to the transmission source even after a predetermined time (hereinafter referred to as “waiting time”) elapses, the circulation message RM is transferred again. Is required. At this time, the waiting time in the transmission source node 1 until transfer is started again depends on the number of nodes 1 participating in the network system S.

  Therefore, for example, when the number of members who are registered for the content distribution business using the network system S is known in advance, the waiting time may be determined in advance based on the number of members. preferable.

  In addition, when the number of members as described above is not known in advance, when starting the transfer of the circulation message RM for the first time, set a waiting time longer than a certain length, and at the time of starting the retransfer from the second time onward. It is preferable to determine the corresponding waiting time based on the time until the return of the round message RM transferred immediately before.

  Further, the waiting time varies depending on which of the above-described circulation operations according to the first to third embodiments is performed. Furthermore, when using the loop operation according to the second embodiment or the third embodiment, the waiting time until the second and subsequent retransmission starts varies depending on the number of nodes 1 in each loop range. Come.

  In addition, as to the number of nodes 1 participating in the network system S and the purpose of circulation of the circulation message RM itself, the number of nodes 1 participating in the network system S and the number of times of performing the above-described retransmission itself for one circulation message RM. Based on this, it is predetermined for each circulation message RM.

  Next, examples according to the above-described embodiments will be collectively described with reference to FIGS. 4 to 8. 4 is a block diagram showing a schematic configuration of the node 1 according to the embodiment in common, FIG. 5 is a flowchart showing the entire operation according to the embodiment at each node 1, and FIGS. It is a flowchart which shows the detail of the said operation | movement.

  First, the configuration of the node 1 according to the embodiment will be described. Each node 1 according to the embodiment basically has the same configuration, and further basically executes the same operation independently.

  As shown in FIG. 4, the node 1 according to the embodiment includes a control unit 21 as an execution unit, an extraction unit, a comparison unit, a timing unit, and a generation load unit, a storage unit 22 as a storage unit, and a buffer memory 23. A decoding accelerator 24, a decoder unit 25, a video processing unit 26, a display unit 27, an audio processing unit 28, a speaker 29, a communication unit 29a as a receiving unit and a transfer unit, and an input unit 29b. IC card slot 29c. These components are connected to each other via a bus 29d.

  At this time, the control unit 21 includes a CPU having an arithmetic function, a working RAM (Random Access Memory), a ROM (Read Only Memory) that stores various data and programs (including an OS (Operating System) and various applications), and the like. It is configured. The storage unit 22 includes an HDD (Hard Disc Drive) that stores various data and programs. Furthermore, the buffer memory 23 temporarily accumulates (stores) content data received via the network system S.

  On the other hand, the decryption accelerator 24 decrypts the content data stored in the buffer memory 23 using a decryption key. The decoder unit 25 decodes (reproduces data, etc.) video data and audio data included in the decoded content data and reproduces them. Further, the video processing unit 26 performs a predetermined drawing process on the reproduced video data or the like and outputs the result as a video signal.

  On the other hand, the display unit 27 includes a CRT (Cathode Ray Tube), a liquid crystal display, or the like, and displays a corresponding video based on the video signal output from the video processing unit 26. The audio processing unit 28 performs D (Digital) / A (Analog) conversion of the reproduced audio data into an analog audio signal, and then amplifies this with an amplifier and outputs the amplified signal. Furthermore, the speaker unit 29 outputs the audio signal output from the audio processing unit 28 as a sound wave.

  Further, the communication unit 29a performs input / output processing of the circulation message RM and the reply message AM together with communication control processing with another node 1 via the communication line 9. Further, the input unit 29b includes, for example, a mouse, a keyboard, an operation panel, a remote controller, and the like, and outputs instruction signals corresponding to various instructions from the user to the control unit 21. The IC card slot 29c reads / writes information from / to the IC card 29e.

  On the other hand, the buffer memory 23 is composed of, for example, a FIFO (First In First Out) ring buffer memory, and the content data received through the communication unit 29a in the storage area indicated by the reception pointer under the control of the control unit 21. Is temporarily stored.

  At this time, the control unit 21 performs overall control of the entire node 1 by reading and executing a program stored in the storage unit 22 or the like by the CPU included therein, and will be described later (see FIGS. 5 to 8). Each such operation is executed. In addition to this, as a normal process, the control unit 21 receives various messages and a plurality of packets transmitted from the other nodes 1 via the network system S using the above-described distributed hash table through the communication unit 29a. Then, the packet (packet received in a certain period of time) and the various messages stored in the buffer memory 23 and the various messages are read out, and other messages are transmitted through the communication unit 29a in accordance with the distributed hash table. Transfer to node 1.

  On the other hand, the buffer memory 23 reads out the packet stored in the storage area of the buffer memory 23 indicated by the playback pointer, and outputs the packet to the decoding accelerator 24 and the decoder unit 25 via the bus 29d.

  The program may be downloaded from a predetermined server on the network, for example, or may be recorded on a recording medium such as a CD-ROM (Compact disc-ROM) and the drive of the recording medium may be used. It may be configured to be read through.

  Next, operations according to the embodiment in the node 1 will be described with reference to FIGS.

  First, the overall operation in the node 1 will be described with reference to FIG.

  As shown in FIG. 5, the control unit 21 of each node 1 according to the embodiment constantly monitors whether or not a power switch (not shown) provided in the input unit 29b is turned off (step S1). When the power switch is turned off (step S1; YES), the control unit 21 ends the operation as the node 1 as it is.

  On the other hand, when the operation of turning off the power switch is not executed in the determination of step S1 (step S1; NO), the control unit 21 next performs a request operation for transmitting the circulation message RM at the input unit 29b. It is confirmed whether there has been (step S2). When the operation is performed (step S2; YES), the control unit 21 creates a circulation message RM having contents corresponding to the operation for instructing the contents of the circulation message RM executed in the input unit 29b. (Step S3). Thereafter, the control unit 21 determines the circulation operation related to the generated circulation message RM based on the contents and the like (step S4). Specifically, as the rounding operation determination process, the control unit 21 determines whether the rounding operation of the rounding message RM is the one in the first to third embodiments by the method described in the above section (IV). The details will be described later.

  When it is determined which one of the circular operations is to be performed, the control unit 21 starts transfer (transmission) of the circular message RM within the network system S by the determined circular operation (step S5). The transfer start process according to step S5 will also be described in detail later.

  Next, after terminating the transfer of one round message RM as the transmission source, the control unit 21 temporarily stores the round message RM itself, initializes a timer (not shown) in the control unit 21, and “1” is set in the transmission frequency parameter indicating the transmission frequency of the circulation message RM. Note that this timer is used to determine whether or not the re-forwarding of the circulation message RM is necessary in the process of step S10 described later, and is associated one-to-one with one circulation message RM. is there.

  Then, the control unit 21 stores the circulation message RM itself and the value of the transmission count parameter in a circulation message list (not shown) in the storage unit 22 that lists the circulation messages RM to be transferred (step S6). Thereafter, the control unit 21 starts measuring time in the initialized timer (step S7), and returns to step S1 to repeat the above-described processing.

  On the other hand, if it is determined in step S2 that there is no request operation for transmitting the circulation message RM (step S2; NO), the control unit 21 then transmits the network system S and the communication unit 29a from another node 1. Then, it is confirmed whether any message including the circulation message RM has been transferred (step S8). When any one of the messages has been transferred (step S8; YES), the control unit 21 executes the reception process (step S9), and then returns to step S1 to repeat the above-described process. The message reception process according to step S9 will be described in detail later.

  On the other hand, if there is no transfer of any of the messages in the determination in step S8 (step S8; NO), the control unit 21 then uses a timer that counts time in step S7 as the transmission source of the circulation message RM. The process of confirming the timed content is executed (step S10). The timer confirmation process according to step S10 will also be described in detail later.

  After that, the control unit 21 performs other processing necessary at that time (step S11), and then returns to step S1 to repeat the above-described processing. At this time, specifically, as other processing related to step S11, for example, content reproduction processing unrelated to the transfer of the circulation message RM, content packet transfer processing, and the like are executed mainly by the control unit 21. .

  Next, the circular motion determination process according to step S4 will be specifically described with reference to FIG.

  As shown in FIG. 6A, in the circulatory motion determination process (step S4), first, the control unit 21 has a content that the data amount gradually increases as the circulatory message RM hits the circulatory (above (IV)). It is confirmed whether or not the operation of (refer to the section) has been executed in the input unit 29b (step S40).

  Then, when the operation for increasing the number is executed in the input unit 29b (step S40; YES), the control unit 21 next indicates that the circulation message RM requires accuracy of the circulation result (the above (IV It is confirmed whether or not the operation of (see ()) has been executed in the input unit 29b (step S42).

  Thereby, when an operation to the effect of requesting the accuracy is executed (step S42; YES), the control unit 21 performs the circulatory operation according to the third embodiment as the circulatory operation of the circulatory message RM (see FIG. 3). Hereinafter, it is simply referred to as “third rotation operation”), and a rotation operation flag (not shown) indicating that is set in the control unit 21 (step S43). Thereafter, the control unit 21 proceeds to the process of step S5 shown in FIG.

  On the other hand, in the determination in step S42, when the operation that the accuracy of the circulation result is required is not performed in the input unit 29b (step S42; NO), the control unit 21 performs the circulation operation of the circulation message RM. The circular operation according to the second embodiment (see FIG. 2; hereinafter, simply referred to as “second circular operation”) is selected, and the circular operation flag indicating that is set in the control unit 21 (step S44). Thereafter, the control unit 21 proceeds to the process of step S5 shown in FIG.

  On the other hand, when the operation to increase the data amount of the circulation message RM is not performed in the input unit 29b in the determination of the step S40 (step S40; NO), the control unit 21 next performs the circulation of the circulation message RM quickly. It is confirmed whether or not the operation indicating that the result acquisition is requested (see the above section (IV)) has been executed in the input unit 29b (step S41).

  Thereby, when the operation to the effect that the speed of obtaining the circulation result is required is executed (step S41; YES), the control unit 21 proceeds to step S42 and executes the subsequent processing. The process proceeds to step S5 shown in FIG. On the other hand, when it is determined in step S41 that an operation to request the quickness of the circulation result acquisition is not executed (step S41; NO), the control unit 21 sets the first embodiment as the circulation operation of the circulation message RM. Such a circular operation (see FIG. 1; hereinafter, simply referred to as “first circular operation”) is selected, and the circular operation flag indicating that is set in the control unit 21 (step S45). Thereafter, the control unit 21 proceeds to the process of step S5 shown in FIG.

  Next, the circulation message transmission processing according to step S5 will be specifically described with reference to FIG.

  As shown in FIG. 6B, in the circulatory message transmission process (step S5), first, the controller 21 determines that the circulatory action determined in the process of step S5 for the circulatory message RM is the first circulatory action. Whether or not there is is checked with reference to the above-mentioned orbiting operation flag (step S50). Thereby, when it is confirmed that the circulation message RM is circulated by the first circulation operation (step S50; YES), the control unit 21 is provided with the control unit 21 in the ID space corresponding to the network system S. The circulation message RM is transmitted to the other node 1 indicated by the node ID having a value adjacent to the node ID indicating the existing node 1 (transmission source), and the circulation is started (step S51). Thereafter, the control unit 21 proceeds to the process of step S6 shown in FIG.

  On the other hand, when it is not confirmed in the determination of step S50 that the circulation message RM is circulated by the first circulation operation (step S50; NO), the control unit 21 next performs the process of step S5 on the circulation message RM. It is confirmed with reference to the above-mentioned orbiting operation flag whether or not the determined orbiting operation is the second orbiting operation (step S52). Thereby, when it is confirmed that the circulation message RM is circulated by the second circulation operation (step S52; YES), the control unit 21 determines the end of the circulation range of the circulation message RM based on the operation in the input unit 29b. Is determined and described in the circulation message RM (step S53). And the control part 21 transfers to the process of the said step S51, and performs the process after the said step S51.

  Next, in the determination of step S52, when it is not confirmed that the circulation message RM is circulated by the second circulation operation (step S52; NO), the control unit 21 determines that the plurality of circulation messages RM are generated by the third circulation operation. Recognize that the lap is specified. Thereafter, the control unit 21 sets each node 1 (indicated as “representative node” in FIG. 6B) corresponding to the beginning of each circulation range (see FIG. 3) corresponding to each of the plurality of circulation messages RM to be rotated. Each node ID shown is determined (step S54). Next, the control unit 21 further determines each node ID indicating the node 1 corresponding to the end of each of the circulation ranges, describes each of the corresponding circulation messages RM, and determines each node ID determined in the process of step S54 above. A corresponding round message RM is transmitted to each representative node (step S55). And the control part 21 transfers to the process of step S6 shown in FIG.

  Next, the message reception process according to step S9 will be specifically described with reference to FIG.

  As shown in FIG. 7, in the message reception process (step S9), the control unit 21 first confirms whether or not the received message is a round message RM transmitted from another node 1 (step S9). S90). The processing in step S50 is executed by processing such as the control unit 21 confirming the contents of the header portion of the message, for example. Thereby, when it is confirmed that the received message is not the circulation message RM (step S90; NO), the control unit 21 executes processing in accordance with the content of the received message (step S99-3). And the control part 21 transfers to the process of step S1 shown in FIG.

  On the other hand, when it is determined in step S90 that the received message is the circulation message RM (step S90; YES), the control unit 21 next causes the node 1 provided with the control unit 21 to receive the received circulation. It is confirmed whether or not the message RM is the transmission source (step S91). This confirmation process is performed by the control unit 21 comparing the transmission source node ID described in the received round message RM with the node ID indicating itself stored in the storage unit 22.

  And when it is confirmed that it is not the transmission source of the circulation message RM received in the determination in step S91 (step S91; NO), the control unit 21 next determines that the node 1 provided with the control unit 21 It is confirmed whether or not it is within the circulation range on the ID space specified in the received circulation message RM (step S92). In this confirmation process, the control unit 21 determines the node ID indicating the node 1 corresponding to the end of the circulation range described in the received circulation message RM and the node ID indicating itself stored in the storage unit 22. This is done by comparing. When the node ID indicating the node 1 corresponding to the end of the circulation range is greater than or equal to the node ID indicating itself, the control unit 21 determines that the node 1 provided with the node ID is within the rotation range. recognize.

  When the node ID indicating the node 1 corresponding to the end of the circulation range is not described in the circulation message RM (that is, when the circulation operation related to the circulation message RM is the first circulation operation), the control unit 21. Does not make a determination in step S92, and directly proceeds to the process in step S93.

  When the determination in step S92 is within the circulation range on the ID space specified in the received circulation message RM (step S92; YES), the control unit 21 then performs the operation based on the content of the circulation message RM. Processing corresponding to the content is executed (step S93).

  The processing in step S93 will be specifically described with reference to the specific example described in the above item (IV).

  First, when the circulation message RM has been circulated for the purpose of grasping the number of all the nodes 1 participating in the network system S, the control unit 21 has, for example, a node number counter described in the circulation message RM. Is incremented by “1” as step S93.

  Next, when the circulation message RM is circulated for the purpose of grasping, for example, the number of content files stored in each of the nodes 1 participating in the network system S, the control unit 21 includes itself. A process of describing information indicating the number of content files stored in the node 1 in the circulating message RM is executed as a process of step S93.

  In addition, when the circulation message RM is circulated for the purpose of grasping, for example, the type of content file stored in each node 1 participating in the network system S, the control unit 21 includes itself. A process of describing information indicating the type of the content file stored in the node 1 in the circulation message RM is executed as a process of step S93.

  Further, when the circulation message RM is circulated for the purpose of grasping the total amount of hard disks used in each of the nodes 1 participating in the network system S, the control unit 21 describes in the circulation message RM. For example, a process of incrementing the disk amount counter, for example, by the total storage amount of the hard disk constituting the storage unit 22 is executed as the process of step S93.

  Furthermore, when the circulation message RM has been circulated for the purpose of grasping the usage rate of the network system S as a whole at a certain timing and the number of times content is viewed in units of users of each node 1, the control unit 21 A process of describing information indicating the usage rate and the number of viewing times in the node 1 in which the node 1 is included in the circulation message RM is executed as the process of step S93.

  Finally, when the circulation message RM has been circulated for the purpose of grasping the number of times of viewing in the specific content of each node 1, the control unit 21 obtains information indicating the number of times of viewing in the node 1 in which the node 1 is included. The process described in the circulation message RM is executed as the process of step S93.

  The control unit 21 that has completed the process of step S93 next sends a circulation message to another node 1 indicated by the node ID having a value adjacent to the node ID indicating the node 1 provided with the control unit 21. RM is transmitted (step S94). Thereafter, the control unit 21 proceeds to the process of step S1 shown in FIG.

  On the other hand, in the determination of step S92, when the circulatory action related to the circulatory message RM is other than the first circulatory action, and the node 1 provided with the control unit 21 is not within the designated circulatory range ( (Step S92; NO), the control unit 21 transmits the received circulation message RM toward the transmission source (Step S95). The reason for executing this processing is that the absence of a node ID indicating itself within the circulation range indicates that the node 1 is the node 1 to which the circulation message RM is first transferred outside the rotation range. Because. In this case, the circulation of the circulation message RM is completed, and it is necessary to transmit (return) the circulation message RM to the transmission source (see, for example, the node 1L in FIG. 2). For this reason, the control unit 21 transmits the circulation message RM toward the transmission source node ID included in the received circulation message RM. Thereafter, the control unit 21 proceeds to the process of step S1 shown in FIG.

  On the other hand, when it is confirmed in step S91 that it is the transmission source of the received circulation message RM (step S91; YES), the control unit 21 next transmits the transmission source from within the received circulation message RM. As a result, necessary round results are obtained (step S96). Thereafter, the control unit 21 circulates itself (see step S5 in FIG. 5) and deletes the circulation message RM itself that has completed the circulation from the circulation message list in the storage unit 22 (step S97).

  Next, it is necessary for the control unit 21 to present the obtained lap results to the user via the display unit 27 or the like, and to report the lap results again to the users of other nodes 1 in the network system S. The user is judged whether or not (step S98). And when the said report is not required (step S98; NO), the control part 21 transfers to the process of step S1 shown in FIG. 5 as it is.

  On the other hand, when it is confirmed that the operation indicating that the report is necessary has been executed in the input unit 29b (step S98; YES), the control unit 21 then sends an answer message AM based on the operation. (Step S99, see FIG. 1 or FIG. 2). Then, the control unit 21 performs the same orbiting operation determination process as that in step S4 on the generated reply message AM (step S99-1). After that, the control unit 21 further circulates the reply message AM in the network system S by the same processing as step S5 based on the determined circulatory operation (step S99-2). Thereafter, the control unit 21 proceeds to the process of step S1 shown in FIG.

  Finally, the timer confirmation process according to step S10 will be specifically described with reference to FIG.

  As shown in FIG. 8, in the timer confirmation process (step S10), first, the control unit 21 determines whether or not the circulation message RM is registered in the circulation message list in the storage unit 22 (that is, all the circulation messages). It is confirmed whether or not the necessary orbiting operation for RM has been completed (step S100). When the circulation message RM is not registered in the circulation message list (step S100; YES), the control unit 21 proceeds directly to step S11 shown in FIG.

On the other hand, when it is determined in step S100 that the circulation message RM for which the circulation operation has not yet been completed remains in the circulation message list (step S100; NO), the control unit 21 next displays the remaining circulation message RM. , A parameter i indicating the number of circulatory messages RM, and a parameter R _i indicating the number of retransmissions for the i-th circulatory message RM, respectively, are initialized (step S101).

  Thereafter, the control unit 21 checks whether or not the current parameter i value is smaller than the current parameter N value (step S102). When the value of the current parameter i is not smaller than the value of the current parameter N (step S102; NO), the control unit 21 assumes that the timer confirmation processing for all remaining circulation messages RM has been completed, and continues as it is. Control proceeds to step S11 shown in FIG. On the other hand, when the value of the current parameter i is smaller than the value of the current parameter N in the determination in step S102 (step S102; YES), the control unit 21 next discloses time measurement in step S7. It is checked whether or not the value of the first timer has passed the waiting time set in advance for the corresponding round message RM (step S103). The process of step S103 is a process in which the control unit 21 confirms whether or not the retransfer timing for the corresponding round message RM has arrived. Then, in the process of step S103, when it is confirmed that the waiting time has not elapsed for the corresponding circulation message RM (step S103; NO), the control unit 21 returns to the process of step S102 as it is and described above. Repeat the process.

On the other hand, when it is confirmed in step S103 that the waiting time has elapsed for the circulation message RM (step S103; YES), the control unit 21 then responds to the current i-th circulation message RM. It is confirmed whether or not the parameter R _i exceeds the designated number of re-transmissions preset for the circulation message RM (step S104). As a result, when the parameter R _i exceeds the specified number of retransmissions (step S104; YES), the controller 21 determines that there is no need to perform further retransmissions, and the circulation is not completed (circulation error). For example, the display unit 27 executes a display indicating that it has become (step S108). Thereafter, the control unit 21 deletes the current i-th circulation message RM in which a circulation error has occurred from the circulation message list in the storage unit 22 and updates the circulation message list, and further leaves the parameter N in the current circulation message list. The number of circulation messages RM being updated is updated (step S109). Thereafter, the control unit 21 returns to the process of step S102 and repeats the process described above.

On the other hand, if it is determined in step S104 that the parameter R _i is equal to or less than the designated number of re-transfers (step S104; NO), the control unit 21 starts the circulation of the circulation message RM again by the same circulation operation as the previous circulation operation. (Step S105). Control unit 21 in addition to this, the value of the corresponding parameter R _i is incremented by "1" (step S105).

  Thereafter, the control unit 21 executes a corresponding timer initialization process (step S106) and a process of incrementing the current parameter i by “1” (step S107), and then returns to the process of step S102 and described above. Repeat the process.

  As described above, according to the operation of the network system S according to each of the embodiments and examples, when the node ID stored therein is within the circulation range of the transferred circulation message RM, it corresponds. Since the processed round message RM is transferred to the other node 1 storing the adjacent node ID, the transfer of the round message RM is sequentially repeated at each node 1, which is necessary for information transmission in the network system S. While reducing the load, the circulation message RM can be transmitted quickly and reliably to the nodes 1 within the range.

  In addition, when there is no node ID stored in the circulation range included in the circulation message RM, the corresponding processed circulation message RM is transmitted to the transmission source, so the range to be circulated Can be reliably sent back to the transmission source.

  Furthermore, in the circulation operation according to the second embodiment and the third embodiment, the node 1 as the transmission source designates the circulation range of the circulation message RM, and stores the node ID indicating the head of the circulation range. Since the circulation is started by transmitting to the node 1, the circulation of the circulation message RM is repeated within the circulation range, thereby reducing the load necessary for information transmission in the network system S and the circulation message RM. Can be quickly and reliably transmitted to the node 1 within the circulation range.

  Furthermore, the attribute of the circulation message RM that is the basis for determining the circulation range is the data amount of the circulation message RM itself, whether or not the circulation message RM should be quickly terminated, or whether the circulation message RM is Since it is either whether or not an answer from the node 1 that is the circulation destination is required, it is possible to efficiently determine the circulation range according to various attributes in the circulation message RM and transfer them.

  Further, in the circulation operation according to the first embodiment or the second embodiment, the circulation starts from the node 1 storing the node ID next to the node 1 of the transmission source, and the node 1 included in the network system S Since only a part of the message is transferred, it is possible to more quickly execute the circulation message RM having a content that can be transferred only within the part.

  Further, in the circular operation according to the third embodiment, the transfer of the circular message RM is started from the first node 1 of each circular range, and only the corresponding circular range is transferred. Therefore, the transfer only within the circular range is performed. Therefore, it is possible to more quickly execute the circulation message RM having the content sufficient for the above and the circulation message RM that requires quickness in the transfer.

  Furthermore, when the circulation message RM is not transmitted by the time when the preset waiting time elapses in the transmission source node 1, since the transfer of the circulation message RM from the transmission source is performed again, a failure occurs during the circulation. Even if there is a problem, the circulation of the circulation message RM can be reliably performed.

  In addition, when the circulation message RM is not sent back by the time when the waiting time has elapsed in the transmission source node 1, the retransmission is repeated a predetermined number of times. In the case where the circulation message RM having a good content is circulated, the circulation of the circulation message RM can be performed more reliably even if there is a failure or the like during the circulation.

  In addition to the re-forwarding method described in the above-described embodiment or example, when the circulation message RM is not transmitted in the transmission source node 1, information indicating a new circulation range in which the circulation range is changed is generated. Then, it may be transferred by adding to the circulation message RM. Even in this case, when there is a failure or the like during the circulation, the circulation of the circulation message RM can be performed more reliably.

  Further, programs corresponding to the flowcharts shown in FIGS. 5 to 8 are recorded in an information recording medium such as a flexible disk or a hard disk, or acquired and recorded via the Internet or the like, and these are stored in a general-purpose computer. It is also possible to utilize the computer as the control unit 21 in the node 1 according to the embodiment by reading out and executing in step.

  As described above, the present invention can be used in the field of grid-type content distribution using various P2P networks. In particular, information of a specific purpose different from normal content is obtained from the network S. If applied to the case, a particularly remarkable effect can be obtained.

It is a figure which illustrates the circumference operation which concerns on 1st Embodiment. It is a figure which illustrates the circumference operation which concerns on 2nd Embodiment. It is a figure which illustrates the circumference operation which concerns on 3rd Embodiment. It is a block diagram which shows the schematic structure of the node which concerns on an Example. It is a flowchart which shows the whole operation | movement in the node which concerns on an Example. 4 is a flowchart showing details of an operation in a node according to the embodiment, (a) is a flowchart showing a circulation operation determination process according to the embodiment, and (b) is a flowchart showing a circulation circuit message RM transmission process according to the embodiment. It is. It is a flowchart which shows the circulation message RM reception process based on an Example. It is a flowchart which shows the timer confirmation process which concerns on an Example.

Explanation of symbols

1A, 1B, 1C, 1D, 1E, 1F, 1G, 1H, 1I, 1J, 1K, 1L, 1M, 1N, 1P, 1Q, 1Q, 1R, 1S node 21 Control unit 22 Storage unit 23 Buffer memory 24 Decoding Accelerator 25 Decoder unit 26 Video processing unit 27 Display unit 28 Audio processing unit 29 Speaker 29a Communication unit 29b Input unit 29c IC card slot 29d Bus 29e IC card S Network system RM1, RM2, RM3-1, RM3-2, RM3- 3, RM3-4 lap message AM1, AM2 reply message

Claims (12)

In the information processing apparatus constituting a network system in which a plurality of information processing apparatuses are connected to each other via a network,
Storage means for storing identification information that is unique to each information processing apparatus and is expressed using a continuous number;
Receiving means for receiving the transferred message when a message to be transferred between the information processing devices according to the continuity of the identification information is transferred via the network;
Execution means for executing corresponding processing corresponding to the content of the received message;
Extraction that extracts range information from the received message when range information indicating the range of the identification information corresponding to the range of the information processing device to which the message is to be sequentially transferred is added to the received message Means,
A comparing means for comparing the range indicated by the extracted range information with the stored identification information;
When the stored identification information is within the range, the message after the execution of the corresponding process is stored with the identification information having a value adjacent to the value of the stored identification information in the continuity. Transfer means for transferring to the other information processing apparatus,
An information processing apparatus comprising: The information processing apparatus according to claim 1,
The transfer means, when the stored identification information is not within the range, transfers the message after execution of the corresponding process to the information processing apparatus that is a transmission source of the message. Information processing device. An information processing apparatus that is included in the network system configured to include the information processing apparatus according to claim 1 and that is a transmission source of the message,
Storage means for storing the identification information for identifying the information processing apparatus itself;
Generation / addition means for generating the range information indicating the range to which the message is to be transferred based on the attribute of the message to be circulated and adding the range information to the message;
Transfer means for transferring the message to which the range information is added toward the other information processing apparatus storing the identification information corresponding to the head of the range in the continuity;
An information processing apparatus comprising: The information processing apparatus according to claim 3.
The attribute is the amount of information of the message itself, whether the message is to be quickly terminated, or the message requires a reply from the information processing apparatus that is the transfer destination. An information processing apparatus characterized by being either or not. The information processing apparatus according to claim 3 or 4,
The generation / addition means starts transferring the message from another information processing apparatus storing the identification information having a value adjacent to the stored identification information value in the continuity, and Generating the range information so as to transfer only a part of the information processing device included in the network system;
The transfer means transfers the message to which the generated range information is added to another information processing apparatus that stores the identification information having the adjacent value. apparatus. The information processing apparatus according to claim 3 or 4,
Each of the information processing devices storing the identification information at the head of each of the identification information groups obtained by dividing the identification information for identifying each of the information processing devices into a plurality of the continuity. The message is started to be transferred from a certain first information processing apparatus, and the information processing apparatus group corresponding to the identification information group including the identification information stored in the first information processing apparatus is transferred only in the information processing apparatus. Generate range information,
The information processing apparatus characterized in that the transfer means transfers the number of messages corresponding to the number of the identification information groups to which the generated range information is added toward the corresponding head information processing apparatus. The information processing apparatus according to any one of claims 3 to 6,
Further comprising a timing means for starting timing when the message is transferred;
The transfer means starts the transfer of the message again when a reply message corresponding to the transferred message is not transmitted by the timing when the preset waiting time is measured by the time measuring means. A characteristic information processing apparatus. The information processing apparatus according to claim 7,
The transfer means repeats starting the transfer of the message again by a preset number of retransmissions when the reply message is not sent back by the timing when the waiting time is measured by the timing means. A characteristic information processing apparatus. The information processing apparatus according to claim 7 or 8,
The generation / addition means generates the new range information in which the content of the range information is changed and adds it to the message when the reply message is not transmitted even if the message is retransmitted the number of times of retransmission. An information processing apparatus characterized by: In an information processing method executed in the information processing apparatus constituting a network system in which a plurality of information processing apparatuses are connected to each other via a network,
The information processing apparatus includes storage means for storing identification information that is unique to each information processing apparatus and is expressed using a continuous number,
A receiving step of receiving the transferred message when a message to be transferred between the information processing devices according to the continuity of the identification information is transferred via the network;
An execution step of executing a corresponding process corresponding to the content of the received message;
Extraction that extracts range information from the received message when range information indicating the range of the identification information corresponding to the range of the information processing device to which the message is to be sequentially transferred is added to the received message Process,
A comparison step of comparing the range indicated by the extracted range information with the stored identification information;
When the stored identification information is within the range, the message after the execution of the corresponding process is stored with the identification information having a value adjacent to the value of the stored identification information in the continuity. A transfer step of transferring to the other information processing apparatus,
An information processing method comprising: An information processing method included in the network system configured to include the information processing apparatus according to claim 1 or 2 and executed in an information processing apparatus that is a transmission source of the message,
The information processing apparatus includes a storage unit that stores the identification information for identifying the information processing apparatus itself,
A generation and addition step of generating the range information indicating the range to which the message is to be transferred based on the attribute of the message to be circulated and adding the range information to the message;
A transfer step of transferring the message to which the range information is added toward the other information processing apparatus storing the identification information corresponding to the head of the range in the continuity;
An information processing method comprising:   An information processing program for causing a computer to function as the information processing apparatus according to any one of claims 1 to 9.

Images