WO2006103801A1 - 情報処理装置、情報処理方法及び情報処理用プログラム - Google Patents
情報処理装置、情報処理方法及び情報処理用プログラム Download PDFInfo
- Publication number
- WO2006103801A1 WO2006103801A1 PCT/JP2005/020876 JP2005020876W WO2006103801A1 WO 2006103801 A1 WO2006103801 A1 WO 2006103801A1 JP 2005020876 W JP2005020876 W JP 2005020876W WO 2006103801 A1 WO2006103801 A1 WO 2006103801A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- information
- distribution
- information processing
- evaluation
- processing apparatus
- 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
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/10—File systems; File servers
- G06F16/18—File system types
- G06F16/182—Distributed file systems
- G06F16/184—Distributed file systems implemented as replicated file system
- G06F16/1844—Management specifically adapted to replicated file systems
-
- 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/1074—Peer-to-peer [P2P] networks for supporting data block transmission mechanisms
- H04L67/1076—Resource dissemination mechanisms or network resource keeping policies for optimal resource availability in the overlay network
Definitions
- Information processing apparatus information processing method, and information processing program
- the present invention belongs to a technical field of an information processing apparatus, an information processing method, and an information processing program. More specifically, the present invention mutually distributes content (distribution information) such as a movie to be distributed via a network.
- the present invention belongs to a technical field of an information processing apparatus and an information processing method for performing information processing, and an information processing program for performing the distribution processing.
- replicas multiple copies (hereinafter simply referred to as replicas) are prepared for a single content and distributed to multiple terminal devices.
- a “distributed storage system” has been proposed, which is a technique to improve fault tolerance and access dispersibility!
- Patent Document 1 As a conventional proposal relating to creation and arrangement of the replica, for example, there is one described in Patent Document 1 below.
- Patent Document 1 Japanese Patent Laid-Open No. 2003-99337
- Patent Document 1 the total size (total information amount) and the number of replicas existing in each terminal device connected in a service group on the network are referred to.
- a method for creating and arranging replicas in a balanced manner across the entire network in the service group has been proposed.
- the present invention has been made in view of the above problems, and an example of the purpose thereof is in a distribution system in which a server for managing the location and number of contents is not separately provided.
- An information processing apparatus, an information processing method, and a distribution process capable of autonomously placing a necessary number of replicas at appropriate positions in the distribution system and distributing the necessary content more efficiently It is to provide an information processing program for performing the above.
- the invention according to claim 1 is an information distribution system in which distribution information to be distributed is directly exchanged between information processing apparatuses via a network.
- the information processing apparatus to be configured one or a plurality of the distribution information is recorded.
- Recording means such as a recording unit
- evaluation information storage means such as a recording unit that generates and stores evaluation information having a value based on at least the number of distribution requests for each distribution information.
- the invention according to claim 2 is recorded in the recording means in the information processing apparatus according to claim 1, and is recorded in the recording means!
- the evaluation information update of the control unit or the like that increases the value of the evaluation information corresponding to the requested distribution information Means are further provided.
- the actual number of distribution requests that is, the actual popularity of the distribution information among users who use information processing devices in the network.
- the value of the evaluation information corresponding to is accurately reflected, and the number of duplicates can be appropriately placed in the network according to the actual popularity.
- the invention according to claim 3 is the information processing apparatus according to claim 1 or 2, wherein the evaluation information storage means includes the other information on the network.
- the transmitted distribution information is transmitted.
- a copy creation information indicating that a copy of the other information processing apparatus has been created is transmitted from the other information processing apparatus together with a copy coefficient corresponding to the replicated distribution information.
- a value obtained by multiplying the value of the evaluation information corresponding to the distribution information at the time when the distribution information is distributed to the apparatus by the transmitted replication coefficient is used as a new value corresponding to the distributed distribution information.
- the duplication coefficient is less than 1 corresponding to a distance on the network between the information processing apparatus including the evaluation information storage unit and the other information processing apparatus that has transmitted the duplication creation information. Is configured to have a value of
- the value of the evaluation information corresponding to each piece of distribution information decreases with the elapse of each preset time, so that the distribution information frequently requested for distribution and the other distribution information Evaluation information can be updated without excessively widening the gap.
- the invention according to claim 5 is directed to the information processing apparatus according to any one of claims 1 to 4, wherein the distribution is requested.
- the control unit searches the network for another information processing apparatus including the recording unit that records the distribution information that is a target of the distribution request.
- a transmission means such as a communication unit for transmitting transmission request information for requesting the other information processing apparatus to transfer the distribution information, and the transmission request information.
- an acquisition means such as a communication unit that acquires the distribution information as a copy of the distribution information from the other information processing apparatus searched together with the evaluation information corresponding to the distribution information, and the evaluation information
- the storage means stores the search.
- a value obtained by multiplying the value of the evaluation information acquired together with the distribution information by the replication coefficient corresponding to the acquired distribution information is distributed. It is stored as a new value of the evaluation information corresponding to the distribution information, and the copy coefficient is further determined between the other information processing apparatus searched and the information processing apparatus provided with the evaluation information storage means. Configured to have a value less than 1 corresponding to the distance on the network.
- the evaluation information can be appropriately updated based on the relationship between the distribution source information processing apparatus on the network and the acquired distribution information itself.
- the invention according to claim 6 is the information processing apparatus according to claim 5, wherein the distribution acquired from the other information processing apparatus searched is used.
- the copy creation information indicating that the distribution information is recorded in the recording unit as a copy is searched together with the replication coefficient corresponding to the recorded distribution information. It further includes copy creation information transmission means such as a communication unit for transmission to another information processing apparatus.
- the invention according to claim 7 is the information processing device according to claim 5 or 6, wherein the value is smaller than the stored new value.
- the recording unit further includes designation means, such as a control unit, that designates the distribution information corresponding to the deletion evaluation information that is the evaluation information having the information as deletion distribution information to be deleted from the recording means. However, when it becomes less than the amount of information of the other delivery information to be transmitted next, the delivery information designated as the deleted delivery information is actually deleted from the recording means.
- the distribution information corresponding to the deletion evaluation information is designated as the deletion distribution information to be deleted, and the free recording capacity in the recording means is the information of other distribution information to be transmitted next.
- the delivery information specified as the deleted delivery information is actually deleted from the recording means, so it becomes unnecessary at the appropriate time in relation to other delivery information that should be received next.
- the distribution information can be deleted and new distribution information can be efficiently transmitted.
- the invention according to claim 8 is the information processing device according to claim 7, wherein the designating unit copies the distribution information corresponding to the deletion evaluation information.
- Confirmation means such as a control part, confirming whether it exists in any of the information processing devices on the network, and the copy exists in any of the information processing devices on the network. Except when confirmed, the distribution information corresponding to the deletion evaluation information is configured to exclude the designated target force as the deletion distribution information.
- the invention according to claim 9 is the information processing device according to claim 8, wherein the confirmation unit includes a preset network including the information processing device.
- the confirmation unit includes a preset network including the information processing device.
- the invention according to claim 10 is the information processing device according to any one of claims 3, 5 to 9, wherein the value of the replication coefficient is the The distance is preset so that the longer the distance is V, the larger the value is.
- the distribution request for the information processing apparatus power far away on the network is generated to some extent. Distribution information with a large number of distribution requests for information processing devices within the range can be efficiently distributed and recorded between information processing devices within a range on the network.
- the invention according to claim 11 is an information distribution system in which distribution information to be distributed is directly exchanged between information processing apparatuses via a network.
- the distribution information is stored in the recording means.
- evaluation information having a value based on at least the number of distribution requests is stored for each piece of distribution information, so that the number of copies of the distribution information in the network is controlled according to the evaluation information. Can do.
- evaluation information having a value based on at least the number of distribution requests is stored for each distribution information. It is possible to control the number of copies of the distribution information in the network according to the information.
- the distribution information is transmitted to the distribution destination.
- Value of the new evaluation information corresponding to the distribution information obtained by multiplying the value of the evaluation information corresponding to the distribution information distributed by the replication coefficient transmitted from the distribution destination when the copy of And the duplication coefficient has a value less than 1 corresponding to the distance on the network to the information processing apparatus of the distribution destination, so that a copy of the distribution information distributed to the information processing apparatus of the distribution destination is generated.
- the evaluation information can be appropriately updated in relation to the distance on the network to the information processing apparatus from which the copy is generated and the copy itself.
- the computer functions as the information processing device according to claim 5, in addition to the case where the computer functions as the information processing device according to any one of claims 1 to 4.
- the distribution information is recorded and another information processing apparatus is searched, and the distribution information of the distribution information is searched for the other information processing apparatus searched.
- the transmission request information is transmitted, the distribution information corresponding to the transmission request information is acquired as a copy of the distribution information together with the corresponding evaluation information, and when the distribution information is acquired, the copy corresponding to the acquired distribution information is acquired.
- the value obtained by multiplying the value of the evaluation information corresponding to the distribution information by the value is stored as the value of the corresponding new evaluation information, and the distance on the network between the duplication coefficient and another information processing device Therefore, when new distribution information is acquired as a copy, the distance between the information processing device of the transmission source on the network and the acquired distribution information itself. Evaluation information can be appropriately updated in relation.
- the computer functions as the information processing device according to claim 6, in addition to the case where the computer functions as the information processing device according to claim 5, the information processing that has received the distribution request
- the copy creation information indicating that fact is transmitted together with the replication coefficient to the distribution information distribution source, so the distribution information recorded in the information processing device of the distribution source
- the value of the evaluation information corresponding to can be updated appropriately in relation to the replication.
- the computer functions as the information processing device according to claim 7
- the computer functions as the information processing device according to claim 5 or 6, and the deletion evaluation information is changed.
- the corresponding distribution information is specified as the deletion distribution information to be deleted, and the available recording capacity in the recording means falls below the amount of other distribution information to be transmitted next
- the distribution specified as the deletion distribution information Since the information is actually deleted from the recording means, it is possible to delete new distribution information efficiently by deleting unnecessary distribution information at an appropriate time in relation to other distribution information to be transmitted next. Can receive transmission.
- the distribution corresponding to the deletion evaluation information Deletion evaluation information is checked unless a copy of the information exists in any information processing device on the network, and it is confirmed that the copy exists in any information processing device on the network. As a result, if the copy does not exist in any information processing device on the network, the distribution information corresponding to the deletion evaluation information is deleted. Since it is not deleted, it is possible to prevent the distribution information from being completely lost on the network.
- the computer functions as the information processing device according to claim 9, in addition to the case where the computer functions as the information processing device according to claim 8, If any of the information processing devices within the search range has a copy of the distribution information corresponding to the deletion evaluation information, the distribution corresponding to the deletion evaluation information Since it is confirmed that a copy of the communication information exists in one of the information processing devices on the network, the necessary distribution information can be quickly obtained by excluding information processing devices outside the search range from the distribution information existence confirmation range. Can be explored.
- the computer functions as the information processing device according to claim 10
- the computer functions as the information processing device according to any one of claims 3, 5 to 9.
- the value of the replication coefficient is set so that the distance on the network increases as the distance on the network increases. Therefore, a distribution request from an information processing device far away on the network is required.
- the distribution information with a large number of distribution requests from information processing devices within a certain range can be efficiently distributed and recorded among information processing devices within a certain range on the network. Can do.
- the invention according to claim 13 is the information processing program according to claim 12, recorded so as to be readable by the computer.
- the information processing program when an information processing program that causes a computer to function as the information processing apparatus according to claim 2 is recorded, the information processing program is read and executed by the computer.
- the value of evaluation information increases each time a distribution request is made, so the actual number of distribution requests, that is, the information processing device in the network is used.
- the value of the corresponding evaluation information accurately reflects the actual popularity of the distribution information for the user, and the number of copies can be appropriately placed in the network according to the actual popularity.
- the program is read and executed by the computer, so that the computer can execute the information processing program according to claim 1 or 2.
- the copy is sent from the distribution destination when a copy of the distribution information is generated at the distribution destination.
- the value obtained by multiplying the duplicated copy coefficient by the value of the evaluation information corresponding to the distributed information is used as the new value of the evaluation information corresponding to the distributed information, and the copy coefficient is the information of the distribution destination.
- the evaluation information can be appropriately updated in relation to the distance to the processing device on the network and the copy itself.
- the information processing program is read and executed by the computer.
- the computer functions as the information processing apparatus according to any one of items 1 to 3
- the value of the evaluation information corresponding to each piece of distribution information decreases for each preset time period. Therefore, it is possible to update the evaluation information without increasing the disparity between the distribution information frequently requested for distribution and the other distribution information.
- an information processing program that causes a computer to function as the information processing apparatus according to claim 5 is recorded, it is read and executed by the computer, so that In addition to the case where the computer functions as the information processing apparatus according to any one of the above, the distribution information requested for distribution is recorded, and other information that records the distribution information is recorded.
- the information processing device is searched, the transmission request information of the distribution information is transmitted to the other information processing devices searched for, and the distribution information corresponding to the transmission request information is copied together with the evaluation information corresponding to the distribution information.
- the distribution information is acquired, the value obtained by multiplying the value of the evaluation information corresponding to the distribution information by the replication coefficient corresponding to the acquired distribution information is used as the corresponding new information.
- the duplication coefficient has a value less than 1 corresponding to the distance on the network with other information processing devices.
- the evaluation information can be appropriately updated based on the relationship between the distribution information processing apparatus on the network and the acquired distribution information itself.
- the information processing program when an information processing program for causing a computer to function as the information processing apparatus according to claim 7 is recorded, the information processing program is read and executed by the computer.
- the distribution information corresponding to the deletion evaluation information is designated as deletion distribution information to be deleted, and the free recording capacity in the recording means is
- the distribution information specified as the deleted distribution information is actually deleted from the recording means, so the relationship with the other distribution information to be transmitted next
- the program is read and executed by the computer, so that the information processing program according to claim 7 is executed.
- the computer functions as an information processing apparatus, it is checked whether a copy of the distribution information corresponding to the deletion evaluation information exists in any information processing apparatus on the network. Except for the case where it is confirmed that it exists in any of the above information processing devices, the distribution information corresponding to the deletion evaluation information is also excluded from the ability to be designated as deletion distribution information. If the information does not exist in any of the information processing apparatuses, the distribution information corresponding to the deletion evaluation information is not deleted. It is possible to prevent that mosquito ⁇ et all disappear.
- the evaluation information having a value based on at least the number of distribution requests is stored for each distribution information, according to the evaluation information.
- the number of copies of the distribution information in the network can be controlled.
- the number of copies of distribution information in the network and the designation of the information processing device that stores each copy are controlled based on the evaluation information, so that the necessary number of copies in the network can be appropriately set. It can be placed autonomously at a location on the network, and the necessary distribution information can be distributed more efficiently.
- the value of the evaluation information increases each time a distribution request is made, the actual number of distribution requests
- the value of the evaluation information corresponding to the actual popularity of the distribution information accurately reflects the actual popularity of the distribution information for the user who uses the information processing device in the network. It can be properly placed in the network.
- the value of the evaluation information corresponding to each distribution information is set in advance. Since it decreases with the passage of time, the evaluation information can be updated without making the difference between the distribution information frequently requested for distribution and the other distribution information excessive.
- the distribution is performed. It searches for other information processing devices that record the information, transmits the transmission request information of the distribution information to the searched other information processing devices, and distributes the distribution information corresponding to the transmission request information.
- the new distribution information is acquired as a copy.
- the distribution information corresponding to the deletion evaluation information is designated as the deletion distribution information to be deleted, Record
- the distribution information designated as the deleted distribution information is actually deleted from the recording means, so the next transmission is received.
- a copy of the distribution information corresponding to the deletion evaluation information exists in any information processing apparatus on the network Unless the copy is confirmed to exist in any information processing device on the network, the distribution information corresponding to the deletion evaluation information is designated as the deletion distribution information. As a result, the duplicate does not exist in any information processing device on the network! If the distribution information corresponding to the deletion evaluation information is not deleted, all of the distribution information disappears. Can be prevented.
- deletion evaluation information is sent to any information processing device within a preset search range on the network.
- it is confirmed that the copy of the distribution information corresponding to the deletion evaluation information exists in one of the information processing devices on the network.
- the device By excluding the device from the presence confirmation range of distribution information, it is possible to quickly search for necessary distribution information.
- the value of the replication coefficient increases as the distance on the network increases. Therefore, distribution requests from remote information processing devices can be prevented to some extent on the network, and between information processing devices within a certain range on the network. However, the distribution information with a large number of information processing apparatus power distribution requests within the range can be distributed and recorded efficiently.
- evaluation information having a value based on at least the number of distribution requests is stored for each distribution information.
- the number of copies of distribution information can be controlled.
- the number of copies of distribution information in the network and each copy are stored.
- the required number of replicas can be autonomously placed at appropriate network locations within the network, and the necessary distribution information can be distributed more efficiently. can do.
- the necessary number of copies in the network can be appropriately set. It can be placed autonomously at a location on the network, and the necessary distribution information can be distributed more efficiently.
- the distribution information is transmitted to the distribution destination.
- Value of the new evaluation information corresponding to the distribution information obtained by multiplying the value of the evaluation information corresponding to the distribution information distributed by the replication coefficient transmitted from the distribution destination when the copy of And the duplication coefficient has a value less than 1 corresponding to the distance on the network to the information processing apparatus of the distribution destination, so that a copy of the distribution information distributed to the information processing apparatus of the distribution destination is generated.
- the evaluation information can be appropriately updated in relation to the distance on the network to the information processing apparatus from which the copy is generated and the copy itself.
- the computer functions as the information processing device according to claim 4, the computer as the information processing device according to any one of claims 1 to 3.
- the value of the evaluation information corresponding to each piece of distribution information decreases with the elapse of each preset time, so that distribution information frequently requested for distribution and other distributions are distributed.
- the evaluation information can be updated without making the difference between the information excessive.
- the computer functions as the information processing device according to claim 5, in addition to the case where the computer functions as the information processing device according to any one of claims 1 to 4.
- the distribution information is recorded and another information processing apparatus is searched, and the distribution information of the distribution information is searched for the other information processing apparatus searched.
- the transmission request information is transmitted, the distribution information corresponding to the transmission request information is acquired as a copy of the distribution information together with the corresponding evaluation information, and when the distribution information is acquired, the copy corresponding to the acquired distribution information is acquired.
- the value obtained by multiplying the value of the evaluation information corresponding to the distribution information by the value is stored as the value of the corresponding new evaluation information, and the distance on the network between the duplication coefficient and another information processing device Therefore, when new distribution information is acquired as a copy, the evaluation information is related to the distance on the network with the information processing device of the distribution source and the relationship with the acquired distribution information itself. Can be updated appropriately.
- the computer functions as the information processing device according to claim 6, in addition to the case where the computer functions as the information processing device according to claim 5, the information processing that has received the distribution request
- the copy creation information indicating that fact is transmitted together with the replication coefficient to the distribution information distribution source, so the distribution information recorded in the information processing device of the distribution source
- the value of the evaluation information corresponding to can be updated appropriately in relation to the replication.
- the computer functions as the information processing device according to claim 7
- the computer functions as the information processing device according to claim 5 or 6, and the deletion evaluation information is changed.
- the corresponding distribution information is specified as the deletion distribution information to be deleted, and the available recording capacity in the recording means falls below the amount of other distribution information to be transmitted next
- the distribution specified as the deletion distribution information Since the information is actually deleted from the recording means, it is possible to delete new distribution information efficiently by deleting unnecessary distribution information at an appropriate time in relation to other distribution information to be transmitted next. Can receive transmission The
- the distribution corresponding to the deletion evaluation information Deletion evaluation information is checked unless a copy of the information exists in any information processing device on the network, and it is confirmed that the copy exists in any information processing device on the network. As a result, if the copy does not exist in any information processing device on the network, the distribution information corresponding to the deletion evaluation information is deleted. Since it is not deleted, it is possible to prevent the distribution information from being completely lost on the network.
- the computer functions as the information processing device according to claim 9, in addition to the case where the computer functions as the information processing device according to claim 8, If any of the information processing devices within the search range has a copy of the distribution information corresponding to the deletion evaluation information, the copy of the distribution information corresponding to the deletion evaluation information exists in any of the information processing devices on the network. Accordingly, since the information processing apparatus outside the search range is excluded from the distribution information existence confirmation range, the necessary distribution information can be searched quickly.
- the computer functions as the information processing device according to claim 10
- the computer functions as the information processing device according to any one of claims 3, 5 to 9.
- the value of the replication coefficient is set so that the distance on the network increases as the distance on the network increases. Therefore, a distribution request from an information processing device far away on the network is required.
- the distribution information with a large number of distribution requests from information processing devices within a certain range can be efficiently distributed and recorded among information processing devices within a certain range on the network. Can do.
- the necessary number of copies in the network can be appropriately set. It can be placed autonomously at a location on the network, and the necessary distribution information can be distributed more efficiently.
- the information processing program when an information processing program that causes a computer to function as the information processing apparatus according to claim 2 is recorded, the information processing program is read and executed by the computer, so that the information processing apparatus according to claim 1 is executed.
- the value of evaluation information increases each time a distribution request is made, so the actual number of distribution requests, that is, the information processing device in the network is used.
- the value of the corresponding evaluation information accurately reflects the actual popularity of the distribution information for the user, and the number of copies can be appropriately placed in the network according to the actual popularity.
- the value obtained by multiplying the value of the evaluation information is used as a new value of the evaluation information corresponding to the distribution information, and the duplication coefficient corresponds to the distance on the network with the information processing apparatus of the distribution destination 1 Therefore, when a copy of the distributed distribution information is generated in the information processing apparatus of the distribution destination, the distance on the network with the information processing apparatus in which the copy is generated, and It can be properly updated evaluation information in relation to replication itself.
- the information processing program is read and executed by the computer.
- the computer functions as the information processing apparatus according to any one of items 1 to 3
- the value of the evaluation information corresponding to each piece of distribution information decreases for each preset time period. Therefore, the evaluation information is updated without excessively widening the disparity between the distribution information frequently requested for distribution and the other distribution information. be able to.
- an information processing program that causes a computer to function as the information processing apparatus according to claim 5 is recorded, the program is read and executed by the computer, so that In addition to the case where the computer functions as the information processing apparatus according to any one of the above, the distribution information requested for distribution is recorded, and other information that records the distribution information is recorded.
- the information processing device is searched, the transmission request information of the distribution information is transmitted to the other information processing devices searched for, and the distribution information corresponding to the transmission request information is copied together with the evaluation information corresponding to the distribution information.
- the distribution information is acquired, the value obtained by multiplying the value of the evaluation information corresponding to the distribution information by the replication coefficient corresponding to the acquired distribution information is used as the corresponding new information.
- the duplication coefficient has a value less than 1 corresponding to the distance on the network with other information processing devices.
- the evaluation information can be appropriately updated based on the relationship between the distribution information processing apparatus on the network and the acquired distribution information itself.
- the information processing program is read and executed by the computer.
- the distribution information corresponding to the deletion evaluation information is designated as deletion distribution information to be deleted, and the free recording capacity in the recording means is
- the distribution information specified as the deleted distribution information is actually deleted from the recording means, so the relationship with the other distribution information to be transmitted next And suitable It is possible to delete distribution information that is no longer needed at a critical time and efficiently transmit new distribution information.
- FIG. 1 is a block diagram showing a schematic configuration of a node according to the first embodiment.
- FIG. 2 is a flowchart showing each operation in the node according to the first embodiment.
- FIG. 3 is a flowchart showing an evaluation value acquisition process in a node according to the first embodiment.
- FIG. 4 is a flowchart showing content acquisition processing in a node according to the first embodiment.
- FIG. 5 is a flowchart showing a replica creation process in the node according to the first embodiment.
- FIG. 6 is a diagram illustrating a distribution state of content between nodes according to the first embodiment, (a) is a diagram illustrating a first stage of distribution, and (b) is a second stage of distribution. It is a figure which illustrates a state, (c) is a figure which illustrates the 3rd stage of distribution, (d) is a figure which illustrates the 4th stage of distribution.
- FIG. 7 is a diagram (II) illustrating another distribution state of content between nodes according to the first embodiment, (a) is a diagram illustrating a first stage of distribution, and (b) is a distribution (C) is a figure which illustrates the 3rd stage of delivery.
- FIG. 8 is a flowchart showing a replica creation process in a node according to the second embodiment.
- FIG. 9 is a diagram illustrating a distribution state of content between nodes according to the second embodiment, (a) is a diagram illustrating a first stage of copy creation processing, and (b) is a diagram of copy creation processing. It is a figure which illustrates the state of a 2nd step, (c) is a figure which illustrates the state of the 3rd step of a replication creation process.
- the content executed on one terminal device This is an embodiment in the case where the present invention is applied to a case where a content desired by another terminal device is distributed to the one terminal device in response to the distribution request operation.
- the terminal device is generally referred to as a “node”.
- FIG. 1 is a block diagram showing a schematic configuration of a node according to the embodiment.
- all nodes belonging to the P2P type distribution system according to the present embodiment basically have the same hardware configuration, the configuration of a general node N on behalf of them is shown in FIG. The outline is explained using.
- the node N included in the distribution system includes a CPU having an arithmetic function, a working RAM (Random Access Memory), and a ROM that records various data and programs.
- (Read Only Memory) Equipotency Control unit 11 as configured evaluation information update means, search means, designation means and confirmation means, content data as the content itself, various routing data necessary for its distribution, and others Storage unit composed of HDD (Hard Disc Drive) etc. for recording and storing necessary programs, etc. and recording unit 12 as evaluation information storage unit, and temporarily storing received content data Buffer memory 13 and the encoding included in the content data
- a decoder unit 14 that decodes (encoded) video data (video information), audio data (audio information), etc.
- a video processing unit 15 that performs drawing processing and outputs a video signal
- a display unit 16 that includes a CRT (Cathode Ray Tube) or a liquid crystal display that displays video based on the video signal output from the video processing unit 15, and the above
- the decoded audio data is converted into an analog audio signal by DZA (Digital / Analog) conversion, then amplified by an amplifier or the like and output, and the audio signal output from the audio processing unit 17 is converted into a sound wave.
- DZA Digital / Analog
- a communication unit 20 as a stage, and an input unit (for example, a keyboard, a mouse, an operation panel, etc.) 21 that receives each user's instruction and outputs an instruction signal corresponding to the instruction to the control unit 11;
- the control unit 11, the recording unit 12, the buffer memory 13, the decoder unit 14, and the communication unit 20 are connected to each other via a bus 22 so as to be able to exchange data.
- control unit 11 controls the overall operation as the node N according to the embodiment.
- FIGS. 2 to 5 are flowcharts showing the operations
- FIG. 6 is a diagram illustrating the results of the operations.
- a value having a value corresponding to the number of times the other nodes (the number of times the content has been requested to be distributed) is added.
- an operation for requesting distribution of content to one node (hereinafter, the content that is the distribution request target is referred to as content (X))
- content (X) When executed on the one node (hereinafter referred to as the one node on which the distribution request operation has been executed), a content request message (X, j) requesting that content X be distributed to node j. ) Force The corresponding node j force is also transmitted to the other node that stores the content X in the recording unit 12 (hereinafter, it is stored by itself corresponding to the received content request message (X, j), The other node that transmits the content (X) to be transmitted to node j is referred to as node k).
- a replica of the content (X) stored in the recording unit 12 of the distribution source node k is created in the recording unit 12 of the node j.
- a replica creation message (X, W) is transmitted from the node j where the replica is created to the node k that is the distribution source.
- the parameter W included in the duplicate creation message (X, W) indicates that the replica of the content (X) stored in the distribution source node k has been created in the distribution destination node j. This is a duplication coefficient used for adjusting the evaluation value of the content (X) as the entire distribution system according to the embodiment.
- the replica that is, the content (X)
- the replica that is, the content (X)
- V and the shifted node N can also be the node j or the node k.
- Figure 2 summarizes the case where one node N becomes node j and node k.
- a content distribution request operation is executed at the node N.
- the card is always monitored (step S1), and the distribution request operation is executed at the one node N, that is, when the one node N becomes the above node j.
- Step S1; yes the process for obtaining the requested content (X) is executed at the node j (Step S4).
- step S9; yes the power of the node j is turned off.
- step S2 when the content distribution request operation is not executed in the determination of step S1 (step Sl; no), the other node N then sends the content request message ( It is determined whether or not X, j) has been transmitted (step S2).
- the content request message (X, j) is transmitted, that is, when the one node N becomes the node k (step S2; yes)
- the node k is currently stored.
- the evaluation value acquisition process for acquiring (calculating) the evaluation value of the content (X) is executed, and the acquisition result is temporarily stored as the value of the parameter V indicating the acquisition result (step S5 ).
- the content request message (X, j) is transmitted in the above step S2 (that is, the distribution request operation of the content (X) stored in the node k is performed by another node N ( The value of the temporarily stored parameter V is incremented by “1” and the current evaluation value of the content X (the content) After all the evaluation values for X are defined as VALUE (X) below (step S6), the current node j force also requested the data of the requested content (X) for distribution (X). The data is transmitted to the node j (step S7), the process proceeds to step S9, and then the above-described processing is executed.
- the current node is j.
- the duplicate creation message (X, W) has been sent (after delivery of the requested content X) to the one node N that is currently the node k from another node N Is determined (step S3).
- the copy creation message (X, W) is sent, that is, when a replica of content X is created at the current node j (step S3; yes)
- the distributed content X
- the above evaluation The value acquisition process is executed for the current evaluation value VALUE (X), and the new acquisition result is temporarily stored as the value of the parameter V (step S5).
- step S5 the value temporarily stored and multiplied by the value of parameter V is set as the current evaluation value VALUE (X) (step S8), and then the processing proceeds to step S9.
- VALUE current evaluation value
- FIG. 3 is a flowchart showing details of the evaluation value acquisition process.
- the three parameters T, Tg, and Tu related to the evaluation value acquisition process are set respectively.
- “Current time”, “Last (ie, most recently in the past) Step S5 is executed and the evaluation value for content (X) is obtained at node j” and “24 hours” (Step S40.
- “24 hours” corresponds to “preset time” in claim 4 of the present application).
- the initial value as the parameter Tg is the time when the evaluation value VALUE (X) for the content (X) is initially determined by a preset method.
- the current time is the time when more than 24 hours have elapsed from the time at which the last evaluation of the content (X) is obtained at node j (step S41).
- Step S41 If the current time is the time when more than 24 hours have passed since the last time the evaluation value was acquired at node j! (Step S41; no), the evaluation of content (X) is currently Proceed directly to step S6 or S8 shown in Fig. 2 without any change in the value.
- step S41 determines whether the current time is the time when 24 hours or more have elapsed since the last time the evaluation value was input to node j (step S41; yes)
- the parameter Tg is updated to the value obtained by adding the parameter Tu to the original parameter Tg (that is, the value of the parameter Tg is updated for 24 hours) (step S42), and the current evaluation value VALUE (X ) Is reduced by 10% (step S43), and the process returns to step S41.
- the evaluation value acquisition process shown in Fig. 3 is always executed, so that the evaluation value VALUE (X) is updated (step S43) every time 24 hours elapse.
- the value of the evaluation value VALUE (X) is decreased by 10%! /, And the ability to execute each content is executed independently of each other. Therefore, as a result, the distribution scenario of the first embodiment is As a result, the corresponding evaluation value is high, the content is low, and the content is independently reduced by 10% every 24 hours.
- FIG. 4 is a flowchart showing details of the acquisition process.
- the formed temporary buffer memory that is, the area in the recording unit 12 that temporarily stores the content (X) for reproduction
- a nonvolatile memory in the recording unit 12 is stored. It is confirmed whether or not the desired content (X) is already stored in the sex region (step S11). If the content (X) is already stored in the non-volatile area (step Sl l; yes), it is not necessary to receive the content (X) from another node N again.
- the stored content (X) is stored in the initialized buffer memory (step S10) —time buffer (step S18), and the process proceeds to step S9 shown in FIG.
- step S11 if the content (X) is not stored in the recording unit 12 of the node j in the determination in step S11 (step S11; no), the recording unit in which the content (X) is stored Another node N having 12 (ie, node k) is searched in the distribution system according to the first embodiment (steps S 12 and S 13).
- a search method In the case of the above P2P type distribution system, it is preferable to use a search method using a so-called DHT (Distributed Hash Table).
- DHT Distributed Hash Table
- step S13 when another node N to be the node k cannot be found (step S13; no), the desired content (X) cannot be acquired in the distribution system according to the first embodiment. Therefore, the fact is notified to the user using the display unit 16 in the node j (step S19), and the process proceeds to step S9 shown in FIG.
- step S13 determines whether another node N that should become node k can be found in the determination in step S13 (step S13; yes).
- step S13 determines whether another node N that should become node k can be found in the determination in step S13 (step S13; yes).
- step S13 determines whether another node N that should become node k can be found in the determination in step S13 (step S13; yes).
- step S14 the delivery of the content (X) data itself as a reply to the content request message (X, j) is awaited (steps S15, S15; no) o and
- step SI 5 determines the distribution of content (X) data is made from node k (step SI 5; yes)
- the distributed content (X) is temporarily stored in the temporary buffer of node j ( Step S16), and then used for the reproduction process at the node j. Then, the content (X) in the temporary buffer is erased as necessary after the reproduction process is completed.
- a copy creation process (X, k) (to be described later) for creating a copy of the content that can be provided to other nodes is executed (step SI 7). Move on to step S9 shown in 2.
- step S12 or S15 When the process of step S12 or S15 is executed, in parallel with these, at the time of the distribution between the retrieved node k and the node j that receives the distribution of the content (X).
- the number of routers (not shown) through which the content (X) is routed (hereinafter referred to as the number of hops) is temporarily stored in the recording unit 12.
- the number of hops is defined in advance in the network as to how many times the value of the TTL (Time To Live) field in the IP packet is transmitted. ⁇ , Can be recognized by decreasing!
- FIG. 5 is a flowchart showing details of the copy creation processing.
- the parameter M is recorded in the recording unit 12 of the node j.
- the parameter Sr is a parameter indicating content with a small evaluation value VALUE (X), and the parameter Sr is information on an area in the recording unit 12 where content is not recorded (hereinafter simply referred to as an unrecorded area). This is a parameter indicating the amount (hereinafter simply referred to as the unrecorded area information amount), and the parameter SIZE (X) is a parameter indicating the amount of information as digital data of the content (X).
- step S20 A deletion data list R [] indicating a list of contents to be deleted is initialized (step S20), and then the contents (X) stored in the temporary buffer at that time are read (step S21), and further A replication coefficient W corresponding to the content (X) is set (step S22).
- the parameter i is initialized to "1", and the current value of the parameter Sr is the content.
- step S26 it is confirmed whether or not the parameter S is equal to or less than "0", that is, whether or not the unrecorded area information amount is larger than the information amount of the content (X) (step S26). If S is less than or equal to “0” and the amount of unrecorded area information is greater than the amount of information in content (X) (step S26; yes), then it is described in the deleted data list R [].
- Content (which is determined to be erasable from the recording unit 12 due to a low evaluation value, as will be described later) is deleted (step S31) and stored in the temporary buffer. The content (X) is stored in the empty area for content storage in the recording unit 12!
- step S31 See step S31) and stored in the area (step S32), and the node that has delivered the content (X) k Is obtained at that time (see step S22)
- the replication creation message containing the number W (X, W) and transmits the (step S33).
- step S34 the fact that a new content (X) replica has been created in the recording unit 12 in the node j is disclosed using the same technology as before (step S34), and the process proceeds to step S9 shown in FIG. 4) Go through step S17).
- step S 27 it is confirmed whether or not the force of the parameter i incremented to the value “M” (step S 27).
- step S27 When the value of the parameter i is equal to or less than the value "M" (step S27; yes), the evaluation value acquisition process is then performed on the content D [i] indicated by the parameter D [i]. It is executed for the corresponding current evaluation value VALUE (D [i]), and the new acquisition result is temporarily stored as the value of parameter Vd (step S5).
- step S28 determines whether the value of parameter Vd is greater than the value of current parameter V (step S28; no) in the determination in step S28.
- the content (D [i]) corresponding to current parameter Vd is Since the evaluation value is high, it should not be deleted, and the process proceeds to step S9 shown in FIG. 2 (via step S17 in FIG. 4).
- step S27 If the current parameter i is greater than the value “M” in the determination in step S27 (step S27; no), it is assumed that there is no content to be deleted, and that is the same as in FIG. The process proceeds to step S9 shown in FIG. 4 (via step S17 in FIG. 4).
- the request for such distant force distribution means that there is another node N that stores the desired content in the vicinity of the distribution requesting node N. Also said that the power Yale. Therefore, as in the first embodiment, the replication coefficient W corresponding to such a remote delivery request is set to a large value (“0.8” in the first embodiment) and distributed once. After that, if a replica that is hard to be deleted at the distribution destination is created, the possibility of a node N requesting a distribution request again in the remote area can be reduced.
- nodes N1 to N4 that store nodes in the distribution system (that is, nodes N that can be nodes k),
- the maximum number of contents that can be stored in one node N is two, and the replication coefficient W is set to “0.5”.
- each time a content request message is transmitted for one node N the corresponding evaluation value is incremented by “1” (see step S6 in FIG. 2), and one replica is added.
- the recording unit 12 of each of the four nodes N1 to N4, which are nodes k in the distribution system according to the first embodiment, is currently in FIG. 6 (a).
- content C1 with an evaluation value of "3" and content C2 with an evaluation value of "1” are stored in the recording unit 12 of the node N1, and are stored in the recording unit 12 of the node N2.
- the numbers of the contents C1 to C4 in the distribution system are the same.
- the node N1 that has received the content request message (CI, N2) sets the evaluation value of the content C1 stored by itself to only "1". After incrementing to “4” (see step S6 in FIG. 2), the content C1 is transmitted to the node N2 (see step S7 in FIG. 2).
- the node N2 creates a copy creation message (CI, W) indicating that, and at the content C1 supplier as illustrated in Fig. 6 (c). Transmit to a certain node N1 (see step S33 in Fig. 5).
- node N4 requests transmission of content C2 from any node (step S1 in FIG. 2; yes).
- the node N4 finds, for example, the node N2 storing the desired content C2 (see step S13; yes in FIG. 4), and copies it to the node N2.
- a content request message (C2, N4) requesting transmission of the content C2 is transmitted (see step S14 in FIG. 4).
- the node N2 that has received the content request message sets the evaluation value of the content C2 stored by itself to “1”. After incrementing to “1” (see step S6 in FIG. 2), the content C2 is transmitted to the node N4 (see step S7 in FIG. 2).
- the distribution system can control! Therefore, the necessary number of replicas can be autonomously placed at appropriate network locations, and the necessary content can be distributed more efficiently.
- the evaluation value increases each time a distribution request is made, the actual number of distribution requests, that is, the actual popularity of the content among users who use node N in the distribution system. Therefore, the number of replicas can be appropriately placed in the distribution system according to the actual popularity.
- a replica of the content when a replica of the content is generated at the distribution destination, a value obtained by multiplying the evaluation value corresponding to the distributed content by the duplication coefficient that has also been transmitted to the distribution destination is used as a new value corresponding to the content.
- the replication coefficient is the destination node Since it has a value less than 1 corresponding to the network distance to N (that is, the number of hops above), when a replica of the distributed content is generated at the distribution destination node N, the replica is generated.
- the evaluation value can be appropriately updated based on the distance from the node N to the network and the relationship with the replica itself.
- the evaluation value corresponding to each content decreases with the elapse of a preset time, the difference between the content that is frequently requested and the other content is displayed.
- the evaluation value can be updated without being excessive.
- the other node N that records the content is searched for, and a content request message is sent to the searched other node N.
- the content corresponding to the content request message is acquired as a replica of the content together with the corresponding evaluation value, and when the content is further acquired, the replication coefficient corresponding to the acquired content is evaluated as the evaluation value corresponding to the content.
- the value obtained by multiplying is stored as a corresponding new evaluation value, and the replication coefficient has a value less than 1 corresponding to the distance on the network to other nodes N.
- the evaluation value can be updated appropriately by the person in charge.
- the deleted content is designated as a deleted content to be deleted according to the evaluation value, and when the free recording capacity in the recording unit 12 becomes equal to or less than the information amount of other content to be transmitted next, the deleted content The content specified as is actually deleted from the recording unit 12, so content that is no longer needed at the appropriate time is deleted in relation to other content that should be transmitted next, and new content is efficiently created. Can be received.
- the value of the replication coefficient is set so that the distance on the network increases as the distance on the network increases, a distribution request from a node N far away on the network is generated. This can be prevented to some extent, and between nodes N within a certain range on the network, content with a large number of distribution requests from nodes N within that range can be efficiently distributed and recorded.
- FIG. 8 is a flowchart showing the copy creation processing according to the second embodiment
- FIG. 9 is a diagram illustrating the result of the copy creation processing.
- the operation in the distribution system according to the second embodiment is the same as the operation in the distribution system according to the first embodiment, except for the copy creation process (step S17) shown in Fig. 8, and therefore, Description is omitted. Furthermore, in the copy creation process shown in FIG. 8, the same step numbers are assigned to the same processes as those in the copy creation process according to the first embodiment shown in FIG.
- the replica creation process (X, k) executed for the node j according to the second embodiment first, the replica creation process (X , K), steps S20 to S22, S5, S23 to S28 and S31 to S34 are executed.
- step S28 if the value of parameter Vd is less than or equal to the current value of parameter V (step S28; yes), the content D [i] is stored and recorded in step S28.
- Another node N that is, node k having the unit 12 is searched in the distribution system according to the second embodiment (steps S40 and S41).
- the parameter S is updated to a value obtained by subtracting the value of the parameter SIZE (D [i]) (that is, the content D [i] is deleted in the future (see step S31)).
- D [i] the value of the parameter SIZE
- the parameter Vd the parameter Vd
- Step S42 the parameter i by “1”
- Step S43 the parameter i by “1”
- step S41 determines whether the node k storing the target content (D [i]) is found in the determination in step S41 (step S41; no).
- N also has no content (D [i]), so if the content (D [i]) is deleted from the current node j, the content (D [i]) no longer exists in the distribution system. Since i]) no longer exists and cannot be distributed thereafter, the content (D [i]) is not added to the deleted data list R [], and the above steps S29 and S43 are performed. Proceed directly to step S43.
- the first stage As shown in FIG. 9 (b), the content C3 in the node N2 is erased from the node N2 because the evaluation value is “0”, and instead, the content in the node N1 A replica of the content C1 is created in the node N2 (see step S32 in FIG. 9). Further, the evaluation value of the content C1 in the node N1 and the evaluation value of the new content C1 (replica) in the node N2 are each “4”. And “3” (see step S8 in FIG. 2 and step S17 in FIG. 4).
- the content C4 in the node N3 is erased from the node N3 because the evaluation value is “0” (this is the case in the distribution system according to the second embodiment, Even if the content C4 in the node N3 is deleted, the content C4 in the node N3 is allowed to be deleted because the content C4 still remains in the node N4 (see step S41; yes in Fig. 8). Instead, a replica of the content C1 in the node N2 is created in the node N3 (see step S32 in FIG. 9), and the evaluation value of the content C1 in the node N2 and new content in the node N3 are also created.
- the evaluation value power of C1 (replica) is “2” and “1”, respectively (see step S8 in FIG. 2 and step S17 in FIG. 4).
- the evaluation value for each content C is rebalanced within the distribution system.
- the replica of the content to be deleted is different in the distribution system.
- Node N outside the above search range is excluded from the content existence confirmation range, so that it is possible to prevent the occurrence of a distribution request to a remote node N on the network to some extent. It is possible to efficiently distribute and record content with a large number of distribution requests from nodes N within a certain range between nodes N within a certain range on the network.
- the value of the above-described duplication coefficient W may be determined based on the number of replicas in the distribution system in addition to the above-described number of hops. It can be determined empirically by determining the average value of the number of hops or replicas.
- the program corresponding to the flowcharts shown in FIGS. 2 to 5 and FIG. 10 described above is recorded on an information recording medium such as a flexible disk or a hard disk, or is acquired and recorded via the Internet or the like.
- an information recording medium such as a flexible disk or a hard disk
- the present invention can be used in the field of content distribution via a network, and particularly effective when applied to the field of content distribution in a download format. It is done.
Description
Claims
Priority Applications (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
EP05805936A EP1868104A4 (en) | 2005-03-29 | 2005-11-14 | INFORMATION PROCESSING DEVICE, INFORMATION PROCESSING METHOD AND INFORMATION PROCESSING PROGRAM |
US11/905,085 US20080027897A1 (en) | 2005-03-29 | 2007-09-27 | Information processing apparatus, information processing method and recording medium |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP2005-095639 | 2005-03-29 | ||
JP2005095639A JP4635682B2 (ja) | 2005-03-29 | 2005-03-29 | 情報処理装置、情報処理方法及び情報処理用プログラム |
Related Child Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US11/905,085 Continuation-In-Part US20080027897A1 (en) | 2005-03-29 | 2007-09-27 | Information processing apparatus, information processing method and recording medium |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2006103801A1 true WO2006103801A1 (ja) | 2006-10-05 |
Family
ID=37053071
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/JP2005/020876 WO2006103801A1 (ja) | 2005-03-29 | 2005-11-14 | 情報処理装置、情報処理方法及び情報処理用プログラム |
Country Status (5)
Country | Link |
---|---|
US (1) | US20080027897A1 (ja) |
EP (1) | EP1868104A4 (ja) |
JP (1) | JP4635682B2 (ja) |
CN (1) | CN101147137A (ja) |
WO (1) | WO2006103801A1 (ja) |
Families Citing this family (15)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP4661429B2 (ja) | 2005-07-26 | 2011-03-30 | ブラザー工業株式会社 | 情報配信システム、情報処理装置、情報処理プログラム及び情報処理方法 |
JP4670604B2 (ja) | 2005-11-21 | 2011-04-13 | ブラザー工業株式会社 | 情報配信システム、情報処理装置、情報処理プログラム及び情報処理方法 |
JP4768537B2 (ja) | 2006-07-18 | 2011-09-07 | 株式会社リコー | コンテンツ閲覧システムおよびプログラム |
EP2229778A2 (en) * | 2007-12-11 | 2010-09-22 | Thomson Licensing | Device and method for optimizing access to contents by users |
JP4833262B2 (ja) * | 2008-07-25 | 2011-12-07 | 株式会社ドワンゴ | 情報通信端末、情報通信サーバ及びプログラム |
EP2249550A1 (en) * | 2009-05-04 | 2010-11-10 | Thomson Licensing | device and method for controlling dissemination of contents between peers having wireless communication capacities, depending on impatience reaction functions |
JP5336403B2 (ja) * | 2010-02-24 | 2013-11-06 | 富士通株式会社 | ノード装置およびコンピュータプログラム |
EP2689571B1 (en) | 2011-03-21 | 2018-10-10 | Thomson Licensing | Replicating data |
JP5750973B2 (ja) * | 2011-03-29 | 2015-07-22 | 富士通株式会社 | 通信方法および通信装置 |
JP5174221B2 (ja) * | 2011-08-08 | 2013-04-03 | 株式会社ドワンゴ | 情報通信端末及びプログラム |
JP5962269B2 (ja) * | 2012-07-09 | 2016-08-03 | 富士通株式会社 | 評価装置,分散格納システム,評価方法及び評価プログラム |
US9391881B2 (en) * | 2013-02-20 | 2016-07-12 | Ip Technology Labs, Llc | System and methods for dynamic network address modification |
JP6146279B2 (ja) * | 2013-11-28 | 2017-06-14 | 富士通株式会社 | データ配信装置及びデータ配信方法 |
FR3024315B1 (fr) * | 2014-07-25 | 2016-07-29 | Docstand | Systeme et procede de mise a disposition de fichiers informatiques. |
CN114338716B (zh) * | 2021-12-14 | 2024-02-13 | 浙江清华长三角研究院 | 一种灵活务工场景下的用户原始数据的分布式存储方法 |
Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2002082339A1 (fr) * | 2001-04-04 | 2002-10-17 | Mitsuharu Watanabe | Systeme et procede de traitement de donnees |
WO2003005654A1 (en) * | 2001-07-25 | 2003-01-16 | Koninklijke Philips Electronics N.V. | Substituting url for attachment in forwarding electronic content |
JP2003280975A (ja) * | 2002-03-25 | 2003-10-03 | Kanazawa Inst Of Technology | キャッシュ制御方法およびキャッシュシステム |
JP2004220183A (ja) * | 2003-01-10 | 2004-08-05 | Sony Corp | 情報処理装置および情報処理方法、並びにコンピュータ・プログラム |
JP2005004615A (ja) * | 2003-06-13 | 2005-01-06 | Oki Electric Ind Co Ltd | コンテンツ配信管理システム |
Family Cites Families (10)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US6256675B1 (en) * | 1997-05-06 | 2001-07-03 | At&T Corp. | System and method for allocating requests for objects and managing replicas of objects on a network |
US6189043B1 (en) * | 1997-06-09 | 2001-02-13 | At&T Corp | Dynamic cache replication in a internet environment through routers and servers utilizing a reverse tree generation |
US7233978B2 (en) * | 1998-07-08 | 2007-06-19 | Econnectix, Llc | Method and apparatus for managing location information in a network separate from the data to which the location information pertains |
US20020055972A1 (en) * | 2000-05-08 | 2002-05-09 | Weinman Joseph Bernard | Dynamic content distribution and data continuity architecture |
JP4658412B2 (ja) * | 2001-09-20 | 2011-03-23 | 富士通株式会社 | データ共有装置 |
JP2004185263A (ja) * | 2002-12-03 | 2004-07-02 | Oki Electric Ind Co Ltd | 分散協調型コンテンツ配信システム |
WO2005001713A1 (en) * | 2003-06-30 | 2005-01-06 | International Business Machines Corporation | Retrieving a replica of an electronic document in a computer network |
US7500020B1 (en) * | 2003-12-31 | 2009-03-03 | Symantec Operating Corporation | Coherency of replicas for a distributed file sharing system |
JP4239096B2 (ja) * | 2004-08-24 | 2009-03-18 | ソニー株式会社 | 情報処理装置および方法、並びにプログラム |
US7610296B2 (en) * | 2004-12-17 | 2009-10-27 | Microsoft Corporation | Prioritized files |
-
2005
- 2005-03-29 JP JP2005095639A patent/JP4635682B2/ja not_active Expired - Fee Related
- 2005-11-14 CN CNA2005800492787A patent/CN101147137A/zh active Pending
- 2005-11-14 WO PCT/JP2005/020876 patent/WO2006103801A1/ja not_active Application Discontinuation
- 2005-11-14 EP EP05805936A patent/EP1868104A4/en not_active Withdrawn
-
2007
- 2007-09-27 US US11/905,085 patent/US20080027897A1/en not_active Abandoned
Patent Citations (5)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
WO2002082339A1 (fr) * | 2001-04-04 | 2002-10-17 | Mitsuharu Watanabe | Systeme et procede de traitement de donnees |
WO2003005654A1 (en) * | 2001-07-25 | 2003-01-16 | Koninklijke Philips Electronics N.V. | Substituting url for attachment in forwarding electronic content |
JP2003280975A (ja) * | 2002-03-25 | 2003-10-03 | Kanazawa Inst Of Technology | キャッシュ制御方法およびキャッシュシステム |
JP2004220183A (ja) * | 2003-01-10 | 2004-08-05 | Sony Corp | 情報処理装置および情報処理方法、並びにコンピュータ・プログラム |
JP2005004615A (ja) * | 2003-06-13 | 2005-01-06 | Oki Electric Ind Co Ltd | コンテンツ配信管理システム |
Non-Patent Citations (1)
Title |
---|
See also references of EP1868104A4 * |
Also Published As
Publication number | Publication date |
---|---|
US20080027897A1 (en) | 2008-01-31 |
EP1868104A4 (en) | 2011-08-31 |
JP2006277337A (ja) | 2006-10-12 |
JP4635682B2 (ja) | 2011-02-23 |
CN101147137A (zh) | 2008-03-19 |
EP1868104A1 (en) | 2007-12-19 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
WO2006103801A1 (ja) | 情報処理装置、情報処理方法及び情報処理用プログラム | |
KR101523816B1 (ko) | 네트워크를 통한 하나의 디바이스에서 또 하나의 디바이스로의 파일들의 송신 | |
JP4670604B2 (ja) | 情報配信システム、情報処理装置、情報処理プログラム及び情報処理方法 | |
JP4661429B2 (ja) | 情報配信システム、情報処理装置、情報処理プログラム及び情報処理方法 | |
US8190779B2 (en) | Information processing apparatus and storing apparatus, information processing method and storing method, and recording medium that promptly and efficiently distributes content | |
US8654678B2 (en) | Node device, recording medium where storage control program is recorded, and information storing method | |
MX2012014966A (es) | Metodos y aparatos para la remocion controlada de contenido de una red distribuida. | |
US20070214175A1 (en) | Synchronization of metadata in a distributed file system | |
TW201638799A (zh) | 計算系統中之軟體影像的分佈式存儲 | |
JP4877107B2 (ja) | 情報配信システムにおける端末装置及び情報処理プログラム、並びに端末装置の情報処理方法 | |
JP2010113573A (ja) | コンテンツ分散保存システム、コンテンツ保存方法、サーバ装置、ノード装置、サーバ処理プログラム、及びノード処理プログラム | |
US10798147B2 (en) | Constraint based controlled seeding | |
US8312068B2 (en) | Node device, information communication system, method for managing content data, and computer readable medium | |
JP5487420B2 (ja) | ファイル複製要否判定方法、通信装置、コンピュータプログラム及びピアツーピア型通信システム | |
JP5458629B2 (ja) | ノード装置、ノード処理プログラム及び検索方法 | |
JP5012712B2 (ja) | コンテンツ分散保存システム、総評価値管理装置、管理処理プログラム、ノード装置、及び総評価値管理方法 | |
JP5157770B2 (ja) | ノード装置、プログラム及び保存指示方法 | |
JP2006252312A (ja) | コンテンツ管理システム及びこれに用いるプログラム | |
JP4983183B2 (ja) | ノード装置、情報分割保存システム、情報処理プログラム及び情報利用方法 | |
JP7287026B2 (ja) | 情報処理装置、ファイル管理装置、ファイル管理システム及びプログラム | |
KR101530346B1 (ko) | 분산 파일 시스템 및 방법 | |
JP2010102573A (ja) | ノード装置、ノード処理プログラム及びデータファイル改変方法 | |
JP2009129161A (ja) | コンテンツ分散保存システム、コンテンツ評価値決定方法、配信装置、及び配信処理プログラム | |
JP2009020669A (ja) | コンテンツ分散保存システム、コンテンツデータ保存方法、稼働率管理装置、及びノード装置等 | |
JP2003348561A (ja) | Vodシステム |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
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: 200580049278.7 Country of ref document: CN |
|
WWE | Wipo information: entry into national phase |
Ref document number: 11905085 Country of ref document: US |
|
NENP | Non-entry into the national phase |
Ref country code: DE |
|
WWW | Wipo information: withdrawn in national office |
Country of ref document: DE |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2005805936 Country of ref document: EP |
|
NENP | Non-entry into the national phase |
Ref country code: RU |
|
WWW | Wipo information: withdrawn in national office |
Country of ref document: RU |
|
WWP | Wipo information: published in national office |
Ref document number: 2005805936 Country of ref document: EP |
|
WWP | Wipo information: published in national office |
Ref document number: 11905085 Country of ref document: US |