JP2005117257A - Content downloading method and content downloading system - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide a content downloading method for optimizing the setting of reproduction order of contents being downloaded or displayed, as a means for coordinating information which a user wants to notify or advertize and information which a televiewer wants to acquire. <P>SOLUTION: When contents are downlaoded from a server to a client through a network and reproduced sequentially by the client, the server downloads contents attached with reproduction priorities P1-Pn at the client, and a reproduction schedule sequentially assigning the contents to reproduction orders T1-Tall calculated by multiplying the emergence rates A1-An of the contents set for respective priorities P1-Pn by the number of contents of respective priorities P1-Pn starting from the content of lowest priority to the client through a network, and the contents are reproduced sequentially according to the reproduction schedule. <P>COPYRIGHT: (C)2005,JPO&NCIPI

Description

  The present invention relates to a content distribution method for distributing content from a server to a client via a network, and a content distribution system based on the content distribution method.

  A content distribution system (hereinafter abbreviated as a distribution system) that sequentially reproduces content (a unit of information that constitutes specific content by combining text, images, videos, or music in a single or combination) with an unspecified number of viewers For example, an electric display board in a platform of a station or a street (scrolling text becomes content) is well known. In addition, in public facilities and hospitals, in order to provide necessary or useful information to facility users and visitors, distribution systems using electric display boards and television monitors have been constructed.

  A recent distribution system has a system configuration for distributing contents from a server to a client via a network (Internet or dedicated line) (Patent Documents 1 to 3 described later). Normally, the server is managed by a content distributor, and distributes the content via a network to clients arranged for each system user. This content is created by the creator and passed to a server managed by the distributor. In this way, the distribution system involves a distributor, a creator, and a user. The classification of the three parties is functional for the distribution system, and the three parties may be the same, but the creator and the user may be different from the distributor.

  In Patent Document 1, an information acquisition module acquires information (contents) from various information sources, and an information amount adjustment module adjusts the amount of information so as to be a unit period acquired information amount. The distribution system which adjusts a timing according to the user's action notified from the action monitoring module and presents the adjusted information to the user at the adjusted timing is disclosed. Thus, Patent Document 1 is characterized by a flexible combination of a wide variety of contents.

  Patent Document 2 weights each attribute for an advertisement (content) for which a time zone to be distributed in advance is not specified, and distributes distribution frequency and distribution reflecting distribution conditions from the distribution side and viewer side. Determine the order, create an advertisement order schedule, schedule the advertisement (content) for which the delivery time zone and delivery frequency are specified in advance, create the delivery time schedule, and create the two schedules. A distribution system is disclosed in which advertisements are distributed to viewers from the distribution side while viewing the time based on the distribution schedule, and displayed on the display unit on the viewer side. As described above, Patent Document 2 further examines a flexible combination of various contents.

  Patent Document 3 discloses a distribution system in which display data transmitted from an information server is distributed to an output unit via a communication line network, and the output unit displays received display data. The server distributes the display data constituting a plurality of display screens to the output unit via the communication line network as schedule data including a display order and / or a display time. The display data constituting the plurality of display screens are displayed according to the schedule data. As described above, Patent Document 3 discloses another example of a flexible combination of various contents.

JP 2000-099441 A (pages 3 to 13, FIGS. 1 and 2) JP 2001-236444 A (2-9 pages, FIGS. 1, 2 and 12) JP 2002-109235 A (pages 3 to 7, FIGS. 1, 2 and 11)

  As described above, the distribution system via the network can flexibly combine various contents. However, the content that the user wants to announce or advertise is not necessarily the same as the content that the viewer wants to acquire, so the problem is how to combine and distribute the various contents. In this regard, Patent Document 1 ([0005] to [0012]) and Patent Document 2 ([0003]) explicitly point out the above problem.

  In Patent Document 1, the information amount adjustment module adjusts the information amount to the unit period acquisition information amount. Here, the unit period acquisition information amount is “information amount acquired per unit period (Cited document 1 [0033])”, and the information amount adjustment module ignores the meaning of various contents, It only has the meaning of quantitative regulation. In addition, the content subjected to such quantitative regulation is only distributed in accordance with “(I) module for distributing information within a unit period (Patent Document 1 [0069])”, which is an information presentation timing adjustment module. It does not take into account any information announced or advertised by the side or information that the viewer wants to obtain.

  Here, the information presentation timing adjustment module includes “(III) module for adjusting timing so that attributes such as information contents and the situation at the time of presentation are compatible (Patent Document 1 [0069])”. Yes. This (III) module that adjusts the timing matches the content and other attributes of the information to be presented and the status obtained from the behavior monitoring module so that the attributes such as the content of the information and the situation at the time of presentation are compatible. To present information. However, the presentation is processing that focuses on information that the viewer wants to acquire, and information that is announced or advertised by the user is not considered. It is important to coordinate the information notified or advertised by the user side with the information that the viewer wants to acquire.

  On the other hand, in patent document 2, the distribution schedule using the attribute set to the content is created, thereby adjusting the information announced or advertised by the user and the information the viewer wants to acquire. Specifically, the distribution conditions set by the user are “information indicating the distribution time zone, number of distributions, target audience group”, and the distribution conditions set by the viewer are “advertising according to viewer preference” By handling “information indicating a group”, a distribution schedule that takes into account all distribution conditions can be used to adjust the information announced or advertised by the user and the information that the viewer wants to acquire. However, in order to consider the viewer side, it is essential to present the distribution conditions from the viewer. In a distribution system that unilaterally distributes and displays content, the system configuration of Patent Document 2 is difficult to use.

  In order to adjust the information that the user wants to announce or promote and the information that the viewer wants to acquire without receiving presentation of distribution conditions from the viewer, the content that the user wants to announce or promote is distributed without exception. Depending on the priority order, it is preferable to set a playback order in consideration of the probability of being noticed by the viewer for each content. In this regard, Patent Document 3 distributes schedule data including the display order and / or display time together with content, and seems to attempt to adjust information that the user wants to announce or advertise and information that the viewer wants to acquire. Looks like. However, it does not touch on the determination of a specific reproduction order.

  Therefore, as a means for adjusting the information that the user wants to announce or advertise and the information that the viewer wants to acquire while taking advantage of the ability to flexibly deliver a variety of content in a distribution system via a network, A specific means for optimizing the setting of the playback order of the content to be distributed or displayed was examined.

  As a result of the examination, the developed content is distributed from the server to the client via the network, and when the content is sequentially played back by the client, the server sets the priority P1 to Pn (n is a natural number of 2 or more) to be played back by the client. Each of the reproduction orders T1 to Tall calculated by multiplying the assigned contents and the appearance rates A1 to An of the contents set for each of the priority orders P1 to Pn and the number of contents for each of the priority orders P1 to Pn have a low priority. This is a content distribution method (hereinafter abbreviated as a distribution method) in which a playback schedule assigned in order from content is distributed to clients via a network, and each content is played back in order according to the playback schedule.

  The playback schedule only defines the repetition order of each content to be played back, and the round trip time of the playback schedule is further the sum of the playback time of each content. The playback schedule is basically distributed from the server to the client together with all the content to be played back according to the playback schedule. However, only the reproduction schedule may be distributed in advance from the server to the client, and each content may be sequentially distributed from the server to the client immediately before or simultaneously with reproduction. For example, designated content with a reproduction designated time, which will be described later, and interrupted content with a sequential reproduction request are sequentially delivered from the server to the client.

  Here, the priorities P1 to Pn are numerical values representing the importance of the content, and may be numerical values representing the difference in the degree of importance between the priorities P1 to Pn. On the other hand, the appearance rates A1 to An mean the reproduction frequency or the repetition frequency of the contents corresponding to the priority orders P1 to Pn, and within the range where the order of the priority orders P1 to Pn is not impaired, It has a magnitude relationship different from the priorities P1 to Pn. For example, a combination in which the priorities P1 to Pn are numerical values having a linear function proportional relationship and the appearance rates A1 to An are numerical values having a quadratic function or exponential proportional relationship is conceivable.

  Specifically, if the numerical value is larger and the priority order or the appearance rate is higher and the priority orders P1 = 1, P2 = 2, and P3 = 3, the appearance ratio A1 = 1 corresponding to the priority order P1, and the priority order P2 are set. , The appearance rate A2 = 1.5, and the appearance rate A3 = 2.25 corresponding to the priority P3. As described above, the appearance rates A1 to An have a function of replacing the priorities P1 to Pn previously assigned to the contents with actual reproduction frequencies or repetition frequencies of the contents. Further, since the correspondence relationship between the priority orders P1 to Pn and the appearance rates A1 to An may be arbitrarily determined, even if the same content is used, different reproduction schedules can be generated and different content distribution forms can be constructed.

  The present invention is applied to a distribution system in which a distributor, a creator, and a user are involved. The distributor manages the server and allocates at least one client for each user. When each user has a plurality of clients, individual contents and playback schedules may be distributed to each client, or the same contents and playback schedule may be distributed to a certain number of clients. The creator may be the same as the distributor or the user, or may be another third party, and may supply the content to the server. The network may be either the Internet or a dedicated line, but the Internet is preferable because it is open to the outside and it is easy to handle third-party content that defines a URL as the content.

  The distribution method of the present invention is similar to the conventional one in that a wide variety of contents are sequentially reproduced according to a reproduction schedule. However, in order to realize the “adjustment of information that the user wants to announce or advertise and the information that the viewer wants to acquire”, which is an issue of the present invention, priorities P1 to Pn are assigned to each content, and this priority P1 Appearance rates A1 to An, which are content repetition frequencies, are set for each Pn, and the reproduction order T1 to Tall calculated from the multiplication of the appearance rates A1 to An and the number of contents for each of the priorities P1 to Pn A playback schedule is generated by assigning the contents in order of priority. That is, the reproduction schedule is generated by paying attention to the priority levels P1 to Pn of the respective contents and obtaining the number of reproductions of all contents including the number of repetitions of the respective contents in consideration of the difference of the priority levels P1 to Pn. There is a feature.

  Specifically, in the reproduction schedule, appearance rates A1 to An corresponding to the priorities P1 to Pn are set, and the number of contents for each priority order P1 to Pn is totaled to calculate the number of contents by rank R1 to Rn. Then, the required number of reproductions S1 (= A1 × R1) to Sn (= An × Rn) is calculated by multiplying the appearance rates A1 to An for the respective priorities P1 to Pn by the content numbers R1 to Rn by rank. Then, the required number of reproductions S1 to Sn for each rank is summed to calculate the necessary reproduction total number Sall, and the reproduction schedule is configured as a permutation in which the same number of reproduction orders T1 to Tall are arranged in the necessary reproduction total number Sall. The contents assigned with the order P1 are assigned in order to the reproduction orders T1 to Tall.

  Here, as described above, since the appearance ratios A1 to An do not necessarily have to be natural numbers, the required reproduction numbers S1 to Sn for each rank do not necessarily become natural numbers. However, Sall obtained by summing S1 to Sn must be a natural number in order to determine the order in which each content is allocated, that is, the reproduction order T1 to Tall. For this reason, each S1 to Sn is rounded down and rounded to a natural number individually by rounding up or rounding, or S1 to Sall are summed and then rounded down to Sall and rounded up to a natural number by rounding up or rounding off. Actually, the larger the reproduction order Tall, the more the content is distributed, which is preferable. Therefore, S1 to Sall may be rounded up to a natural number by rounding up or rounding individually. Usually, the required number of reproductions S1 to Sn for each rank is larger than the number of contents R1 to Rn for each rank in order to multiply the appearance rates A1 to An. In this case, the required reproduction numbers S1 to Sn for each rank are within the range. The content for each priority order P1 to Pn is repeatedly reproduced.

  The generation of the reproduction schedule has a function of distributing content with low priority to the range of the reproduction order T1 to Tall substantially evenly and a function of increasing the appearance rate of content with high priority (reducing the repetition interval). . In other words, by assigning the content with low priority to the reproduction schedule with priority, the content with low priority is scattered throughout the reproduction schedule so that the information desired by the viewer can be reproduced regularly and reliably. In addition, since the repetition frequency according to the appearance rates A1 to An is ensured for each content, the number of high-priority content reproductions is relatively high, and information that the user wants to announce or advertise is more frequently used. Can show to viewers.

  A more specific reproduction schedule is generated as follows. First, for the content with the lowest priority order P1, the value obtained by dividing the required total playback number Sall by the required playback number S1 for each priority order P1 is defined as the appearance interval Int1, and the appearance interval Int1 is determined from the playback order T1. For the content assigned at intervals and assigned the next lowest priority P2, the remaining playback number Srest (= Sall-S1) obtained by subtracting the required playback number S1 by rank from the required playback total number Sall is ranked in this priority order P2. A value obtained by dividing by another necessary number of reproductions S2 is set as an appearance interval Int2, and is assigned at an interval of this appearance interval Int2 from the reproduction order T2 to which the content Cp1 is not assigned. The priority P3 and higher is assigned the above priority P2. In accordance with the assigned content, it is repeatedly assigned and generated until the required total number Sall is filled.

  As described above, the appearance interval Int1 is obtained by dividing the total number of required reproductions Sall by the number of necessary reproductions S1 by rank. However, since Sall cannot be divided by S1 in practice, the decimal point obtained by dividing Sall by S1. Use only the upper part and round off the decimal part. This means that the non-reproduction order Tx equal to each content of the priority order P1 is assigned, and the fractional number after the rounded down decimal point means the non-reproduction order Tx for the content of the last priority order P1 assigned to the reproduction schedule. From now on, for example, when the appearance interval Int1 = 5, if the content with the previous priority P1 is assigned to the reproduction order T1, the content with the next priority P1 is reproduced in the reproduction order T (1 + Int1 + 1) = reproduction opened by the appearance interval Int1. Assigned to order T7.

  The system configuration for realizing the above distribution method is as follows. That is, in a content distribution system in which content is distributed from a server to a client via a network and the content is sequentially played back by the client, the server is assigned priorities P1 to Pn (n is a natural number of 2 or more) for playback by the client. The distribution side storage means for storing the content, and the reproduction orders T1 to Tall calculated from the multiplication of the content appearance rates A1 to An set for each priority order P1 to Pn and the number of contents for each priority order P1 to Pn. A schedule generation unit configured to generate a playback schedule assigned in order from each content having a low priority; and a distribution unit configured to send the content and the playback schedule to the client via the network. The client transmits the content and the playback schedule via the network. Receive from the server A stage, and a receiving side storage means for storing the received content and the reproduction schedule, the content delivery system comprising a reproducing means for reproducing the order according to the reproduction schedule content (hereinafter, the distribution system and substantially) a.

  The server is composed of a computer responsible for information processing for distributing a reproduction schedule and content to a client. As the distribution-side storage means provided in this server, various conventionally known internal or external storage devices can be used. The distribution means provided in the server is means for communicating with the client via the network, and various conventionally known communication devices can be used. On the other hand, the schedule generation unit is a unit for generating a reproduction schedule that is a feature of the present invention, and specifically includes each program stored in the distribution-side storage unit and an information processing unit included in the server. Is done.

  The schedule generation means is an appearance rate setting means for setting appearance rates A1 to An corresponding to the priorities P1 to Pn, and totals the number of contents for each of the same priorities P1 to Pn, and the number of contents by rank R1 to The number of contents classified by rank for calculating Rn, and the number of reproductions required by rank S1 (= A1 × R1) by multiplying the number of contents classified by rank R1 to Rn with the appearance rates A1 to An for each priority order P1 to Pn. ~ Sn (= An × Rn) required number of required reproduction number calculating means, and a permutation (1 in which the same number of reproduction orders T1 to Tall are arranged in the required total number of reproductions Sall obtained by summing the required number of reproductions S1 to Sn for each rank. A playback schedule structuring unit for allocating to the playback order T1 to Tall in order from the content with the lowest priority P1.

  Further, the reproduction schedule assigning means sets the value obtained by dividing the necessary total reproduction number Sall by the necessary reproduction number S1 for each priority order P1 as the appearance interval Int1, and the lowest priority order from the reproduction order T1 to the appearance interval Int1. The first order allocating means for allocating the content with P1 and the remaining reproduction number Srest (= Sall-S1) obtained by subtracting the required reproduction number S1 for each rank from the necessary total reproduction number Sall for each priority of the priority P2. The value obtained by dividing by the number of reproductions S2 is defined as an appearance interval Int2, and the content having the next lowest priority P2 is assigned to the reproduction order in which the content is not assigned and the appearance interval Int2 is assigned. It consists of repetitive assignment means for repetitively assigning contents of priority order P3 or higher until the required total number of reproductions Sall is filled in accordance with the assignment of contents with P2.

  The client is a computer that temporarily stores the reproduction schedule and content received from the server and performs information processing for sequentially reproducing the content according to the reproduction schedule. The receiving means provided in the client is means for communicating with the server via a network, and various conventionally known communication devices can be used. As the receiving side storage means provided in the client, various types of conventionally known internal or external storage devices can be used.

  The reproduction means is means for reproducing the contents in order according to the reproduction schedule, and may be constituted by various conventionally known output devices operated by the information processing unit of the client. As described above, by using the reproduction means using the information processing unit of the client, it is possible to temporarily interrupt the reproduction of the content according to the reproduction schedule or to interrupt the content. As content that requires such special processing, third-party content that captures playback content from another server (third-party server) on the network, specified content that is assigned a playback specified time regardless of the playback schedule, or There is an interrupt content to which a sequential playback request is attached regardless of the playback schedule. Specifically, such playback means includes a content playback program to be stored in the reception-side storage means, an information processing unit included in the client, and an output device such as a display or a speaker, and the played content is the display or speaker. Etc. to the viewer.

  For third-party content that captures playback content from another server (third-party server) on the network, a third-party content playback means is added to the client of the distribution system. That is, the client includes third-party content reproduction means for receiving third-party content whose access destination is indicated by a URL from a third-party server via the network according to the URL and reproducing the content of the URL by the reproduction means. . The third-party content reproduction means only needs to have a function of reproducing the third-party content by controlling the output device, and can be incorporated in the information processing unit of the reproduction means described above. The third-party content may be composed of playback content that is fetched entirely from the third-party server, or may be configured to capture part of the playback content from the third-party server.

  With respect to the designated content to which the reproduction designated time is attached regardless of the reproduction schedule, a designated content reproduction means is added to the client of the distribution system. That is, the client interrupts the designated content with the designated reproduction time into the content with the priorities P1 to Pn to be reproduced according to the reproduction schedule, and reproduces it at the reproduction designated time or the time before and after the reproduction designated time. There is provided designated content reproduction means for reproduction by the means. The designated content reproducing means only needs to have a function of controlling the reproducing means to reproduce the designated content, and can be incorporated into the information processing unit of the reproducing means described above.

  Although the designated content is played back in an interrupted manner with respect to the playback schedule, the playback schedule of the present invention only defines the repetition order of each content to be played back, so even if the designated content is interrupted in this way, There is no effect on the content that is played in order according to the playback schedule. This specified content is similar to the interrupt content described later, but the timing for interrupting the playback schedule is determined as the playback specified time, and the specified content can be distributed simultaneously with the playback schedule or content distribution. doing.

  For interrupt content to which a sequential playback request is added regardless of the playback schedule, an interrupt content playback means is added to the client of the distribution system. That is, the client receives the interrupt receiving means for receiving the interrupt content with the sequential playback request by the receiving means, and the priority levels P1 to Pn for reproducing the interrupt content with the sequential playback request according to the playback schedule. Interrupted content reproduction means for interrupting the attached content and causing the reproduction means to reproduce the content is provided. The interrupt receiving means only needs to have a function of controlling the receiving means and receiving the interrupt content as appropriate, and can be incorporated into the above-described receiving means. Further, the interrupt content playback means may have a function of controlling the playback means to play back the interrupt content, and can be incorporated in the information processing unit of the playback means described above.

  The interrupt content is played back in an interrupted manner with respect to the playback schedule. Since the playback schedule of the present invention only defines the repetition order of each content to be played back, the interrupt content is interrupted in this way. However, there is no effect on the content that is played in order according to the playback schedule. This interrupted content is similar to the above-mentioned designated content. For example, when the timing for interrupting the reproduction schedule is known in advance, it can be handled as the designated content. The interrupt content playback means is required when a specific content is desired to be interrupted to the playback schedule according to a request from a user or the like. Delivered to the client. For this reason, unlike the handling of the designated content, an interrupt receiving means is required so that the interrupt content can be received at any time.

  The playback schedule and content are updated when a new playback schedule or content is distributed from the server to the client. However, in the client, since the content is already being reproduced according to the previously distributed reproduction schedule and content, it is not preferable to update the reproduction schedule or the content in the middle so as to interrupt the reproduction of such content. Therefore, in order to update the reproduction schedule or the content mainly by the client, the following update means may be added to the client. That is, the client periodically updates the content or the reproduction schedule with the server, and when the content or schedule update is confirmed, the client distributes the updated content or the reproduction schedule with the server distribution means. Update receiving means for distributing and receiving the content or the reproduction schedule by the receiving means.

  The update confirmation unit only needs to have a function of controlling the reception unit to communicate with the server and confirming whether or not a new reproduction schedule or content exists in the distribution-side storage unit, and can be incorporated into the function of the reception unit. . In addition, the update receiving means only needs to have a function of receiving the new reproduction schedule or content as appropriate by controlling the receiving means in order to receive the new reproduction schedule or content confirmed by the update confirmation means. Can be incorporated. The update confirmation unit and the update reception unit operate after the distribution system is operated and the reproduction schedule and the content are first distributed, that is, when the second and subsequent reproduction schedules or the content is distributed.

  According to the present invention, in a distribution system via a network, information that a user wants to announce or advertise can be well coordinated with information that a viewer wants to acquire while flexibly combining various types of content. effective. Moreover, since the optimization of the playback order of the content to be distributed or displayed is automatically set depending on the priority order desired by the user, a distribution system that is valuable as a service provided to the user is provided. There is an effect that can be done.

  In the present invention, contents having the same priority are handled in the same row, and assigned to the generated reproduction schedule in the order stored in the storage unit of the server. Since the content is played repeatedly according to the playback schedule, it is strictly limited to the required number of playbacks by rank. Even if the content has the same priority, the number of times played per playback schedule is different, but the content with the same priority is substantially equivalent. May be considered. This is true because the larger the number of contents included in the playback schedule, the smaller the absolute difference in the number of playbacks per playback schedule. In order to increase the number of contents included in the reproduction schedule, the number of contents can be simply increased, and if the appearance rate is set high, the number of reproductions required by rank increases, and the number of apparent contents can be increased.

  However, as the playback schedule is repeated, the total number of playbacks per playback schedule gradually increases in absolute difference, and content that is played back in an earlier playback order is played back more. From now on, considering the priority order set by the user or distributor as well as the order of the contents stored in the storage unit of the server, the information that the user wants to announce or advertise and the information that the viewer wants to acquire are more precise. Can be adjusted. Thus, the present invention has the effect of providing a technique for optimizing content allocation that has not been conventionally considered.

  Hereinafter, embodiments of the present invention will be described with reference to the drawings. FIG. 1 is a network configuration diagram showing the overall configuration of a distribution system to which the present invention is applied, FIG. 2 is a functional block diagram of the server 100 showing the functional configuration of the server 100, and FIG. 3 is a client 200 showing the functional configuration of the client 200. It is a functional block diagram. In this example, for convenience of explanation, the number of clients is small, but in actual service provision, many clients connect to the server via the network.

  As shown in FIGS. 1 to 3, the distribution system of this example connects a server 100 having the information processing unit 101 as a core and a plurality of clients 200 having the information processing unit 201 as a core through a network 300. It consists of a whole structure. The network 300 is based on the Internet that is normally open to the outside, but may be an intranet that is closed to the outside, or a dedicated network that connects only specific servers and clients. The server 100 is managed by the distributor, and assigns one or a plurality of clients 200 to users who have contracted with the distributor. That is, the three exemplary clients 200 are assigned to the same or individual users.

  The reproduction schedule and content for each distribution unit are distributed for each client 200. From now on, even when multiple clients 200 are assigned to the user, each client 200 (a) when playing the same content with the same playback schedule, (b) playing with the same content but different playback schedule In such a case, (c) different contents may be reproduced with different reproduction schedules. Since the playback schedule depends on the content, the playback schedule is necessarily different if the content is different.

  The content is provided by the user himself / herself to the distributor, or separately created by the creator based on the request of the user and provided to the distributor. In addition, the distributor himself may create his own content. These clients have a wide variety of contents consisting of only audio or music, still images or moving images. In the present invention, each content is identified only by the priority assigned to each content while mixing such various contents. A reproduction schedule for adjusting the information that the user wants to announce or advertise and the information that the viewer wants to acquire is automatically generated based on the priority and the number of contents for each priority.

  The server 100 can be configured by a general-purpose computer. As shown in FIG. 2, the server 100 has a hardware configuration centered on the information processing unit 101 of the computer, a storage unit 102, a transmission / reception unit 103, an output unit 104, and an input unit 105. It can be expressed by a functional block consisting of The storage unit 102 is an internal or external storage device of the computer, and normally uses a hard disk device. The transmission / reception unit 103 is a transmission / reception device that accesses the network 300 from the server 100, and uses, for example, a modem or a router. The output unit 104 is an interface that outputs data handled by the server 100 and a management screen to the outside, and can be exemplified by a display and a printer. The input unit 105 is an interface for inputting data handled by the server 100 from the outside, and examples thereof include a keyboard, a mouse, a scanner, and various memory readers.

  In the server 100, the distribution side storage means of the present invention is the distribution management program (distribution management PR) 401, the information processing section 101 and the storage section 102, and the schedule generation means is the schedule generation program (SC generation PR) 402 and the information processing section. 101, and the distribution means includes a distribution program (distribution PR) 403, an information processing unit 101, and a transmission / reception unit 103. As described above, when a general-purpose computer is used as the server 100, there is an advantage that functions can be easily changed or added by changing or adding various programs. On the contrary, if it is not necessary to change or add functions, the server 100 of the present invention is configured as a dedicated device having only functions for storing and distributing contents and reproduction schedules, and the reproduction schedule is generated by an external computer. It may be.

  The storage unit 102 of the server 100 additionally stores the content (C) captured from the input unit 105 as needed, and also generates a playback schedule (playback SC) generated by the schedule generation program 402 according to the priority assigned to the content. Is temporarily stored. The contents and reproduction schedule are managed as a database by the distribution management program 401 executed by the information processing unit 101 of the server 100. The content or the reproduction schedule managed in this way becomes a reference for determining whether or not the content or the reproduction schedule is updated by an update confirmation unit of the client 200 described later. Further, the content and the reproduction schedule are distributed to the client 200 for each distribution unit through the transmission / reception unit 103 by causing the information processing unit 101 to execute the distribution program (distribution PR) 403 stored in the storage unit 102.

  The schedule generation program 402 includes an appearance rate setting program (appearance rate setting PR) 404, a content number totaling program by rank (C number totaling PR by rank) 405, a required playback count calculation program by rank (required playback count calculation PR by rank) 406, a playback schedule configuration program (playback SC configuration PR) 407, a first sequential allocation program (first sequential allocation PR) 408, and a repeated allocation program (repeated allocation PR) 409. These programs are basically executed in the order described above, and a reproduction schedule is generated from the priorities P1 to Pn assigned to the respective contents.

  The appearance rate setting means includes an appearance rate setting program 404, an information processing unit 101, an input unit 105, and an output unit 104 of the server 100. The appearance rate setting program 404 is a program that allows the distributor to set the appearance rates A1 to An for adjusting the frequency with which the priority order P1 to Pn assigned to each content by the user or creator is reproduced by the client 200. The simplest appearance rate setting program 404 is a procedure in which the information processing unit 101 of the server 100 prompts the distributor to input the appearance rates A1 to An from the output unit 104 of the server 100. The procedure includes a procedure for causing the distributor to input the priorities A1 to An from the input unit 105, and a procedure for storing the input appearance rates A1 to An in the storage unit 102 of the server 100 by the information processing unit 101 of the server 100.

  Since the appearance rates A1 to An are not numerical values having a specific correspondence with the priorities P1 to Pn, as described above, the appearance rate setting program 404 that allows the distributor to individually set the appearance rates A1 to An is preferable. This means that the appearance rate can be finely changed according to the type of content to be distributed and according to the user's request. Regardless of the type of content or the request of the user, when setting the appearance rate uniformly corresponding to the specific priority order P1 to P2, the relational expression of the priority order and the appearance rate is input to the distributor from the output unit of the server , A procedure for allowing the distributor to input the relational expression from the input unit of the server, a procedure for calculating the individual appearance rates A1 to An from the relational expression by the information processing unit of the server, and the calculation in the storage unit of the server It is preferable to use an appearance rate setting program including a procedure for storing the appearance rates A1 to An obtained from the above.

  The rank-based content number totalization means includes a rank-specific content number totalization program 405 and the information processing unit 101 of the server 100. The rank-based content count program 405 is a program that counts the number of contents for each priority order P1 to Pn. The specific number-of-contents totaling program 405 for each rank is called by the information processing unit 101 of the server 100 in order to sequentially read all the contents of the distribution units stored in the storage unit 102 of the server 100 by the information processing unit 101 of the server 100. The procedure for determining the priority orders P1 to Pn of the contents and the procedure for adding the number of contents by rank R1 to Rn corresponding to the priority orders P1 to Pn determined by the information processing unit 101 of the server 100 are performed for all contents. And finally, the information processing unit 101 of the server 100 stores the number of contents R1 to Rn classified by rank in the storage unit 102 of the server 100. When storing the content in the storage unit 102 of the server 100, the information processing unit 101 of the server 100 may also execute the rank-based content number totaling program and add the number of content by rank R1 to Rn as needed. .

  The rank-specific required number-of-plays calculation means includes a rank-specific required number-of-plays calculation program 406 and an information processing unit 101 of the server 100. The required number-of-plays calculation program 406 by rank multiplies the number of contents R1 to Rn calculated by rank by the appearance rates A1 to An, respectively, and determines the contents of the respective priorities P1 to Pn in the playback schedule as a repetition unit. It is a program that determines whether or not playback is possible. The specific required number-of-plays calculation program 406 by rank sequentially reads the number of contents by rank R1 to Rn and the appearance rates A1 to An stored in the storage unit 102 of the server 100 by the information processing unit 101 of the server 100, the server A procedure for obtaining the required number of reproductions S1 to Sn by rank by multiplying the content numbers R1 to Rn and the appearance rates A1 to An of the contents called by the 100 information processing units 101, and the information processing unit 101 of the server 100 The procedure consists of storing the required number of reproductions S1 to Sn obtained by order in the storage unit 102 of the server 100. These procedures are repeated for all priorities P1 to Pn.

  The reproduction schedule configuration means includes a reproduction schedule configuration program 407 and an information processing unit 101 of the server 100. The required number-of-plays calculation program 407 for each rank calculates a required total number Sall from the sum of the required number-of-required playback numbers S1 to Sn previously calculated, and is composed of a number of playback orders T1 to Tall equal to the total number of required playbacks Sall. It is a program that constitutes a dimensional matrix. A specific reproduction schedule configuration program 407 is called by the information processing unit 101 of the server 100, a procedure for reading out the necessary number of reproductions S 1 to Sn by rank stored in the storage unit 102 of the server 100 by the information processing unit 101 of the server 100. A procedure for obtaining the required playback total number Sall by summing up the required playback counts S1 to Sn by rank, and a procedure for setting a one-dimensional matrix composed of the playback order T1 to Tall based on the required playback total number Sall by the information processing unit 101 of the server 100 The information processing unit 101 of the server 100 stores the one-dimensional matrix composed of the reproduction orders T1 to Tall in the storage unit 102 of the server.

  The first order allocating unit includes a first order allocating program 408 and the information processing unit 101 of the server 100. The first order assignment program 408 is a program for assigning contents of priority P1 to the one-dimensional matrix composed of the reproduction orders T1 to Tall set in advance, and the information processing unit 101 of the server 100 sets the priority order P1. The procedure can be divided into a procedure for calculating the appearance interval Int1 in the content reproduction schedule and a procedure for specifically assigning the content according to the appearance interval Int1 by the information processing unit 101 of the server 100.

  The specific first order allocation program 408 is a procedure for reading out the required total reproduction number Sall and the necessary reproduction number S1 classified by rank stored in the storage unit 102 of the server 100 by the information processing unit 101 of the server 100, and the information processing unit of the server 100 101, the required playback total number Sall is divided by the required playback number S1 by rank, and the first stage of the procedure for calculating the appearance interval Int1, which is the quotient excluding the remainder, and the earliest playback order Tj free by the information processing unit 101 of the server 100 The procedure of assigning the first content with the priority P1 to (natural number in i = 1 to Sall), and then the next reproduction order Tj (i = 1 to 1) that is spaced by the appearance interval Int1 by the information processing unit 101 of the server 100 (Procedure for assigning the next content of priority P1 to the natural number in Sall), a procedure for repeating the procedure by the information processing unit 101 of the server 100 only by the required number of reproductions S1-1 by rank, and an information processing unit 101 of the server 100 Server 100 The storage unit 102 comprising a subsequent step of storing a one-dimensional matrix consisting reproduction order T1~Tall assigned content priority P1.

  The storage of the one-dimensional matrix composed of the reproduction orders T1 to Tall in the storage unit 102 of the server 100 may be performed after the execution of the repetitive allocation program 409 described later, that is, after all the contents have been allocated. Further, a procedure for calculating the remaining number of reproductions Srest used in the later-described repetitive allocation program 409 may be added to the above procedure. In the procedure for calculating the remaining reproduction number Srest, the information processing unit 101 of the server 100 reads out the required total reproduction number Sall and the required reproduction number S1 classified by rank stored in the storage unit 102 of the server 100 by the information processing unit 101 of the server 100. The procedure, the information processing unit 101 of the server 100 calculates the remaining reproduction number Srest by subtracting the required number of reproductions S1 for each rank from the required total number of reproductions Sall, and the information processing unit 101 of the server 100 stores it in the storage unit 102 of the server 100 It consists of a procedure for storing the remaining reproduction number Srest.

  Here, the procedure for reading out the necessary reproduction total number Sall and the required reproduction number S1 classified by rank stored in the storage unit 102 of the server 100 by the information processing unit 101 of the server 100 is the first sequential allocation program. When executed together with 408, it is not necessary. Further, the procedure for causing the information processing unit 101 of the server 100 to store the remaining playback count Srest in the storage unit 102 of the server 100 is not necessary when the later-described repeated allocation program 409 is executed following the first sequential allocation program 408. is there.

  The repetitive assignment means includes a repetitive assignment program 409 and an information processing unit 101 of the server 100. The repetitive assignment program 409 is a program for assigning higher priority contents to a one-dimensional matrix composed of reproduction orders T1 to Tall to which lower priority contents have already been assigned. A procedure for calculating the appearance intervals Int2 to Intn in the reproduction schedule of the contents of the respective priorities P2 to Pn by 101, and a procedure for specifically assigning the contents according to the appearance intervals Int2 to Intn by the information processing unit 101 of the server 100; Can be broadly divided. If the first allocation program 408 does not calculate the remaining reproduction number Srest, the information processing unit 101 of the server 100 calculates the respective remaining reproduction number Srest before allocating the contents of the respective priorities P2 to Pn. A procedure is necessary. Srest may be a common variable that is always used by subtracting the required number of lower priority orders.

  The specific repetition assignment program 409 is as follows when the priority order P2 is described. First, a procedure for reading the remaining playback count Srest and the required playback count S2 by rank stored in the storage section 102 of the server 100 by the information processing section 101 of the server 100, and the remaining playback count Srest by rank by the information processing section 101 of the server 100 The first stage of the procedure for calculating the appearance interval Int2, which is a quotient obtained by dividing by the required number of reproductions S2 and excluding the remainder, and the earliest reproduction order Tj (i = 1 to Sall natural number in the information processing unit 101 of the server 100) ) To assign the first content of the priority P2 to the next, and then to the free reproduction order Tj (i = 1 to a natural number in Sall) that is spaced by the appearance interval Int1 by the information processing unit 101 of the server 100 A procedure for assigning the next content of P2, a procedure for repeating the procedure by the information processing unit 101 of the server 100 by the required number of reproductions S2-1 by rank, and a priority for the storage unit 102 of the server 100 by the information processing unit 101 of the server 100 Rank P1 Content consists of the subsequent steps of storing a one-dimensional matrix consisting reproduction order T1~Tall assigned to. Here, when another content is already assigned to the reproduction order Tj (i = 1 to a natural number in Sall) spaced by the appearance interval Int1, the content is assigned to the next reproduction order Tj + 1. .

  The repetitive assignment program 409 repeats the process in the same manner for the priority order P2 and higher, and assigns each content with a higher priority order to an empty part of the one-dimensional matrix composed of the reproduction orders T1 to Tall. For this reason, a procedure for calculating the remaining reproduction number Srest necessary for the next iteration is executed by the information processing unit 101 of the server 100 between each iteration. The one-dimensional matrix composed of the reproduction orders T1 to Tall may be stored in the storage unit 102 of the server 100 after all contents have been assigned.

  The client 200 can be configured by a general-purpose computer. As shown in FIG. 3, the client 200 has a functional block including a storage unit 202, a transmission / reception unit 203, and an output unit 204 centered on an information processing unit 201 of the computer. It can be expressed as In principle, the client 200 inputs data (contents and playback schedule) only via the network 300, and thus a normal input unit is not necessary, but an input unit 205 may be provided for maintenance or the like. The storage unit 202 is a computer internal or external storage device, and normally uses a hard disk device. The transmission / reception unit 203 is a transmission / reception device that accesses the network 300 from the client 200, and uses, for example, a modem or a router. The output unit 204 is an interface that outputs content to be played back by the client to the outside, and can be exemplified by a display and a speaker. The input unit 205 is an interface for directly inputting data when maintaining the client, and examples thereof include a keyboard, a mouse, a scanner, and various memory readers.

  In the client 200, the receiving side storage means of the present invention is the reception management program (reception management PR) 501, the information processing section 201 and the storage section 202, and the content playback means is the content playback program (C playback PR) 502, the information processing section. 201 and the output unit 204, and the receiving means includes a reception program (reception PR) 503, an information processing unit 201, and a transmission / reception unit 203. As described above, when a general-purpose computer is used as the client 200, there is an advantage that functions can be easily changed or added by changing or adding various programs. Conversely, if there is no need to change or add functions, the client may be configured from a dedicated device that can sequentially play back the content according to the playback schedule.

  The storage unit 202 of the client 200 receives a reception program (reception PR) that receives and processes the content (C) and the reproduction schedule (reproduction SC) distributed from the server 100, as well as the content (C) and the reproduction schedule (reproduction SC). ) 503 and a content reproduction program (C reproduction PR) 502 for sequentially reading and reproducing the content (C) and the reproduction schedule (reproduction SC). The content and reproduction schedule are managed as a database by the reception management program 501 executed by the information processing unit 201 of the client 200. The content or reproduction schedule managed in this way is checked against the content or reproduction schedule managed by the server 100 to determine whether or not there is an update.

  The distribution system of this example not only receives basic content and playback schedule, but also receives interrupted content at any time, confirms update of content or playback schedule to the server 100, and if there is an update at any time Receive content or playback schedule. Therefore, the reception program 503 further includes a basic reception program (basic reception PR) 504, an interrupt reception program (interrupt reception PR) 505, an update confirmation program (update confirmation PR) 506, and an update reception program (update reception PR) 507. It is subdivided into. From now on, the reception means is from the basic reception program 504, the information processing section 201 and the transmission / reception section 203 of the client 200, and the interrupt reception means is from the interruption reception program 505, the information processing section 201 and the transmission / reception section 203 of the client 200, and the update confirmation means. Includes an update confirmation program 506, an information processing unit 201 and a transmission / reception unit 203 of the client 200, and an update reception unit includes an update reception program 507, the information processing unit 201 and the transmission / reception unit 203 of the client 200, respectively.

  The basic reception program 504 is a program that receives basic content or a reproduction schedule distributed from the server 100 and performs basic reception processing for storing the content or the reproduction schedule in the storage unit 202 of the client 200. A specific basic reception program 504 is a procedure in which the information processing unit 201 of the client 200 receives a distribution request from the server 100 by the transmission / reception unit 203 of the client 200, and the information processing unit 203 of the client 200 distributes the request based on the distribution request. The content or reproduction schedule is received by the transmission / reception unit 203 of the client 200, and the content or reproduction schedule is stored in the storage unit 202 of the client 200 as needed. Management of the content or playback schedule stored in the storage unit 202 of the client 200 is transferred to database processing by the reception management program 501 as needed.

  The interrupt reception program 505 receives the interrupt content sent to the client 200 as a single content that is not incorporated in the playback schedule at the request of the user or distributor, and stores it in the storage unit 202 of the client 200 It is. A specific interrupt reception program 505 is a procedure for receiving an interrupt request from the server 100 by the information processing unit 201 of the client 200 by the transmission / reception unit 203 of the client 200, and based on the interrupt request, the information processing unit of the client 200 The interruption content distributed by 201 is received by the transmission / reception unit 203 of the client 200, and the interruption content is stored in the storage unit 202 of the client 200 as needed.

  Since the processing of the interrupt reception program 505 conforms to the basic reception program 504, the interrupt reception program 505 may be configured to use the basic reception program 504 as an exception processing program for processing an interrupt request from the server 100. . It is desirable that the interrupt content is basically played back immediately after reception, but since the content is often played according to the playback schedule, the playback of the content according to the playback schedule is not hindered. First, it is desirable to store in the storage unit 202.

  The update confirmation program 506 associates the content or playback schedule stored in the storage unit 202 of the client 200 with the content or playback schedule stored in the storage unit 102 of the server 100, and whether or not the content or playback schedule is updated It is a program to confirm. The content or the reproduction schedule may be confirmed to be updated simultaneously or individually. The content can be confirmed most reliably by comparing with each reproduction content, but this increases the amount of data handled and increases the processing load on the client 200. From now on, for example, a content ID or the like is attached to each content, and it is preferable to confirm whether or not there is an update by comparing the content IDs. In this case, whether or not the reproduction schedule is updated can be determined by the arrangement order of the content IDs according to the reproduction order T1 to Tall.

  A specific update confirmation program 506 is a procedure for acquiring information on the content or reproduction schedule (the content ID or the arrangement of the content IDs) currently stored in the storage unit 102 of the server 100 by the information processing unit 201 of the client 200, A procedure for reading information (the content ID or a sequence of content IDs) currently played back from the storage unit 202 of the client 200 by the information processing unit 201 of the client 200, and the server 100 by the information processing unit 201 of the client 200 And a procedure for comparing information of each content or reproduction schedule of the client 200, and a procedure for instructing the update receiving means to execute update if the information processing unit 201 of the client 200 does not match the result of the comparison.

  The update receiving program 507 requests the delivery of the content or playback schedule from the client 200 to the server 100 in response to the update confirmation means confirming the update of the content or playback schedule, and distributes the updated content or playback schedule. , A program to receive. Normally, in the stage of receiving the updated content or the playback schedule, the content is already being played back sequentially according to the playback schedule. Therefore, the update receiving program 507 does not hinder the playback of such content and smoothly Alternatively, it is responsible for buffer processing for updating the playback schedule.

  A specific update receiving program 507 is a procedure for transmitting a distribution request for a content or a reproduction schedule currently stored in the storage unit 102 of the server 100 by the information processing unit 201 of the client 200, and distributed by the information processing unit 201 of the client 200. This procedure consists of a procedure for storing the new content or playback schedule that has been stored in the storage unit 202 of the client 200. In addition, if a procedure for switching to the newly acquired content or playback schedule is provided when the playback schedule of the currently played content reaches the playback order Tall, the above-described content or playback schedule can be smoothly updated. It becomes possible. From now on, at the stage of receiving the updated content or playback schedule, the client 200 stores the old and new content or playback schedule in the storage unit 202 of the client 200. The old content or playback schedule may be deleted after switching to the updated content or playback schedule.

  Such an update confirmation unit and update reception unit are mainly configured by each client 200 to check the update of the content and playback schedule handled by each client 200 with respect to the server 100, and when the update is approved, the client 200 200 It has a function to acquire content and playback schedule updated by itself. As a result, it is not necessary to manage the update of each client 200 by the server 100, and it is possible to reduce the load on the server 100 and hence the management burden on the distributor.

  In addition, the distribution system of this example is based on the fact that the content having the playback content completed by itself is played in order according to the playback schedule, while the third-party content having the playback content in the third-party server 301 on the network 300, Then, the designated content for which the designated reproduction time is set in advance and the interrupt content distributed as appropriate are reproduced. For this reason, the content playback program (C playback PR) 502 further includes a basic content playback program (basic C playback PR) 508, a third party content playback program (third party C playback PR) 509, and a designated content playback program (designated C). Playback PR) 510 and interrupt content playback program (interrupt C playback PR) 511.

  From now on, the reproduction means is the content reproduction program 508 or the third party content reproduction program 509, the information processing unit 201 and the output unit 204 of the client 200, and the designated content reproduction means is the designated content reproduction program 510, the information processing unit 201 of the client 200 and The output unit 204 and the interrupt content playback means are configured by an interrupt content playback program 511, an information processing unit 201 of the client 200, and an output unit 204, respectively.

  The basic content playback program 508 is a program that sequentially reads the content stored in the storage unit 202 of the client 200 according to the playback schedule, plays back the content according to the playback content of each content, and outputs the content from the output unit 204 to the outside. A specific basic content playback program 508 is a procedure in which the information processing unit 201 of the client 200 reads out the playback schedule from the storage unit 202 of the client 200, and the information processing unit 201 of the client 200 assigns the playback schedule in order from the playback order T1. A procedure for sequentially reading the content from the storage unit 202 of the client 200, a procedure for reproducing the content read by the information processing unit 201 of the client 200 according to the content of each content, and the content of the content reproduced according to the content of the reproduction This is a procedure for outputting from the output unit 204. A speaker is used for the output unit 204 when the playback content is audio or music, and a display is used for the output unit 204 when the playback content is a still image or a moving image.

  The third-party content playback program 509 is a third-party content that is stored in the third-party server 301 on the network 300 to which the client 200 is connected, among the content that is sequentially played according to the playback schedule, the interrupt content, or the specified content. The client 200 is used as a network browser. As described above, the third-party content playback program 509 is an exception processing program of the basic content playback program 508, the designated content playback program 510 or the interrupt content playback program 511, and the basic content playback program 508, the specified content playback program 510 or This is executed when a URL is detected as the playback content in the procedure of playing back each content of the interrupt content playback program 511.

  A specific third-party content reproduction program 509 is a procedure for accessing the third-party server 301 on the network 300 from the transmission / reception unit 203 according to the URL detected as the reproduction content of the third-party content by the information processing unit 201 of the client 200 The information processing unit 201 of the client 200 includes a procedure for retrieving the reproduction content posted at the URL from the third party server 301. The content thus reproduced is reproduced according to the procedure for reproducing each content of the basic content reproduction program 508, the designated content reproduction program 510 or the interrupt content reproduction program 511. In other words, the reproduction content posted on the URL can be handled in the same manner as the reproduction content of other content once it is captured.

  The designated content reproduction program 510 is a program for reproducing the designated content at the designated reproduction time regardless of the reproduction schedule. The specific designated content reproduction program 510 is a procedure for reading the designated content stored in the storage unit 202 of the client 200 by the information processing unit 201 of the client 200 at the designated reproduction time, and the designated content read by the information processing unit 201 of the client 200. Are reproduced following normal content that has been reproduced after the designated reproduction time has elapsed, and the reproduction content of the designated content that has been reproduced is output from the output unit 204 in accordance with the reproduction content. The designated content is only reproduced by interrupting the reproduction schedule immediately after the reproduction designation, but does not change the reproduction order of the reproduction schedule. For this reason, the content according to the playback schedule may be played back in the next playback order following the content immediately before the specified content is interrupted after the specified content is played back.

  It is only necessary that the designated content can be reproduced at an absolute time that is not influenced by repetition of the reproduction schedule = reproduction designated time. Thus, the designated content can be received simultaneously with the normal content by the basic receiving means, or appropriately received as interrupt content by the interrupt receiving means. The reproduction designated time may be temporary or may be a repetition time within a specific period. Normally, since there is a period from the reception of the designated content to the designated reproduction time, it is stored in the storage unit 202 of the client 200 after reception. Therefore, when the designated reproduction time is the repetition time, the client 200 The same designated content is read from the storage unit 202 and reproduced.

  The interrupt content reproduction program 511 is a program that interrupts and reproduces the interrupt content received by the interrupt receiving means between the reproduction schedule reproduction orders T1 to Tall. The specific interrupt content playback program 511 is a procedure for reading the interrupt content stored in the storage unit 202 of the client 200 by the information processing unit 201 of the client 200, and the interrupt content read by the information processing unit 201 of the client 200. It consists of a procedure for reproducing following the normal content that has been reproduced after the reading, and a procedure for outputting the reproduced content of the reproduced interrupted content from the output unit 204 corresponding to the reproduced content. The interrupt content is only interrupted and reproduced by appropriately interrupting the reproduction schedule, and does not change the reproduction order of the reproduction schedule. For this reason, the content in accordance with the playback schedule may be played back in the next playback order following the content immediately before the interrupted content is interrupted after the interrupted content is played back.

  The interrupt content is distributed from the server 100 as appropriate according to the request of the user or distributor, or directly transmitted from the user or distributor's computer, etc., and received by the above-described interrupt content receiving means. It suffices if the reproduction means can reproduce after reception. Since this interrupt content does not have a specified playback time like the specified content, for example, if priority is given to the interrupt content and the priority of the content according to the playback schedule is high, it will be much later than the time of reception. It is also possible to delay the playback of the interrupt content within a period of no time. Further, unlike the specified content, the interrupt content does not need to be stored in the storage unit 202 of the client 200 because it is basically not required to be played once. However, for example, in the case of interrupt content with a determined number of playbacks, it is temporarily stored in the storage unit 202 of the client 200, and the interrupt content is repeatedly played back by appropriately interrupting the playback schedule so as to satisfy the playback number. You may make it do.

  Next, the processing flow of the distribution system according to the present invention will be described mainly by generating a reproduction schedule in the server 100 (FIGS. 4 to 16) and reproducing content in the client 200 (FIGS. 17 to 20b). Reference numerals in the following refer to FIGS. Further, this example assumes a distribution system that distributes and reproduces a total of 27 contents C11 to C53 with five priority levels P1 to P5 for convenience of explanation. However, as the number of contents included in the reproduction schedule increases, the user can better coordinate information that the user wants to announce or promote and information that the viewer wants to acquire.

  4 is an overall flow diagram of content distribution by the distribution system, FIG. 5 is a partial flow diagram showing generation of a reproduction schedule, FIG. 6 is a conceptual diagram showing contents C11 to C53 with priority levels P1 to P5, and FIG. FIG. 8 is a conceptual diagram showing a correspondence relationship between the priority orders P1 to P5 and the appearance rates A1 to A5, FIG. 8 is a partial flow diagram showing a playback schedule configuration constituting a one-dimensional matrix composed of playback orders T1 to Tall, and FIG. FIG. 10 is a conceptual diagram showing the calculation of the required number of reproductions for each priority, and FIG. 10 is a conceptual diagram that forms a one-dimensional matrix composed of the reproduction orders T1 to Tall from the total number of required reproductions Sall. FIG. 11 is the reproduction order T1 to Tall. FIG. 12 is a partial flow diagram showing a flow of assigning contents to the one-dimensional matrix composed of the first order assignment and the repeated assignment, and FIG. 12 assigns the contents C11 to CR18 of the priority order P1. FIG. 13 is a conceptual diagram showing the procedure for assigning the contents C21 to CR25 having the priority P2, and FIG. 14 shows the procedure for assigning the contents C31 to CR36 having the priority P3. FIG. 15 is a conceptual diagram showing a procedure for assigning the contents C41 to CR45 having the priority order P4, and FIG. 16 is a conceptual diagram showing a procedure for assigning the contents C51 to CR53 having the priority order P5. It is.

  In the distribution system of the present invention, as shown in FIG. 4, first, the user, creator, or distributor starts from creating content. Usually, in order to use the content that the user wants to distribute, the user or the creator who requested the creation by the user creates the content by using each computer or the like. The type of content is not limited, and any content that can be reproduced by the client 200 can be used. The playback time of each content is determined by the longer playback time of audio, music, or moving image included in the playback content, or the longer display time set for text or still images. These contents to be distributed also include those created by distributors. The distribution unit for each client 200 is configured by combining the content of the user (or the creator requested to create by the user) and the content of the distributor.

  Each content causes a user or a distributor to set priorities P1 to P5. The priorities P1 to P5 for each content are set for each content in advance on the computer where the user or distributor creates the content, or separately used when each content is stored in the storage unit 102 of the server 100. Or a distributor may set. The number of priority levels is arbitrary, but if the number of levels is small, the function of distributing contents in the present invention cannot be exhibited. Conversely, if the number of levels is too large, it is difficult to set the priority level. Therefore, the number of priority levels is preferably at least 3 to several tens, and practically about 5 to 10 in this example. The priorities P1 to P5 are represented by numbers that distinguish between large and small, but the numbers may be easy to understand natural numbers at equal intervals. Henceforth, the priorities P1 to P5 of this example are natural numbers of 1 to 5 (see FIG. 6 described later).

  Each content is stored in the storage unit 102 of the server 100 as appropriate or collectively. The content provided by the user or creator is provided to the distributor by various recording media, stored in the storage unit 102 of the server 100 by the distributor, or directly from the user or creator computer via the network 300. To the storage unit 102 of the server 100. The content created by the distributor is created by the distributor's computer and stored in the storage unit 102 of the server 100 via various recording media or the network 300, or directly created on the server 100 and stored in the server 100. The data is stored in the unit 102. Each content is assigned an individual content ID when it is stored in the storage unit 102 of the server 100, thereby facilitating management and update confirmation in the server 100 or the client 200.

  When the distribution unit content is stored in the storage unit 102 of the server 100, a reproduction schedule is generated based on the distribution unit content. A specific reproduction schedule generation procedure is based on the procedure shown in FIG. The appearance rates A1 to A5 are set by the distributor according to the user's request using the appearance rate setting means and stored in the storage unit 102 of the server 100. The timing of setting the appearance rates A1 to A5 may be before the content of the distribution unit is prepared or after the content of the distribution unit is prepared, but in any case, it is set at the first stage of the generation of the reproduction schedule. It is necessary to keep.

  At the beginning of the generation of the reproduction schedule, first, as shown in FIG. 6, the number of contents by rank R1 to R5 for each priority order P1 to P5 is counted by the number of contents by rank. In the case of this example, the content number R1 = 8 by the contents C11 to C18 having the priority P1 = 1, the content number R2 = 5 by the contents C21 to C25 having the priority P2 = 2, and the contents having the priority P3 = 3. The number of contents by rank R3 = 6 by C31 to C36, the number of contents by rank R4 = 5 by the contents C41 to C45 of priority P4 = 4, and the number of contents by rank R5 = 3 by the contents C51 to C53 of priority P5 = 5 It becomes.

  As shown in FIG. 7, each priority order P1 to P5 is associated with preset appearance rates A1 to A5. Specifically, the priority P1 = 1 is the appearance rate A1 = 1.00, the priority P2 = 2 is the appearance rate A2 = 1.75, the priority P3 = 3 is the appearance rate A3 = 2.25, and the priority P4 = 4 is the appearance rate A4. = 2.50, and the priority order P5 = 5 is the appearance rate A5 = 2.65. Thus, unlike the priority orders P1 to P5, the appearance ratios A1 to A5 do not have to be natural numbers as long as the magnitude relationship in the description order is maintained. This is because the priority orders P1 to P5 represent the degree of priority intended by the user or distributor, whereas the appearance rates A1 to A5 are set for the purpose of setting the appearance frequency of each content in the playback schedule. This is based on the difference in purpose.

  When the calculation of the number of contents by rank R1 to R5 and the association between the priority orders P1 to P5 and the appearance rates A1 to A5 are completed, the playback schedule forming means subsequently plays back the playback order T1 as shown in FIG. Create a one-dimensional matrix (one-dimensional MX) consisting of ~ Tall. In FIG. 8, Si represents the required number of reproductions by priority of priority Pi, Ri represents the number of contents by priority of priority Pi, and Ai represents the appearance rate of priority Pi, and i is the upper limit number n of priority levels. It is a variable. Specifically, first, the required number of reproductions S1 to S5 by rank is obtained by multiplying the number of contents by rank R1 to R5 and the appearance rates A1 to A5, and then obtained from the sum of the required reproduction numbers S1 to S5 by rank. A one-dimensional matrix composed of the reproduction orders T1 to Tall is created as the required total reproduction number Sall = reproduction order Tall.

  In the case of this example, as shown in FIG. 9, the required number of reproductions by rank S1 = number of contents by rank R1 × appearance rate A1 = 8 × 1.00 = 8, the required number of reproductions by rank S2 = number of contents by rank R2 × appearance Rate A2 = 5 × 1.75 = 0.75≈9, required number of reproductions by rank S3 = number of contents by rank R3 × appearance rate A3 = 6 × 2.25 = 13.5≈14, necessary number of reproductions by rank S4 = number of contents by rank R4 × appearance The rate A4 = 5 × 2.50 = 12.5≈13, and the required number of reproductions by rank S5 = the number of contents by rank R5 × the appearance rate A5 = 3 × 2.65 = 7.95≈8. Here, since the appearance rates A2 to A5 are decimal numbers, the required reproduction numbers S2 to S5 by order are decimal numbers, but are rounded off.

  The required total reproduction number Sall is 52 because it is the sum of the required reproduction numbers S1 to S5 by rank. From this, the reproduction order Tall = required total reproduction number Sall = 52, and as shown in FIG. 10, a one-dimensional matrix composed of the reproduction orders T1 to Tall can be created. In FIG. 10, the one-dimensional matrix is illustrated as a structure in which each cell-like reproduction order Tj (j = 1 to 52) is arranged. Further, the reproduction order T10, the reproduction order T20, the reproduction order T30, the reproduction order T40, and The square of the reproduction order T50 is surrounded by a thick frame to make the separation easy to understand.

  The contents C11 to C18 having the priority P1 to the contents C51 to C53 having the priority P5 are sequentially assigned to the one-dimensional matrix composed of the reproduction orders T1 to Tall thus completed to generate a reproduction schedule. As shown in FIG. 11, first, the first order assigning means assigns the contents C11 to C18 having the priority P1 to the one-dimensional matrix to which no content is assigned, and then repeat assigning means. Thus, the contents C21 to C53 of the priority order P2 and later are assigned to the one-dimensional matrix to which the contents have already been assigned. In FIG. 11, Si represents the required number of reproductions by priority of the priority order Pi, i is a variable whose upper limit is the number n of priority levels, Tj represents the reproduction order on the one-dimensional matrix to which content is allocated, and j is 1 ~ Sall variable, and C1k represents each content of the priority order P1, Cik represents each content of the priority order Pi, and k is a variable with the upper limit of the number of contents Ri by rank corresponding to each priority order Pi. is there.

  The first order allocation means first calculates an appearance interval Int1. The appearance interval Int1 is a value obtained by dividing the required total reproduction number Sall by the required reproduction number S1 by rank, and the remainder is rounded down. That is, appearance interval Int1 = required total number of reproductions Sall / necessary number of reproductions by rank S1 = 52/8 = 6, and the remainder is 4. From now on, as shown in FIG. 12, the contents C11 to C18 having the priority P1 are assigned to a one-dimensional matrix composed of reproduction orders T1 to Tall with an appearance interval Int1 = 6. In FIG. 12, for convenience of explanation, a one-dimensional matrix is illustrated in parallel according to each priority, but there is only one actual one-dimensional matrix.

  Specifically, first, the content C11 is assigned to the reproduction order T1. In this way, the first content C11 with the priority P1 assigned from the state where no content is assigned is always assigned to the reproduction order T1. The next content C12 is assigned to the reproduction order T8 opened by the appearance interval Int1, and the contents C13 to C18 are assigned with the appearance interval Int1 opened. In this way, the reproduction order Tj to which the contents C11 to C18 are assigned cannot assign other contents C21 to C53. In FIG. 12, a cross is marked in the square of the reproduction order Tj to which the content can no longer be assigned.

  Here, since the contents C11 to C18 having the priority order P1 are allowed to be assigned by the required number of reproductions S1 by order, if the last contents C18 are assigned, the assignment to the one-dimensional matrix is completed. This means that the appearance rate A1 = 1.00 and the contents C11 to C18 having the priority P1 are set to appear only once on the reproduction schedule. In other words, since the appearance rates A2 to A5 are set to values larger than 1, content that is repeatedly reproduced on the reproduction schedule is generated (see FIGS. 13 to 17 described later).

  Next, as shown in FIG. 13, the repetitive assignment means assigns the contents C21 to C25 having the priority P2 to the reproduction order Tj in which the one-dimensional matrix is free. For this reason, first, the appearance interval Int2 is calculated. Unlike the appearance interval Int1, the appearance interval Int2 uses the number of already assigned contents C11 to C18, that is, the remaining reproduction number Srest obtained by subtracting the required reproduction number S1 for each rank from the necessary reproduction total number Sall. That is, the appearance interval Int2 = (required total reproduction number Sall−required reproduction number by rank S1) / required reproduction number by rank S2 = remaining reproduction number Srest / required reproduction number by rank S2 = (52-8) / 9 = 4. The remainder is 8.

  Accordingly, the first content C21 having the priority P2 has not yet been assigned the content, and is assigned to the earliest reproduction order T2, and the next content C22 is assigned to the reproduction order T7 which is free by the appearance interval Int2 = 4. Unlike the contents C11 to C18 having the priority order P1, the number of contents R2 by order having the priority order P2 is 5, whereas the required number of reproductions S2 by order is 9. For this reason, after the contents C21 to C25 of the first round are assigned to the one-dimensional matrix, the contents C21 to C24 of the second round can be further assigned. However, although the playback order Tj remains after the appearance interval Int2 = 4 or more after the content C24 assigned to the playback order T44, the content C25 can no longer be assigned because the content is already assigned by the required playback number S2. .

  Thereafter, in the same manner as the assignment of the contents C21 to C25 having the priority P2, the contents C31 to C36 having the priority P3 (FIG. 14), the contents C41 to C45 having the priority P4 (FIG. 15), and the priority P5 being assigned. The contents C51 to C53 are assigned to the reproduction orders Tj that are vacant in order. Specifically, the contents C31 to C36 are assigned at an appearance interval Int3 = 2, the contents C41 to C45 are assigned at an appearance interval Int4 = 1, and the contents C51 to C53 are assigned at an appearance interval Int3 = 1. .

  Here, for example, when viewing the content C31, the playback order T22 corresponding to the appearance interval Int3 = 2 is already assigned the content C14, and the next playback order T23 is already assigned the content C25, so that it is assigned to the subsequent playback order T24. Yes. In this way, each content is not necessarily assigned to the one-dimensional matrix at equal intervals according to the appearance intervals, but rather is assigned at unequal intervals.

  Further, at the stage of assigning the contents C51 to C53 of the priority order P5, all of the lower contents C11 to C45 have already been assigned, and only the number of reproduction orders Tj that are equal to the required number of reproductions S5 by rank have already been left. For this reason, the contents C51 to C53 can be assigned without obtaining the appearance interval T5 again. This can be understood from the fact that, at the stage of assigning priority P5, the remaining reproduction number Srest is equal to the necessary reproduction number S5 by rank, and the appearance interval Int5 is always 1.

  In this way, a low-priority content can be allocated at equal intervals to a one-dimensional matrix composed of the reproduction orders T1 to Tall, and a high-priority content can be reproduced with a high appearance frequency without being biased. The time for which the reproduction schedule makes one round is the sum of the reproduction times of all the contents C11 to C53 reproduced according to this reproduction schedule. The server distributes the reproduction schedule and contents C11 to C53 reproduced according to the reproduction schedule as distribution units from the server 100 to each client 200. The client 200 that has received the content C11 to C53 of the reproduction schedule and the distribution unit by the receiving means sequentially reproduces the content C11 to C53 according to the reproduction schedule.

  FIG. 17 is a partial flowchart showing the reproduction of various contents in the client 200, FIG. 18 is a conceptual diagram showing the reproduction of the contents C11 to C53 according to the reproduction schedule, and FIG. 19a interrupts the reproduction schedule by the designated content Cap. FIG. 19b is a conceptual diagram showing a shift in the reproduction schedule due to interruption of the designated content Cap, FIG. 20a is a conceptual diagram showing a state in which the reproduction schedule is interrupted by the interrupt content Cir, and FIG. 20b is a conceptual diagram showing the state. FIG. 21a is a conceptual diagram showing a state in which a new content or playback schedule is received, and FIG. 21b is a state in which switching to the new content or playback schedule is performed. FIG.

  The distribution system of this example handles not only normal content that is played independently, but also third-party content that captures playback content from the third-party server 301, specified content with a specified playback time, and content that interrupts at any time. In accordance with the procedure shown in FIG. 17, the contents C11 to C53 are repeatedly reproduced according to the reproduction schedule while properly using the content reproduction means, third party content reproduction means, designated content reproduction means, and interrupt content reproduction means. Since the reproduction schedule and the contents C11 to C53 are already stored in the storage unit 202 by the client 200, there is no problem even if communication with the server 100 is interrupted during the reproduction of the contents C11 to C53.

  Basically, as can be seen in FIG. 18, the basic content playback means, from the content C11 assigned to the playback order T1, to the content C21 assigned to the playback order T2, the content C31 assigned to the playback order T3,. Each content is played back in the order listed in the playback schedule. Here, if the content C32 assigned to the playback order T6 is a third party content including a URL, the third party content playback means acquires the playback content from the third party server 301 of the URL, and the playback Play the contents. Here, such third-party content is likely to be delayed in order to obtain the playback content via the network 300. For this reason, for example, while the content C51 of the reproduction order T5 is being reproduced, the third party server 301 of the URL is accessed through the network 300, and the reproduction content is acquired in advance except for the reproduction content of the sequential reproduction. .

  As shown in FIG. 19a, the designated content Cap sets the designated reproduction time in absolute time regardless of the reproduction order Tj of the reproduction schedule. For this reason, the reproduction designated time is during reproduction of the content C12 of the reproduction order T8 in FIG. 19a, or is a break between the reproduction order T14 and the reproduction order T15. In any case, since the reproduction of the content according to the reproduction schedule is fundamental, the designated content reproduction means reproduces the designated content Cap after the reproduction designated time as seen in FIG. 19b.

  The playback schedule merely determines the playback order of the contents C11 to C53, and does not restrict the playback order with absolute or relative time. For this reason, when the reproduction of the designated content Cap is interrupted as described above, as shown in FIG. 19b, the reproduction order T9 immediately after the interruption is shifted backward, and after the reproduction of the designated content Cap is completed, the reproduction order T9. The content C33 assigned to is reproduced. The same applies to the content C43 assigned to the reproduction order T14.

  As shown in FIG. 20a, the interrupt content Cir is reproduced by interrupting the reproduction schedule at the timing received by the interrupt receiving means. For this reason, the interrupt content Cir is delayed from reception to playback when the content C32 assigned to the playback order T6 according to the playback schedule is being played back, as with the above-mentioned designated content Cap. For this reason, the interrupt receiving means temporarily stores the received interrupt content Cir in the storage unit 202 of the client 200, and the interrupt content playing means revisits the replayable stage as seen in FIG. 20b. The interrupt content Cir may be read and reproduced.

  As described above, the specified content Cap and the interrupt content Cir are handled in a similar manner, but the former is important for the reproduction at the designated reproduction time, and the latter is especially reproduced at the timing requested by the user. There are differences that are important. In other words, except for the difference in the reproduction timing, the processing in the client 200 is similar, so that the designated content reproduction means and the interrupt content reproduction means can be combined.

  Finally, updating of content or a reproduction schedule by the client 200 will be described. The client 200 periodically accesses the server 100 with the update confirmation unit while sequentially reproducing the clients according to the reproduction schedule, and confirms whether or not the content or the reproduction schedule is updated. In the procedure shown in FIG. 4 above, for convenience of explanation, the update confirmation is made after one cycle of repeated reproduction of contents based on the reproduction schedule. However, the timing of the update confirmation can be arbitrarily set. The reason why the update confirmation is displayed in broken lines in FIG. 4 is based on these reasons. Actually, during the reproduction of the current content held by the client 200, update confirmation (FIG. 21a) and update reception (FIG. 21b) are executed as background processing.

  If the update confirmation means confirms the update of the content or the reproduction schedule, as seen in FIG. 21a, the client 200 continues to reproduce the content according to the superficial reproduction schedule, while the update reception means internally creates a new one from the server 100. The content or playback schedule is received and stored in the storage unit 202 of the client 200. Switching to new content or playback schedule may be arbitrarily set, but in order to realize smooth switching between old and new content or playback schedule, as shown in FIG. It is desirable to switch when the tour is complete.

  After updating the content or playback schedule in this manner, the old content or playback schedule is unnecessary, and it is basically desirable to delete the finite storage unit 202 of the client 200 that operates unattended. . However, if the old content and the playback schedule are stored in the storage unit 202 as an old distribution unit, for example, if the content or the playback schedule cannot be updated (blocking of the network 300), the currently playing content and the playback schedule The content to be reproduced may be changed while switching between the old content and the reproduction schedule.

It is a network block diagram showing the whole structure of the delivery system to which this invention is applied. It is a functional block diagram of a server showing a functional configuration of the server. It is a functional block diagram of the client showing the functional configuration of the client. It is a whole flow figure of contents distribution by a distribution system. It is a partial flow figure showing reproduction schedule generation. It is a conceptual diagram showing the contents C11-C53 which attached | subjected priority P1-P5. It is a conceptual diagram showing the correspondence between priorities P1 to P5 and appearance rates A1 to A5. It is a partial flow figure showing the reproduction schedule composition which constitutes the one-dimensional matrix which consists of reproduction order T1-Tall. It is a conceptual diagram showing calculation of the required number of reproduction | regeneration according to order | rank for each priority. FIG. 4 is a conceptual diagram that configures a one-dimensional matrix composed of a reproduction order T1 to Tall from a necessary reproduction total number Sall. FIG. 5 is a partial flow diagram showing a flow of assigning contents to a one-dimensional matrix composed of reproduction orders T1 to Tall by first order assignment and repeated assignment. It is a conceptual diagram showing the procedure which allocates each content C11-CR18 of the priority order P1. It is a conceptual diagram showing the procedure of assigning each content C21-CR25 of the priority order P2. It is a conceptual diagram showing the procedure which allocates each content C31-CR36 of the priority P3. It is a conceptual diagram showing the procedure which allocates each content C41-CR45 of the priority P4. It is a conceptual diagram showing the procedure of assigning each content C51-CR53 of the priority P5. It is a partial flow figure showing reproduction of various contents in a client. It is a conceptual diagram showing reproduction of contents C11-C53 according to a reproduction schedule. It is a conceptual diagram showing the state which interrupts a reproduction schedule by the designated content Cap. It is a conceptual diagram showing the shift | offset | difference of the reproduction schedule by interruption of the designated content Cap. It is the conceptual diagram showing the state which interrupts a reproduction schedule by the interruption content Cir. It is the conceptual diagram showing the shift | offset | difference of the reproduction schedule by interruption of interruption content Cir. It is a conceptual diagram showing the state which received the new content or the reproduction schedule. It is a conceptual diagram showing the state switched to a new content or a reproduction schedule.

Explanation of symbols

100 servers
101 Information processing department
102 Memory unit
200 clients
201 Information processing department
202 storage
300 network
301 Third party server

Claims (10)

When contents are distributed from the server to the client via the network and the contents are sequentially played back by the client, the server assigns the contents with priority P1 to Pn (n is a natural number of 2 or more) to be played back by the client, A reproduction schedule assigned in order from the contents with the lowest priority to the reproduction order T1 to Tall calculated from the multiplication of the content appearance rates A1 to An set for each of P1 to Pn and the number of contents for each of the priorities P1 to Pn. Is distributed to clients via a network, and each content is reproduced in order according to the reproduction schedule. The reproduction schedule sets appearance rates A1 to An corresponding to the priorities P1 to Pn, totals the number of contents for each of the priorities P1 to Pn, calculates the content numbers R1 to Rn by rank, By multiplying the appearance rates A1 to An for each of P1 to Pn by the number of contents R1 to Rn by rank, the required number of reproductions S1 (= A1 × R1) to Sn (= An × Rn) by rank is calculated. The required number of reproductions S1 to Sn are summed to calculate the total number of required reproductions Sall, and the reproduction schedule is configured as a permutation in which the same number of reproduction orders T1 to Tall are arranged in the necessary total number of reproductions Sall, and the lowest priority P1 is assigned. 2. The content distribution method according to claim 1, wherein the content distribution method is generated by allocating to the reproduction orders T1 to Tall in order from the content. In the playback schedule, the content with the lowest priority P1 has the appearance interval Int1 as a value obtained by dividing the required total playback number Sall by the required playback number S1 by priority of the priority P1, and the appearance interval from the playback order T1. For the contents assigned at intervals of Int1 and assigned the next lowest priority P2, the remaining playback number Srest (= Sall-S1) obtained by subtracting the required playback number S1 by rank from the required playback total number Sall is assigned to the priority order P2. The value obtained by dividing the required number of reproductions S2 by rank is set as an appearance interval Int2, and is assigned at an interval of the appearance interval Int2 from the reproduction order T2 to which the content is not assigned. 3. The content distribution method according to claim 2, wherein the content distribution method is repeatedly allocated and generated until the necessary total number of reproductions Sall is filled in accordance with the assigned content allocation. In a content distribution system in which content is distributed from a server to a client via a network, and the content is sequentially played back by the client, the server assigns content with priorities P1 to Pn (n is a natural number of 2 or more) to be played back by the client. The priority is given to the reproduction order T1 to Tall calculated from the distribution side storage means for storing and the appearance rate A1 to An of the contents set for each priority order P1 to Pn and the number of contents for each priority order P1 to Pn. A schedule generation means for generating a playback schedule assigned in order from each content having a low content, and a delivery means for sending the content and the playback schedule to the client via the network. The client sends the content and the playback schedule to the server via the network. Receiving means to receive from Content distribution system characterized by comprising: a reception-side storage means for storing the content and reproduction schedule Tsu, and reproducing means for reproducing sequentially according to the reproduction schedule content. The schedule generation means, the appearance rate setting means for setting the appearance rates A1 to An according to the priorities P1 to Pn, and the number of contents for each of the same priorities P1 to Pn, and the number of contents by rank R1 to Rn The number-of-contents-by-order totaling means for calculating the priority, and the appearance rates A1 to An for the respective priorities P1 to Pn are multiplied by the number of contents by rank R1 to Rn to obtain the required number of reproductions by rank S1 (= A1 × R1) A required number-of-reproduction-requirement calculating means for calculating Sn (= An × Rn) and a permutation in which the same number of reproduction orders T1-Tall are arranged in the required total number of reproductions Sall obtained by summing up the required number of reproductions S1-Sn for each order. 5. The content distribution system according to claim 4, further comprising: a reproduction schedule structuring unit; and a reproduction schedule allocating unit that allocates the reproduction order T1 to Tall in order from the content having the lowest priority P1. The reproduction schedule allocating means obtains a value obtained by dividing the total number of required reproductions Sall by the necessary number of reproductions S1 by order of priority P1 as an appearance interval Int1, and sets the lowest priority P1 from the reproduction order T1 to the appearance interval Int1. The first order allocating means for allocating the attached content and the remaining number of reproductions Srest (= Sall-S1) obtained by subtracting the number of necessary reproductions S1 by rank from the total number of necessary reproductions Sall are calculated as the number of necessary reproductions by rank of the priority P2. The value obtained by dividing by S2 is defined as the appearance interval Int2, and the content with the next lowest priority P2 is assigned to the reproduction order in which the content is not assigned at the interval of the appearance interval Int2. 6. Content according to claim 5, further comprising repetitive assignment means for repeatedly assigning contents of priority order P3 or higher until the required total number of reproductions Sall is filled in accordance with the assigned contents. Shin system. The client is provided with third party content reproduction means for receiving third party content whose access destination is indicated by a URL from a third party server via the network according to the URL, and for reproducing the content of the URL by the reproduction means. Item 5. The content distribution system according to Item 4. The client interrupts the designated content with the designated reproduction time into the content with the priorities P1 to Pn to be reproduced according to the reproduction schedule, and uses the reproduction means at the time before or after the reproduction designated time or the reproduction designated time. 5. The content distribution system according to claim 4, further comprising designated content reproduction means for reproduction. The client assigns the interrupt receiving means for receiving the interrupt content with the sequential playback request by the receiving means, and the priorities P1 to Pn for reproducing the interrupt content with the sequential playback request according to the playback schedule. 5. The content distribution system according to claim 4, further comprising interrupt content reproduction means for interrupting the content and causing the reproduction means to reproduce the content. The client periodically updates the content or the reproduction schedule with the server, and when the content or schedule update is confirmed, the client distributes the updated content or the reproduction schedule with the server distribution means. The content distribution system according to claim 4, further comprising: an update receiving unit that causes the receiving unit to receive the content or the reproduction schedule.

Images