WO2006038433A1 - ノード装置、共用情報更新方法、共用情報保存方法、プログラム - Google Patents
ノード装置、共用情報更新方法、共用情報保存方法、プログラム Download PDFInfo
- Publication number
- WO2006038433A1 WO2006038433A1 PCT/JP2005/016740 JP2005016740W WO2006038433A1 WO 2006038433 A1 WO2006038433 A1 WO 2006038433A1 JP 2005016740 W JP2005016740 W JP 2005016740W WO 2006038433 A1 WO2006038433 A1 WO 2006038433A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- information
- node device
- shared information
- update
- shared
- Prior art date
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/104—Peer-to-peer [P2P] networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/104—Peer-to-peer [P2P] networks
- H04L67/1061—Peer-to-peer [P2P] networks using node-based peer discovery mechanisms
- H04L67/1068—Discovery involving direct consultation or announcement among potential requesting and potential source peers
Definitions
- the present invention relates to a Peer to Peer (P2P) type content distribution system including a plurality of node devices connected to each other via a network.
- P2P Peer to Peer
- the present invention relates to a technical field such as a content distribution system and method in which content data to be distributed to a node device is distributed and stored in a plurality of node devices.
- each node device has information related to content data distributed and stored in a plurality of node devices (eg, content data attribute information (content name, etc.), content data,
- the IP address of the node device storing the IP address) has a list in which the user can download the desired content data based on the information described in the list.
- Such a list is shared information that should be used in common by a plurality of node devices, and is generally managed by a management server that manages all content data stored on the content distribution system. The above list will be distributed to each node device.
- Patent Document 1 discloses an index server that exists at the top as this type of management server and manages all content information in the content distribution management system.
- Patent Document 1 Japanese Patent Laid-Open No. 2002-318720
- the management server manages the list
- the server load increases when the list is updated, and the network load increases.
- the problem that the list that can be distributed and concentrated in one place is restricted is not preferable.
- Another problem is that if the management server goes down (for example, due to a failure), the list cannot be updated.
- the management cost for list management by the management server is increased.
- the present invention has been made in view of the above problems and the like, and it has become possible to efficiently acquire shared information in the latest state at any time without providing a management server as described above. It is an object to provide a node device, a shared information update method, a shared information storage method, a shared information update processing program, and a shared information storage processing program.
- the invention according to claim 1 is the node device in an information distribution system including a plurality of node devices connected to each other via a network, wherein the plurality of node devices Shared information information storage means for storing first shared information to be commonly used in node devices, and identification information for generating unique identification information corresponding to the first shared information based on the first shared information Generating means; node device specifying means for specifying a node device that is a management source of the first shared information based on the generated first identification information; and the first shared information from the specified node device.
- Updates corresponding to Update information acquisition means for acquiring information, and shared information update means for updating the first shared information stored in the shared information storage means to second shared information based on the acquired update information. It is characterized by that.
- each node device identifies the management source of the first shared information based on the unique identification information corresponding to the first shared information, and from the management source Since the update information corresponding to the first shared information is acquired and the first shared information is updated to the second shared information, the shared information held by itself can be updated efficiently without installing a management server. As a result, the shared information that is in the latest state can be efficiently obtained. Therefore, the management cost by the management server can be reduced.
- the invention according to claim 2 is the node device according to claim 1, wherein the shared information updating means is a node that is a management source of the first shared information based on the acquired update information It is determined whether or not the first shared information has been updated in the device, and if it has been updated, the first shared information stored in the shared information report storage means is updated to the second shared information. It is characterized by that.
- each node device in each node device, it is known whether or not the first shared information is updated, and when it is updated, the shared information held by itself is efficiently used. It can be updated well.
- the identification information generating means (2) Based on the shared information, unique second identification information corresponding to the second shared information is generated, and the node device specifying means is configured to generate the second shared information based on the generated second identification information.
- the node device that is the information management source is specified
- the update information acquisition unit acquires update information corresponding to the second shared information from the specified node device
- the shared information update unit is the acquisition unit. Based on the updated information, it is determined whether or not the second shared information is updated in the node device that is the management source of the second shared information. 2nd shared information stored in Characterized in that the new to.
- the update information corresponding to the first shared information is stored in the first shared information.
- Information is managed by the node device that is the information management source, and the update information corresponding to the second shared information is managed by the node device that is the management source of the second shared information. Since the management sources are distributed, it is possible to avoid the network load from being concentrated in one place when each node device updates the shared information.
- each node device is configured to gradually update the shared information held by itself, so that the shared information held by itself can be updated more efficiently. Certain shared information can be acquired efficiently.
- the invention according to claim 4 is the node device according to any one of claims 1 to 3, wherein the update information is updated in a node device that is a management source of the first shared information.
- the second shared information is updated in a node device that is a management source of the first shared information.
- the invention according to claim 5 is the node device according to any one of claims 1 to 3, wherein the update information is updated in a node device that is a management source of the first shared information. This is partial information related to the updated portion of the first shared information.
- the update information is partial information related to the update part of the first shared information, the amount of data can be reduced, and therefore the network load is reduced. You can do it.
- the invention according to claim 6 is the node device in the information distribution system including a plurality of node devices connected to each other via a network, and is commonly used in the plurality of node devices.
- Shared information storage means for storing shared information to be identified, and identification information generating means for generating unique identification information corresponding to the shared information based on the shared information before the update when the shared information is updated
- a node device specifying means for specifying a node device that is a management source of the shared information based on the generated identification information, and corresponding to the shared information before update for the specified node device.
- a shared information storage means for storing update information.
- each node device that is a management source of shared information stores the update information corresponding to the shared information before the update, so that each node can be provided without providing a management server.
- the shared device can efficiently update the shared information held by itself, so that the latest shared information can be efficiently acquired. Therefore, the management server Management costs can be reduced.
- the invention described in claim 7 is the node device according to claim 6, wherein the update information is shared information after update.
- the invention according to claim 8 is the node device according to claim 6, wherein the update information is partial information related to an update portion of the shared information before update.
- the invention according to claim 9 is the node device according to any one of claims 1 to 8, wherein the identification information generating unit applies a hash value by applying the shared information to a predetermined hash function. The identification information is generated.
- the invention according to claim 10 is the node device according to any one of claims 1 to 9, wherein the node device specifying means uses the identification information among the plurality of node devices. Identifying the node device based on the information indicating the node device that is the management source, which is transmitted to any node device and returned from any one of the plurality of node devices.
- the invention according to claim 11 is the node device according to any one of claims 1 to 10, wherein the distribution information to be distributed from one node device to another node device is the node device according to any one of claims 1 to 10.
- the shared information is distributed and stored in a plurality of node devices, and the shared information is list information in which information on the distributed and stored distribution information is described.
- the invention according to claim 12 is a shared information updating method in the node device in an information distribution system including a plurality of node devices connected to each other via a network, and in the plurality of node devices. Based on the first shared information to be used in common, a step of generating unique identification information corresponding to the first shared information, and the first shared information based on the generated first identification information A step of identifying a node device that is an information management source; a step of acquiring update information corresponding to the first shared information from the identified node device; and the shared information based on the acquired update information And a step of updating the first shared information stored in the storage means to the second shared information.
- the invention according to claim 13 is a method for storing shared information in the node device in an information distribution system comprising a plurality of node devices connected to each other via a network. And generating shared identification information corresponding to the shared information based on the shared information before the update when shared information to be commonly used in the plurality of node devices is updated. A step of identifying a node device that is a management source of the shared information based on the generated identification information, and causing the identified node device to store update information corresponding to the shared information before update And a process.
- the computer included in the node device in the information distribution system including a plurality of node devices connected to each other via a network is commonly used in the plurality of node devices.
- Shared information storage means for storing first shared information to be used, identification information generating means for generating unique identification information corresponding to the first shared information based on the first shared information, the generated Based on the first identification information, the node device specifying means for specifying the node device that is the management source of the first shared information, and the update information corresponding to the first shared information from the specified node device.
- the computer included in the node device in the information distribution system including a plurality of node devices connected to each other via a network is commonly used in the plurality of node devices.
- Shared information storage unit for storing shared information to be used, and identification information generation for generating unique identification information corresponding to the shared information based on the shared information before update when the shared information is updated
- a node device specifying means for specifying a node device that is a management source of the shared information based on the generated identification information, and corresponding to the shared information before the update for the specified node device. It is characterized by functioning as a shared information storage means for storing updated information.
- the invention according to claim 16 is characterized in that the shared information update processing program according to claim 14 is recorded so as to be readable by a computer.
- the shared information storage processing program described in claim 15 is copied. It is recorded so that it can be read by a computer.
- the invention according to claim 18 includes a plurality of node devices connected to each other via a network, and the plurality of node devices include shared information to be commonly used in the plurality of node devices.
- Any one of the node devices in an information distribution system including a node device that is a management source of a plurality of different pieces of shared information in each update stage, and any one of the update stages Shared information storage means for storing the shared information in the network, node device specifying means for performing a specifying process for specifying a node device that is a management source of the shared information stored in the shared information report storage means, and the specified Update information acquisition means for performing an acquisition process for acquiring update information corresponding to the shared information stored in the shared information information storage means from the obtained node device, and the acquired update information Group Dzu Te, characterized in that it comprises a shared information updating means stored !, Ru performs update process of updating the shared information in the shared information storage unit.
- the invention according to claim 19 is the node device according to claim 18, wherein the node device specifying means until the shared information stored in the shared information storage means becomes the latest state.
- the specifying process, the acquisition process by the update information acquisition unit, and the update process by the shared information update unit are repeatedly performed.
- the latest shared information can be efficiently obtained at any time without providing a management server.
- each node device identifies a management source of the first shared information based on the unique identification information corresponding to the first shared information, and the first shared information is transmitted from the management source. Since the update information corresponding to is acquired and the first shared information is updated to the second shared information, the shared information held by itself can be updated efficiently without providing a management server. In this way, shared information that is in the latest state can be efficiently acquired.
- FIG. 1 is a diagram showing an example of a connection mode of each node device in the content distribution system according to the present embodiment.
- FIG.2 DHT searches for node device 1 that is the storage source of content data It is a figure which shows an example.
- ⁇ 3 A diagram showing a schematic configuration example of the node device 1.
- FIG. 4 is a flowchart showing a main routine of keyword list saving processing in the control unit 11 of the node device 1.
- FIG. 5 is a flowchart showing a keyword list storage subroutine in the control unit 11 of the node device 1.
- FIG. 6 is a flowchart showing a keyword list storage subroutine in the control unit 11 of the node device 1.
- FIG. 7 is a conceptual diagram showing how content data is saved and a keyword list are saved in the keyword list saving process.
- FIG. 8 is a flowchart showing keyword list update processing in the control unit 11 of the node device 1.
- FIG. 9 is a conceptual diagram showing how keyword lists are updated in the keyword list update process.
- FIG. 1 is a diagram showing an example of a connection state of each node device in the content distribution system according to the present embodiment.
- IX Internet eXchange
- ISP Internet Service
- FTTH Fiber
- a network (real-world network) 8 such as the Internet is constructed by To The Home) line operator (device) 6 and communication line (eg, telephone line, optical cable, etc.) 7.
- communication line eg, telephone line, optical cable, etc.
- the content distribution system S is configured to include a plurality of node devices la, lb, lc---lx, ly, 1 ⁇ ⁇ connected to each other via such a network 8. It has become a peer-to-peer network system. Each node device la, lb, lc---lx, ly, 1 ⁇ ⁇ is assigned with a unique manufacturing number and IP (Internet Protocol) address as information indicating the node device. The serial number and IP address are not duplicated among multiple node devices 1. In the following description, when any one of the node devices la, lb, lc-• ⁇ 1 ⁇ , ly, 1 ⁇ ⁇ is indicated, it may be referred to as the node device 1 for convenience.
- this content distribution system S uses a specific algorithm such as a distributed hash table (hereinafter referred to as DHT (Distribute Hash Table)) described later.
- DHT Distribute Hash Table
- An overlay network 9 as shown in the upper frame 100 of FIG. In other words, this overlay network 9 Network that constitutes a virtual link formed using
- the overlay network 9 is constructed by an algorithm using DHT, and the node device 1 arranged on the overlay network 9 participates in the content distribution system S (in other words, in other words). Node device 1 participating in overlay network 9). Participation in the content distribution system S is performed by sending a participation request to an arbitrary node device 1 that has already participated and has already participated in the sword device power.
- the node ID of each node device 1 participating in the content distribution system S is, for example, a value obtained by hashing an IP address or manufacturing number with a common hash function, and is biased to one ID space. It will be distributed and distributed. In this way, the node ID (hashed) obtained by a common hash function has a very low probability of having the same value if the IP address or serial number is different. Since noh and shush functions are well known, detailed description thereof is omitted.
- a node ID is a value obtained by hashing an IP address (global IP address) with a common hash function.
- the plurality of node devices 1 participating in the content distribution system S include content (for example, movies and music) as distribution information to be distributed from one node device 1 to another node device 1.
- content for example, movies and music
- Etc. Data is distributed and stored (stored).
- the content data of a movie with the title XXX is stored in the node device la
- the content data of the movie with the title YYY is stored in the node device 1b.
- Data is distributed and stored in a plurality of node devices 1 (however, the same content data may be distributed and stored in a plurality of node devices 1).
- Which content data may be stored in which node device 1, for example, a keyword (eg, content name (content title) or content outline information) as an example of information related to content data Keyword such as (Synopsis)) Power Hashed by the same hash function as when obtaining the above node ID (that is, placed in the same ID space as the hash value of the IP address of node device 1) and closest to the hash value
- the content data is stored in the node device 1 having the node ID (for example, the higher-order digits match more).
- the same keyword for example, the name of the content
- the same hash value is assumed.
- the keyword to be converted may be a combination of content name and copyright information (for example, performer name, director name, original author name, singer name, composer name, or songwriter name). .
- the location of the content data distributed and stored in this manner is held by each node device 1 in a small share by the DHT, and the location of the content data, that is, the storage, is stored using these DHTs.
- the original node device 1 can be searched (discovered).
- path information to other node devices that is, node IDs (hash values) of other node devices that are appropriately separated in the node ID space, and multiple IP addresses are registered. .
- FIG. 2 is a diagram showing an example of a state in which the node device 1 that is the content data storage source is searched by the DHT.
- a node device la searches for content data X of a keyword “XXX” described in a keyword list L as list information to be described later, the node device la Then, the keyword “XXX” is subjected to a hash function common to the node ID to be obtained to obtain the hash value (hereinafter, the hash value is assumed to be “123”) ((i) in FIG. 2).
- the hash value of the keyword “XXX” may be described in association with the keyword “XXX”! ,.
- the node device la refers to the DHT (in other words, the route table of the network) 51 held by itself and refers to the numerical value “1” in the highest digit of the keyword hash value “123”.
- DHT the route table of the network
- the node device lb associated with the node device (ii in FIG. 2)
- send inquiry information including the hash value “123” and the IP address of the node device la to the node device lb
- Make an inquiry ((iii) in Figure 2).
- the node device lb receives the inquiry information, refers to the DHT 52 held by itself, and refers to the second digit numerical value “2” of the keyword hash value “123”. ”Is obtained ((iv) in FIG. 2), and inquiry information including the hash value“ 123 ”and the IP address of the node device la is transmitted to the node device If. And make an inquiry ((V) in Figure 2).
- the node device If receives the above inquiry information, refers to the DHT53 held by itself, and refers to the value “3” in the third digit from the highest digit of the keyword hash value “123”.
- the IP address of the node device lj associated with "" is acquired as the IP address of the node device 1 storing the content data X of the keyword "XXX” ((vi) in Fig. 2), and this is obtained as the node device. Reply to la ((vii) in Figure 2).
- the node device la retrieves the location of the content data X of the keyword "XXX", that is, the node device lj that is the storage source by receiving the IP address of the node device lj.
- the content data X is acquired (downloaded) from the node device lj.
- the keyword list L describes keywords of a plurality of content data distributed and stored on the content distribution system S, so that the user of each node device 1 can select what content. It is possible to grasp the power of storing data, in other words, whether it can be viewed.
- the keyword list L can also be said to be shared information that should be used in common in all the node devices 1, and must always be in the latest state.
- each node device 1 that does not provide a server that collectively manages the keyword list L by searching for update information of the keyword list L using the keyword list L before update is the latest It is possible to efficiently acquire the keyword list L that is in any state at any time. Details of this will be described later.
- FIG. 3 is a diagram illustrating a schematic configuration example of the node device 1.
- each node device 1 includes a CPU 11 having a calculation function, a working RAM, a ROM that stores various data and programs, a control unit 11 as a computer, and the content data ,
- a storage unit 12 as a shared information report storage means composed of an HDD or the like for storing (storing) the keyword list L, the DHT, and the program (the content data is stored in the node device 1 that is not stored)
- a buffer memory 13 for temporarily storing received content data, and decoding of encoded video data (video information) and audio data (audio information) included in the content data (data expansion and decoding)
- a video processing unit that performs a predetermined drawing process on the decoded video data and outputs the video signal.
- a display unit 16 such as a CRT or a liquid crystal display for displaying video based on the video signal output from the video processing unit 15, and the decoded audio data as an analog audio signal D (Digital) / A ( (Analog) is converted by an amplifier and output after being converted by an amplifier, a speaker 18 that outputs an audio signal output from the audio processing unit 17 as a sound wave, and video data and audio included in the content data Whether the encoder unit 19 encodes data, etc.
- D Digital
- A Analog
- the communication unit 20 for controlling communication of information between the other node device 1 through the network 8, and the user
- An input unit for example, a keyboard, a mouse, or an operation panel
- Ete configured, the control unit 11, storage unit 12, a buffer memory 13, decoder unit 14, encoder unit 19, and a communication unit 2 0 are connected to one another via a bus 22, Ru.
- the CPU in the control unit 11 executes various programs stored in the storage unit 12 and the like, so that the entire node device 1 is controlled in an integrated manner. Depending on the signal, keyword list storage (registration) processing, keyword list update processing, etc. are performed. These keyword list storage (registration) processes and keyword list update processes will be described later.
- FIG. 4 is a flowchart showing a main routine of the keyword list saving process in the control unit 11 of the node device 1
- FIGS. 5 and 6 are flowcharts showing a subroutine of the keyword list saving process.
- FIG. 7 is a conceptual diagram showing how content data, keyword list, etc. are stored in the keyword list saving process.
- the content data registration node device 1 acquires (for example, reads from a removable information recording medium) by the user. )
- the control unit 11 sets the keyword of the content data X to be newly saved (for example, the content name (content (Title)) is obtained (Step Sl). Note that all the node devices 1 store the keyword list L1 in the storage unit 12 as an initial value.
- control unit 11 may acquire a keyword from the data added to the content data X, or by the operation of the input unit 21 by the user.
- the control unit 11 may acquire the input keyword.
- control unit 11 performs a search process for the node device 1 that should be the storage source of the content data X (step S 2).
- control unit 11 first generates a hash value by subjecting the acquired keyword to a hash function common to that for obtaining the node ID (step S21).
- the control unit 11 refers to the DHT (step S22), determines whether or not it is the node device 1 that should be the storage source of the content data X (step S23), and the self is the storage source. If it is determined that it is not the node device 1 (for example, if the IP address is not associated with the hash value of the keyword in the DHT) (step S23: N), the hash value of the keyword and the self The inquiry information including the IP address is sent to the other node device 1 (step S24). Then, the control unit 11 responds accordingly. When the IP address of the node device lj to be the storage source is received (step S25: Y), the node device lj to be the storage source is specified by the IP address (step S26).
- step S24 when inquiry information is transmitted to another node device 1, the same flow as the search method described with reference to FIG. 2 ((iv) to (vii) in FIG. 2). In the end, the IP address of the node device lj that should be the storage source is returned.
- step S23 when it is determined in step S23 that the node device is to be the storage source (step S23: Y), the node device la is specified as the node device to be the storage source (step S23). S 26).
- the control unit 11 performs a process of storing the content data X in the node device 1 to be stored (step S3). More specifically, if the node device 1 identified in step S26 is not self, the control unit 11 uses the IP address received in step S25 as shown in (i) of FIG. The content data X acquired in the above step SI is transmitted to the node device lj to be the storage source via the communication unit 20 and the network 8 and stored. On the other hand, when the node device 1 identified in step S26 is self, the control unit 11 stores the content data X acquired in step S1 in its own memory that is the node device la to be a storage source. Store and save in part 12.
- control unit 11 performs a search process for the node device 1 that is the management source of the keyword list L1 (step S4).
- the control unit 11 stores the keyword list L1 before update (for example, a character string described in the keyword list) in the above-mentioned No.
- a hash value (an example of unique identification information corresponding to the keyword list L1) is generated by applying a hash function that is common to when the ID is obtained (step S51).
- the control unit 11 specifies the node device 1 that is the management source of the keyword list L1 based on the generated hash value as a node device specifying unit. For example, the control unit 11 refers to the DHT (step S52), determines whether or not it is the node device 1 that is the management source of the keyword list L1 (step S53), and the node that is the management source of itself.
- Device 1 (For example, if the IP address is not associated with the hash value of the keyword list L1 in the DHT) (step S53: N), the hash value of the keyword list L1 and The inquiry information including the IP address is transmitted to the other node device 1 (step S54).
- control unit 11 When the control unit 11 receives the IP address of the node device lx that is the management source of the keyword list L1 returned in response (step S55: Y), the control unit 11 is the management source based on the IP address.
- the node device lx is identified (step S56).
- step S54 as in step S24, if the question and alignment information is transmitted to another node device 1, the same flow as the search method described with reference to FIG. The processing is performed ((iv) in FIG. 2 to (vii) in FIG. 2), and finally the IP address S of the node device lx that is the management source is returned.
- step S53 when it is determined in step S53 that the node device 1 is the node device 1 that is the management source of the keyword list L1 (step S53: Y), the node device la is the node device 1 that is the management source. Is identified (step S56).
- the control unit 11 is the management source of the identified keyword list L1 for the update processing prohibition instruction for prohibiting the update processing from the other node device 1.
- the data is transmitted to the node device 1 via the communication unit 20 and the network 8 (step S5).
- the node device 1 that is the management source that has received the update processing prohibition instruction when the update processing from another node device 1 has already been performed (for example, when the write prohibition flag is set), the node device Information indicating that the node node la cannot receive an update processing prohibition instruction is returned to la, while another node device 1 is already writing, while update processing from the other node device 1 is performed. Is not performed (for example, when the write prohibition flag is not set), the write prohibition flag is set and information indicating that the node device la receives an update processing prohibition instruction is returned to the node device la. .
- control unit 11 of the node device la receives the above information (information indicating that the update processing prohibition command is received or not received! /) That is returned from the node device 1 that is the management source. If it is received, it is determined whether or not the write-protection is possible (step S6), and if write-protection is not possible! N), this The process ends. On the other hand, if write-protection is possible (that is, information indicating that an update processing prohibition instruction is received) is received (step S6: Y), the process proceeds to step S7.
- step S7 the control unit 11 performs an update process for updating the keyword list L1 stored in the storage unit 12 to the keyword list L2. More specifically, the control unit 11 reads the keyword list L1 from the storage unit 12, and, as shown in (ii) of FIG. 7, the keyword “XXX” of the acquired content data X is used as the keyword. A new keyword list L2 is created by additionally describing the list L1, and the keyword list L2 is stored in the storage unit 12.
- control unit 11 causes the node device 1 that is the management source of the identified keyword list L1 to store the update information corresponding to the keyword list L1 before the update, as shared information storage means. Save processing is performed (step S8).
- the control unit 11 performs the process shown in (iii) of FIG. 7 based on the IP address received in step S55.
- the update information corresponding to the keyword list L2 is transmitted to and stored in the node device lx that is the management source via the communication unit 20 and the network 8 in step S1, and the processing ends.
- the control unit 11 sends the update information corresponding to the keyword list L2 to its own storage unit 12 that is the node device la that is the management source. Save to.
- the update information corresponding to the keyword list L2 may be the entire keyword list L2, or the partial information (for example, the keyword list L1 in the keyword list L1).
- the keyword may be an additional description).
- the keyword list L1 may be rewritten (overwritten) with the keyword list L2.
- the keyword list is updated from the old version to the new version.
- the keyword lists Ll, L2, and L3 are managed by each update stage.
- the update information is stored in the node devices lx, ly, and lz.
- the hash values of the keyword lists Ll, L2, and L3 at each update stage are different from each other (because the character strings described in the keyword list are different), so the node devices lx, ly, and lz that are the management sources of these It will be different.
- Which node device 1 is used as the management source of the keyword list at each update stage is arbitrary 1S For example, it is more desirable to determine the relationship between the node ID and the hash value of the keyword list. Specifically, there is a method in which the node device 1 having the node ID of the hash value closest to the hash value of the keyword list (for example, the higher-order digits match more) is used as the management source of the keyword list. Can be mentioned.
- the items to be hashed for the keyword lists Ll, L2, and L3 are not limited to the character strings described in the keyword list.
- the information that can distinguish the keyword lists Ll, L2, and L3 from each other. For example, a list name added to each (preferably if it is a name including the update date and time, etc.)) /.
- the control unit 11 of the node device la sends an update process prohibition cancellation command to the node device lx that is the management source via the communication unit 20 and the network 8. Is transmitted (step S9), and the process is terminated. As a result, the write prohibition flag is lowered in the node apparatus lx that is the management source.
- FIG. 8 is a flowchart showing keyword list update processing in the control unit 11 of the node device 1.
- FIG. 9 is a conceptual diagram showing how the keyword list is updated in the keyword list update process. The process shown in FIG. 8 is performed by the control unit 11 executing the shared information update processing program stored in the storage unit 12 or the like.
- the shared information update processing program may be downloaded from, for example, a predetermined network on the network 8, or may be a recording medium such as a CD-ROM. May be recorded and read via the drive of the recording medium! ⁇ (same for the shared information storage processing program above).
- node device 1 for example, node device lb shown in FIG. 9
- the control unit 11 reads out, for example, the keyword list L 1 stored in the storage unit 12, and performs a search process for the node device 1 that is a management source of the keyword list L1 (step Sl 1).
- the search processing of the node device 1 that is the management source of the keyword list is the same processing as the processing shown in FIG.
- the control unit 11 serves as the update information acquisition unit to identify the identified node.
- An acquisition process for acquiring update information corresponding to the keyword list L1 from the device lx is performed (step S12).
- the control unit 11 is a node device that is a management source of the keyword list L1, as shown in (i) of FIG.
- the update information of the keyword list L1 is inquired of lx, and the update information transmitted from the node device 1X via the network 8 is acquired as shown in (i) of FIG.
- Such update information includes whether or not the keyword list L1 has been updated, and if there is an update, the update history and the part (difference) information related to the updated part of the keyword list L1 before the update (or the keyword after the update) List L2) is included. Note that the amount of data can be reduced when the update information is a part (difference) related to the update part, rather than the entire updated keyword list L 2, so that the network load can be reduced.
- the control unit 11 determines whether or not the keyword list L1 is updated in the node device lx that is the management source of the keyword list L1, based on the acquired update information. (Step S13: Y), and if it is updated (Step S13: Y), the keyword list L1 (an example of first shared information) stored in the storage unit 12 is used as the keyword list L1 (first (2) Update processing to update to (an example of shared information) (step S1 Four).
- the update information includes part information related to the update part of the keyword list L1 before the update (for example, the keyword “XXX” to be additionally described), ( As shown in ii), the keyword “XXX” is additionally described in the keyword list L1 stored in the storage unit 12 to create a new keyword list L2, and the keywords stored in the storage unit 12 are created.
- List L1 is overwritten with keyword list L2.
- the updated information includes the updated keyword list L2, the keyword list L1 stored in the storage unit 12 is overwritten and saved as the keyword list L2.
- the process returns to step S11, and this time, the updated keyword list L2 is read from the storage unit 12, and the node device 1 that is the management source of the keyword list L2 1 For example, the node device ly that is the management source of the keyword list L2 is specified. Then, as shown in (iii) of FIG. 9, update information corresponding to the keyword list L2 is acquired from the identified node device ly, and the keyword list is acquired in the node device ly which is the management source of the keyword list L2. It is determined whether or not L2 has been updated, and if it has been updated, the keyword list L2 (an example of second shared information) stored in the storage unit 12 is used as a keyword as described above. Update processing is performed to update the list L3 (an example of third shared information) (for example, as shown in (iv) of FIG. 9, the keyword “YYY” is additionally described).
- the list L3 an example of third shared information
- step S13 Such update processing is performed until it is determined in step S13 that the keyword list has not been updated. For example, as shown in FIG. If the update information transmitted from the node device lz via the network 8 indicates that the keyword list L3 is not updated, the keyword list is confirmed as the latest state of the keyword list L3 ( Step S 15).
- the control unit 11 causes the display unit 16 to display the keyword list via the video processing unit 15.
- the selected key keyword “ ⁇ ” is selected.
- the search power at the location of the content data ⁇ ⁇ corresponding to “” is performed as described with reference to FIG. 2, and as a result, the IP address of the node device li from which the content data ⁇ is stored As shown in (vi) of Fig. 9, the content data Y is acquired (downloaded) from the node device.
- the acquired content data Y is stored and stored in the buffer memory 13, and the video data included in the content data Y is output and displayed on the display unit 16 via the decoder unit 14 and the video processing unit 15.
- the audio data included in the content data Y is output to the speaker 18 via the decoder unit 14 and the audio processing unit 17.
- the node devices that are the management sources of the keyword lists Ll, L2, and L3 in each update stage are distributed, and the respective node devices 1 have their respective keyword lists. Since the corresponding update information is stored, each node device 1 accesses the management source node device corresponding to the keyword list held by itself and acquires the update information to update the keyword list. Even without providing a management server, it is possible to efficiently update the keyword list that it holds and to avoid concentrating the network load on one place when updating the keyword list. In addition, since it is not necessary to provide a management server, the management cost of the management server can be reduced.
- the keyword list L1, keyword list L2, keyword list L3, etc. are sequentially updated from the oldest to the latest state, so there is no need to provide a management server.
- the keyword list that is up-to-date can be obtained efficiently at any time.
- the process shown in FIG. 7 is configured such that the keyword list L3 in the latest state is acquired from the keyword list L1 via the keyword list L2.
- the node device 1 holding the keyword list L1 may be configured to directly acquire the keyword list L3 in the latest state.
- the node device 1 holding the keyword list L1 acquires the latest list name of the keyword list L3 from any of the node devices 1 participating in the content distribution system S, and hashes this. Sent to the other node device 1 and returned Based on the IP address of the node device 1 that is the management source of the list L3, update information of the keyword list L3 is acquired from the node device 1.
- the update date of the pre-update keyword list L1 is put in the inquiry information of the keyword list.
- This inquiry information is the force that will pass through some other node devices 1 while arriving at the node device 1 that is the management source. If the keyword list L1 is quite old, There is a high possibility that the node device 1 that has passed (passed through) has a keyword list that is newer than the keyword list L1. If the node device 1 that has passed through has a keyword list L3 that is newer than the keyword list L1, the information (hash value, update date, etc.) of the keyword list L1 in the inquiry information is used as a keyword. By rewriting with the list L3 and making a new inquiry, the node device 1 that is the final management source can be reached earlier.
- the node device that is the management source of the keyword list L3 The update information that 1 has must be the keyword list L4 itself or partial information (for example, the part added to the keyword list L4 from the keyword list L1 (difference information (L4-L1))).
- FIG. 2 shows an example of a search method using DHT in each node device 1.
- FIG. 6 in the above embodiment is shown.
- it is determined in step S53 whether or not it is closest to the hash value of its own node ID keyword list (for example, the higher digits match more).
- step S54 If it is close, it becomes the node device 1 that is the management source itself, otherwise, it is the closest to the hash value of the key list in the node ID registered in the DHT (for example, the higher digit is more).
- the hash value of the keyword list and its own IP address are transmitted to the node device 1 having the node ID (which matches a lot) (step S54). Then, the same processing (steps S51 to S54) is performed in the node device 1 that has received this, and the hash of the keyword list is searched until the node device 1 having the closest node ID to the hash value of the keyword list is searched.
- the value and its own IP address are sent (transferred) to the other node device 1, and finally the above key
- the IP address is transmitted from the node device 1 having the closest node ID to the hash value of the one word list, that is, the node device 1 that is the management source. Such a process can be similarly applied even when the node device 1 that is the storage source of the content data shown in FIG. 2 is searched.
- the keyword or keyword list is hashed, and the content data is based on the strong hash value and DHT.
- the ability to identify (discover) the node device that is the storage source or the node device that is the keyword list management source. Instead, for example, the keyword or keyword list (or associated with it) Information) and the content data by an algorithm or function (function find (for example, converted to a numerical value corresponding to the keyword list) IP address of the node device 1 that manages the keyword list)
- the node device that is the storage source of or the keyword list management source Configure the system to identify (discover) the node device to be used.
- control unit 11 is configured to generate a hash value of the key word list by a predetermined hash function. Based on the keyword list that is not limited to this, It may be configured to generate a keyword list ID (which can be distinguished from others) corresponding to the keyword list, and to identify the node device 1 that is the management source of the keyword list based on the generated keyword list ID.
- the keyword list has been described as an example of shared information that should be used in common in a plurality of node devices 1.
- the present invention is not limited to this, for example, a plurality of node devices. It may be applied to shared data that a plurality of users need to have in common, such as a source program to be commonly used in 1.
- Can search (specify) the node device 1 that is the management source of the shared data after the update from the shared data before the update.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Information Transfer Between Computers (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Computer And Data Communications (AREA)
Abstract
Description
Claims
Priority Applications (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
EP20050782392 EP1811402B1 (en) | 2004-09-30 | 2005-09-12 | Node device, common information update method, common information storage method, and program |
CN2005800330674A CN101031918B (zh) | 2004-09-30 | 2005-09-12 | 节点设备、共享信息更新方法、共享信息存储方法以及程序 |
US11/727,832 US20070195796A1 (en) | 2004-09-30 | 2007-03-28 | Node apparatus, shared information updating method, shared information storing method, and program |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP2004-285895 | 2004-09-30 | ||
JP2004285895A JP4561283B2 (ja) | 2004-09-30 | 2004-09-30 | ノード装置、共用情報更新方法、共用情報保存方法、共用情報更新処理プログラム、及び共用情報保存処理プログラム |
Related Child Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US11/727,832 Continuation-In-Part US20070195796A1 (en) | 2004-09-30 | 2007-03-28 | Node apparatus, shared information updating method, shared information storing method, and program |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2006038433A1 true WO2006038433A1 (ja) | 2006-04-13 |
Family
ID=36142514
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/JP2005/016740 WO2006038433A1 (ja) | 2004-09-30 | 2005-09-12 | ノード装置、共用情報更新方法、共用情報保存方法、プログラム |
Country Status (5)
Country | Link |
---|---|
US (1) | US20070195796A1 (ja) |
EP (1) | EP1811402B1 (ja) |
JP (1) | JP4561283B2 (ja) |
CN (1) | CN101031918B (ja) |
WO (1) | WO2006038433A1 (ja) |
Cited By (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7894471B2 (en) | 2006-09-29 | 2011-02-22 | Brother Kogyo Kabushiki Kaisha | Content distribution system, content distribution method, terminal apparatus in content distribution system, and recording medium on which program is recorded |
JP2016153486A (ja) * | 2010-11-29 | 2016-08-25 | メルク パテント ゲゼルシャフト ミット ベシュレンクテル ハフツングMerck Patent Gesellschaft mit beschraenkter Haftung | 液晶混合物 |
TWI708830B (zh) * | 2015-07-02 | 2020-11-01 | 日商迪愛生股份有限公司 | 液晶組成物及使用其之液晶顯示元件 |
Families Citing this family (18)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP4017161B2 (ja) * | 2004-01-22 | 2007-12-05 | 日本アイ・ビー・エム株式会社 | 区間特定システム、配電系統モニタリングシステム、その方法及びプログラム |
US8770482B2 (en) * | 2006-04-26 | 2014-07-08 | Roche Diagnostics Operations, Inc. | Apparatus and method to administer and manage an intelligent base unit for a handheld medical device |
JP2007334638A (ja) * | 2006-06-15 | 2007-12-27 | Kddi Corp | データ管理装置 |
JP4845759B2 (ja) * | 2007-02-07 | 2011-12-28 | キヤノン株式会社 | 識別子管理装置及びその制御方法 |
US20080276091A1 (en) * | 2007-05-04 | 2008-11-06 | Annikki Welin | Mobile Device File Sharing Method and Apparatus |
US8250171B2 (en) * | 2007-06-22 | 2012-08-21 | Pioneer Corporation | Content delivery apparatus, content delivery method, and content delivery program |
US7979419B2 (en) * | 2007-11-01 | 2011-07-12 | Sharp Laboratories Of America, Inc. | Distributed search methods for time-shifted and live peer-to-peer video streaming |
KR101559580B1 (ko) * | 2008-03-06 | 2015-10-12 | 삼성전자주식회사 | 공간 다중화 시스템에서 단일 입력 다중 출력 모드 또는 협력적 공간 다중화 모드의 버스트를 프레임에 추가하는 방법 |
US8738801B2 (en) * | 2009-07-14 | 2014-05-27 | Qualcomm Incorporated | Methods and apparatus for updating index information while adding and updating documents in a distributed network |
KR101232601B1 (ko) * | 2009-12-18 | 2013-02-12 | 한국전자통신연구원 | 통합 노드 시스템의 통신 노드 및 그 통신 방법 |
CN103098443B (zh) * | 2010-09-13 | 2016-07-06 | 株式会社东芝 | 分布式元数据高速缓存 |
CN102360299B (zh) * | 2011-09-30 | 2015-08-26 | 奇智软件(北京)有限公司 | 软件***重装方法、服务器以及客户端 |
JP5863615B2 (ja) * | 2012-09-28 | 2016-02-16 | ジーイー・メディカル・システムズ・グローバル・テクノロジー・カンパニー・エルエルシー | 画像表示システム及び画像表示装置 |
CN103578073A (zh) * | 2013-11-25 | 2014-02-12 | 方正国际软件有限公司 | 信息引用装置和信息引用方法 |
CN104391654B (zh) * | 2014-11-06 | 2018-02-06 | 浪潮(北京)电子信息产业有限公司 | 一种共享磁盘管理方法及*** |
CN104579765B (zh) * | 2014-12-27 | 2019-02-26 | 北京奇虎科技有限公司 | 一种集群***的容灾方法和装置 |
CN104778222B (zh) * | 2015-03-23 | 2017-12-05 | 四川长虹电器股份有限公司 | 基于usb存储设备的媒体库建立及更新方法 |
CN108352036B (zh) * | 2015-10-28 | 2022-04-19 | 株式会社富士 | 单元固有信息管理*** |
Family Cites Families (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7054867B2 (en) * | 2001-09-18 | 2006-05-30 | Skyris Networks, Inc. | Systems, methods and programming for routing and indexing globally addressable objects and associated business models |
US7263560B2 (en) * | 2002-08-30 | 2007-08-28 | Sun Microsystems, Inc. | Decentralized peer-to-peer advertisement |
US7769881B2 (en) * | 2003-01-24 | 2010-08-03 | Hitachi, Ltd. | Method and apparatus for peer-to peer access |
JP2004258994A (ja) * | 2003-02-26 | 2004-09-16 | Nippon Telegr & Teleph Corp <Ntt> | P2pネットワークにおける動的なファイル検索方法、端末、プログラム、および記録媒体 |
-
2004
- 2004-09-30 JP JP2004285895A patent/JP4561283B2/ja not_active Expired - Fee Related
-
2005
- 2005-09-12 EP EP20050782392 patent/EP1811402B1/en not_active Not-in-force
- 2005-09-12 WO PCT/JP2005/016740 patent/WO2006038433A1/ja active Application Filing
- 2005-09-12 CN CN2005800330674A patent/CN101031918B/zh not_active Expired - Fee Related
-
2007
- 2007-03-28 US US11/727,832 patent/US20070195796A1/en not_active Abandoned
Non-Patent Citations (3)
Title |
---|
NAKAUCHI K. ET AL: "Ubiquitous Kankyo ni Muketa Bunsan Contents Hakken.", THE INSTITUTE OF ELECTRONICS, INFORMATION AND COMMUNICATION ENGINEERS GIJUTSU KENKYU HOKOKU., vol. 102, no. 352, 23 September 2002 (2002-09-23), pages 7 - 12, XP002998442 * |
NISHIMURA K.: "Nihon Hatsu, Chumoku no P2P Base no Group Ware 'ArielAirOne' wa Broadband Jidan no Killer Application to Naruka?.", ASCII., vol. 26, no. 9, 1 September 2002 (2002-09-01), pages 226 - 229, XP002998443 * |
See also references of EP1811402A4 * |
Cited By (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7894471B2 (en) | 2006-09-29 | 2011-02-22 | Brother Kogyo Kabushiki Kaisha | Content distribution system, content distribution method, terminal apparatus in content distribution system, and recording medium on which program is recorded |
JP2016153486A (ja) * | 2010-11-29 | 2016-08-25 | メルク パテント ゲゼルシャフト ミット ベシュレンクテル ハフツングMerck Patent Gesellschaft mit beschraenkter Haftung | 液晶混合物 |
JP2018070892A (ja) * | 2010-11-29 | 2018-05-10 | メルク パテント ゲゼルシャフト ミット ベシュレンクテル ハフツングMerck Patent Gesellschaft mit beschraenkter Haftung | 液晶混合物 |
TWI708830B (zh) * | 2015-07-02 | 2020-11-01 | 日商迪愛生股份有限公司 | 液晶組成物及使用其之液晶顯示元件 |
Also Published As
Publication number | Publication date |
---|---|
US20070195796A1 (en) | 2007-08-23 |
JP4561283B2 (ja) | 2010-10-13 |
EP1811402A1 (en) | 2007-07-25 |
CN101031918B (zh) | 2010-05-26 |
EP1811402A4 (en) | 2010-07-14 |
EP1811402B1 (en) | 2013-05-01 |
CN101031918A (zh) | 2007-09-05 |
JP2006099503A (ja) | 2006-04-13 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
WO2006038433A1 (ja) | ノード装置、共用情報更新方法、共用情報保存方法、プログラム | |
JP4418897B2 (ja) | 情報配信システム、情報更新プログラム、及び情報更新方法等 | |
JP4599581B2 (ja) | 情報配信システム、配信要求プログラム、転送プログラム及び配信プログラム等 | |
US20070283043A1 (en) | Information delivery system, delivery request program, transfer program, delivery program, and the like | |
US8676855B2 (en) | Distributed storage system, management apparatus, node apparatus, recording medium on which node program is recorded, page information acquisition method, recording medium on which page information sending program is recorded, and page information sending method | |
JP2007280303A (ja) | 情報通信システム、コンテンツカタログ情報配信方法、及びノード装置等 | |
JP5343793B2 (ja) | 情報生成装置、情報生成プログラム、情報生成方法、ノード装置、ノードプログラム及び検索方法 | |
JP2008059399A (ja) | コンテンツ配信システム、コンテンツ配信システムにおける情報処理方法、端末装置及びそのプログラム | |
US8654678B2 (en) | Node device, recording medium where storage control program is recorded, and information storing method | |
JP4696498B2 (ja) | 情報配信システム、ノード装置、所在情報検索方法、及び所在情報検索処理プログラム等 | |
JP2006195744A (ja) | 情報配信システム、配信要求プログラム、転送プログラム、配信プログラム等 | |
JP5168334B2 (ja) | 情報生成装置、情報生成方法及び情報生成プログラム | |
US20100293152A1 (en) | Managing apparatus, recording medium in which managing program is recorded, and expiration date determining method | |
JP5375272B2 (ja) | ノード装置、ノード処理プログラム、情報通信システム及びコンテンツデータ管理方法 | |
JP5338461B2 (ja) | 管理装置、情報生成プログラム、及び情報生成方法 | |
JP5458629B2 (ja) | ノード装置、ノード処理プログラム及び検索方法 | |
JP2009232272A (ja) | コンテンツ分散保存システム、コンテンツ再生方法、ノード装置、管理装置、ノード処理プログラム、及び管理処理プログラム | |
JP4674504B2 (ja) | 管理装置、ノード装置、コンテンツ情報管理処理プログラム、確認要求処理プログラム、情報配信システム、及び情報配信方法 | |
JP4983183B2 (ja) | ノード装置、情報分割保存システム、情報処理プログラム及び情報利用方法 | |
JP2006217538A (ja) | 情報通信システム、情報通信システムに含まれる初期ゾーン管理ノード装置等 | |
JP2010102573A (ja) | ノード装置、ノード処理プログラム及びデータファイル改変方法 | |
JP5370328B2 (ja) | ノード装置、情報通信システム、情報処理方法及び情報処理プログラム | |
JP5278152B2 (ja) | 管理装置、ノード装置、ノードプログラム、ページ情報送信プログラム、及びページ情報送信方法 | |
JP2010067073A (ja) | 保存指示装置、ノード装置、及び保存指示処理プログラム、ノード処理プログラム及び保存指示方法 | |
JP2009187056A (ja) | コンテンツ分散保存システム、評価値加算方法、サーバ装置、ノード装置、及びノード処理プログラム |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AK | Designated states |
Kind code of ref document: A1 Designated state(s): AE AG AL AM AT AU AZ BA BB BG BR BW BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EC EE EG ES FI GB GD GE GH GM HR HU ID IL IN IS KE KG KM KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NA NG NI NO NZ OM PG PH PL PT RO RU SC SD SE SG SK SL SM SY TJ TM TN TR TT TZ UA UG US UZ VC VN YU ZA ZM ZW |
|
AL | Designated countries for regional patents |
Kind code of ref document: A1 Designated state(s): GM KE LS MW MZ NA SD SL SZ TZ UG ZM ZW AM AZ BY KG KZ MD RU TJ TM AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IS IT LT LU LV MC NL PL PT RO SE SI SK TR BF BJ CF CG CI CM GA GN GQ GW ML MR NE SN TD TG |
|
121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
WWE | Wipo information: entry into national phase |
Ref document number: 11727832 Country of ref document: US |
|
WWE | Wipo information: entry into national phase |
Ref document number: 200580033067.4 Country of ref document: CN |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2005782392 Country of ref document: EP |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
WWP | Wipo information: published in national office |
Ref document number: 2005782392 Country of ref document: EP |
|
WWP | Wipo information: published in national office |
Ref document number: 11727832 Country of ref document: US |