WO2004049667A1 - 情報処理装置および情報処理方法、並びにコンピュータ・プログラム - Google Patents
情報処理装置および情報処理方法、並びにコンピュータ・プログラム Download PDFInfo
- Publication number
- WO2004049667A1 WO2004049667A1 PCT/JP2003/014637 JP0314637W WO2004049667A1 WO 2004049667 A1 WO2004049667 A1 WO 2004049667A1 JP 0314637 W JP0314637 W JP 0314637W WO 2004049667 A1 WO2004049667 A1 WO 2004049667A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- data
- processing
- information
- request
- demand
- Prior art date
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F15/00—Digital computers in general; Data processing equipment in general
- G06F15/16—Combinations of two or more digital computers each having at least an arithmetic unit, a program unit and a register, e.g. for a simultaneous processing of several programs
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
- H04N21/60—Network structure or processes for video distribution between server and client or between remote clients; Control signalling between clients, server and network components; Transmission of management data between server and client, e.g. sending from server to client commands for recording incoming content stream; Communication details between server and client
- H04N21/63—Control signaling related to video distribution between client, server and network components; Network processes for video distribution between server and clients or between remote clients, e.g. transmitting basic layer and enhancement layers over different transmission paths, setting up a peer-to-peer communication via Internet between remote STB's; Communication protocols; Addressing
- H04N21/643—Communication protocols
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/38—Flow control; Congestion control by adapting coding or compression rate
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L65/00—Network arrangements, protocols or services for supporting real-time applications in data packet communication
Definitions
- the present invention relates to an information processing apparatus, an information processing method, and a computer program. More specifically, data (contents) distributed and stored in a plurality of nodes (information processing devices) connected via a network or the like, or data stored in a specific node, for example, a server, is transmitted and received via the network.
- the present invention relates to an information processing apparatus and an information processing method capable of performing data reproduction with enhanced transmission efficiency by executing a plurality of different transmission schemes in combination in accordance with a situation in the configuration, and a computer program.
- various information processing devices for example, personal computers (PCs), large-scale computers, servers, and other communication devices have been connected to a communication network such as the Internet.
- Content such as data, voice data, or various programs, or various processed data is being transferred.
- the type of content exchanged via the network is shifting from text and still images to multimedia content such as video and audio, and the capacity of content is increasing significantly.
- a large-scale storage system that records certain data in a distributed manner to a large number of information processing terminals connected to each other via a network has attracted attention.
- a server that records and manages data transmits data to an information processing terminal or another server by multicast or the like, and transmits the data to a local server provided in the information processing terminal or another server.
- On a storage medium I I have. In this case, in order to be able to retrieve data on demand, a large amount of data must be recorded on a recording medium.
- a capacity of 1 terabyte or more is required.
- TCP / A protocol that requests retransmission of data such as an IP arrival signal (ACK)
- ACK IP arrival signal
- a P2P network is not a server that performs centralized processing, but an information processing device as a resource possessed by each network client, such as Pc, mobile terminal, PDA, mobile phone, and communication.
- Various devices such as disk devices or printers, which have processing functions or are connected as storage means connected to communication devices, can communicate with each other via a network, and can share the resources of each network client. This is the configuration.
- Peer-to-peer (P2P: Peer-to-Peer) network technology is the first to be used in APPN (Advanced Peer to Peer Networking), which is the US company's power company. Have been.
- Peer-to-peer The (p 2 p p ee r- to- Peer) network, "Pure (Pure) peer 'Two' peer (P 2 P: Peer - to -Peer) network" and "hybrid There are two types of networks: hybrid peer-to-peer (P2P: Peer-to-Peer) networks.
- Pure peer-to-peer (P2P: Peer-to-Peer) network Is a network form in which each component (peer) of the system has the same function and role, and performs equal communication.
- a typical service using it is Gnuterlla.
- a hybrid peer-to-peer (P2P: Peer—to—Peer) network is a pure (P2P) peer-to-peer (P2P) network. This is a network configuration that uses a control server to facilitate the interaction between each component of the system (peer). Napster is one of the typical services that use it.
- Hybrid P2P Hybrid P2P
- a network-connected terminal when a network-connected terminal tries to acquire content, it first searches for content resources on a central server, Based on the search information, the terminal accesses the node (other network connection terminal) holding the resource and acquires the content.
- the terminal it is necessary to register resource information of all nodes in the central server, and furthermore, the search is concentrated on the central server. Therefore, a method has been proposed in which processing such as resource search is executed by being distributed to a plurality of devices.
- devices for determining processing execution are managed by a method such as arranging them in a tree-like relationship, and processing such as resource search is distributed to a plurality of devices and executed based on management information. is there.
- processing such as resource search is distributed to a plurality of devices and executed based on management information.
- Carousel transmission takes its name from the carousel, a method of repeatedly transmitting data.
- This method if multicast is used, the ability to transmit data to a very large number of playback instruction devices S, and data cannot be taken out at an arbitrary timing. The only alternative was to reduce the waiting time by increasing the number of repetitions per hour.
- This carousel method is efficient when the number of simultaneous players is large, but cannot satisfy both real-time performance and playback at an arbitrary timing. Also in this method, transmission loss such as duplication of packets is small.
- Cheung Jung there is a method called Cheung Jung.
- Chaining means that when there is a node that has just received some data from another node, it does not request data from the original node, but connects to the node that just received the data and transfers it. It is a technique to get. Although it is not known whether there is data surely in the first Jung, if a small number of playback instruction devices use specific data, efficient data transmission is realized without increasing the network load. However, when many playback devices are connected, the carousel transmission method is more efficient. In addition, a fourth method is to secure a large number of caches locally. In other words, in the apparatus that executes the reproduction, all the data is cached. However, when such a cache method is used, it is not practical unless the capacity of the low-level storage device is considerably large.
- the network load at the time of reproduction is practically zero, but there is a problem that the network load at the time of distribution is the largest of all methods.
- DISCLOSURE OF THE INVENTION As described above, there are various data transmission methods, all of which have an advantage. There is a disadvantage, and it can be said that an appropriate method differs depending on the situation.
- An object of the present invention is to provide an information processing apparatus and an information processing method capable of reproducing data, and a computer program.
- the storage means installed in a plurality of network-connected terminals (nodes) for performing data processing such as content reproduction processing.
- a content playback request is transmitted based on a predetermined rule without performing a process such as a node search in advance, and a terminal (node) receiving the request autonomously issues a command.
- Is configured to selectively execute instructions by judging whether or not to execute them, thereby enabling efficient data processing while suppressing an increase in network traffic due to the transfer of many packets. It is an object of the present invention to provide an information processing apparatus and an information processing method, and a computer program. According to a first aspect of the present invention,
- An information processing device serving as a playback instruction device that transmits a data playback process request to a node connected to the network and executes a data playback process based on return data;
- a data transmission rate setting unit that selects one or more data transmission methods to be applied as a return data transmission method from a plurality of data transmission methods and determines a data transmission rate of each selected method
- a network interface unit for transmitting the packet generated by the packet generation unit An information processing apparatus characterized by having: Further, in one embodiment of the information processing apparatus of the present invention, the data transmission rate setting unit selects a data transmission method based on a demand level of data to be reproduced and determines a data transmission rate of each selected method. It is characterized by having a configuration. Further, in one embodiment of the information processing apparatus according to the present invention, the data rate setting unit includes a data transmission method including at least one of a carousel transmission method, a checking transmission method, a distributed cache method, and a client server method. The transmission method is selected, and the data transmission rate of each selected method is determined.
- the data transmission rate setting section has data corresponding to the demand of the data to be reproduced and the band ratio as the data transmission rate of the applicable data transmission method. Then, according to the corresponding data, the data transmission system is selected based on the demand level information of the reproduction target data, and the data transmission rate of each selected system is determined. Further, in one embodiment of the information processing apparatus of the present invention, the data transmission rate setting unit includes: a demand level: X, a bandwidth ratio for each transmission mode: y, and an identification value of each data transmission mode: n.
- the information processing apparatus further includes a data restoration processing unit that executes a deinterleaving process and an FEC decoding process, and the data restoration processing unit includes the data restoration processing unit. It is characterized in that it is configured to execute the data leaping process and the FEC decoding process on the data to be reproduced extracted from the packet received from the node that has received the reproduction processing request, and perform data restoration. Further, in one embodiment of the information processing device of the present invention, the information processing device further includes a process for determining whether or not to execute a process according to the processing request at a node that receives the data reproduction processing request. Set the applicable judgment data
- a packet determining unit that stores the determination data set by the rule determining condition setting unit and a data reproduction request packet that stores instruction data of data to be reproduced; It is characterized in that it is configured to generate Further, in one embodiment of the information processing apparatus of the present invention, the rule determination condition setting unit is adapted to determine whether or not a node receiving the data reproduction processing request performs a process according to the processing request.
- the packet generation unit generates a bucket storing the probability value: 0 as the reproduction rule determination condition description. It is characterized in that it is configured to execute processing.
- the data to be reproduced stored in the node is obtained by dividing the data into p blocks, performing p-block FEC encoding, and q-blocks.
- the rule determination condition setting unit is a probability value for returning the data with a return probability: ⁇ at a node receiving the data reproduction processing request.
- ⁇ is set as a playback rule determination condition description, and a recording probability specified by a recording instruction device connected to the network: ⁇ , and the number of encoded blocks:
- the probability value: ⁇ is set so that the number: ⁇ .
- a second aspect of the present invention is:
- a communication unit for transmitting and receiving data to and from a network connection node
- the number of demand information acquisition requests received from a network connection node via the communication unit is counted, demand information corresponding to each data is generated based on the count information, and the demand information is generated based on the generated demand information.
- the control unit when the data corresponding demand based on the count information is equal to or greater than a preset threshold, the carousel transmission execution node, It is characterized in that it has a configuration for executing transmission control of a carousel transmission processing request for data corresponding to a demand level that is equal to or greater than a threshold.
- the control unit includes, in the carousel transmission processing request, an identifier of data to be executed for carousel transmission, and a source node address of the received demand information acquisition request. It is characterized by executing processing for storing destination address information of carousel transmission set based on the information.
- the data transmission rate setting step includes a step of selecting a data transmission method based on a demand level of the data to be reproduced and determining a data transmission rate of each selected method. It is characterized by including. Further, in one embodiment of the information processing method according to the present invention, the data rate setting step includes at least one of a carousel transmission method, a checking transmission method, a distributed cache method, and a client server method. It is characterized by including the process of selecting the data transmission method to be included and determining the data transmission rate of each selected method.
- the data transmission rate setting step includes the step of setting the data transmission rate according to the data corresponding to the demand of the data to be reproduced and the bandwidth ratio as the data transmission rate of the applicable data transmission method.
- the method is characterized in that a data transmission method is selected based on data demand information and a data transmission rate determination process of each selected method is executed.
- the information processing method further includes a data restoration process step of executing a dinterleaving process and an FEC decoding process, and the data restoration process step includes the data reproduction process. It is characterized in that the data is restored by executing the deinterleaving process and the FEC decoding process on the reproduction target data extracted from the packet received from the node that received the request. Further, in one embodiment of the information processing method according to the present invention, the information processing method further includes a process for determining whether or not to execute a process according to the processing request at a node receiving the data reproduction processing request.
- the data to be reproduced stored in the node is obtained by dividing the data into ⁇ blocks, subjecting the ⁇ blocks to FEC coding, and Encoding processing data at an encoding rate q / p converted to a block of the above-mentioned block.
- the rule determination condition setting step is a probability value for returning data with a return probability of 13 at a node receiving the data reproduction processing request.
- ⁇ is set as a description of the playback rule determination condition, and can be calculated by the recording probability specified by the recording instruction device connected to the network: ⁇ , and the number of encoding blocks: q, and the number of network connection nodes: n
- the relationship between the number of reply blocks: qXaXnX ⁇ > the number of blocks: p is set to the probability value: And wherein the door.
- An information processing method in a demand information providing device that provides demand level information of transmission data via a network.
- An information processing method comprising: Further, in one embodiment of the information processing method of the present invention, the information processing method further includes a step of: On the other hand, demand The method includes a step of executing transmission control of a carousel transmission processing request for data corresponding to the degree of necessity. Further, in one embodiment of the information processing method of the present invention, the information processing method further includes an ' The method includes a step of executing a process of storing destination address information of carousel transmission set based on the node address information. Further, a fifth aspect of the present invention provides
- a computer program that sends a data playback processing request to a node connected to the network and executes data playback processing based on the return data.
- the computer is characterized by having a program. Further, a sixth aspect of the present invention provides
- a computer that executes processing to provide information on the degree of demand for transmission data transmitted over a network.
- a computer program According to the configuration of the present invention, a data reproduction processing request is transmitted to a node connected to the network, and the data reproduction processing is performed based on the return data. Then, one or more data transmission methods to be applied as data transmission methods are selected, and the data transmission rate of each selected method is determined, and data transmission is performed according to the determined transmission method. It is possible to select and combine data transmission methods from the transmission method, the chaining transmission method, the distributed cache method, the client server method, etc., and data transmission by the efficient and reliable data transmission method is realized. According to the configuration of the present invention, when executing the reproduction process, the instruction device has correspondence data between the demand of the data to be reproduced and the band ratio as the data transmission rate of the applicable data transmission method.
- a demand information providing device for providing demand information of transmission data via a network is configured, and the number of demand information acquisition requests received from a network connection node is counted. Since it is configured to generate and provide demand information corresponding to each data based on the information, it is possible to grasp the demand information in real time and provide the latest demand information.
- the data handling demand based on the force information measured by the demand information providing device that provides the demand information of the transmission data via the network is equal to or greater than a preset threshold.
- the carousel transmission execution node is configured to execute transmission control of carousel transmission processing requests for data corresponding to the demand level that is equal to or higher than the threshold value.
- Appropriate data transmission control is realized.
- the computer program of the present invention is, for example, a storage medium or a communication medium provided in a computer-readable format for a general-purpose computer system capable of executing various programs' codes, for example, a CD, FD, MO, etc.
- FIG. 1 is a diagram illustrating an example of the configuration of a distributed storage system to which the present invention can be applied.
- FIG. 2 is a diagram illustrating an example of a network configuration to which the present invention can be applied.
- Figure 3 is a diagram illustrating the configuration of an information processing device (node) connected to the network.
- FIG. 4 is a diagram illustrating the configuration of the recording instruction device.
- FIG. 5 is a diagram illustrating FEC encoding processing and interleaving processing of data executed in the recording instruction device.
- FIG. 6 is a diagram illustrating a configuration of a data recording processing request packet transmitted from the recording instruction device.
- FIG. 7 is a diagram for explaining a process of transmitting a data recording process request packet from the recording instruction device to the node.
- FIG. 8 is a flowchart illustrating a processing procedure including an autonomous processing execution determination processing in a node that has received a data recording processing request packet from the recording instruction device.
- FIG. 9 is a flowchart illustrating a processing procedure including an autonomous processing execution determination processing in a node that has received a data recording processing request bucket from the recording instruction device.
- FIG. 10 is a diagram illustrating an example of a hash value generated in an autonomous process execution determination in a node that has received a data recording process request packet from a recording instruction device.
- FIG. 11 is a diagram illustrating the configuration of the playback instruction device.
- FIG. 12 is a diagram illustrating the configuration of a data reproduction processing request packet transmitted from the reproduction instruction device.
- FIG. 13 is a diagram illustrating a configuration of a packet transmitted from the node that has received the data reproduction processing request packet to the reproduction instruction device.
- FIG. 14 is a diagram for explaining data dinterleaving and FEC decoding performed in the playback instruction device.
- FIG. 15 is a diagram illustrating a process of transmitting a data reproduction processing request packet from a reproduction instruction device to a node.
- FIG. 16 is a diagram illustrating a process of transmitting a data storage packet from a node that has received a data reproduction processing request bucket from the reproduction instruction device.
- FIG. 17 is a flowchart illustrating a processing procedure including an autonomous processing execution determination processing in a node that has received a data reproduction processing request packet from the reproduction instruction device.
- FIG. 18 is a flowchart illustrating a processing procedure including an autonomous processing execution determination process in a node that has received a data reproduction processing request packet from a reproduction instruction device.
- FIG. 19 shows the data recording processing request from the recording instruction device, the data recording processing at the node, the data reproduction processing request from the reproduction instruction device, the data extraction and transmission processing at the node, and the reproduction processing at the reproduction instruction device.
- FIG. 4 is a sequence diagram to be described.
- FIG. 20 is a diagram illustrating a configuration example of the reproduction instruction device.
- FIG. 21 is a diagram for explaining a process of transmitting a reproduction processing request (command) bucket to each node connected to the network.
- FIG. 22 is a diagram showing a state in which data is transmitted from each node to the reproduction instruction device as a reply to a reproduction processing request (command) packet.
- FIG. 23 is a diagram illustrating a method in which the reproduction instruction device acquires data necessary for reproduction and characteristics of each method.
- FIG. 24 is a diagram illustrating the effect of bandwidth reduction by using carousel transmission and other transmission methods together.
- FIG. 25 is a diagram showing an example of an address table applied to set a multicast address according to the distance from the playback instruction device.
- FIG. 26 is a diagram illustrating an example of an address table in which data (content) IDs and data transmission node addresses are set.
- FIG. 28 is a diagram illustrating an example in which a demand information providing device that provides demand degree information is set on a network.
- FIG. 9 is a diagram illustrating a series of processing sequences of issuing a data reproduction processing request to a node, extracting data at the node, and transmitting a packet.
- FIG. 30 is a flowchart showing a detailed processing procedure from “inquiry of demand” to “restoration of processed data” of the reproduction instruction device.
- FIG. 31 is a diagram illustrating a processing sequence in which the demand information providing device detects an increase in the demand for content and performs control to start carousel transmission based on the detected information.
- FIG. 32 is a diagram illustrating an example of a hardware configuration of the information processing apparatus of the present invention.
- BEST MODE FOR CARRYING OUT THE INVENTION an information processing apparatus, an information processing method, and a computer program according to the present invention will be described in detail with reference to the drawings. The description will be made in the following order.
- FIG. 1 is a diagram showing a specific example of a distributed storage system for distributing and recording data on terminals constituting a network.
- the distributed storage system instructs n nodes 1 1 1 1 1 1 2 ... It has a recording instruction device 101 to be controlled and a reproduction instruction device 102 to read data recorded in each node.
- the recording instruction device 101, each of the nodes 111 to 115, and the reproduction instruction device 102 are described as separate devices, but the functions of these two devices are provided. There may be a device such as a recording / playback instruction device that performs the operation. Also, each of the nodes can be provided with a function as a recording instruction device or a reproduction instruction device. In this case, each device constituting the network can be used without distinction.
- the recording instruction device, the reproduction instruction device, and the node are collectively called an information processing device. That is, a network configuration as shown in FIG. 2 can be assumed.
- the information processing device has a configuration capable of communicating with another information processing device and is connected by a communication network.
- the network is a pure peer-to-peer (P2P: Peer-to-Peer) network without a control server as a look-up server. is there.
- P2P peer-to-peer
- the information processing devices 12 1 to 12 26 communicate with each other via the network 110 and execute various types of data processing such as content recording processing and content reproduction processing.
- the present invention can be applied to a hybrid peer-to-peer (P2P: Peer-to-Peer) network in which a control server is present.
- the configuration is not limited and can be applied as long as the information processing apparatuses can communicate with each other.
- a recording request processing request packet in which a multicast address is set based on a predetermined rule is generated, and the content is subjected to FEC (Forward Error Correction) and the interleave processing is performed. It is stored as divided data and transmitted to other information processing devices.
- the information processing device that receives these packets autonomously determines whether to execute the data recording process, and performs the content recording process based on the determination.
- one of the information processing apparatuses 121 to 126 sends a content playback request to another information processing apparatus, for example, a request packet in which a multicast address based on a predetermined rule is set. Generate and send.
- the information processing device that receives these packets autonomously determines whether or not to execute data extraction processing, performs content extraction processing based on the determination, and extracts data extracted according to the request, for example, FEC (Forward Error). Correction) and the interleaved divided data are stored in a packet and transmitted to the playback request information processing device.
- transmission control devices such as routers that constitute a network are omitted in FIGS. 1 and 2, in practice, transmission control devices such as routers that select a route of a packet passing through a node are used. Is provided.
- the transmission control device may be provided separately from the node, or the node may have a function as the transmission control device.
- FIG. 3 is a diagram illustrating a configuration of an information processing device that functions as a node.
- the information processing device (node) 200 has a rule determination processing unit 201, a data processing unit 202, a packet processing unit 203, and a data transmitting / receiving unit 204. I do.
- the data transmission / reception unit 204 outputs a transmission bucket to another information processing device connected via a network, and executes a process of inputting a reception packet from another information processing device.
- the packet processing unit 203 performs a process of generating a packet to be transmitted from the own device to another information processing device connected to the network, a process of analyzing a packet received from another information processing device, and the like.
- the data processing unit 202 executes a process according to a data processing program stored in each information processing device. For example, data processing based on a data processing request from another information processing device such as a recording instruction device or a reproduction instruction device connected to the network. This is a process of extracting the packet and outputting it to the packet processing unit 203. In the case of a content recording request, this is a process of inputting and storing input content in the storage unit 205.
- the rule determination processing unit 201 is a processing unit that executes processing unique to the information processing apparatus of the present invention, and has a probability value of ⁇ or 0 as [rule determination condition description] described in the input packet.
- Data processing based on the packet for example, data reception and storage processing in the storage unit as processing corresponding to the data recording instruction, or data extraction from the storage unit as processing corresponding to the data reproduction instruction. And a transmission process, and a process of determining whether or not to execute these processes.
- the probability of executing the recording command is set as ⁇
- the probability of executing the playback command is set as 0. The value is set.
- the rule determination processing unit 201 of each node determines whether or not to execute the reproduction instruction based on the probability: As described above, in the reproduction command, since the command is executed only at a certain probability at each node, packet loss occurs. By setting the probability that the replay command is executed so that a sufficient number of packets are sent from multiple distributed nodes in total, this can be combined to form an FEC (Forward Error Collect error) based on the original data.
- FEC Forward Error Collect error
- FIG. 4 is a diagram showing a configuration of the recording instruction device 250.
- the recording instructing device 250 is a data input unit 251, which inputs recording processing request data (contents) to a plurality of nodes, such as FEC (Forward Error Collection) encoding, and interleave processing for encoded data.
- the data processing unit 252 that executes data processing, the probability value as the above [rule determination condition description]: the rule determination condition setting unit that sets ⁇ , the processing data generated by the data processing unit 252,
- the rule judgment condition setting section 25 stores the rule judgment condition description set in 3 and the packet generation section 2 54 that generates a packet with an address set, and connects to the network.
- the FEC coding is a general term for coding methods that perform error correction on the receiving side, such as a tornado coding method, a lead tornado coding method, and a turbo coding method.
- the data input from the input unit 251 is divided into p blocks, and the p blocks are subjected to FEC coding to be converted into q blocks. Coding from the p blocks into q blocks is called coding rate qp, and by changing the coding rate qZp, the recording efficiency and the recording efficiency of this distributed storage system can be improved. Transmission efficiency can be changed You.
- the interleaving process is a process of rearranging the order of encoded data. By interleaving, the data can be dispersed so that the burst error caused by packet loss becomes a random error.As a result, the lost data part can be corrected by error correction according to FEC. Become.
- FEC encoder processing and the interleaving processing will be described with reference to FIG.
- Fig. 5 (a) the input original data is divided into p blocks.
- FIG. 5 (b) FEC encoding is performed at an encoding rate of q / p, and the data divided into p blocks is converted into q encoded blocks.
- FEC coding is a general term for coding methods that perform error correction on the receiving side, such as tornado coding, read tornado coding, and turbo coding, and use FEC coding.
- the FEC-coded data undergoes an interleaving process as shown in FIG. 5 (c).
- the order of the encoded data is rearranged to distribute the data.
- the data subjected to the interleap processing is output to the rule determination condition setting unit 253, and a probability value: ⁇ is set as the above [rule determination condition description].
- the setting process of the probability value: ⁇ as the [rule determination condition description] is set in relation to the above-described processing of the data adding unit.
- the data processing unit divides the data into ⁇ blocks, applies FEC coding to the generated ⁇ blocks, and performs q blocks.
- the rail judgment condition setting unit 25 3 sets the recording probability at the node that receives the data recording processing request to the probability of recording data with ⁇ .
- ⁇ is set as the recording rule determination condition description, and the return probability specified by the playback instruction device 102 (see FIG. 1) connected to the network (see FIG. 1): ⁇ , and the number of encoded blocks: q,
- the packet generation unit 254 divides the processing data generated by the data processing unit 252 into a predetermined size, stores the rule determination condition description set by the rail determination condition setting unit 253, and sets the end address. It generates a packet to which a header and a footer are added, and transmits the packet through the network interface 255. The packet is transmitted to each node configuring the distributed storage system using address setting according to the transmission node, that is, using multicast or multicast.
- FIG. 6 is a diagram showing the structure of the packet 40 generated by the packet generator 254.
- the packet consists of a header, a description of the recording rule judgment condition, a payload, and a footer.
- the payload stores the processed data (processed content) that has been subjected to the FEC encoder processing and the interleave processing.
- control information such as data ID indicating the data type, CRC (Cyclic Redundancy Check) checksum, GU ID (Global Unique ID) as the unique identifier of the packet destination node, and network address are described. It has been.
- Each node described later records this packet in the recording rule determination condition description. Probability: ⁇ is described.
- the rule determination processing unit 201 of the node receiving the bucket (see FIG. 3) records the packet based on the recording probability ct.
- All nodes constituting the distributed storage system determine whether to record a packet based on the recording probability. As a result, data is recorded with a probability ⁇ on the nodes that constitute the distributed storage system.
- data is recorded with a probability ⁇ on the nodes that constitute the distributed storage system.
- the recording rule judgment condition description was stored in a packet different from the bucket storing the processed content
- the link information of the packet storing the recording rule judgment condition description was stored in the bucket storing the processed content
- the processed content was stored.
- a configuration may be adopted in which the node that has received the packet acquires the corresponding recording rule determination condition description storage packet based on the link information.
- FIG. 7 is a diagram for explaining a process of transmitting the data recording processing request packet shown in FIG. 6 as a data recording command from the recording instruction device 101 to the plurality of nodes 111 to 115.
- the recording instructing device uses the processed data subjected to the FEC processing and the interleave processing described in FIG. 6 as a payload, and further, a packet in which a probability value: ⁇ as a rule judgment condition description is set for each node. Transmits a multicast or manoretic cast.
- step S101 a data recording processing request bucket is waited for. If it is determined in step S102 that a packet has been received, random number generation processing is executed in step S103, and in step S104, the generated random number and the data recording processing request packet are included. Description of the stored recording rule judgment condition: Compares with the probability ⁇ , and judges whether the instruction is executed or not based on the comparison result. For example, if the generated random number> probability ⁇ , the processing for recording the processed data stored as the payload of the packet in its own storage means is executed, and if the generated random number probability ⁇ , the data recording processing is not executed.
- the random numbers generated at each node are packets to all nodes when the number ⁇ of nodes constituting the distributed storage system is sufficiently large and the number q of decoded blocks is sufficiently large. Are uniformly recorded, and the range of the generated random numbers is set so that data is recorded with the probability of ⁇ as a whole of the distributed storage system. If it is determined that the data recording processing request should be executed as a result of the comparison processing based on the random number in step S104, the process proceeds to step S105, in which the processed data stored as the payload of the bucket is processed. Execute the extraction process, and
- a process for recording the extracted data in the storage means of (node) is executed.
- the process proceeds to step S106, and the processing ends without executing the data recording processing.
- the information processing apparatus that has received the data recording processing request (command) autonomously executes and non-executes the command based on the comparison between the recording rule determination condition description stored in the packet and the random number. Judge and perform the process according to the judgment.
- the information processing apparatus that has received the data recording processing request calculates a hash value, and autonomously decodes the hash value based on the hash value.
- step S201 the process waits for a data processing request bucket.
- step S202 a hash value generation process based on the data stored in the received bucket is performed. Is executed, and in step S204, execution or non-execution of an instruction is determined based on the generated hash value.
- the information processing device stores a set value as a preset threshold value in the storage unit, and if the generated hash value is greater than the set value, the instruction execution, the generated hash value
- the setting value is ⁇ , set the instruction to be non-executable.
- the data stored in the data processing request packet for which the hash value is to be generated is, for example, an identifier (data ID) of the content data or a part of the data, for example, from the beginning of the data.
- data ID an identifier
- n predetermined
- MD5 can be applied.
- a hash value of MD5 of data ID or a hash value of MD5 of data content is generated.
- step S204 If it is determined that the data recording processing request should be executed as a result of the determination based on the hash value in step S204, the process proceeds to step S205, where the processed data stored as the payload of the packet is processed. The extraction process is executed, and the process of recording the extracted data in the storage means of the own device (node) is executed. On the other hand, if it is determined that the data recording processing request is not to be executed as a result of the comparison processing based on the hash value, the process proceeds to step S206, and the processing ends without executing the data recording processing.
- the information processing apparatus that has received the data recording processing request (command) receives the data recording processing request (instruction) and compares the hash value of the data stored in the packet with the setting value of each node. And autonomously determines the execution or non-execution of an instruction, and performs processing according to the determination.
- FIG. 11 is a diagram showing a configuration of the reproduction instruction device 270.
- the playback instruction device 270 is a network interface 271 that transmits and receives data to and from the outside via a network, and generates a packet for requesting a node to transmit playback data specifying playback target data.
- a rule determination condition setting unit 273 that determines a probability value: 1 as [rule determination condition description] to be set in the data request packet.
- the network interface 271 receives the playback data storage packet from each node, and the bucket processing unit 274 of the playback instruction device 270 performs processing for combining the data divided into packets.
- the data restoration processing unit 275 executes the data interleaving process and the FEC decoding process of the data extracted from the received packet, and executes the restoration of the content data.
- the restored data is input to the data processing unit 276 and output to an external device such as a monitor (not shown) or stored in a recording device (not shown).
- the data request packet generator 272 transmits a packet requesting data to each node constituting the distributed storage system.
- FIG. 12 is a diagram showing a configuration of a packet requesting data.
- the packet is composed of a header, a description part of the playback rule judgment condition, a request description part, and a footer.
- a data ID for identifying the requested data is recorded in the request description part.
- Control information such as CRC checksum, node network address and GUID, and sequence number indicating data order are recorded in the header and footer.
- the playback rule determination condition description part contains the return determined by the rule determination condition setting part 273.
- Transmission probability (Set to 8. The transmission probability is a variable used to determine whether the node that received the packet returns data. Based on this variable, it is determined that data is returned. Some nodes determine that no data is returned, while others determine that data is not returned. However, the return probability is a value when the entire distributed storage system is viewed as a macro. Return probability is 3.
- the packet processing unit 274 combines the packets returned from the nodes, and Fig. 13 is a diagram showing the data structure of the packets returned from the nodes. As shown The packet is composed of a header, a payload, and a footer. In the pay mouth, the data extracted from the storage unit by each node, that is, the data block subjected to the FEC processing and the interleave processing described above with reference to FIG.
- control information such as a CRC checksum, a network address of the receiving node, a sequence number indicating a packet order, and the like are received by the playback instruction device shown in FIG.
- the packet processor 274 performs packet analysis, reads the sequence number, changes the order of the received buckets, removes control information such as the header and footer, and combines the packets in the order of the sequence numbers.
- the data restoration processor 275 5 interpolates the received data block by dinter leaping and arranges the data sequence Was further Dinta performs FEC decoding on one sleep has been de one data, to recover the original data.
- the data restoration processing based on the FEC and the Dinter Leap processing will be described with reference to FIG.
- Fig. 14 (a) received packets from each node In this case, loss occurs on the network, and the received data block and the lost data block are mixed.
- the received data block is subjected to FEC coding at a coding rate of qZp, and the data divided into p blocks is converted into q coded blocks. This is the converted block data.
- the data restoration processing unit 275 in the playback instruction device first applies the interleaving to the received data block, arranges the data arrangement, and generates the interleaved processing data shown in FIG. 14 (b). .
- the data restoration processing unit 275 performs error correction by FEC on the dinterleave processing data shown in FIG. 14 (b), and generates restored data shown in FIG. 14 (c).
- FEC coding is a general term for coding methods that perform error correction on the receiving side, such as tornado coding, read tornado coding, and turbo coding, and uses FEC coding.
- the data restored by the data restoration processing unit 275 is output to the data processing unit 276.
- the data processing unit 276 stores the decrypted data in a recording unit (not shown) or outputs the data to an output unit such as a monitor speed via an output interface. And output.
- the distributed storage system is a system in which data is recorded in each node with a recording probability ⁇ , and data recorded in each node is returned with a return probability of 3, and the recording instruction device shown in FIG.
- the original data output from 101 is returned at the rate of aXnX0. For example, if p blocks are coded into q blocks, q X a X n X] 3 blocks are returned. If the number of returned blocks is larger than the number p of blocks before decoding, the data can be decoded, as described in the above-mentioned paper RIZZ 097.
- the rule determination condition setting unit 273 in the playback instruction device 270 is configured to convert the data to be played back stored in the node into q blocks by performing FEC encoding on p blocks.
- the recording probability specified by the recording instructing device connected to the network one return probability: i3 and p, q, and the number of coding blocks: q
- the probability of packet loss during data recording, output, or transmission is a, ⁇ , ⁇ q / so that a X n X a X q X / 3 is sufficiently larger than P.
- p the probability of packet loss during data recording, output, or transmission
- a sufficient number of data are returned.
- the number of unique packets returned from multiple nodes is mathematically estimated, and the probability of arrival of unique packets can be increased by increasing the recording probability, return probability, or coding rate. it can.
- the packet is transmitted. A description will be given of a playback processing procedure in which the mode that receives the content autonomously determines whether to extract and transmit the content and executes the processing.
- FIG. 15 illustrates a process of transmitting the data reproduction processing request packet shown in FIG. 12 as a data reproduction command from the reproduction instruction device 102 to the plurality of nodes 111 to 115.
- FIG. The playback instructing device sets the identifier of the playback designation data, for example, content ID, GUID, etc., as the request description, and further sets the probability value:
- Fig. 16 shows the data playback processing, that is, the node receiving the data playback processing request bucket shown in Fig. 12 according to the playback command, that is, reading specified data from its own storage unit, generating a packet, and transmitting a packet.
- step S301 a data reproduction processing request packet is waited, and when it is determined in step S302 that a packet has been received, in step S303, a random number generation process is executed.
- step S304 the generated random number is compared with the reproduction rule judgment condition description: probability stored in the data reproduction processing request packet, and execution or non-execution of an instruction is determined based on the comparison result. . For example, if the generated random number> probability i3, the specified content stored in its own storage means is extracted, and a packet with the extracted data as the payload (see Fig. 13) is generated. Then, processing to be transmitted to the reproduction instruction device is executed, and if the generated random number ⁇ probability / 3, the data reproduction processing is not executed.
- step S304 If it is determined that the data reproduction processing request should be executed as a result of the comparison processing based on the random number in step S304, the process proceeds to step S305, where the request is stored in the storage means of the own device (node). The extracted data is extracted, a packet with the extracted data as a payload (see Fig. 13) is generated, and the packet is transmitted to the playback instruction device. On the other hand, if it is determined that the data reproduction processing request is not to be executed as the comparison processing result based on the random number, the process proceeds to step S306, and the processing ends without executing the data reproduction processing.
- the information processing device that has received the data reproduction processing request autonomously executes and non-executes the instruction based on a comparison between the reproduction rule determination condition description stored in the packet and the random number. Judge and perform the process according to the judgment.
- the information processing apparatus that has received the data reproduction processing request calculates a hash value, and autonomously executes the data reproduction processing request based on the hash value. The process of determining execution will be described. First, in step S401, a data reproduction processing request packet is waited for, and when it is determined in step S402 that a packet has been received, in step S403, based on the data stored in the received bucket.
- a hash value generation process is executed, and in step S404, execution or non-execution of an instruction is determined based on the generated hash value.
- the information processing apparatus stores a preset set value as a threshold value in the storage unit, and executes the instruction if the generated hash value is greater than the set value, and executes the instruction if the generated hash value is the set value. Make settings such as execution.
- the data for which the hash value is to be generated is, for example, the content data identifier (data ID) shown in FIG. 10 or a part of the data, for example, from the beginning of the data as shown in FIG.
- data ID content data identifier
- MD5 can be applied to the hash value calculation.
- a hash value based on the MD5 of the data ID or a hash value based on the MD5 of the data content is generated. If it is determined that the data recording processing request should be executed as the determination result based on the hash value in step S404, the process proceeds to step S405, where the data is stored in the storage means of the own device (node). It executes the process of extracting the processed data, generates a packet with the extracted data as the payload (see Fig. 13), and sends it to the playback instruction device. On the other hand, if it is determined that the data reproduction processing request is not to be executed as the comparison processing result based on the hash value, the process proceeds to step S406, and the processing ends without executing the data reproduction processing.
- the information processing apparatus that has received the data reproduction processing request (command) autonomously executes the command based on the comparison between the hash value of the data stored in the packet and the set value of each node. , Determine non-execution and perform processing according to the determination. [5. Data recording / playback processing sequence]
- the recording instruction device issues a data recording processing request to the node, the node performs data recording processing, the reproduction instruction device issues a data reproduction processing request to the node, and the node extracts data.
- a series of processing sequences of the bucket transmission processing will be described together.
- the recording instruction device executes processing of recording target data (contents), that is, FEC processing and interleave processing. This process is the process described above with reference to FIG.
- step S12 the recording instruction device executes a data recording processing request (instruction) packet generation process.
- the data subjected to the interleave processing is stored as a payload, and the packet in which the probability value: ⁇ is set as the [rule determination condition description] determined in the rule determination condition setting unit 25 3 (see FIG. 4). Generate.
- the recording instruction device transmits an address to each node configuring the distributed storage system using an address setting corresponding to the transmitting node, that is, using a unicast or a multicast.
- the processing of the node that has received the data recording processing request (command) packet from the recording instruction device is performed by autonomously judging the execution or non-execution of the processing described above with reference to FIGS. Processing.
- Figure 19 shows the processing of two nodes (nodes 1 and 2).
- autonomous judgment is performed at many nodes, and data recording processing is performed. Some nodes do not perform data recording.
- the two nodes (nodes 1 and 2) shown in FIG. 19 perform the probability control processing of steps S 21 and S 31, that is, the generated random numbers described with reference to FIG. Probability set as the recording rule judgment condition description in the packet): Judgment processing execution / non-execution based on comparison with a, or hash value based on data in the packet explained with reference to Fig. 9 Executes the process execution / non-execution determination process based on the comparison with the node setting value. As a result of the probability control processing of steps S 21 and S 31, it is concluded that the two nodes (nodes 1 and 2) shown in FIG.
- step S32 a data recording process is executed.
- the data to be recorded is the FEC and interleaved processed data stored in the data recording request packet received from the recording instruction device.
- step S41 the reproduction instruction device transmits a reproduction processing request (command) packet (see FIG. 12) to each node.
- the content ID to be played back is stored as a request description, and each node that receives a playback processing request (command) packet (see Fig. 12), which is a packet that sets a playback rule judgment condition description (probability: ⁇ ), That is, the two nodes (nodes 1 and 2) shown in FIG. 19 are the probability control processes of steps S51 and S61, that is, the generated random numbers described with reference to FIG.
- step S51 Probability set as playback rule judgment condition description in: Processing execution ⁇ non-execution determination processing based on comparison with j3, or in packet described with reference to FIG. 18 Executes the process execution / non-execution determination process based on the comparison between the hash value based on the data and the node setting value. As a result of the probability control process in step S51, it is concluded that the node 1 shown in FIG. 19 performs the data reproduction process.
- step S52 the reproduction process request (instruction) packet is transmitted. According to the request description, the corresponding data is acquired from the storage unit of the own node, a packet storing the acquired data as a payload (see FIG.
- FIG. 19 shows a configuration in which data from only node 1 is transmitted to the reproduction instructing device. Data packets from nodes 3 to ⁇ (not shown) are transmitted to the reproduction instructing device and reproduced. The pointing device has received a large number of packets from a large number of nodes.
- the reproduction instruction device that has received the packet storing the reproduction data applies the interleaving to the reception data block, arranges the data arrangement, and performs the FEC decoding on the interleaved data. , Restore the original data.
- the data restoration processing based on the FEC and the Dinter Leap processing is as described above with reference to FIG. Even if there is a lost packet, the error is not a burst error in which the error portion exists as a large data area, but a random error, and the original data is restored by the FEC decoding process.
- the information processing device that has received the data recording or reproduction processing request (command) receives the recording rule judgment condition description or the reproduction rule judgment condition description set in each processing request packet, or other data in the packet. It is possible to autonomously determine the execution or non-execution of an instruction on the basis of, and perform processing according to the determination.
- the distributed storage system distributes and records data by transmitting a packet describing the recording probability a to the nodes constituting the system. Then, the data recorded in the node is returned with a return probability of 3 to retrieve the data.
- data can be stored without concentrating the data management load on one server. Also, since one node is shared by a plurality of nodes, the data capacity required for the entire system can be reduced. Also, if data is received from multiple nodes, traffic will not be concentrated on one server, and data can be transmitted and received with a stable communication volume. Also, by changing the values of a, ⁇ , and q / p, the transmission efficiency and the amount of data to be recorded can be changed.
- the recording instruction device transmits the data to be recorded and the recording probability in the same packet, but transmits the data to be recorded and the recording probability in different packets, or uses an external recording device. And may be referenced from each information processing node.
- the present invention is not limited to the configuration having the packet transfer configuration.
- data corresponding to the above-described processing rule determination condition description is added to each transfer data.
- a carousel transmission method that repeatedly transmits data from a single node, a checking method that connects to the node that received data immediately before and receives data, and that receives data from multiple distributed caches and A node that stores all data, such as a server client method that connects to a recording instruction device to obtain all data, and stores local data locally on its own node,
- the local cache method which eliminates the need for data transfer during playback by acquiring data from these, can be applied as a playback data acquisition method.
- the above various methods are appropriately combined and executed, thereby reducing network traffic and realizing efficient and reliable data reproduction. Configuration.
- the reproduction instruction device When acquiring data necessary for reproduction from another node, the reproduction instruction device transmits a data reproduction instruction to each node, receives data to be reproduced from each node, and executes data reproduction processing. If it exists in its own cache (local cache), it retrieves the data from the cache and plays it back.
- the reproduction instruction device 310 will be described with reference to FIG.
- Playback instruction device 3 1 0 is a network interface 311 for transmitting and receiving data to and from an external device via a network, and a data request packet generator 311 for generating a packet for requesting a node to transmit reproduction data specifying reproduction target data. 2.
- It has a rule determination condition setting unit 313 that determines the probability value: as the [rule determination condition description] to be set in the data request packet. Further, there is a data transmission rate setting unit 318 that selects one or more data transmission methods from a plurality of data transmission methods and determines the data transmission rate of each selected method.
- the data request bucket generation unit 312 sets the data to be subjected to the reproduction request processing based on the data transmission rate determined by the data transmission rate setting unit 318, performs the address setting processing of the packet, and sets the reproduction request. It generates a data reproduction processing request packet that stores the instruction data of the processing target data as a request description.
- the data transmission rate setting section 318 selects the data transmission method based on the demand level of the data to be reproduced and determines the data transmission rate of each selected method.
- the carousel transmission method, the switching transmission Select a data transmission method that includes at least one of the methods, distributed cache method, and client server method, and determine the data transmission rate of each selected method.
- the network interface 311 receives the playback data storage packet from each node, and the packet processing unit 314 of the playback instruction device 310 performs a process of combining the data divided into packets. Execute. Further, the data restoration processing unit 315 executes the deinterleaving processing and the FEC decoding processing of the data extracted from the received packet, and executes the data restoration.
- the restored data is input to the data processing unit 316, output to external devices such as a monitor and a speaker (not shown), or stored in a recording device (not shown).
- the data storage unit 317 is applied as a local cache, and can store reproduction target data. If the stored data is processed data, the data is restored by the data restoration processor 3 15 After processing, it is played back. When stored as non-processed data, the data is reproduced by the data processing unit 316 without performing the restoration process.
- the data request bucket generating unit 312 transmits a packet requesting data to each node constituting the distributed storage system.
- the transmission packet configuration is as described above with reference to FIG. 12, and is composed of a header, a playback rule determination condition description section, a request description section, and a footer.
- a data ID for identifying the requested data is recorded.
- control information such as CRC checksum, node network address and GUID, and sequence number indicating data order are recorded.
- the return probability determined by the rail determination condition setting unit 3 13 is set in the reproduction rule determination condition description unit.
- the return probability] 3 is a variable for determining whether or not the node that has received the packet returns data. Based on this variable, the request data is extracted from its own storage unit, a packet is generated, and it is determined whether or not a data reply is to be executed. As a result of the judgment processing according to the variable, some nodes execute the request processing, and some nodes do not execute the request processing.
- the return probability is a value when the entire distributed storage system is viewed as a macro, In the entire distributed storage system, the probability of returning data from each node is ⁇ . Therefore, when there are ⁇ nodes in the distributed storage system, the ratio of returned packets is the value ⁇ X multiplied by the number of nodes ⁇ and the return probability of 3.
- various data transmission methods such as carousel, chaining, client server type, etc. are applied.
- the rule determination condition setting unit 3 13 3 The return probability j3 can be set. That is, a for carousel, j3 b for Cheung Jung, and] 3c for client server type.
- the bucket processing unit 314 combines the packets returned from each node.
- the return packet has the configuration described above with reference to FIG. As shown in Fig. 13, a packet is composed of a header, a payload, and a footer force.
- the payload includes data extracted from the storage unit by each node, that is, the FEC processing and processing described above with reference to Fig. 5.
- the interleaved data block is stored, and the header and footer store control information such as the CRC checksum, the network address of the receiving node, and the sequence number indicating the packet order.
- the packet processing unit 314 When the playback instruction device receives the bucket shown in FIG. 13, the packet processing unit 314 performs packet analysis, reads the sequence number, changes the order of the received packets, and transmits control information such as header and footer. Remove and combine packets in sequence number order.
- the data restoration processor 315 interleaves the received data block, aligns the data arrangement, performs FEC decoding on the interleaved data, and restores the original data.
- the data restoration processing based on the FEC and the Dinter Leap processing is as described above with reference to FIG.
- the data restored by the data restoration processor 315 is output to the data processor 316.
- the data processing unit 316 stores the decrypted data in a recording unit (not shown), or outputs the data to an output unit such as a monitor speed through an output interface.
- the playback instruction device of the present embodiment has a plurality of interfaces (A, B,-) in the interface 311 in order to support a plurality of transmission methods.
- the rule determination condition setting unit 3 1 3 transmits data via these interfaces.
- a playback processing request (instruction) bucket with the return probability (] 3a, j3b ⁇ ⁇ ⁇ ) determined according to the formula is transmitted.
- FIG. 21 is a diagram illustrating a process of transmitting a reproduction processing request (command) packet to each node connected to the network. Each node provides one or more transmission methods.
- the playback instructing device 351 includes, for example, a node 371 that executes carousel transmission, a node 374 that executes chain transmission, a node 375 that stores data by the distributed cache method, and other nodes.
- the return rule (
- the identifier of the playback designation data for example, content ID, GUID, etc.
- FIG. 22 shows a state in which data is transmitted from each of the nodes 37 1 to 37 75 to the playback instructing device 35 1 as a reply to a playback processing request (instruction) packet.
- the node receiving the data reproduction processing request packet shown in FIG. 12 executes the data reproduction processing, that is, reads the designated data from the storage unit of the own node, generates the packet, and transmits the packet according to the reproduction command.
- the bucket that stores the playback data only at the node that has made the decision to execute the processing, that is, the processed data that has been subjected to the FEC processing and the interleave processing described in Fig. 6, is used as the payload.
- a packet (see Fig. 13) is generated and transmitted to the playback instruction device 351.
- Each node returns data in the form of carousel, distributed cache, check, and client server.
- the details of the method by which the reproduction instruction device acquires data necessary for reproduction and the characteristics of each method will be described with reference to FIG. Figure 23 summarizes the characteristics of each data transmission method or storage method to be acquired, such as data to be reproduced.
- the methods are divided into the carousel method, distributed cache method, checking method, low-power cache method, and client-server method.
- the cache node performs data acquisition processing such as a playback instruction device. The distinction is made between close and far from the executing device.
- Carousel is a data transmission method that repeatedly transmits a group of data related to certain data using multicast.
- a recording processing request packet in which the recording rule determination condition description described with reference to Fig. 6 is set is transmitted to each node, and the node performs autonomous processing determination and records data.
- the reproduced data is obtained by the reproduction instruction device transmitting a reproduction request packet. It is a transmission system that can be operated flexibly even if other systems are used.
- each node can be grouped to obtain a group of close nodes that do not cause much load on the network, it will be possible to control to receive the playback bucket from the group as close as possible. For example, by performing a process of setting an address (multicast address) in which a node group transmitting a data reproduction processing request is set to a node group close to the reproduction instruction device, packet transmission loss can be reduced to a minimum. . For example, by applying the address table shown in FIG.
- the reproduction instruction device sets a multicast address that limits a group of nodes transmitting a data reproduction processing request to nodes that are close to the own device, Network traffic can be controlled by setting a multicast address that is limited to various nodes such as medium distance, long distance, or all nodes from the device.
- Chaining is a method in which when a node also serves as a playback instruction device, the data reproduced immediately before or before is cached and reused. For example, it retains the identifier information corresponding to the data reproduced immediately before or before and the identification information of the node that transmitted the data, and based on the retained information, as shown in FIG.
- An address table that associates a unicast or multicast address containing an address to the node that transmitted the data is generated, and by referring to this table, a data reproduction request (instruction) packet transmitted by the reproduction instruction device is transmitted.
- Chaining is an effective method for content (data) that has rapidly become popular, for example. However, if the number of nodes holding data is small, data must be sent from a distance. Transmission loss such as packet duplication Therefore, it is desirable to use the content data only until the content data is held in many nodes, that is, until the distributed cache state is reached. It is also possible to use a local cache that does not perform real-time transmission during data reproduction.
- this method stores data in the local cache of the device that executes the reproduction process, and uses the stored data for the reproduction process.
- this method is considered to be applicable when the cache capacity of each node that executes distributed cache processing is extremely large and is biased toward specific data.
- the client-server type transmission method is applicable to data transmission of data that cannot be obtained by, for example, the carousel, distributed cache, chaining, and local cache, and is a device that stores the original data.
- this is a processing method in which data is acquired by inquiring of a server such as a recording instruction device that securely holds data.
- This client-server type data transmission is a data distribution processing configuration suitable for data requested by only a small number of playback instruction devices, which is not cached at all in other nodes.
- Figure 23 summarizes the characteristics of each of the above methods. The characteristics are shown for six items: distance, net load, data discovery rate, suitability for on-demand, transmission loss, and efficient demand.
- the distance indicates the distance between the playback instruction device and the data storage node on the network.
- the distributed cache method is classified as “distant” because it cannot be divided into far and near objects by grouping, and cannot be divided into other things.
- the network load was evaluated by multiplying the transmission distance by the amount of transmission packets. “Small” indicates a small network load, and “Large” indicates a large network load. Even if the distance is long, the network load can be reduced only by the carousel method, and in other cases, the network load increases with distance.
- the local cache must be A heavy load is imposed when you run.
- the data discovery probability indicates whether there is a high or low possibility that a certain data is transmitted on the transmission line when the reproduction instruction device requests the data.
- the on-demand property indicates whether playback can be started immediately when the playback instruction device requests certain data.
- Transmission loss refers to the loss of data transmission including duplicate packets, and “large” is not desirable.
- the vertical axis shows the data demand (popularity) as a logarithmic axis
- the horizontal axis shows the ratio (bandwidth ratio) to which each data acquisition method is applied.
- the bandwidth ratio corresponds to the data transmission rate of each data transmission method. For example, data (content) in the area a or higher where demand (popularity) is extremely high executes carousel transmission 100%. For data (content) whose demand (popularity) is at the point of b, the bandwidth ratio applied to carousel transmission is 30%, and the bandwidth ratio applied to data acquisition from the distributed cache is 70%.
- the bandwidth ratio substantially corresponds to the data acquisition rate.
- the data transmission rate setting section 3 18 (see Fig. 20) has data corresponding to the demand level of the data to be reproduced and the bandwidth ratio as the data transmission rate of the applicable data transmission method as shown in Fig. 27.
- the data transmission method is selected based on the demand level information of the data to be reproduced, and the data transmission rate of each selected method is determined.
- the data request packet generator 312 sets the playback request processing target data based on the data transmission rate determined by the data transmission rate setting section 318, performs the address setting processing, and executes the playback request processing target data.
- a data reproduction processing request packet that stores the instruction data of (1) as a request description is generated.
- the demand popularity
- the data acquisition ratio from the distributed cache is 43%
- the data transfer of the chaining and client server type is 5%. Since it is 7%, the request description of the data acquisition request packet from the distributed cache describes 43% of the data acquisition request of the entire content, and the address is the multicast address corresponding to the distributed node. Set.
- the remaining 57% of data requests are executed as client-server type data requests. That is, an address to the server (for example, the recording instruction device) is set, and a bucket storing a 57% data request as a request description is transmitted to the server. Efficient data transfer is realized by properly using such transmission methods.
- Fig. 27 shows four types of examples of carousel + distribution j, distribution + checking + client server, and client server only according to the data demand (popularity).
- the combination of data transmission and the combination of ranks are not limited to the configuration shown in the figure, and various settings are possible.
- the present embodiment has a configuration in which the data transmission method and the data acquisition method are changed according to the degree of demand (popularity) of the acquired data.
- the index data related to the demand (popularity) of the acquired data is set, for example, on a website that can be freely browsed. It is preferable to have a configuration in which the execution is performed.
- FIG. 28 shows an example in which a demand information providing device 421 for providing demand degree information is set on a network.
- the demand information providing device 421 collects and stores the number of nodes connected to the network, executable transmission method information of each node, and demand information of data (for each content). Provide this information on request.
- the force indicating the reproduction instruction device 4 1 1 is distinguished from the other nodes 4 3 1 to 4 3 5.
- ⁇ 4 3 5 also with playback instruction device And can function.
- the demand information providing device 4 2 1 not only provides the number of nodes connected to the network, the transmission method information executable by each node, and the demand information of data (for each content), but also controls the timing of the start of carousel transmission. It is also possible to use a configuration that performs the operation. That is, when starting the carousel transmission from the node having the original data, a transmission start request is transmitted from the demand information providing device 421, and the carousel transmission is started on condition that the node receives the transmission start request.
- the nodes that execute the carousel transmission are, for example, a recording instruction device holding original data, a node holding data in its own storage means, and the like.
- the node that executes the carousel transmission may be only one node or a plurality of nodes.
- the demand information providing device 4 21 is composed of an information processing device having a communication unit for transmitting and receiving data to and from a network connection node, and a control unit for generating demand degree information and controlling the process of providing generated information. .
- the control unit for example, a process of counting the number of demand information acquisition requests received from the network connection node via the communication unit is executed, and demand information corresponding to each data is generated based on the count information. You.
- the control unit Upon receiving the demand information acquisition request from the network connection node via the communication unit, the control unit generates and transmits response information based on the count value.
- the control unit of the demand information providing device 4 21 when the data corresponding demand degree based on the count information is equal to or greater than the preset threshold, the carousel transmission execution node is equal to or greater than the threshold. Carousel transmission processing of data corresponding to the demand is executed. These processes will be described later. Next, referring to FIG. 29, a data recording process from the recording instruction device to the node is required. Request, data recording processing at the node, inquiry and response information reception from the reproduction instruction device to the demand information providing device, data issuance of a data reproduction processing request to the node based on the response information, data extraction at the node, packet A series of transmission processing sequences will be described together.
- step S501 the recording instruction device performs processing of recording target data (content), that is, FEC processing and interleave processing.
- content that is, FEC processing and interleave processing.
- step S502 the recording instruction device executes a data recording processing request (instruction) packet generation process.
- the data subjected to the interleave processing is stored as a payload, and a probability value: ⁇ is set as a [rule determination condition description] determined in the rule determination condition setting unit 25 3 (see FIG. 4).
- step S503 the recording instruction device transmits an address to each node configuring the distributed storage system by using an address setting corresponding to the transmission node, that is, using a unicast or a multicast.
- the processing of the node that has received the data recording processing request (command) bucket from the recording instruction device is performed by autonomously determining whether to execute the processing described above with reference to FIGS. Processing.
- Figure 29 shows the processing of two nodes (nodes 1 and 2).
- autonomous judgment probability control
- data recording processing is performed. Some nodes do not perform data recording.
- the two nodes (nodes 1 and 2) shown in 121 29 are the probability control processes of steps S511 and S521, that is, the generated random numbers described with reference to FIG. Set as recording rule judgment condition description in data recording processing request packet) Probability: Based on the comparison with ⁇ , the processing to determine whether or not to execute the processing, or based on the comparison between the hash value based on the data in the bucket described with reference to FIG. 9 and the set value of the node, A non-execution determination process is executed. In the two nodes (nodes 1 and 2) shown in FIG. 29, as a result of the probability control processing in steps S511 and S521, it is concluded that both of them execute data recording processing. At 5 1 2 and S 5 2 2, data recording processing is executed.
- the data to be recorded is the FEC and interleaved processed data stored in the data recording processing request packet received from the recording instruction device.
- the playback instruction device makes an inquiry to the demand information providing device, and in the response in step S 5 32, the demand information for the playback-scheduled content and, if necessary, Obtain information on the feasible transmission method of each node.
- the reproduction instruction device determines the transmission method of the reproduction data based on the information obtained from the demand information providing device, and in step S5333, executes the reproduction processing request (instruction) packet (FIG. 12) based on the determined information. ), And transmits the packet to each node in step S534.
- the playback data transmission method is, for example, one of the carousel, distributed cache, chaining + client, and client server methods. .
- the content ID to be reproduced is stored in the packet as a request description, and a reproduction rule judgment condition description (probability: ⁇ ) is set as necessary.
- Each node receiving the playback processing request (instruction) bucket that is, the two nodes (nodes 1 and 2) shown in FIG.
- the probability control process that is, the generated random number described with reference to FIG. 17 and the reproduction rule determination condition description in the received packet (data reproduction request packet) are set.
- step S551 For judgment processing of execution / non-execution based on comparison with ⁇ , or comparison of hash value based on data in a packet described with reference to Fig. 18 with node setting value Based on the process execution Perform the non-execution determination process.
- the probability control processing in step S551 it is concluded that the node 1 shown in FIG. 29 executes data reproduction processing.
- step S552 the playback processing request (instruction) packet is According to the request description, the corresponding data is acquired from the storage unit of the own node, and a packet (see FIG. 13) storing the acquired data as a payload is generated. Send.
- FIG. 29 shows a configuration in which data only from node 1 is transmitted to the playback instruction device. ! The data storage bucket from is transmitted to the reproduction instruction device, and the reproduction instruction device receives a large number of packets from a large number of nodes.
- the playback instruction device that has received the packet storing the playback data performs interleaving on the received data block, aligns the data arrangement, and performs FEC decoding on the interleaved data. And restore the original data.
- the data restoration processing based on the FEC and the Dinter Leap processing is as described above with reference to FIG. Even if there is a lost packet, the error is not a burst error in which the error part exists as a large data area but a random error, and the original data is deleted by the FEC decoding processing. Data is restored.
- a detailed processing procedure from “inquiry of demand” to “restoration of processed data” of the reproduction instruction device in the sequence chart of FIG. 29 will be described with reference to the flowchart of FIG. First, when the content to be reproduced is determined, the reproduction instruction device makes an inquiry to the demand information providing device in step S601.
- the reproduction instruction device determines a reproduction data acquisition method, that is, a data transmission mode, based on the demand information received from the demand information providing device. This is determined based on the correspondence between the demand level and the bandwidth ratio described above with reference to FIG. For example, as described above, data (contents) in the area a or higher where demand (popularity) is extremely high executes 100% carousel transmission. For data (content) at the point where the demand (popularity) is b, the bandwidth ratio applied to carousel transmission is set to 30%, and the area ratio applied to data acquisition from the distributed cache is set to ⁇ 0%. It is.
- step S602 when the transmission mode of the reproduction target data is determined based on the demand degree, in step S603, the return probability according to the determined data transmission mode is set as necessary. This is, for example, a return probability of / 3 as the playback rule judgment condition description (see Fig. 2) set in the playback request packet when acquiring data from the distributed cache.
- step S604 a reproduction rule determination condition description is set, and a reproduction request packet (see FIG. 12) in which the identification information of the reproduction target data is a request description is transmitted.
- step S605 a data bucket (see FIG. 13) having the reproduced data as a payload is received.
- step S606 it is determined whether or not data that can be decoded (FEC decoding) has been obtained. If so, the decoding process is executed in step S607.
- the decoding process for example, a process including the dent leave described above with reference to FIG. 14 and the FEC decoding is executed.
- step S606 it is determined whether the number of reply blocks satisfies the above condition. If not satisfied, the data reception may be continued further, but as described above, in step S609, the data transmission mode is changed, and It is also possible to execute the process again.
- step S606 If it is determined in step S606 that the decoding process (FEC decoding) executable data has been obtained, the decoding process is executed in step S607, and in step S608, the data is reproduced based on the decoded data.
- the demand information providing device detects that the demand for the content has increased, and performs control to start carousel transmission based on the detected information. The processing sequence will be described.
- the demand information providing device measures the content demand degree by counting, for example, the number of times the demand degree inquiry is received from the reproduction instruction device. The greater the number of times the demand degree inquiry is received from the playback instruction device, the greater the demand for that data (content).
- the demand information providing device executes a control to switch the content delivery to the power roulette transmission when the number of times of receiving the demand degree inquiry from the reproduction instruction device exceeds a preset threshold. That is, when the number of nodes receiving the same content increases, a carousel transmission is instructed to a node capable of executing the carousel transmission, for example, a recording instruction device.
- the carousel transmission instruction request includes data (content) identification information for which a demand inquiry has been made for the specific data received by the demand information providing device, and the source address information set in the inquiry.
- a node that can execute power roux cell transmission identifies a data (content) by setting an address including a single door address included in the carousel transmission instruction request received from the demand information providing device, for example, a multicast address. Generates a packet in which data corresponding to the information is set as the payload, and starts carousel transmission.
- the process in which the demand information providing device starts power roux cell transmission based on the content demand level will be described with reference to the processing sequence in FIG.
- FIG. 31 shows an example in which two playback instructing devices A and B play the same content, and the same processing is performed in a configuration in which many nodes play back the same data (content). .
- a plurality of reproduction instruction devices make an inquiry about demand information to the demand information providing device.
- This demand information inquiry includes the identifier of the data (content) to be inquired.
- the demand information providing device stores, as inquiry log information, a data (content) identifier of an inquiry target and address information of an inquiry node as inquiry source information.
- the demand information providing device provides the demand information as a response process to the playback instruction device of the inquiry source.
- each playback instructing device determines a data transmission method based on the demand information, generates a playback request packet in which a return probability is set as a playback rule determination condition description, and executes a step.
- the packet is transmitted in S714.
- the demand information providing device counts the number of times of receiving the demand degree inquiry from the reproduction instruction device, and determines that the number of times of receiving the demand degree inquiry has exceeded the preset threshold value.
- a carousel transmission start request is transmitted to the executable node 501.
- the carousel transmission start request includes data (content) identification information for which a demand inquiry has been made for the specific data received by the demand information providing device, and the source address information set in the inquiry.
- the node 501 capable of executing the carousel transmission sets an address including a single address included in the carousel transmission instruction request received from the demand information providing device, for example, a multicast address, in step S711, Generates a packet in which the data corresponding to the user (content) identification information is set as the payload, and starts power roux cell transmission.
- the reproduction instruction device applies the interleaving to the received data block, aligns the data arrangement, further performs FEC decoding on the interleaved data, and restores the original data.
- the data restoration processing based on the FEC and Dinter-leave processing is as described above with reference to FIG.
- the demand information providing device detects that the demand for the content has increased, and performs control to start carousel transmission based on the detected information, so that the individual playback instruction devices can reproduce the content to be reproduced in different transmission methods.
- the state of receiving data can be switched to carousel transmission, reducing network traffic and increasing the efficiency of data transmission.
- FIG. 32 shows an example of an information processing apparatus provided with a CPU (Central Processing Unit) as a control means.
- a CPU Central Processing Unit
- ROM Read-Only-Memory
- a RAM Random Access Memory
- FIG. 32 shows an example of an information processing apparatus provided with a CPU (Central Processing Unit) as a control means.
- a CPU Central Processing Unit
- ROM Read-Only-Memory
- a RAM Random Access Memory
- the HDD 904 executes the control of the hard disk, and executes the storing process and the reading process of various data and programs with respect to the single disk.
- the encode Z decode processing section 905 executes encode processing of transmission data such as content and decode processing of received data in accordance with the above-described processing.
- the input unit 9111 is an input unit including, for example, a keyboard and a pointing device.
- the input unit 911 is operated via the keyboard ⁇ mouse, or when data is received from the communication unit 913, a command is input to the CPU 901 and the ROM (Read Only Memory) is read.
- the output unit 912 is, for example, a CRT, a liquid crystal display, or the like, and displays various kinds of information as text or images.
- the communication unit 913 executes communication between information processing devices or communication processing with other entities, and under the control of the CPU 911, data supplied from each storage unit or C
- the PU 901 transmits the data processed by the encoder Z decode processing section 905 and executes processing for receiving data from another entity.
- the drive 914 is used for recording removable storage media 915 such as a flexible disk, CD-ROM (Compact Disc Read Only Memory), MO (Magneto optical) disk, DVD (Digital Versatile Disc), magnetic disk, and semiconductor memory. It is a drive that executes recording and reproduction, and executes programs or data from each of the removable recording media 915, and stores programs or data in the removable recording media 915.
- each process described in the specification can be executed by hardware, software, or a combined configuration of both. If a series of processing is executed by software, the software
- the program may be stored and provided on a program-readable recording medium such as a CD-ROM, or the program may be downloaded via a communication network such as the Internet.
- the program can be recorded in a hard disk or a ROM (Read Only Memory) as a recording medium in advance.
- the program may be a flexible disk, CD-ROM (Compact Disk Read Only Memory), MO (Magneto opt i cal) disk, DVD (Digital Versatile Disk) magnetic disk, semiconductor memory, etc. It can be stored (recorded) temporarily or permanently on a removable recording medium.
- a removable recording medium can be provided as so-called package software.
- the program can be wirelessly transferred from a download site to the computer, or connected to the computer via a network such as a LAN (Local Area Network) or the Internet.
- LAN Local Area Network
- the computer can receive the program thus transferred and install it on a recording medium such as a built-in hard disk.
- the information processing device that constitutes the node, the recording instruction device, and the reproduction instruction device may be a camcorder, a personal video recorder, a home gateway, or the like.
- a recording unit that records data and a predetermined operation It may be a device having another configuration as long as it has a control unit that performs transmission and reception of data and a network interface.
- the recording probability ⁇ , the reply probability 3 was recorded in the packet, but the recording probability ⁇ ,
- the transmission probability / 3 may be recorded in an arbitrary recording device or packet, and each node may refer to the value.
- the interleaving process can be omitted.
- the various processes described in the specification are not only executed in chronological order as described, but also Alternatively, the processing may be performed in parallel or individually as required by the processing capability of the device that executes the processing.
- a system is a logical set configuration of a plurality of devices, and is not limited to a device in which each component is in the same housing.
- a data reproduction process request is transmitted to a node connected to a network, and a data reproduction process is performed based on return data.
- one or more data transmission methods to be applied as data transmission methods are selected according to the data demand (popularity), and the data transmission rate of each selected method is determined.
- data transmission methods can be selected and combined from, for example, the carousel transmission method, the switching transmission method, the distributed cache method, and the client-server method. Data transmission by a reliable data transmission method is realized.
- the production instruction device when executing the reproduction process, sets the reproduction target data.
- the configuration of the present invention when the demand level of the data to be reproduced is higher than a preset threshold value, the configuration is such that the processing of setting the applicable data transmission method as the carousel transmission method is executed. This makes it possible to automatically select and execute carousel transmission suitable for data transfer in response to a data acquisition request from a node.
- a demand information providing apparatus for providing demand information of transmission data via a network is configured, and the number of demand information acquisition requests received from the network connection nodes is counted.
- the data handling demand based on the count information measured by the demand information providing device that provides the demand information of the transmission data via the network is equal to or greater than a preset threshold. In this case, transmission control of carousel transmission processing requests for data corresponding to the demand level that exceeds the threshold is executed for the carousel transmission execution node. Data transmission control is realized.
Landscapes
- Engineering & Computer Science (AREA)
- Signal Processing (AREA)
- Multimedia (AREA)
- Computer Networks & Wireless Communication (AREA)
- Computer Hardware Design (AREA)
- Theoretical Computer Science (AREA)
- Software Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
Description
Claims
Priority Applications (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
EP03775830A EP1566937A4 (en) | 2002-11-28 | 2003-11-18 | DATA PROCESSING DEVICE AND METHOD, AND COMPUTER PROGRAM |
US10/500,146 US7818446B2 (en) | 2002-11-28 | 2003-11-18 | Controlling data transmission on a data storage network by selecting from multiple transmission modes |
AU2003284407A AU2003284407A1 (en) | 2002-11-28 | 2003-11-18 | Information processing device, information processing method, and computer program |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP2002-345375 | 2002-11-28 | ||
JP2002345375A JP2004180092A (ja) | 2002-11-28 | 2002-11-28 | 情報処理装置および情報処理方法、並びにコンピュータ・プログラム |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2004049667A1 true WO2004049667A1 (ja) | 2004-06-10 |
Family
ID=32376002
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/JP2003/014637 WO2004049667A1 (ja) | 2002-11-28 | 2003-11-18 | 情報処理装置および情報処理方法、並びにコンピュータ・プログラム |
Country Status (6)
Country | Link |
---|---|
US (1) | US7818446B2 (ja) |
EP (1) | EP1566937A4 (ja) |
JP (1) | JP2004180092A (ja) |
KR (1) | KR101009326B1 (ja) |
AU (1) | AU2003284407A1 (ja) |
WO (1) | WO2004049667A1 (ja) |
Families Citing this family (21)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
PL1715709T3 (pl) | 2004-03-09 | 2017-10-31 | Optis Wireless Technology Llc | Sposób dostępu bezpośredniego i urządzenie terminala komunikacji radiowej |
KR100643285B1 (ko) * | 2004-11-02 | 2006-11-10 | 삼성전자주식회사 | 멀티캐스트를 이용한 데이터 송수신 시스템 및 방법 |
JP4742784B2 (ja) * | 2005-09-28 | 2011-08-10 | ブラザー工業株式会社 | 情報分配処理プログラム、情報処理装置、および情報分配処理システム |
US7480848B2 (en) * | 2006-02-10 | 2009-01-20 | The Directv Group, Inc. | Methods and apparatus to select tornado error correction parameters |
WO2007114107A1 (ja) * | 2006-03-30 | 2007-10-11 | Pioneer Corporation | コンテンツ送信システムにおけるサーバー装置およびコンテンツ送信方法 |
JP5293038B2 (ja) * | 2008-09-19 | 2013-09-18 | 沖電気工業株式会社 | 情報処理装置、情報処理方法、通信装置、通信方法、情報処理システムおよび情報処理システムによる情報処理方法 |
US8681679B2 (en) * | 2009-12-21 | 2014-03-25 | Lg Electronics Inc. | Transmitting system and method for transmitting digital broadcast signal |
US9344735B2 (en) * | 2009-12-21 | 2016-05-17 | Tmm, Inc. | Progressive shape based encoding of video content within a swarm environment |
US9118922B2 (en) * | 2009-12-30 | 2015-08-25 | TMM Inc. | Progressive encoding of video content within a swarm environment |
CN102244558B (zh) * | 2010-05-12 | 2014-09-03 | 华为技术有限公司 | 发送数据的方法及装置 |
KR20130024996A (ko) * | 2011-08-24 | 2013-03-11 | 한국전자통신연구원 | 멀티캐스트 환경에서 싱글 버퍼 해시를 이용한 소스 인증 방법 및 장치 |
US10104168B2 (en) * | 2011-12-12 | 2018-10-16 | International Business Machines Corporation | Method for managing throughput in a distributed storage network |
KR101978177B1 (ko) | 2012-12-07 | 2019-08-28 | 삼성전자주식회사 | 컨텐츠 중심 네트워크에서 노드가 컨텐츠를 저장하는 방법 및 컨텐츠 제공자가 컨텐츠를 전송하는 방법 |
JP6193569B2 (ja) * | 2012-12-28 | 2017-09-06 | キヤノン株式会社 | 受信装置、受信方法、及びプログラム、撮像装置、撮像方法、及びプログラム、送信装置、送信方法、及びプログラム |
US10091088B2 (en) * | 2013-11-04 | 2018-10-02 | Telefonaktiebolaget Lm Ericsson (Publ) | Mode selection for a communications session |
US10326824B2 (en) * | 2013-12-17 | 2019-06-18 | Excalibur Ip, Llc | Method and system for iterative pipeline |
US9986018B2 (en) | 2014-01-09 | 2018-05-29 | Excalibur Ip, Llc | Method and system for a scheduled map executor |
CN103731364B (zh) * | 2014-01-16 | 2017-02-01 | 赛特斯信息科技股份有限公司 | 基于x86平台实现万兆大流量快速收包的方法 |
WO2016051512A1 (ja) | 2014-09-30 | 2016-04-07 | 株式会社日立製作所 | 分散型ストレージシステム |
CN107566395A (zh) * | 2017-09-28 | 2018-01-09 | 郑州云海信息技术有限公司 | 一种交互式数据包的构造方法 |
CN112486074B (zh) * | 2020-12-03 | 2021-11-16 | 上海哔哩哔哩科技有限公司 | 数据处理系统、方法及装置 |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2000156031A (ja) * | 1998-11-17 | 2000-06-06 | Sony Corp | 情報処理システム、情報処理装置、及び情報処理方法 |
JP2001028739A (ja) * | 1999-07-15 | 2001-01-30 | Sony Corp | データ配信システム及びデータ配信方法、データ受信システム及びデータ受信方法、並びに、ゲーム機 |
Family Cites Families (30)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5568614A (en) * | 1994-07-29 | 1996-10-22 | International Business Machines Corporation | Data streaming between peer subsystems of a computer system |
US5553083B1 (en) * | 1995-01-19 | 2000-05-16 | Starburst Comm Corp | Method for quickly and reliably transmitting frames of data over communications links |
US5699369A (en) * | 1995-03-29 | 1997-12-16 | Network Systems Corporation | Adaptive forward error correction system and method |
JP3456064B2 (ja) * | 1995-09-08 | 2003-10-14 | ソニー株式会社 | 音声・映像データ記録・再生装置 |
US5701292A (en) * | 1995-12-04 | 1997-12-23 | Lucent Technologies Inc. | Method and apparatus for controlling data transfer rates of data sources in asynchronous transfer mode-based networks |
JPH10134485A (ja) * | 1996-10-30 | 1998-05-22 | Toshiba Corp | ストレージ共有型分散マルチメディアサーバシステム |
JPH10229427A (ja) * | 1997-02-14 | 1998-08-25 | Canon Inc | 情報処理装置及び方法 |
US6292834B1 (en) * | 1997-03-14 | 2001-09-18 | Microsoft Corporation | Dynamic bandwidth selection for efficient transmission of multimedia streams in a computer network |
US6282240B1 (en) * | 1997-09-03 | 2001-08-28 | Oki Electric Industry Co., Ltd. | Picture coder, picture decoder, and transmission system |
JP3873405B2 (ja) * | 1997-10-21 | 2007-01-24 | ソニー株式会社 | データ配信システム及びデータ配信装置 |
US6195622B1 (en) * | 1998-01-15 | 2001-02-27 | Microsoft Corporation | Methods and apparatus for building attribute transition probability models for use in pre-fetching resources |
US6973140B2 (en) * | 1999-03-05 | 2005-12-06 | Ipr Licensing, Inc. | Maximizing data rate by adjusting codes and code rates in CDMA system |
US6876668B1 (en) * | 1999-05-24 | 2005-04-05 | Cisco Technology, Inc. | Apparatus and methods for dynamic bandwidth allocation |
CA2284947C (en) * | 1999-10-04 | 2005-12-20 | Storagequest Inc. | Apparatus and method for managing data storage |
BR0015030A (pt) * | 1999-10-28 | 2002-06-18 | Ncube Corp | Sistema de largura de banda adaptativo e método para transmitir dados |
US6678855B1 (en) * | 1999-12-02 | 2004-01-13 | Microsoft Corporation | Selecting K in a data transmission carousel using (N,K) forward error correction |
US7631080B2 (en) * | 2000-06-20 | 2009-12-08 | Nds Limited | Unicast/multicast architecture |
WO2002021239A2 (en) * | 2000-09-06 | 2002-03-14 | Xanboo, Inc. | Adaptively controlled resource and method for controlling the behavior of same |
JP4622070B2 (ja) * | 2000-09-13 | 2011-02-02 | 株式会社デンソー | 適応通信システム、通信端末、及び記録媒体 |
GB2367219A (en) * | 2000-09-20 | 2002-03-27 | Vintage Global | Streaming of media file data over a dynamically variable bandwidth channel |
US6970939B2 (en) * | 2000-10-26 | 2005-11-29 | Intel Corporation | Method and apparatus for large payload distribution in a network |
US7143143B1 (en) * | 2000-10-27 | 2006-11-28 | Microsoft Corporation | System and method for distributed caching using multicast replication |
US8107524B2 (en) * | 2001-03-30 | 2012-01-31 | Vixs Systems, Inc. | Adaptive bandwidth footprint matching for multiple compressed video streams in a fixed bandwidth network |
US7191246B2 (en) * | 2001-07-18 | 2007-03-13 | Sharp Laboratories Of America, Inc. | Transmission rate selection for a network of receivers having heterogenous reception bandwidth |
JP2003087348A (ja) * | 2001-09-14 | 2003-03-20 | Matsushita Graphic Communication Systems Inc | 通信制御方法及び通信制御装置並びにadsl通信装置 |
US7327676B2 (en) * | 2001-10-11 | 2008-02-05 | Nippon Telegraph And Telephone Corporation | Data transmission control method, program therefor and data transmission unit using the same |
JP2003162470A (ja) * | 2001-11-27 | 2003-06-06 | Fujitsu Ltd | 配信制御プログラムおよび方法 |
US7260601B1 (en) * | 2002-06-28 | 2007-08-21 | Cisco Technology, Inc. | Methods and apparatus for transmitting media programs |
US20040064719A1 (en) * | 2002-09-13 | 2004-04-01 | Sun Microsystems, Inc., A Delaware Corporation | Accessing for digital content access control |
US7222185B1 (en) * | 2002-10-03 | 2007-05-22 | Cisco Technology, Inc. | Methods and apparatus for distributing content within a content delivery system |
-
2002
- 2002-11-28 JP JP2002345375A patent/JP2004180092A/ja active Pending
-
2003
- 2003-11-18 EP EP03775830A patent/EP1566937A4/en not_active Withdrawn
- 2003-11-18 AU AU2003284407A patent/AU2003284407A1/en not_active Abandoned
- 2003-11-18 US US10/500,146 patent/US7818446B2/en not_active Expired - Fee Related
- 2003-11-18 WO PCT/JP2003/014637 patent/WO2004049667A1/ja active Application Filing
- 2003-11-18 KR KR1020047011592A patent/KR101009326B1/ko not_active IP Right Cessation
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JP2000156031A (ja) * | 1998-11-17 | 2000-06-06 | Sony Corp | 情報処理システム、情報処理装置、及び情報処理方法 |
JP2001028739A (ja) * | 1999-07-15 | 2001-01-30 | Sony Corp | データ配信システム及びデータ配信方法、データ受信システム及びデータ受信方法、並びに、ゲーム機 |
Non-Patent Citations (1)
Title |
---|
See also references of EP1566937A4 * |
Also Published As
Publication number | Publication date |
---|---|
US7818446B2 (en) | 2010-10-19 |
EP1566937A1 (en) | 2005-08-24 |
KR20050084765A (ko) | 2005-08-29 |
JP2004180092A (ja) | 2004-06-24 |
AU2003284407A1 (en) | 2004-06-18 |
US20050080916A1 (en) | 2005-04-14 |
EP1566937A4 (en) | 2010-12-22 |
KR101009326B1 (ko) | 2011-01-18 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
WO2004049667A1 (ja) | 情報処理装置および情報処理方法、並びにコンピュータ・プログラム | |
JP4172259B2 (ja) | 情報処理装置および方法、並びにコンピュータ・プログラム | |
US9350488B2 (en) | Content delivery system with allocation of source data and repair data among HTTP servers | |
JP4676833B2 (ja) | 拡張可能なメディアの分散ストリーミングのシステムおよび方法 | |
JP4920220B2 (ja) | ピアツーピアネットワークでの受信側主導のシステム及び方法 | |
JP5058468B2 (ja) | ストリーミングメディアの消去耐性符号化のための方法、該方法を実行するコンピュータ実行可能命令を記録した媒体、及びシステム | |
EP1505508B1 (en) | Distributed data recording and retrieval | |
JP5003177B2 (ja) | 送信装置、受信装置、パケット送信方法、パケット受信方法及びプログラム | |
KR20130084301A (ko) | 비균등 에러 보호 및 번들링된 파일 전달 서비스들을 제공하기 위한 범용 파일 전달 방법들 | |
KR20060049325A (ko) | 콘텐츠 배신 방법, 프로그램 및 정보 처리 장치 | |
EP2774347A2 (en) | Content delivery system with allocation of source data and repair data among http servers | |
JP2004531824A (ja) | ネットワーク環境でのファイル伝送方法 | |
US20130198151A1 (en) | Methods for file sharing related to the bit fountain protocol | |
WO2012011473A1 (ja) | 送信装置、送信方法、受信装置、受信方法、通信システム、データ構造、プログラム、及び、記憶媒体 | |
KR100919254B1 (ko) | 유디피 홀펀칭을 이용한 피어 대 피어 데이터 전송을 통해스트리밍 데이터를 분산 전송하는 분산 스트리밍 시스템 및그 방법 | |
JP2004220183A (ja) | 情報処理装置および情報処理方法、並びにコンピュータ・プログラム | |
JP2004221756A (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 BY BZ CA CH CN CO CR CU CZ DE DK DM DZ EC EE ES FI GB GD GE GH GM HR HU ID IL IN IS KE KG KP KR KZ LC LK LR LS LT LU LV MA MD MG MK MN MW MX MZ NI NO NZ OM PH PL PT RO RU SC SD SE SG SK SL 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): BW GH GM KE LS MW MZ 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 IT LU MC NL PT RO SE SI SK TR BF BJ CF CG CI CM GA GN GQ GW ML MR NE SN TD TG |
|
WWE | Wipo information: entry into national phase |
Ref document number: 10500146 Country of ref document: US |
|
REEP | Request for entry into the european phase |
Ref document number: 2003775830 Country of ref document: EP |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2003775830 Country of ref document: EP |
|
WWE | Wipo information: entry into national phase |
Ref document number: 1020047011592 Country of ref document: KR |
|
121 | Ep: the epo has been informed by wipo that ep was designated in this application | ||
WWP | Wipo information: published in national office |
Ref document number: 2003775830 Country of ref document: EP |