JP4107968B2 - Content distribution server, content receiving terminal, and content distribution system - Google Patents

Description

[0001]
BACKGROUND OF THE INVENTION
The present invention relates to a content distribution server, a content receiving terminal, and a content distribution system. For example, when streaming content data such as music data via a network such as the Internet or a LAN, the line capacity of the network is used efficiently. The present invention relates to a content distribution server, a content receiving terminal, and a content distribution system that can be performed.
[0002]
[Prior art]
When a server distributes data to a client terminal via a network, a streaming technique is generally widely known as a technique that allows a client terminal to start playback before receiving all data. ing.
In recent years, streaming technology has been widely used as a content distribution service such as video and music transmitted to a personal computer connected to a network such as the Internet. When content data is distributed using such streaming technology, even if the network is busy or content data that exceeds the bandwidth of the line is distributed, the content data that has been distributed is received and played back. In order to enable the player to continue playing without interruption, a method for playing while storing the streamed content data in a cache memory provided in the client terminal, a server for delivering the content data, A technique is adopted in which content data is distributed and stored in advance to cache devices arranged at different network locations, and then distributed from the cache device to the client terminal.
[0003]
For example, in Japanese Patent Application Laid-Open No. 2002-183019 disclosed in Patent Document 1, meta information indicating the characteristics of the content data is received together with the content data, and temporary storage means is used according to the meta information and the user profile. A technique related to a cache device that determines and stores content data to be stored in a certain cache memory is disclosed. By using this technology, when a specific client terminal accesses content data in the content distribution server, the desired content can be accessed without being limited by the network access time or being affected by network congestion. It is said that data can be streamed.
[0004]
[Patent Document 1]
Japanese Patent Laid-Open No. 2002-183019 (page 3-5, FIG. 1)
[0005]
[Problems to be solved by the invention]
However, when the technology disclosed in Japanese Patent Laid-Open No. 2002-183019 shown in Patent Document 1 is used, content data registered in advance from the content distribution server to the client terminal is pushed and distributed. In this case, there is a possibility that even content data that is not actually used at all for the client terminal may be automatically distributed, resulting in an increase in the total amount of content data transferred over the network. is there.
[0006]
Further, as a general problem of streaming distribution, when a user wants to request reproduction of content data not stored in a cache device, the client terminal on the user side is networked to the content distribution server on the service provider side at the time of the request. Need to connect through. For this reason, when a request is made so that many users simultaneously reproduce the content data not stored in the cache device, the communication bandwidth obtained by multiplying the occupied bandwidth per user by the number of users requested at once is the network. In addition, all of the client terminals connected to the network are requested to connect to the content distribution server on the service provider side at the same time. The problem remains that it is not possible to eliminate the situation where content data is not delivered to all client terminals simultaneously.
[0007]
Further, streaming distribution of content data is sequentially performed in accordance with the requested order of client terminals, but when it exceeds the allowable bandwidth of the network, it is distributed to the client terminal that is the subsequent distribution request source. It becomes impossible to do so, and there is a problem of lack of fairness.
[0008]
The present invention has been made in view of such circumstances, and when transmitting a distribution request for requesting distribution of content data from a content receiving terminal, information about content data cached in a cache memory (for example, reproduced) The number of times of reproduction representing the number of times, the reproduction date and time representing the date and time of reproduction, the cache date and time representing the cached date and time, and the like are transmitted together as distribution prioritization information, and the content distribution server transmits them at predetermined time intervals. Based on the distribution prioritization information received within a certain distribution request acceptance period, the distribution priority of each content receiving terminal is determined, and the distribution is preferentially performed according to the allowable bandwidth (that is, transferable capacity) of the network. Content receiving terminals to be determined, content data is distributed, and the remaining content receiving terminals are distributed. Therefore, it is possible to read out the content data cached in the cache memory in the past and internally reproduce it, thereby making it possible to effectively use the network and each content receiving terminal. On the other hand, content data can be distributed fairly and without separation.
[0009]
[Means for solving problems]
In a content distribution server that accumulates content data to be distributed to content receiving terminals, receives a distribution request for content data transmitted from each content receiving terminal, and distributes the content data in a streaming manner, the first technical means unit A list of distributed content data recorded in the cache memory in the content receiving terminal attached to the distribution request received every time, and the cache date and time, or the number of times of reproduction and the latest reproduction date and time for each content in the list Content distribution consisting of one or more of them priority Rank Date Based on information, based on preset selection criteria Accepted content About receiving terminal Content data Determine delivery priority, In accordance with the determined distribution priority, streaming distribution of content data is performed to content receiving terminals having a high distribution priority corresponding to a predetermined number of distributable terminals. A content distribution server characterized by the above.
[0010]
The second technical means is the above Delivery Low priority Unit Cannot deliver within the period content The receiving terminal is instructed to perform internal reproduction using a cache memory in the receiving terminal.
[0011]
The third technical means is the above Delivery The priority is In delivery prioritization information In order of the content receiving terminal in which the total number of reproduction times is recorded, or in the order of oldest content receiving terminal in the record of the oldest cache among the records of the cache date and time, the oldest of the records of the latest reproduction date and time The record of the oldest playback date is new content In order of receiving terminal, the largest number of times of reproduction of the largest number of times of reproduction of each content data content It is one of receiving terminal order.
[0012]
The fourth technical means caches the content data distributed from the content distribution server in the cache memory each time, and at the content receiving terminal that decodes and reproduces each cached content data, A content distribution request is a content distribution consisting of a list of each content data cached in the cache memory and one or more of the cache date and time, the number of times of reproduction, and the latest reproduction date and time for each content in the list priority Rank Date And send it along with the information According to the distribution priority information determined based on the content distribution ranking information Instruction response from the distribution server But, content Data Streaming delivery of When playing the distributed content data, When instructing internal playback using cache memory The content receiving terminal reads out the predetermined content data cached and internally reproduces the content data.
[0013]
The fifth technical means is If the instruction response is not received within a predetermined elapsed time from the transmission of the distribution request, the content data is automatically read from the cache memory and internally reproduced. It is characterized by that.
[0014]
The sixth technical means is The content data read from the cache memory and internally reproduced is content data with a small number of reproductions representing the number of times each content data has been reproduced, or content data with the oldest reproduction date of each content data. It is characterized by that.
[0015]
The seventh technical means is The content data cached in the cache memory is in the order of content data in which each content data is played back in the order of the number of playbacks, or in the order of content data in which the cache date and time indicating the date and time when each content data is cached is in the oldest order. Deleted from the cache memory in any of a preset order with respect to date and time It is characterized by that.
[0016]
The eighth technical means is A content distribution system comprising a content distribution server of any one of the first to third technical means and a content receiving terminal of any of the fourth to seventh technical means. Features.
[0035]
DETAILED DESCRIPTION OF THE INVENTION
Hereinafter, embodiments of a content distribution server, a content receiving terminal, and a content distribution system according to the present invention will be described in detail with reference to the drawings. In the following description, a case where a music distribution system is used as the content distribution system will be described as an example.
[0036]
FIG. 1 is a network configuration diagram showing a concept of a network configuration in a music distribution system which is an example of an embodiment of a content distribution system according to the present invention. A music distribution system shown in FIG. 1 includes a content distribution server 101 (that is, a music distribution server: hereinafter simply abbreviated as a server) that distributes music data to a client terminal that is a distribution request source, A client terminal 102 that makes a distribution request and receives and reproduces music data distributed from the server 101, for example, 13 client terminals 1 102 _-1 Thru client terminal 13102 _-13 (That is, a content receiving terminal: hereinafter simply abbreviated as a terminal) is connected to the Internet 103. Each terminal 1 102 _-1 To terminal 13 102 _-13 Are sequentially assigned in advance as numbers of “1” to “13” as terminal IDs used by the server 101 to identify each terminal, and are incorporated in each terminal.
[0037]
FIG. 2 is a functional block diagram showing an example of a functional block configuration in the content distribution server, that is, the music distribution server 101 according to the present invention of FIG. In FIG. 2, the music distribution server 101 connected to the Internet 103 shows a distribution data storage unit 111 that stores music data to be distributed to the terminal, and a reception cycle for receiving a distribution request from the terminal via the Internet 103. A distribution request acceptance period is set, and for each set distribution request acceptance period, a distribution request list 114 for registering terminals together with distribution priority ranking information in the order of distribution requests received from the terminal, and a distribution request list at the end of acceptance 114 sets the distribution priority of the terminals registered in 114 by rearranging based on the distribution prioritization information, and distributes to each terminal according to the set distribution priority. For content data, allow streaming delivery or read from cache memory in the terminal So as to select one if to instruct the internal playback and a delivery terminal selection unit 112 which determines for each terminal to play. Further, the music distribution server 101 transmits an instruction response indicating that streaming distribution is performed to a terminal that is permitted to perform streaming distribution, and distributes the music data to the terminal, and a distribution unit 113 that distributes the music data to the terminal. And a network connection unit 115 for connecting to the Internet 103.
[0038]
In the distribution request list 114, as shown in FIG. 5 described later, a terminal ID area 114a for registering a terminal ID for identifying the terminal transmitted from the terminal requested for distribution, and the distribution request. A distribution prioritization information area 114b for registering distribution prioritization information that is attached and transmitted is provided. Here, the distribution prioritization information registered in the distribution prioritization information area 114b of the distribution request list 114 is information for ordering distribution priorities regarding the terminals that have requested distribution, and has been distributed in the past. Information generated from information on content data cached in the cache memory of each terminal (for example, information such as the number of times of reproduction, reproduction date / time, and cache date / time).
[0039]
FIG. 3 is a functional block diagram showing an example of a functional block configuration in the terminal (content receiving terminal) 102 according to the present invention in FIG. In FIG. 3, a terminal 102 connected to the Internet 103 has a cache memory 123 that caches music data distributed from the server 101 via the Internet 103 each time, and music data cached in the cache memory 123. A management table 121 that stores management information for management and a cache manager 122 that determines timing for deleting, updating, or playing back music data cached in the cache memory 123 are provided.
[0040]
Further, the terminal 102 decodes the music data distributed via the Internet 103 or cached in the cache memory 123 and plays the music data decoder 124 for reproducing the music data and the server 101 via the Internet 103. Is transmitted together with the distribution prioritization information, while receiving an instruction response from the server 101 in response to the distribution request and receiving the music data distributed from the server 101, and the music data as a content distribution server A network connection unit 126 for connecting to the Internet 103 for receiving from the network 101 is provided.
[0041]
FIG. 4 is a memory configuration diagram showing an example of management information stored in the management table 121 built in the terminal 102 shown in FIG. In FIG. 4, the management table 121 is a music data number 121a for uniquely identifying each music data cached in the cache memory 123, and a reproduction indicating the number of times each music data cached in the cache memory 123 is reproduced. Number-of-times data 121b, cache date / time data 121c indicating the date and time when each music data cached in the cache memory 123 is cached, and latest playback date and time indicating the date and time when each music data cached in the cache memory 123 was most recently played back One or more data items are stored among the data 121d and the total reproduction count data 121e indicating the total number of reproductions of any music data cached in the cache memory 123.
[0042]
FIG. 5 is a memory configuration diagram showing an example of a state in which terminals are registered in time series in the order of delivery requests in the delivery request list 114 built in the server 101 shown in FIG. 2 during a delivery request acceptance period. It is. In FIG. 5, the distribution request list 114 includes a terminal ID area 114 a for storing a terminal ID and the total number of reproductions set in the management table 121 in the terminal 102, which are transmitted from the terminal 102 together with the distribution request. A total reproduction count data area 114b for storing data 121e is provided, which is registered in the order of the terminal from which the distribution request is received. Here, the total number of times of reproduction data 121e registered in the total number of times of reproduction data area 114b is registered in the distribution priority ranking information area 114b of the distribution request list 114 shown in FIG. It shows an example of the distribution prioritization information for performing the above.
[0043]
FIG. 6 shows the distribution priorities of the terminals 102 registered in the distribution request list 114 shown in FIG. 5 after rearrangement of the distribution priorities of the terminals 102 regarding the content data to be distributed after the end of the distribution request acceptance period. It is a memory block diagram which shows an example. In the present embodiment shown in FIG. 6, an example is shown in which the total number of times of reproduction data 121e registered in the total number of times of reproduction data area 114b is used as the distribution priority ranking information for rearranging the distribution priorities. The total playback count data 121e for each terminal 102 shown in FIG. 4 in descending order, that is, the total playback count transmitted from each terminal 102 to the server 101 and stored in the total playback count data area 114b of the distribution request list 114. The example in which rearrangement is performed in descending order of the number-of-times data 121e is shown.
[0044]
Next, music data transmission / reception processing in each of the server 101 and the terminal 102 will be described in more detail with reference to FIG. FIG. 7 shows that the number of terminals 102 instructing distribution from the server 101 and the number of terminals 102 instructing internal reproduction are determined according to the number of terminals of the distribution request received by the server 101 every certain distribution request reception period. It is a schematic diagram showing an example of the temporal flow which changes.
In the example shown in FIG. 7, it is possible to distribute music data from the server 101 to 100 terminals 102 simultaneously via the Internet 103, and the first distribution request from the elapsed time 10 seconds to 20 seconds. In the initial period of the reception period A, it is shown that 97 terminals have already been connected to the 100 distributable traffic capacity on the Internet 103 and music data is being distributed. Yes. In the music distribution system according to the present embodiment, the distribution request reception period is always set to a reception period with a fixed time interval of 10 seconds.
[0045]
Here, the number of additionally distributable terminals that can be newly distributed in the distribution request acceptance period A is 3 (= 100 (the number of terminals capable of simultaneous distribution) −97 (the number of terminals being distributed)) And a new distribution request from five terminals (terminal IDs “1”, “2”, “3”, “4”, “5”, respectively) for the remaining three additional distributable terminals. In the distribution request list 114 shown in FIG. 2, as shown in FIG. 5, the total number of times of reproduction data is registered in the total number of times of reproduction data area 114 b in the order of the terminals that received the distribution requests.
When the distribution request acceptance period A ends, the distribution terminal selection unit 112 shown in FIG. 2 has a large total reproduction count data stored in the total reproduction count data area 114b for the distribution request terminal of the registered distribution request list 114. Rearrangement is performed in order of distribution priority. The distribution request list 114 after rearrangement in the descending order of the total reproduction count data is as shown in FIG.
[0046]
Therefore, in the distribution terminal selection unit 112, according to the sorted distribution priorities shown in FIG. 6, for the three terminals whose terminal IDs are “4”, “2”, and “1”, music The distribution of the data is permitted and an instruction response indicating that streaming distribution is performed to each terminal is performed from the distribution unit 113 and the streaming distribution of the music data is performed. On the other hand, the terminal IDs are “5” and “3”. ”To the two terminals, the distribution terminal selection unit 112 instructs to perform internal reproduction (local reproduction) using the music data cached in the cache memory in each terminal. No instruction is given for distribution.
[0047]
On the other hand, as described in the column “Number of terminals whose distribution ends within the period” in FIG. 7, the number of terminals whose distribution ends within the period of the distribution request reception period A is four. .
Accordingly, in the distribution request reception period B that follows the distribution request reception period A, the number of additional distributable terminals that can be newly distributed can be distributed during the distribution request reception period A. The number of terminals is four. If there is a new distribution request access from two terminals (terminal IDs “6” and “7”) for the remaining four additional distributable terminals, the distribution request acceptance period A in the distribution request list 114 Each new distribution request terminal is registered in the same manner as in the above, but in the distribution terminal selection unit 112, since the number of newly received distribution request terminals is less than two and the number of additional distributable terminals is four, An instruction to unconditionally permit distribution of music data is given to the two terminals with the received terminal IDs “6” and “7”.
[0048]
On the other hand, it is assumed that the number of terminals that end distribution within the period of the distribution request reception period B is one.
Accordingly, in the distribution request reception period C that follows the distribution request reception period B, the number of additional distributable terminals that can be newly distributed and distributed is 3 (= 2 (distribution request reception period). The remaining number of additional distributable terminals of the number of terminals permitted in B) +1 (the number of terminals that have ended distribution during the distribution request acceptance period B)). If there is a new distribution request access from four terminals (terminal IDs “8”, “9”, “10”, “11”) for the remaining three additional distributable terminals, the distribution request Each new distribution request terminal is registered in the list 114 as in the case of the distribution request reception period A, and when the distribution request reception period C ends, the distribution terminal selection unit 112 distributes the distribution request as in the case of the distribution request reception period A. The request list 114 is rearranged in descending order of the total reproduction count data.
Here, if the terminal ID is “8”, “9”, “10”, “11” in the order of the terminal with the largest total number of reproduction times data, the terminal ID is “8” according to the distribution priority. ”,“ 9 ”, and“ 10 ”are permitted to be connected for streaming distribution, and the remaining terminal ID“ 11 ”is cached inside the terminal. An instruction to perform internal reproduction (local reproduction) by the memory is issued.
[0049]
On the other hand, it is assumed that the number of terminals that end distribution within the period of the distribution request reception period C is zero.
Therefore, in the distribution request reception period D that follows the distribution request reception period C, the number of additional distributable terminals that can be additionally distributed is 0 (= 0 (distribution request reception period). The remaining number of additional distributable terminals of the number of terminals permitted in C) +0 (the number of terminals that ended distribution during the distribution request acceptance period C)). If there is a new distribution request access from two terminals (terminal IDs “12” and “13”) with respect to the remaining number of additional distributable terminals, the distribution request reception period A Each new distribution request terminal is registered as in the case of. At the time when the delivery request acceptance period D ends, the delivery terminal selection unit 112 has two newly accepted terminal IDs of “12” and “13” because the number of additional deliverable terminals is 0. Is instructed to perform internal reproduction (local reproduction) by the cache memory inside each terminal unconditionally.
[0050]
8 shows a terminal 1 102 that has a distribution request to the server 101 (music distribution server) in the reception period of the distribution request reception period A shown in the schematic diagram of FIG. _-01 To terminal 5 102 _-05 (That is, a sequence chart showing a communication flow on the Internet 103 when a distribution request is made for terminal IDs “1”, “2”, “3”, “4”, “5”). As shown on the right side of FIG. 8, the processing in the server 101 is as follows: 1) During the predetermined period indicated by the distribution request reception period, the distribution request from the terminal 102 is received, and the distribution prioritization information is sequentially received in time series. A registration process for registering in the distribution request list 114, and 2) a distribution priority determining process for determining a distribution priority for distribution in accordance with the predetermined condition of the distribution prioritization information registered in the distribution request list 114; 3) In accordance with the determined distribution priority order, a distribution permission instruction is given to the number of distributable terminals for a terminal having a high distribution priority corresponding to a predetermined number of distributable terminals. For the remaining terminals with low distribution priority not applicable, it can be divided into three processing processes of distribution terminal determination processing for instructing internal reproduction by the cache memory of each terminal. That.
[0051]
That is, in FIG. 8, the terminal 1 102 is within the distribution request reception period A from the start of distribution request reception to the end of distribution request reception shown in FIG. _-1 To terminal 5 102 _-Five The distribution requests 1 to 5 are sequentially received in time series and sequentially registered in the distribution request list 114, and each terminal is based on the distribution prioritization information registered in the distribution request list 114 after the distribution request reception period ends. Terminal 4 102 in the descending order of the distribution priority corresponding to the number of additional distributable terminals calculated in advance. _-Four , Terminal 2 102 _-2 , Terminal 1 102 _-1 Are sequentially instructed to permit connection 4, 2, and 1 of connection to the content data distribution unit 113, while the terminal 5 having a low distribution priority exceeding the number of additional distributable terminals. 102 _-Five To terminal 3 102 _-3 The two terminals are instructed to perform internal reproductions 5 and 3 using the cache memory in each terminal.
[0052]
Next, the processing in the server 101 shown in FIGS. 7 and 8 will be further described with reference to the flowchart shown in FIG. FIG. 9 is a flowchart for explaining an example of the processing process in the server 101.
First, the distribution terminal selection unit 112 of the server 101 clears the past registration contents of the distribution request list 114 and restores it to the initial state, and starts a timer for measuring the distribution request reception period. Starts accepting a request for distribution of the content data (step S101). Next, the distribution terminal selection unit 112 determines whether or not there is a terminal 102 that requests distribution via the Internet 103 (YES in step S102), and from the terminal 102 that has made a distribution request. The terminal ID and the total number of times of reproduction data that have been attached to the distribution request and transmitted are registered first in the distribution request list 114 (step S103).
[0053]
Next, it is determined whether or not a delivery request acceptance period, for example, 10 seconds shown in FIG. 7 has elapsed (step S104), and steps S102 and S103 are repeated until the acceptance end time is reached (NO in step S104), The terminals 102 that have made distribution requests are registered in the distribution request list 114 in time series.
When the reception end time is reached (YES in step S104), the distribution terminal selection unit 112 ends the reception of the distribution request from the terminal 102 (step S105), and selects the distribution request terminal registered in the distribution request list 114. The total number of reproduction times data is retrieved with reference to step S106.
[0054]
Thereafter, the terminal IDs of the distribution request list 114 and the total reproduction count data are rearranged in the descending order of the extracted total reproduction count data, and the distribution priority for distributing the music data is determined for each terminal (step S107). . Next, the terminal ID having the first distribution priority in the rearranged distribution request list 114 is extracted (step S108).
Thereafter, it is determined whether or not the distribution priority is equal to or lower than the number of terminals capable of streaming distribution (step S109). If the distribution priority is higher than the number of distributable terminals (NO in step S109), When streaming delivery connection to the terminal 102 with the terminal ID is permitted (step S111), and when the distribution priority is equal to or lower than the number of distributable terminals (YES in step S109), the terminal 102 with the terminal ID is The internal reproduction by the cache memory inside the terminal is instructed (step S110).
[0055]
Thereafter, it is determined whether or not the processing for instructing the playback method for all the terminals 102 that have requested distribution during the distribution request acceptance period has been completed (step S112). NO), returning to step S108, steps S109, S110, and S111 are repeated for all terminals 102 that have made distribution requests.
[0056]
As shown on the right side of the flowchart in FIG. 9, among the above-described three processing processes in the server 101, 1) registration processing is performed in each step of steps S 101 to S 105, and 2) distribution priority order determination processing is performed. Steps S106 to S107, and the distribution terminal determination process 3) corresponds to steps S108 to S112.
[0057]
In addition, in order to reduce the total number of reproductions of the content data in each terminal 102 as the logic for determining the distribution priority for the distribution terminal selection unit 112 of the server 101 to select the terminal 102 for streaming distribution of music data, As the distribution prioritization information, the total number of reproduction times data attached to the distribution request from each terminal 102 (that is, the total number of reproduction times data in the management table 121 of FIG. 3 provided in each terminal 102) 121e) is used, and the case of using the logic in which the total reproduction count data is in descending order is shown for each terminal 102. However, the present invention is not limited to this case.
[0058]
For example, in order to shorten the cache period of music data cached in the cache memory 123 of each terminal 102 as much as possible, each music data is cached as the distribution prioritization information attached to the distribution request from each terminal 102. It is assumed that the oldest oldest cache date / time is extracted from the cache date / time cached in the memory 123 (that is, the cache date / time data 121c in the management table 121 of FIG. 3 provided in each terminal 102). The distribution priority order of the distribution request list 114 may be determined in the order of the oldest cache date and time for 102.
[0059]
Alternatively, in order to make the playback interval of the same music data in each terminal 102 as long as possible, the most recent playback date and time of each music data is represented as the distribution prioritization information attached to the distribution request from each terminal 102 As for each terminal 102, the oldest playback date and time representing the oldest latest playback date and time among the latest playback date and time (that is, the latest playback date and time data 121d in the management table 121 of FIG. 3 provided in each terminal 102) is used. The distribution priority order of the distribution request list 114 may be determined in the order of the oldest reproduction date and time.
[0060]
Alternatively, in order to reduce the number of times of reproduction of individual music data of each terminal 102 as much as possible, the number of times of reproduction of each music data (that is, as the distribution prioritization information attached to the distribution request from each terminal 102) (that is, In the management table 121 of FIG. 3 provided in each terminal, the maximum number of times of reproduction is extracted and used, and the number of times of the maximum number of times of reproduction for each terminal 102 is obtained. The distribution priority order of the distribution request list 114 may be determined in descending order.
[0061]
Alternatively, the distribution priority order of the distribution request list 114 may be determined in the order randomly selected from the terminals 102 registered in the distribution request list 114.
[0062]
In addition, as the distribution prioritization information attached to the distribution request from each terminal 102, one to a plurality of data (for example, total reproduction count data 121e, reproduction, etc.) among various data stored in the management table 121. The most frequently played count in the count data 121b, the oldest cache date in the cache date data 121c, and the oldest play date in the latest play date data 121d). The distribution priority order of the distribution request list 114 may be determined by making a comprehensive determination based on a preset priority order.
Furthermore, in addition to the various data as described above, it is possible to register arbitrary data that can determine the distribution priority of the distribution request list 114 in the distribution request list 114, and based on such arbitrary data, The distribution priority order of the distribution request list 114 may be determined.
[0063]
On the other hand, the terminal 102 (that is, the terminals 1 to 13 102 shown in FIG. 1). _-1 ~ 102 _-13 ) In the music data decoder 124: 1) Waiting process in which the transmission / reception unit 125 is operated to transmit a distribution request to the server 101 and wait for an instruction response from the server 101, and then 2) the server 101, a playback method specifying process for specifying a playback method of music data streamed from the server 101 or internal playback of music data cached in the cache memory 123 based on an instruction response from the server 101; Further, it can be divided into three processing processes: 3) reproduction processing for reproducing music data by the specified reproduction method.
[0064]
FIG. 10 is a flowchart for explaining an example of a processing process in the terminal 102. The flowchart shown in FIG. 10 starts in response to a music data reproduction instruction from the user. First, the terminal 102 can identify the terminal 102 and a management table in order to make a distribution request to the server 101. The desired data (one or more data among the total reproduction count data 121e, the reproduction count data 121b, the cache date / time data 121c, the latest reproduction date / time data 121d, etc.) stored in 121 are attached to the distribution request. Preparation for transmission as the distribution prioritization information is performed (step S201).
[0065]
The terminal ID extracted as the preparation for transmission and the desired data in the management table 121 are attached to the distribution request as the distribution prioritization information and transmitted to the server 101 (step S202).
Thereafter, a waiting process is performed for waiting until an instruction response to the distribution request arrives from the server 101 (step S203). When the instruction response from the server 101 is received, the process proceeds to the next step S204.
[0066]
First, referring to an instruction response from the server 101 that has arrived at the terminal 102, it is determined whether or not a distribution connection indicating that the instruction response is permitted for streaming distribution of music data from the server 101 is enabled. If the determination is made (step S204) and the distribution is not permitted (NO in step S204), the process proceeds to step S209 and is not cached from the server 101 but cached in the cache memory 123 of the terminal 102. In the case where it is indicated that the distribution is permitted (that is, when it is a streaming reproduction instruction) (YES in step S204), the server performs the operation of internally reproducing the music data currently being played. In order to be able to receive the music data distributed from 101, the music data is stored in the cache memory 123. It determines whether the free space is present to store (step S205).
[0067]
If it is determined that there is no free space for storing the music data in the cache memory 123 (YES in step S205), the cache manager 122 refers to the playback count data 121b in the management table 121. Then, by selecting and deleting the music data with the largest number of playbacks, the free space is secured in the cache memory 123 (step S206), and when it is determined that it is not yet full (NO in step S205) ) And the process proceeds to step S207. Here, if it is in the state like the management table 121 shown in FIG. 4, in step S206, the music data of the music data number “200366” having the largest number of reproduction times data 121b in the management table 121 is 10 times is deleted. Is done.
[0068]
In step S207, streaming distribution is connected to the server 101, music data streamed from the server 101 is sequentially received, and streaming reproduction is performed until the reception is completed while being cached in the cache memory 123. This is performed (step S207).
Thereafter, in the management table 121, the music data number (identification number for identifying the music data), the number of times of reproduction (data indicating one time reproduction), the cache date and time (cached) regarding the music data streamed and reproduced in step S207. Current date and time) and latest playback date and time (current date and time as latest playback date and time) are registered as music data number 121a, playback count data 121b, cache date and time data 121c, and latest playback date and time data 121d, respectively. At the same time, the total number of reproductions is recalculated and set as the total number of reproductions data 121e (step S208), and the process proceeds to step S212.
[0069]
On the other hand, when the distribution is not permitted and the instruction for internal reproduction is given (NO in step S204), the music data with the smallest number of reproductions is selected with reference to the reproduction number data 121b of the management table 121. (Step S209).
Until the reproduction of the music data with the smallest number of reproductions is completed, the data is sequentially read from the cache memory 123 and is internally reproduced (step S210). That is, if the management table 121 is in the state shown in FIG. 4, the music data with the smallest music data number “10031” that is played once is internally reproduced.
[0070]
Thereafter, “1” is added to the reproduction count data 121b of the management table 121 related to the internally reproduced music data and updated, the current date and time is set as the latest reproduction date / time data 121d, and the total reproduction count is calculated. Then, the total number of reproduction times data 121e is set (step S211).
In S212, it is determined whether or not the user continues to play back, and if playback is continuously requested (YES in Step S212), the process returns to Step S201, and the processes in Steps S202 to S211 are performed. If the process is to be repeated repeatedly (NO in step S212), the process is terminated.
[0071]
As shown on the right side of the flowchart of FIG. 10, among the above-described three processing processes in the terminal 102, a waiting process for sending a distribution request to the server 1) and waiting for an instruction response from the server is performed in steps S201 to S203. In each step, the reproduction method specifying process for specifying the reproduction method for reproducing the music data in 2) is performed in each step in steps S204 to S206 and S209, and the reproduction process for reproducing the music data in 3) is performed. This corresponds to each of steps S207, S208 and S210 to S212.
[0072]
Note that in step S206 of the flowchart shown in FIG. 10, the cache manager 122 determines the number of times the cached music data has been played as much as possible as the logic for determining the deletion priority for deleting the music data cached in the cache memory 123. In order to reduce the number of cached music data, the music data having the largest number of times of reproduction (that is, the number of times of reproduction data 121b in the management table 121 of FIG. 3 provided in each terminal) is deleted in order. However, the present invention is not limited to such a case.
[0073]
For example, in order to shorten the cache period of the cached music data as much as possible, the cache date and time indicating the cached date and time (that is, each terminal is provided as the deletion priority of music data to be deleted from the cache memory 123). The cache date / time data 121c) in the management table 121 of FIG. 3 may be used, and the oldest cached music data may be deleted in order from the cached date / time.
[0074]
Alternatively, as the deletion priority order of music data to be deleted from the cache memory 123, the order of music data randomly selected from the music data registered in the management table 121 may be used.
[0075]
In addition, as the deletion priority of music data to be deleted from the cache memory 123, a plurality of management data (for example, reproduction count data 121b and cache date / time data 121c) among various management data stored in the management table 121 is used. In this manner, the order of deletion may be determined by comprehensively determining the management data based on a preset priority order for a plurality of management data.
Furthermore, in addition to the various types of management data as described above, it is possible to register arbitrary data that can determine the deletion priority of music data to be deleted from the cache memory 123 in the management table 121. The deletion priority of music data to be deleted from the cache memory 123 may be determined based on the above.
[0076]
Note that, in steps S209 to S211 of the flowchart shown in FIG. 10, the music data decoder 124 uses the cached individual music as the logic for determining the playback priority for internally playing the music data cached from the cache memory 123. In order to make the number of data reproductions as uniform as possible, among the cached music data, the number of reproductions (that is, the reproduction number data 121b in the management table 121 of FIG. 3 provided in each terminal) is the smallest. Although the case of reproducing the music data in order is shown, the present invention is not limited to such a case.
[0077]
For example, in order to make the playback interval of each cached music data as long as possible, the latest playback indicating the most recently played date and time as the playback priority for internally playing the music data cached from the cache memory 123 Using the date and time (that is, the latest reproduction date and time data 121d in the management table 121 of FIG. 3 provided in each terminal), the music data reproduced from the oldest among the latest reproduction date and time most recently reproduced is used. It is good also as reproducing in order.
[0078]
Alternatively, the music data cached from the cache memory 123 may be played back in the order of music data selected at random from the music data registered in the management table 121 as a playback priority order.
[0079]
Further, among the various management data stored in the management table 121, a plurality of management data (for example, the playback count data 121b and the latest playback) are used as playback priorities for internally playing back the music data cached from the cache memory 123. The date and time data 121d) may be used, and the order of internal reproduction may be determined by comprehensively determining based on the priority order preset for a plurality of management data.
Furthermore, in addition to the various types of management data as described above, it is possible to register in the management table 121 any data that can determine the playback priority of music data that is internally played from the cache memory 123. Based on the data, the playback priority of the music data to be internally played from the cache memory 123 may be determined.
[0080]
In addition, as a distribution system for streaming distribution of music data shown in the above-described embodiment, when the internal playback is instructed from the cache memory 123 of the terminal 102, the internal playback instruction is sent as an instruction response from the server 101 to the terminal 102. The server 101 transmits an instruction response indicating that streaming distribution is performed only to the terminal 102 that is capable of streaming distribution, while the terminal 102 that instructs internal reproduction from the cache memory 123. In response to the request, an instruction response for instructing internal reproduction is not transmitted, and the terminal 101 also receives the server 101 while a predetermined time elapses from the time when the distribution request is made. If the instruction response from is not returned, the cache memory 12 is automatically It reads the music data to be reproduced from, may be configured to internally reproduced.
[0081]
Furthermore, in the above-described distribution system for distributing music data, the channel that can be selected by the user is composed of only one channel, and when the user turns on the terminal 102, music is always transmitted. Has been described, for example, a plurality of servers 101 corresponding to each channel are connected to the Internet 103, and each terminal 102 connected to the Internet 103 is arbitrarily selected from a plurality of channels. A channel selection key capable of selecting a channel, a management table 121 corresponding to each channel, and a cache memory 123. When the user selects a channel with the channel selection key, the channel is selected. Stored in the management table 121 The specified server by creating the distribution prioritization information using the various management data and the terminal ID, and transmitting it by attaching to the distribution request transmitted to the server 101 corresponding to the channel Based on the instruction response returned from 101, the distribution system may be configured such that the content data related to the selected channel is distributed and reproduced by streaming distribution or internally reproduced from the cache memory 123 of the terminal 102. .
[0082]
Further, as the network applied to the above-described distribution system, the case where the Internet 103 is used as shown in FIG. 1 has been shown. However, for example, in a LAN (Local Area Network) in a company or a home. It does not matter.
[0083]
【The invention's effect】
The content distribution server, content receiving terminal, and content distribution system according to the present invention can achieve the following effects.
That is, according to the content distribution server according to the present invention, various management data related to content data that has been distributed and cached in the past is transmitted from a content receiving terminal that transmits a distribution request for requesting distribution of content data to a distribution priority order. By receiving as distribution prioritization information to be attached, based on the received distribution prioritization information, the distribution priority of the content receiving terminal to be subjected to streaming distribution is set, and streaming is performed from the content distribution server. Depending on the number of terminals that can perform distribution and the distribution priority, it is possible to determine a content receiving terminal that performs streaming distribution from the content distribution server. Therefore, it is possible to perform streaming distribution of new content data fairly and equally to all the content receiving terminals that use the streaming distribution service, and at the same time, the network transfer data amount accompanying the distribution of content data is effective. Can be controlled automatically.
[0084]
Further, according to the content receiving terminal according to the present invention, the content data received from the content distribution server is cached in a cache memory, so that the distribution request attached to the content distribution server is attached to the distribution request. Even when there is no instruction response indicating the distribution of the content data from the content distribution server, it is possible to select the content data previously cached in the cache memory and efficiently perform internal reproduction. Therefore, not only can the streaming delivery of fresh content data be received from the content delivery server by the delivery request, but also the case where the streaming delivery cannot be received from the content delivery server is cached. The content data can be reproduced internally, and the user can always view fresh content data. Furthermore, it is possible to effectively control the amount of network transfer data that accompanies the distribution of content data.
[0085]
Therefore, according to the content distribution system according to the present invention configured by connecting the content distribution server and the content receiving terminal to a network, the content distribution server regardless of the total number of terminals of the content receiving terminal. Content data can be streamed within the allowable range of the network capacity of the network interposed between the content receiving terminal and the content receiving terminal. Fresh content data can be distributed fairly and fairly to all the content receiving terminals that use.
[Brief description of the drawings]
FIG. 1 is a network configuration diagram showing a concept of a network configuration in a music distribution system which is an example of an embodiment of a content distribution system according to the present invention.
2 is a functional block diagram showing an example of a functional block configuration in the content distribution server according to the present invention of FIG. 1. FIG.
3 is a functional block diagram showing an example of a functional block configuration in the content receiving terminal according to the present invention of FIG. 1. FIG.
4 is a memory configuration diagram showing an example of management information stored in a management table built in the terminal shown in FIG. 3; FIG.
5 shows an example of a state in which content receiving terminals are registered in the distribution request list built in the content distribution server shown in FIG. 2 in a certain distribution request acceptance period in the order in which distribution requests are made. It is a memory block diagram.
FIG. 6 shows distribution priority for content receiving terminals registered in the distribution request list shown in FIG. 5 after rearranging the distribution priority of the content receiving terminals regarding the content data to be distributed after the end of the distribution request acceptance period. It is a memory block diagram which shows an example of an order | rank.
FIG. 7 shows a relationship between a content receiving terminal instructing distribution from the content distribution server and a content receiving terminal instructing internal reproduction according to the number of terminals of the distribution request received by the content distribution server every certain distribution request reception period. It is the schematic diagram showing an example of the time flow in which each number changes.
8 is a sequence chart showing a communication flow on the Internet when a terminal having a distribution request to the server makes a distribution request in the reception period of the distribution request reception period of FIG.
FIG. 9 is a flowchart for explaining an example of a processing process in the server.
FIG. 10 is a flowchart for explaining an example of a processing process in the terminal.
[Explanation of symbols]
101: Content distribution server (music distribution server, server), 102, 102 _-1 ~ 102 _-13 ... Client terminal (content receiving terminal, terminal) 103 ... Internet 111 ... Distribution data storage unit 112 ... Distribution terminal selection unit 113 ... Distribution unit 114 ... Distribution request list 114a ... Terminal ID area 114b ... Distribution priority Ranking information area (total playback count data area), 115 ... network connection unit, 121 ... management table, 121a ... music data number, 121b ... playback count data, 121c ... cache date / time data 121c, 121d ... latest playback date / time data, 121e ... Total playback count data, 122... Cache manager, 123... Cache memory, 124... Music data decoder, 125.

Claims (8)

In a content distribution server that accumulates content data to be distributed to a content receiving terminal, accepts a distribution request for content data transmitted from each content receiving terminal, and distributes the content data by streaming.
A list of distributed content data recorded in the cache memory in the content receiving terminal attached to the distribution request received every predetermined period unit, and the cache date and time or the number of times of reproduction for each content in the list based on one or content delivery prioritization information comprising a plurality of reproduction time, to determine the distribution priority of the content data for the content receiving terminal received by the selection criteria set in advance,
A content distribution server for performing streaming distribution of content data to a content receiving terminal having a high distribution priority corresponding to a predetermined number of distributable terminals according to the determined distribution priority . 2. The content distribution server according to claim 1, wherein an instruction for internal reproduction by a cache memory in the receiving terminal is given to a content receiving terminal that has a low distribution priority and cannot be distributed within the unit period. The delivery priority, the distribution prioritization total number of recording views in the information often content receiving terminal sequence, or the oldest oldest cache time of recording the old content receiving terminal of the recording of the cache time order, the latest playback record of the date and time the oldest oldest playback date and time of the recording of new content receiving terminal order, most often most views a lot of content receiving terminal order among the number of plays of each content data, one of the The content distribution server according to claim 1, wherein the content distribution server is a content distribution server. In the content receiving terminal that caches the content data distributed from the content distribution server in the cache memory each time and decrypts and reproduces each cached content data,
One or more of a list of content data cached in the cache memory and a cache date / time for each content in the list, or the number of times of reproduction and the latest reproduction date / time are sent to the distribution server. sent together with a more composed content delivery prioritization information,
Instruction response from the distribution server in accordance with the delivery priority information determined based on the content distribution ranking information definitive to the delivery request, when the streaming distribution of the content data to reproduce the distributed content data, A content receiving terminal characterized in that , when an internal reproduction instruction is issued by a cache memory, the cached predetermined content data is read and reproduced internally.   5. The content reception according to claim 4, wherein when there is no instruction response within a predetermined elapsed time from transmission of the distribution request, content data is automatically read from the cache memory and internally reproduced. Terminal.   The content data read from the cache memory and internally reproduced is content data with a small number of reproductions indicating the number of times each content data has been reproduced, or content data with the oldest reproduction date and time of each content data. The content receiving terminal according to 4 or 5.   The content data cached in the cache memory is in the order of the content data in which the number of times of reproduction of each content data is large, or in the order of the content data having the oldest cache date and time indicating the date and time when the content data is cached. 6. The content receiving terminal according to claim 4 or 5, wherein the content receiving terminal is deleted from the cache memory in any order set in advance with respect to the cache date and time.   A content distribution system comprising the content distribution server according to any one of claims 1 to 3 and the content receiving terminal according to any one of claims 4 to 7.

Images