JP2012118709A - Distribution system, storage capacity decision program, and storage capacity decision method - Google Patents

Abstract

PROBLEM TO BE SOLVED: To assign a capacity appropriate for each service to a storage even when the storage is shared by a plurality of services.SOLUTION: A distribution system where content is distributed via an overlay network comprising a plurality of information processors that are communicable via a network includes the storage which is formed by the plurality of information processors and saves the content. The distribution system acquires capacity information showing a capacity of the content distributed in a plurality of services different from one another which distribute the content by using the overlay network, for each service, and decides a data capacity to be assigned to the storage for each service on the basis of the capacity information.

Description

  The present invention relates to a technical field of a Peer to Peer (P2P) type distribution system including a plurality of node devices that can communicate with each other via a network.

  In recent years, a peer-to-peer distribution system has been known. In a peer-to-peer distribution system, a plurality of content data are distributed and stored in a plurality of node devices. That is, in such a distribution system, a storage for storing content data is formed by a plurality of node devices. The content data stored in the storage is distributed from the first node device to the second node device different from the first node device via the overlay network. The content data is hereinafter referred to as “content”. In such a peer-to-peer distribution system, it is possible to reduce the load concentration on the server as in the client-server distribution system. Further, the location of the content stored in the storage can be efficiently searched using a routing table using a distributed hash table as disclosed in Patent Document 1, for example.

JP 2006-197400 A

  By the way, in a peer-to-peer type distribution system, a plurality of services for distributing contents using an overlay network may be mixed. In this case, storage formed by a plurality of node devices is shared by a plurality of services. The amount of content used for each service may be different. However, since the storage capacity is limited, a capacity suitable for each service cannot be allocated to the storage.

  Therefore, the present invention has been made in view of the above points and the like, and even when storage is shared by a plurality of services, a distribution capable of allocating a suitable capacity for each service to the storage It is an object to provide a system, a storage capacity determination program, a storage capacity determination method, and the like.

  In order to solve the above problem, the invention according to claim 1 is a distribution system in which content is distributed via an overlay network composed of a plurality of information processing apparatuses that can communicate with each other via a network. A storage formed by the information processing apparatus, and a plurality of services for storing the content and a plurality of services for distributing the content using the overlay network, distributed by the plurality of different services Content to be stored in the storage as the content to be stored for each service, and the storage based on the capacity information acquired by the first acquisition unit. The amount of data that can be stored and allocated to the storage And determining means for determining the data capacity to be allocated for each service, wherein the determining means determines the allocated data capacity to be larger for the service having a larger capacity of the content indicated by the capacity information. And

  According to a second aspect of the present invention, in the distribution system according to the first aspect, the determining unit determines, for each service, a data capacity allocated to a fixed storage having a predetermined capacity in the storage. Based on the capacity information, the data capacity allocated to the free storage in the storage excluding the fixed storage is determined for each service.

  According to a third aspect of the present invention, in the distribution system according to the second aspect, the first acquisition unit has a maximum data capacity set in advance for each of the services and can be allocated to the storage. The maximum capacity information indicating the maximum data capacity and the capacity information indicating the capacity of the content stored in the storage are acquired for each service, and the determining means is configured to obtain the maximum capacity based on the maximum capacity information. The larger the data capacity, the larger the data capacity allocated to the fixed storage, and the determination of the data capacity allocated to the free storage for each service based on the capacity information. Features.

  According to a fourth aspect of the present invention, there is provided the distribution system according to any one of the first to third aspects, in which login information indicating login status of a user who uses the service is acquired for each service. The information processing apparatus further includes an acquiring unit, wherein the determining unit determines a data capacity allocated to a fixed storage having a predetermined capacity in the storage for each service, and based on the number of logins obtained from the login information, The service having a larger number of logins determines, for each service, a data capacity allocated to a free storage in the storage excluding the fixed storage.

  According to a fifth aspect of the present invention, in the distribution system according to the fourth aspect, the first acquisition means has a maximum data capacity preset for each of the services and can be allocated to the storage. The maximum capacity information indicating the maximum data capacity is obtained for each service, and the determination unit is configured to allocate, to the fixed storage, the service having a larger maximum data capacity based on the maximum capacity information. The capacity is determined to be large, and based on the number of logins obtained from the login information, the data capacity allocated to the free storage is determined for each service as the number of logins increases. .

  According to a sixth aspect of the present invention, in the distribution system according to any one of the first to fifth aspects of the present invention, login information indicating a login status of a user who uses the service is acquired for each service. The information processing apparatus further includes an acquisition unit, wherein the determination unit determines the allocated data capacity to be larger for the service having a larger content capacity and having a larger number of logins obtained from the login information. To do.

  A seventh aspect of the present invention is the distribution system according to any one of the first to sixth aspects, wherein the first acquisition unit and the determination unit are provided in a server device that manages the content, and the server The apparatus shows a receiving unit that receives an allocation start command to the storage, and an instruction to execute allocation according to the capacity determined by the determining unit when the allocation start command is received by the receiving unit The information processing apparatus includes a transmission unit that transmits instruction information to the plurality of information processing apparatuses forming the storage, and the information processing apparatus that has received the instruction information is based on the storage unit that configures the storage and the instruction information. And assigning processing means for executing assignment processing to the storage means.

  According to an eighth aspect of the present invention, in the distribution system according to any one of the first to sixth aspects, the first acquisition unit and the determination unit are provided in the plurality of information processing apparatuses forming the storage. The information processing apparatus comprises storage means constituting the storage, and assignment processing means for executing assignment processing to the storage means in accordance with the capacity determined by the determination means. To do.

  According to a ninth aspect of the present invention, in the distribution system according to the seventh or eighth aspect, the allocation processing means is assigned in advance to the data capacity determined for each of the services by the determination means and for each of the services. The information processing device creates a setting file for storing the identification information in association with each other, and the information processing device acquires third content from another device via the network, and the information stored in the setting file. The content acquired by the third acquisition means based on the data capacity associated with the identification information of the service that provides the content acquired by the third acquisition means. And determining means for determining whether the data can be stored in the storage means.

  A tenth aspect of the present invention is a distribution system in which content is distributed via an overlay network including a plurality of information processing devices that can communicate with each other via a network, and is formed from the plurality of information processing devices. A plurality of services for distributing the content using the overlay network to a computer included in a distribution system including the storage for storing the content in a storage to be stored, and distributed by the plurality of services different from each other Acquiring capacity information indicating the capacity of content newly stored in the storage as content to be stored for each service, and a data capacity storable in the storage based on the acquired capacity information. Assigned to the storage A step of determining a data capacity for each service, wherein the service having a larger capacity of the content indicated by the capacity information determines a larger data capacity to be allocated. This is a capacity determination program.

  The invention according to claim 11 is a distribution system in which content is distributed via an overlay network composed of a plurality of information processing apparatuses capable of communicating with each other via a network, and formed by the plurality of information processing apparatuses. In a storage capacity determination method in a distribution system including the storage for storing the content in a storage to be stored, a plurality of services for distributing the content using the overlay network, the distribution being performed by the plurality of different services Acquiring capacity information indicating the capacity of content newly stored in the storage as content to be stored for each service, and a data capacity storable in the storage based on the acquired capacity information. For the storage Determining a data capacity to be allocated for each service, the service having a larger data capacity of the content indicated by the capacity information, determining a larger data capacity to be allocated. To do.

  According to the first, tenth, and eleventh aspects of the present invention, the capacity allocated to the storage is determined to be larger for a service with a larger capacity of content to be distributed from each of the plurality of services. Therefore, even when the storage is shared by a plurality of services, a capacity suitable for each service can be allocated to the storage. Therefore, it is possible to secure a storage of an appropriate size for each service.

  According to the inventions described in claims 2 to 5 and 9, while ensuring a minimum storage capacity required for each service, each service has an appropriate size according to the capacity of content to be distributed from now on. Storage can be secured.

  According to the sixth aspect of the present invention, it is possible to secure a storage of an appropriate size according to the capacity of contents to be distributed from each service and according to the number of logins for each service.

  According to the seventh aspect of the present invention, the information processing apparatus may execute the allocation process based on an instruction from the server apparatus. Therefore, the processing load on the information processing apparatus can be reduced.

  According to the eighth aspect of the present invention, since each information processing apparatus performs the process of determining the data capacity allocated to the storage for each service, the processing load on the server apparatus can be reduced.

It is a figure showing an example of outline composition of a contents distribution system concerning this embodiment. (A) is a block diagram showing a schematic configuration example of the center server SS. (B) is a block diagram showing a schematic configuration example of a node Nn. (A) is a flowchart which shows the process of the control part 1 of center server SS. (B) is a flowchart showing processing of the control unit 11 of the node Nn. (C) is a flowchart showing details of a process for determining the allocated capacity to the storage. (A) is a flowchart showing a first modification of the storage allocation capacity determination process. (B) and (C) are flowcharts showing details of a process for determining the allocated capacity to the fixed storage. (D) is a diagram showing an example of the allocated capacity to the fixed storage area and the allocated capacity to the free storage area when the process shown in (B) is performed. (E) is a diagram showing an example of the allocated capacity to the fixed storage area and the allocated capacity to the free storage area when the process shown in (C) is performed. (F) is a flowchart showing the allocation capacity determination process for the free storage in the fourth embodiment.

Hereinafter, embodiments of the present invention will be described with reference to the drawings. The embodiment described below is an embodiment when the present invention is applied to a content distribution system.
[ 1. Content distribution system configuration and operation overview ]
First, with reference to FIG. 1, the structure and operation | movement outline | summary of the content delivery system which concerns on this embodiment are demonstrated. FIG. 1 is a diagram illustrating a schematic configuration example of a content distribution system according to the present embodiment. As shown in FIG. 1, the content distribution system S according to the present embodiment includes a center server SS, node devices Nn (n = 1, 2, 3... K), and the like. The content distribution system S is an example of the distribution system of the present invention. The center server SS is an example of a server device in the present invention. The node device is an example of an information processing device in the present invention. The node device Nn is hereinafter referred to as “node”. The center server SS and the node are connected to the network NW. The network NW is composed of the Internet or the like. In addition, a Web server WS is connected to the network NW. The web server WS is a server for configuring a website that provides content to terminals accessed via the network NW. Examples of this terminal include a user terminal UT having a Web browser function and a base terminal Tn-l (l = 1, 2, 3,... J). The user terminal UT is, for example, a personal computer or a portable device.

  In addition, as shown in FIG. 1, in the content distribution system S, a base network NLn is constructed for each of a plurality of bases Pn. Examples of the base include a karaoke store, a school, a company, a house, and other facilities. The base network NLn is a private network such as a LAN (Local Area Network) as a communication means. Each base network NLn is connected to a node and a plurality of base terminals Tn-l. The node has a function as an edge server that provides content to the base terminal Tn-l connected to the same base network NLn. On the other hand, the base terminal Tn-l has a function of reproducing content. For example, when the base Pn is a karaoke store, the base terminal Tn-l is a commander that plays content for karaoke. For example, when the base Pn is a school, it is a viewing terminal that reproduces content for teaching materials. For example, when the base Pn is a company, it is a viewing terminal that reproduces content for training. For example, when the base Pn is a house, it is a set-top box that reproduces content for a broadcast program. Note that the base terminal Tn-l at each base Pn is not limited to communicating with only nodes connected to the same base network NLn. For example, the base terminal T1-1 at the base P1 can communicate with not only the node N1 connected to the same base network NL1, but also the node N2, the web server WS, etc. at other bases P2.

  As shown in FIG. 1, in the content distribution system S, an overlay network ON is configured by participation of a plurality of nodes that can communicate with each other via a network NW. The overlay network ON is a logical network that forms a virtual link. The overlay network ON is realized by a specific algorithm, for example, an algorithm using a distributed hash table. The distributed hash table is hereinafter referred to as “DHT (Distributed Hash Table)”. Here, participating in the overlay network ON means operating in a state in which various messages can be transmitted to and received from other nodes via the overlay network ON based on a routing table using DHT. Note that a routing table using DHT is known in Japanese Patent Application Laid-Open No. 2006-197400 and the like, and thus detailed description thereof is omitted.

  A node ID is assigned to each node participating in the overlay network ON. This node ID is unique identification information for identifying a node among nodes participating in the overlay network ON. A plurality of contents are distributed and stored in a plurality of nodes participating in the overlay network ON. In other words, one storage for storing contents is formed by a plurality of nodes participating in the overlay network ON. That is, the storage is configured by a storage area provided in each node participating in the overlay network ON. The data capacity that can be stored in the storage is the sum of the storage capacity of the storage area provided in each node participating in the overlay network ON. A storage area having a predetermined size may be set in each node. In this case, the data capacity that can be stored in the storage is the sum of the storage areas set in each node. Note that the storage capacity of the storage area indicates a capacity when data is not yet stored in the storage area. Note that a node storing content is hereinafter referred to as a “content holding node”. Also, a content ID is assigned to each content stored in the content holding node when the overlay network is ON. The content ID is unique identification information for identifying the content from the content stored in the content holding node when the overlay network is ON. Note that the node ID and the content ID are generated by, for example, a hash function common to the overlay network ON. Information indicating the location of the content is stored as index information in a node that manages the location of the content. The node that manages the location of the content is hereinafter referred to as a “content root node”. The index information includes a set of the node information of the content holding node storing the content and the content ID of the content. The node information includes, for example, the IP address, port number, and node ID of the content holding node. The content root node is determined to be a node to which a node ID closest to the content ID is assigned, for example. The node ID closest to the content ID is, for example, the node ID with the highest number of upper digits that match. When a node acquires a certain content from the content holding node, first, the content is searched using the overlay network ON. A node that performs this search is hereinafter referred to as a “user node”. Specifically, the user node inquires of the root node of the content about the location of the content to be acquired. Thereby, the user node receives the IP address of the content holding node from the root node. Then, the user node accesses the content holding node and downloads the content. Note that the process of inquiring the location of the content to the root node is well known in, for example, Japanese Patent Application Laid-Open No. 2007-053662, and detailed description thereof is omitted.

  In the present embodiment, a plurality of services for distributing content using the overlay network ON are provided. Therefore, a storage formed by a plurality of nodes is shared by a plurality of different services. Here, examples of services include services A to C. Service A is a service for distributing content for karaoke. The service B is a service for distributing moving image content posted by a user or the like. Service C is a service for distributing movie and music content. Each service is provided by a different operator. Alternatively, these services may be provided by the same operator.

  In addition, the data capacity that can be stored in the storage is assigned to the storage for each service. The data capacity allocated to the storage for each service is hereinafter referred to as “allocated capacity”. Then, new content to be distributed by each service is periodically introduced into the overlay network ON, for example. Here, “input” means that a replica of a new content is stored in the node as content distributed by the overlay network ON.

  By the way, for example, the contents of service A with a large amount of content input and service B with a small content input amount may be uniformly distributed and stored. In addition, the storage may be under pressure by the content of service B. In such a case, the waiting time until the service A content is acquired may be longer than the waiting time until the service B content is acquired. When this situation occurs, there are the following disadvantages. For example, consider a case where service A, which has a large amount of content input, inputs new popular content. In this case, the waiting time until the user node searches for and acquires popular new content via the overlay network ON becomes long.

  Therefore, in the present embodiment, for example, when content is input, the allocated capacity is dynamically determined for each service based on the capacity information indicating the capacity of the content input for each service. For example, it is determined that the allocated capacity becomes larger as the service with the larger content capacity is input. The allocated capacity is determined by the center server SS or each node, for example. As a result, for example, more content of services with a large amount of content input is stored in a distributed manner. Therefore, it is possible to reduce the waiting time until the node searches and acquires content with a large amount of input via the overlay network ON.

  Note that the content capacity indicated by the capacity information is represented by the file size (bytes) of the original content. In addition, there may be a plurality of contents input in a certain service. In this case, the sum of the file sizes of the original content becomes the content capacity indicated by the capacity information.

[ 2. Configuration and function of center server SS ]
Next, the configuration and functions of the center server SS will be described with reference to FIG. FIG. 2A is a block diagram illustrating a schematic configuration example of the center server SS. As illustrated in FIG. 2A, the center server SS includes a control unit 1, a storage unit 2, a communication unit 3, and the like. The control unit 1, the storage unit 2, and the communication unit 3 are connected to each other via a bus 4.

  The storage unit 2 is composed of, for example, a hard disk drive. The storage unit 2 stores an operating system, a storage capacity determination program, and the like. Note that the storage capacity determination program may be downloaded from a predetermined server connected to the network NW, for example. Alternatively, the storage capacity determination program may be recorded on a recording medium and read via a drive of the recording medium, for example.

  Further, the storage unit 2 stores content attribute information indicating the attributes of the content scheduled to be input at a predetermined date and time. This content attribute information includes information such as the content name, content ID, content file size, content publication period, and service ID of the service providing the content. Here, the service ID is unique identification information for identifying the service from other services. The content publication period is represented by, for example, a start date / time when the input content can be distributed via the overlay network ON and an end date / time when the content cannot be used. In addition, there may be a plurality of contents scheduled to be input in a certain service. In this case, attribute information of each content scheduled to be input is stored.

  Further, the maximum capacity information is stored in the storage unit 2 in association with the service ID of each service. The maximum capacity information indicates the maximum data capacity that can be allocated to the storage for each service. Here, the maximum data capacity that can be allocated to the storage is preset for each service. The maximum data capacity is hereinafter referred to as “maximum capacity”. For example, the maximum data capacity of a service with high content usage frequency is set larger than the maximum data capacity of a service with low content usage frequency. In addition, the maximum data capacity of a service with a large number of users is set larger than the maximum data capacity of a service with a small number of users. Note that the content attribute information and the maximum capacity information are acquired from, for example, a terminal used by a service provider.

  The storage unit 2 stores login information in association with the service ID of each service. The login information indicates the login status of the user who uses the service. Here, the login status indicated by the login information is represented by the number of logins of the user, for example. For example, the user transmits a login request from the base terminal Tn-l or the like to the Web server WS or the node for providing the service. When login is permitted in response to the login request, the user can use the service. The login request includes, for example, a user ID and password that identify the user. Login is permitted when a set of user ID and password included in the login request is registered in the Web server WS or node. The login information is acquired from, for example, the Web server WS or the node Nn for providing the service. Here, the login is also referred to as logon or sign-in depending on the service.

  The storage unit 2 stores an original content catalog information including content attribute information of each content input to the overlay network ON. This content catalog information is distributed to each node participating in the overlay network ON at a predetermined timing such as when content is input.

  Further, the storage unit 2 stores a node list for registering node information of each node participating in the overlay network ON.

  When the center server SS inputs content to the overlay network ON, the content to be input is stored in the storage unit 2. The content may be input by an input server other than the center server SS.

  The communication unit 3 performs communication control with a node or the like through the network NW.

  The control unit 1 includes a CPU having a calculation function, a working RAM, a ROM, and the like. The control unit 1 is an example of a first acquisition unit, a second acquisition unit, a reception unit, a determination unit, and a transmission unit in the present invention. The control unit 1 has a clock function and a timer function. The control unit 1 reads out and executes a program stored in the storage unit 2 or the like, and performs processing to be described later. In the processing to be described later, the control unit 1 may function as a determination unit in the present invention. In this case, the control unit 1 determines the allocated capacity for the storage for each service based on the capacity information indicating the capacity of the content input for each service.

[ 3. Node configuration and functions ]
Next, the configuration and function of the node will be described with reference to FIG. FIG. 2B is a block diagram illustrating a schematic configuration example of a node. As shown in FIG. 2B, the node includes a control unit 11, a storage unit 12, a communication unit 13a, a communication unit 13b, a buffer memory 14, and the like. The control unit 11, the storage unit 12, the communication unit 13 a, the communication unit 13 b, and the buffer memory 14 are connected to each other via a bus 15. The storage unit 12 is an example of a “storage unit that constitutes a storage” in the present invention.

  In the present embodiment, the node is a relay device that relays an IP (Internet Protocol) packet between the network NW and the base network NLm. This relay device is, for example, a router or an L3 switching hub. Note that the node may be a Web server or a user terminal. In addition, the node may basically be a device such as a gateway that is regularly connected to the network NW.

  The storage unit 12 is composed of, for example, a hard disk drive. The storage unit 12 stores an operating system, an IP packet relay processing program, a P2P program, a storage capacity determination program, and the like.

  In addition, the storage unit 12 stores a routing table using DHT used for overlay network ON. Node information of a plurality of nodes is registered in the routing table using DHT. The storage unit 12 has a storage area. This storage area is provided, for example, by installing a P2P program that executes control processing as a node. In the storage area, contents distributed by each service are stored so as to be within the “allocated capacity” allocated for each service.

  In addition, the storage unit 12 stores an attribute information management table for managing content attribute information indicating the attributes of content stored in the storage area.

  The storage unit 12 stores content catalog information distributed from the center server SS. The storage unit 12 stores the IP address and port number of the center server SS.

  The communication unit 13a performs communication control with the center server SS, the Web server WS, and the like through the network NW. The communication unit 13b performs communication control with the base terminal Tn-l through the base network NLn. Further, the buffer memory 14 temporarily accumulates the content received via the communication unit 13a.

  The control unit 11 includes a CPU having a calculation function, a working RAM, a ROM, and the like. The control unit 11 is an example of a first acquisition unit, a second acquisition unit, a third acquisition unit, a determination unit, a determination unit, and an allocation processing unit in the present invention. The control unit 11 has a clock function and a timer function. And the control part 11 performs the process mentioned later, when CPU reads and runs the program memorize | stored in the memory | storage part 12 grade | etc.,. In the processing to be described later, the control unit 1 may function as a determination unit in the present invention. In this case, the control unit 1 determines the allocated capacity for the storage for each service based on the capacity information indicating the capacity of the content input for each service. The control unit 11 has a function of relaying IP packets from other routers or hosts in the network layer, which is the third layer of the OSI (Open Systems Interconnection) reference model. Since the function of relaying IP packets is the same as that of a known router or L3 switching hub, detailed description thereof is omitted.

[ 4. Operation of Content Distribution System S ]
Next, the operation of the content distribution system S according to the present embodiment will be described. The process of determining the allocated capacity for storage for each service may be performed by the center server SS or a node. In the following description, it is assumed that the content attribute information is stored in the storage unit 2 of the center server SS in association with the service ID. The content attribute information is transmitted from, for example, a terminal used by a provider providing each service.

Example 1
In the first embodiment, the case where the center server SS determines the allocated capacity will be described with reference to FIGS. FIG. 3A is a flowchart showing processing of the control unit 1 of the center server SS. FIG. 3C is a flowchart showing details of the process for determining the allocated capacity to the storage.

  The process illustrated in FIG. 3A is started when the control unit 1 of the center server SS receives an allocation start command to the storage. The message indicating the assignment start command is transmitted from the system administrator's terminal or the like, for example, when content is input. The content is input every predetermined period. Alternatively, the content is input when the content to be input in each service exceeds a predetermined number.

  When the process shown in FIG. 3A is started, the control unit 1 of the center server SS acquires capacity information indicating the capacity C (i) of the content to be input for each service (step S1). Here, “i” is a natural number from 1 to N, and N corresponds to the number of services. The content capacity C (i) is calculated as the sum of the file sizes of the input content. However, when only one content is input, the content capacity C (i) is equal to the file size of the content. The file size of the content is acquired from the content attribute information stored in the storage unit 2.

  Next, the control unit 1 of the center server SS performs an allocated capacity determination process for the storage based on the capacity information corresponding to each service acquired in Step S1 (Step S2). Here, the allocated capacity determination process for the storage is a process for determining the allocated capacity for the storage for each service. In the allocated capacity determination process shown in FIG. 3C, the control unit 1 calculates the sum of the contents capacity C (i) of each service (step S21).

  Next, the control unit 1 calculates the ratio P (i) of the content capacity to the total content capacity C (i) for each service (step S22). This ratio P (i) is calculated, for example, by dividing the content capacity C (i) by the total capacity calculated in step S21. That is, the content capacity ratio P (i) = (content capacity C (i)) / (total of capacity C (i)). For example, it is assumed that the content capacity C (1) of service A is 5 GB, the capacity C (2) of content of service B is 3 GB, and the capacity C (3) of content of service C is 2 GB. In this case, the total capacity is 10 GB. Therefore, for example, the ratio P (1) of the capacity C (1) of the content of the service A is 5 GB / 10 GB = 0.5. The ratio P (i) of the service content capacity C (i) is hereinafter referred to as “service ratio P (i)”.

  Here, the service ratio P (i) may not strictly be {(content capacity C (i)) / (total of capacity C (i))}. For example, the service ratio P (i) may be a rough ratio determined based on {(content capacity C (i)) / (total of capacity C (i))}. The rough ratio means, for example, a ratio obtained by rounding a fraction by a method such as rounding off or rounding up. For example, assume that the ratio P (1) of service A is 0.47, the ratio P (2) of service B is 0.24, and the ratio P (3) of service C is 0.29. In this case, the rough ratio is, for example, the ratio P (1) of service A is 0.5, the ratio P (2) of service B is 0.2, and the ratio P (3) of service C is 0.3. . Alternatively, the service ratio P (i) may be calculated by multiplying {(content capacity C (i)) / (sum of capacity C (i))} by a constant k. In this case, the constant k has a different value for each service, for example. For example, the constant k corresponding to each service is determined by the weight set for each service. The weighting is determined by, for example, the service usage frequency.

  Next, the control unit 1 determines the allocated capacity A (i) to the storage for each service (step S23). The allocated capacity A (i) is calculated, for example, by multiplying the storage capacity of the storage area by the service ratio P (i) calculated in step S22. That is, the control unit 1 determines a larger allocated capacity for a service having a larger content capacity C (i). Here, the storage capacity of the storage area is read from a setting file for setting the storage capacity of the storage area, for example, at the start of the processing shown in FIG.

  When the allocated capacity A (i) of the service is determined, the control unit 1 performs an allocation execution instruction process (step S3). Here, the allocation execution instruction process is a process of transmitting an instruction message indicating an instruction to execute allocation according to the determined allocation capacity to a plurality of nodes forming the storage. The instruction message is an example of instruction information. The instruction message includes the allocated capacity A (i) and service ID of each service determined in step S23. The instruction message may include the service ratio P (i) instead of the determined allocated capacity A (i). Further, the IP address and port number of the node that is the destination of the instruction message are acquired from the node list stored in the storage unit 2. For example, the center server SS directly transmits an instruction message to all the nodes forming the storage. Alternatively, the center server SS may be configured to transmit the instruction message to all the nodes using the DHT multicast. Here, since the DHT multicast is known in, for example, Japanese Patent Application Laid-Open No. 2007-053662, detailed description thereof is omitted.

  When the node receives the instruction message transmitted in this way, the control unit 11 of the node executes allocation processing to the storage area provided in the storage unit 12 based on the instruction message. More specifically, in this allocation process, the allocated capacity A (i) and service ID of each service included in the instruction message are extracted. Then, a setting file for allocating the allocated capacity A (i) of each service to the storage area is created and saved. In this setting file, the allocated capacity A (i) of each service extracted from the instruction message and the service ID of each service are stored in association with each other. The service ID is an example of identification information given in advance for each service. Note that the instruction message may include a service ratio P (i). In this case, the control unit 11 of the node multiplies the storage capacity of the storage area provided in the storage unit 12 by the service ratio P (i). With this calculation, the allocated capacity A (i) of the service is determined for each service.

  In this way, the assignment process is executed by each node participating in the overlay network ON. As a result, a data capacity that can be stored in a storage formed by a plurality of nodes is allocated for each service.

  As described above, according to the first embodiment, the allocated capacity allocated to the storage is determined to be larger for a service with a larger capacity of content to be input in each of a plurality of services. Therefore, even when the storage is shared by a plurality of services, a capacity suitable for each service can be allocated to the storage. Therefore, it is possible to secure a storage of an appropriate size for each service. As a result, for example, a larger amount of content of services with a large amount of content input is stored in a distributed manner, so that a waiting time until a content with a large amount of input is searched for and acquired via the overlay network ON can be reduced. it can.

  In the first embodiment, each node may perform the allocation process based on an instruction from the center server SS. Therefore, the processing load on the node can be reduced.

  By the way, the setting file created by the above allocation process is referred to when the node acquires content from the content holding node. For example, it is assumed that the node N1 receives a request for content for karaoke provided by the service A from the base terminal T1-1. Note that the base terminal T1-l is used by a user who has logged in to use the service A. In this case, if the content requested from the base terminal T1-l is not stored, the node N1 acquires this content from the content holding nodes participating in the overlay network ON. That is, the node N1 acquires content from another device via the network NW. Then, the node transmits the acquired content to the base terminal T1-l. At this time, the node N1 performs content storage processing for storing the acquired content in the storage area.

  In this content storage process, the node N1 first calculates the file size of the acquired content and the file sizes of all the content stored in the storage area and associated with the service ID of service A. Calculate the sum. Next, the node N1 acquires the allocated capacity A (1) associated with the service ID of the service A from the setting file. Here, the service A is a service that provides the acquired content. The allocated capacity A (1) is an example of the data capacity stored in the setting file in association with the service ID of the service A. The node N1 determines whether the acquired content can be stored in the storage area based on the acquired allocated capacity A (1). Specifically, the node N1 determines whether or not the total sum of the calculated file sizes exceeds the acquired allocated capacity A (1). If the node N1 determines that the total file size does not exceed the allocated capacity A (1), the node N1 determines that the acquired content can be stored in the storage area. The node N1 determined to be storable stores the acquired content in the storage area. At this time, the content attribute information of this content is registered in the attribute information management table described above. On the other hand, if the node N1 determines that the sum of the file sizes exceeds the allocated capacity A (1), the node N1 determines that the acquired content cannot be stored in the storage area. The node N1 that has determined that recording is not possible deletes, for example, the most recently stored content from the storage area among the content associated with the service ID of the service A. Thereby, a free space for storing the acquired content is secured. Then, the node N1 stores the acquired content in the storage area.

  As another example, it is assumed that, for example, the node N1 receives a request for moving image content provided by the service B from the Web server WS. For example, the Web server WS receives a request for moving image content provided by the service B from the user terminal UT. In this case, the Web server WS accesses the node N1 participating in the overlay network ON and requests content. The user terminal UT is used by a user who has logged in to use the service B. In this case, if the content requested from the Web server WS is not stored, the node N1 acquires this content from the content holding nodes participating in the overlay network ON. Then, the node transmits the acquired content to the Web server WS. Also at this time, the content storage process is performed. Then, the Web server WS transmits the acquired content to the user terminal UT. Note that the node N1 may be configured to transmit the IP address of the node N1 instead of transmitting the content to the Web server WS.

(Example 2)
In the second embodiment, the case where the node determines the allocated capacity will be described with reference to FIGS. FIG. 3B is a flowchart showing processing of the control unit 11 of the node Nn.

  The process shown in FIG. 3B is started when the node control unit 11 receives an allocation start command for the storage. A message indicating this allocation start command is transmitted from, for example, the center server SS. Alternatively, the center server SS may be configured to transmit a message indicating an allocation start command to all nodes using DHT multicast.

  When the process shown in FIG. 3B is started, the node control unit 11 acquires capacity information indicating the capacity C (i) of the content to be input for each service (step S11). The capacity information indicating the content capacity C (i) is acquired from the center server SS via the network NW, for example.

  Alternatively, the node control unit 11 may be configured to acquire content catalog information stored in the storage unit 12. In this case, the service ID of each service is included in the message indicating the assignment start command. Thereby, the control unit 11 of the node Nn acquires the file size of the content associated with each service ID in the content catalog information. Then, the control unit 11 of the node Nn calculates the content capacity C (i) of each service based on the acquired file size of the content.

  Next, the control unit 11 of the node performs the allocated capacity determination process shown in FIG. 3C described above based on the capacity information corresponding to each service acquired in step S11 (step S12).

  Next, the control unit 11 of the node executes the allocation process to the storage area provided in the storage unit 12 based on the allocated capacity A (i) determined by the allocated capacity determination process (step S13). More specifically, in this allocation process, a setting file for allocating the allocated capacity A (i) of each service determined in step S12 to the storage area is created and saved. In this setting file, the allocated capacity A (i) of each service determined in step S12 and the service ID of each service are stored in association with each other. Such an assignment process is executed by each node participating in the overlay network ON.

  As described above, according to the second embodiment, the same effects as in the first embodiment can be obtained, and the processing load can be distributed because each node Nn performs the allocated capacity determination process. Therefore, the processing load of the center server SS can be reduced.

(Example 3)
In the third embodiment, a modified example of the allocated capacity determination process described in FIG. 3C will be described with reference to FIG. FIG. 4A is a flowchart showing a first modification of the allocation capacity determination process for the storage.

  In the first embodiment or the second embodiment, the allocated capacity of each service for the storage may vary every time the process shown in FIG. 3A or 3B is performed. However, such fluctuations may not be desirable. For example, normally, even if a service or the like has a large volume of content to be inserted and a high frequency of use, there may be a case where the volume of content to be inserted is small only at a certain time. In this case, although the service is frequently used, the allocated capacity of the service is reduced. As a result, there is a disadvantage that the waiting time until the content of the service is retrieved and acquired via the overlay network ON is increased.

  Therefore, in the third embodiment, the storage is divided into fixed storage and free storage. The fixed storage has a predetermined capacity in the storage. Free storage is storage that excludes fixed storage from storage. In the third embodiment, the data capacity that can be stored in the fixed storage is allocated for each service. Furthermore, in the third embodiment, the data capacity that can be stored in the free storage is allocated for each service. Here, the fixed storage is configured by a fixed storage area provided in the storage unit 12 of each node Nn. That is, the data capacity that can be stored in the fixed storage is the sum of the storage capacities of the respective fixed storage areas. The fixed storage area is an area provided in the storage unit 12 of each node participating in the overlay network ON. The fixed storage area provided in the storage unit 12 of each node has a predetermined storage capacity in the entire storage area. On the other hand, the free storage is configured by a free storage area provided in the storage unit 12 of each node. That is, the data capacity that can be stored in the free storage is the sum of the storage capacities of the free storage areas. The free storage area is an area provided in the storage unit 12 of each node participating in the overlay network ON. The fixed storage area provided in the storage unit 12 of each node has a storage capacity excluding the fixed storage area in the entire storage area.

  In the third embodiment, the allocated capacity determination process shown in FIG. 4A is performed in step S2 shown in FIG. 3A or in step S12 shown in FIG.

  In step S31 shown in FIG. 4A, the allocation capacity determination process for the fixed storage is performed by the control unit 1 or the control unit 11. As the allocation capacity determination process for the fixed storage, for example, there are two processes, that is, the process shown in FIG. 4B and the process shown in FIG. 4B and 4C are flowcharts showing details of the processing for determining the allocated capacity to the fixed storage. In addition, the process of step S31 shown to FIG. 4 (A) is performed only once, for example at the time of service start.

  In the allocation capacity determination process for the fixed storage shown in FIG. 4B, the control unit 1 or the control unit 11 calculates the service number N based on the number of service IDs (step S311). Next, the control unit 1 or the control unit 11 determines the allocated capacity Ax (i) to the fixed storage for each service (step S312). This allocated capacity Ax (i) is calculated, for example, by dividing the storage capacity of the fixed storage area by the number of services N. In this way, a fixed size allocated capacity Ax (i) that is equal to each service is determined.

  On the other hand, in the allocation determination process to the fixed storage shown in FIG. 4C, the control unit 1 or the control unit 11 acquires the maximum capacity information indicating the maximum capacity Cm (i) that can be allocated to the storage for each service. (Step S315). Here, when the process of step S315 is performed by the node, the maximum capacity information is acquired from the center server SS via the network NW, for example. Next, the control unit 1 or the control unit 11 calculates the sum of the maximum capacities Cm (i) of each service (step S316). Next, the control unit 1 or the control unit 11 calculates a ratio Pm (i) of the maximum capacity Cm (i) of the content to the sum of the maximum capacity Cm (i) for each service (step S317). This ratio Pm (i) is calculated, for example, by dividing the maximum capacity Cm (i) of each service by the sum of the maximum capacity Cm (i) calculated in step S316. Next, the control unit 1 or the control unit 11 determines the allocation capacity Ax (i) to the fixed storage for each service (step S318). The allocated capacity Ax (i) is calculated, for example, by multiplying the storage capacity of the fixed storage area by the service ratio Pm (i) calculated in step S317. That is, the control unit 1 or the control unit 11 determines a larger capacity to be allocated to the fixed storage for a service having a larger maximum capacity Cm (i). In this way, a fixed size allocation capacity Ax (i) corresponding to the maximum capacity Cm (i) is determined for each service.

  Next, in step S32, the control unit 1 or the control unit 11 performs an allocation capacity determination process for the free storage. The allocation capacity determination process for the free storage is performed in the same manner as the process shown in FIG. Through this process, the allocated capacity Ay (i) to the free storage is determined for each service. Note that the processing in step S32 illustrated in FIG. 4A is performed, for example, every time content is input, as in the first or second embodiment.

  The fixed storage allocation capacity Ax (i) and the free storage allocation capacity Ay (i) determined as described above are used in node allocation processing. That is, the node control unit 11 performs allocation processing to a fixed storage area provided in the storage unit 12 and allocation processing to a free storage area. In the allocation process to the fixed storage area, a setting file for allocating the allocated capacity Ax (i) of each service to the fixed storage area is created and saved. In the allocation process to the free storage area, a setting file for assigning the allocated capacity Ay (i) of each service to the free storage area is created and saved. FIG. 4D shows an example of the allocated capacity to the fixed storage area and the allocated capacity to the free storage area when the process shown in FIG. 4B is performed. On the other hand, FIG. 4E shows an example of the allocated capacity to the fixed storage area and the allocated capacity to the free storage area when the processing shown in FIG. 4C is performed.

  As described above, according to the third embodiment, a storage of an appropriate size corresponding to the capacity of contents to be introduced in each service is secured while securing a minimum storage size for each service. can do.

Example 4
In the fourth embodiment, another modification of the allocated capacity determination process described in FIG. 3C will be described with reference to FIG. In the fourth embodiment, the storable data capacity is allocated to each service separately for the fixed storage and the free storage.

  Also in the fourth embodiment, similarly to the third embodiment, the control unit 1 or the control unit 11 performs the allocation capacity determination process for the fixed storage in step S31 illustrated in FIG.

  Next, in the allocation capacity determination process for the free storage in step S32, the above-described login information is used. FIG. 4F is a flowchart illustrating an allocation capacity determination process for a free storage according to the fourth embodiment.

  In the process shown in FIG. 4F, the control unit 1 or the control unit 11 acquires login information indicating the login status of the user who uses the service for each service (step S321). Here, in the case where the process of step S321 is performed by the node Nn, there are two cases: using the login information of the user of the entire content distribution system S and using the login information of the user in the site Pn to which the node belongs. Is mentioned. When using login information of users of the entire content distribution system S, the login information is acquired from the center server SS via the network NW, for example. On the other hand, when using login information of a user in the site Pn to which the node belongs, this login information is acquired from the storage unit 12. The login information of the user in the base Pn to which the node belongs indicates the number of logins of the user of the base terminal Tn-l connected to the same base network NLn as the node. For example, it is the number of users who visited a karaoke store and logged in.

  And the control part 1 or the control part 11 calculates the sum total of the login number L (i) obtained from the login information of each service (step S322). Next, the control unit 1 or the control unit 11 calculates the ratio Pl (i) of the login number L (i) with respect to the sum of the login number L (i) for each service (step S323). This ratio Pl (i) is calculated, for example, by dividing the number of logins L (i) of each service by the sum of the number of logins L (i) calculated in step S322. Next, the control unit 1 or the control unit 11 determines the allocated capacity Ay (i) to the free storage for each service (step S324). The allocated capacity Ay (i) is calculated, for example, by multiplying the storage capacity of the free storage area by the service ratio Pl (i) calculated in step S323. That is, the control unit 1 or the control unit 11 determines a larger capacity to be allocated to the free storage as the service has a larger number of logins L (i).

  The allocation capacity Ax (i) to the fixed storage and the allocation capacity Ay (i) to the free storage determined as described above are used in the allocation process of the node Nn as in the third embodiment.

  As described above, according to the fourth embodiment, a storage of an appropriate size is ensured according to the capacity of contents to be distributed in each service and according to the number of users used for each service. be able to.

  In step S2 of the allocated capacity determination process shown in FIG. 3C described in the first and second embodiments, the allocated capacity determination process for the storage is performed based on the login information indicating the user login status. You may comprise. In this case, in FIG. 3C, instead of the processes of steps S1 and S21 to S23, the processes of steps S321 to S324 are performed.

  In the above embodiment, the peer-to-peer network using DHT is applied to the overlay network ON. However, the present invention is not limited to this. For example, a system using another overlay network may be applied. As a peer-to-peer system that does not use DHT, for example, there is a hybrid peer-to-peer system.

DESCRIPTION OF SYMBOLS 1,11 Control part 2,12 Storage part 3,13a, 13b Communication part SS Center server Nn node NW network ON Overlay network S Content delivery system

Claims (11)

In a distribution system in which content is distributed via an overlay network composed of a plurality of information processing devices that can communicate with each other via a network,
A storage formed by the plurality of information processing devices, the storage for storing the content;
Capacitance information indicating the capacity of content stored in the storage is acquired for each service as content distributed by the plurality of services different from each other using the overlay network. First acquisition means for
Determining means for determining, for each service, a data capacity that can be stored in the storage based on the capacity information acquired by the first acquiring means and that is allocated to the storage;
With
The distribution unit, wherein the determination unit determines the allocated data capacity to be larger for the service having a larger capacity of the content indicated by the capacity information.   The determining means determines, for each service, a data capacity allocated to a fixed storage having a predetermined capacity in the storage, and excludes the fixed storage in the storage based on the capacity information. The distribution system according to claim 1, wherein a data capacity allocated to a free storage is determined for each service. The first acquisition means includes maximum capacity information indicating the maximum data capacity that can be allocated to the storage and a maximum data capacity preset for each service, and content stored in the storage. Obtaining the capacity information indicating the capacity for each service;
The determining means determines, based on the maximum capacity information, a larger data capacity allocated to the fixed storage for the service having the larger maximum data capacity,
The distribution system according to claim 2, wherein a data capacity allocated to the free storage is determined for each service based on the capacity information. A second acquisition unit that acquires, for each service, login information indicating a login status of a user who uses the service;
The determination means determines, for each service, a data capacity allocated to a fixed storage having a predetermined capacity in the storage, and the service having a large number of logins based on the number of logins obtained from the login information. The distribution according to any one of claims 1 to 3, wherein a data capacity allocated to a free storage excluding the fixed storage in the storage is determined for each service. system. The first acquisition means acquires, for each service, maximum capacity information indicating the maximum data capacity that is preset for each service and that can be allocated to the storage, for each service,
The determining means determines, based on the maximum capacity information, a larger data capacity allocated to the fixed storage for the service having the largest maximum data capacity, and based on the number of logins obtained from the login information. The distribution system according to claim 4, wherein a data capacity allocated to the free storage is determined for each service as the service having a larger number of logins. A second acquisition unit that acquires, for each service, login information indicating a login status of a user who uses the service;
2. The determination means according to claim 1, wherein the data capacity to be allocated is determined to be larger for the service having the larger content capacity and the service having a larger number of logins obtained from the login information. Item 6. The distribution system according to any one of Items 5. The first acquisition unit and the determination unit are provided in a server device that manages the content,
The server device
Accepting means for accepting an instruction to start allocation to the storage;
The plurality of information processing devices that form the storage with instruction information indicating an instruction to execute allocation according to the data capacity determined by the determination unit when the allocation start command is received by the reception unit A transmission means for transmitting to
The information processing apparatus that has received the instruction information
Storage means constituting the storage;
Assignment processing means for executing assignment processing to the storage means based on the instruction information;
The distribution system according to any one of claims 1 to 6, further comprising: The first acquisition unit and the determination unit are provided in the plurality of information processing devices forming the storage,
The information processing apparatus includes:
Storage means constituting the storage;
Assignment processing means for executing assignment processing to the storage means in accordance with the data capacity determined by the determination means;
The distribution system according to any one of claims 1 to 6, further comprising: The allocation processing unit creates a setting file for storing the data capacity determined for each service by the determination unit in association with identification information given in advance for each service;
The information processing apparatus includes:
Third acquisition means for acquiring the content from another device via the network;
The third acquisition based on the data capacity stored in the setting file and associated with the identification information of the service providing the content acquired by the third acquisition means Determining means for determining whether the content acquired by the means can be stored in the storage means;
The distribution system according to claim 7 or 8, further comprising: A distribution system for distributing content via an overlay network composed of a plurality of information processing devices that can communicate with each other via a network, and storing the content in a storage formed by the plurality of information processing devices A computer included in a distribution system comprising the storage for
Capacity information indicating the capacity of content newly stored in the storage as content distributed by the plurality of services different from each other using the overlay network is provided for each service. A step to obtain,
A step of determining, for each service, a data capacity that can be stored in the storage based on the acquired capacity information, and that is allocated to the storage for each service. Determining the allocated data capacity to be larger for the service having a larger content capacity;
A storage capacity determination program characterized in that A distribution system for distributing content via an overlay network composed of a plurality of information processing devices that can communicate with each other via a network, and storing the content in a storage formed by the plurality of information processing devices In a storage capacity determination method in a distribution system comprising the storage for
Capacity information indicating the capacity of content newly stored in the storage as content distributed by the plurality of services different from each other using the overlay network is provided for each service. A step to obtain,
A step of determining, for each service, a data capacity that can be stored in the storage based on the acquired capacity information, and that is allocated to the storage for each service. Determining the allocated data capacity to be larger for the service having a larger data capacity of content;
A storage capacity determination method comprising:

Images