JP2006202186A - Content distribution system, peer computer to be used for the same, peer program and data structure of distributed content information - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide a content distribution system for downloading in advance information and contents related with private contents, and for simultaneously reproducing disclosed contents. <P>SOLUTION: In this content distribution system, distributed content information including a download start date, disclosure start date and disclosure end date or the like is registered in a center server in a peer-to-peer system. Each peer acquires distributed content information from the center server, and downloads the contents passing the download start date from the other peer, and reproduces the contents between the disclosure start date and the disclosure end date. As for contents for which a video for main story and a video for preview are prepared, the download start date, the disclosure start date and the disclosure end state are applied to each video. <P>COPYRIGHT: (C)2006,JPO&NCIPI

Description

  The present invention relates to a content distribution system and a data structure of a peer computer, a peer program, and distribution content information used therefor, and more specifically, a download type content distribution system that distributes content such as a movie predetermined by a service provider. And the data structure of the peer computer, peer program, and distribution content information used therefor.

  A downloadable content distribution system generally includes a server that stores a large number of contents, and a client that downloads and reproduces contents from the server. The server is operated by a service provider, and the client is operated by a user.

  In order for a user to download new content, it is necessary to inform the user of information related to the content. In a client-server environment, it is not possible to notify the client unilaterally from the server. Usually, the client periodically inquires whether there is new content on the server, and the server responds to the inquiry from the server to the client. Notifying information about new content.

  When new contents are added irregularly, the inquiry cycle needs to be shortened, but there is a problem that the load on the server increases as the number of clients increases.

  Moreover, it takes time to download high-quality content, and the time required for downloading varies greatly depending on the state of the network. Therefore, the time from the start of content distribution until the content can actually be played varies greatly depending on the client, and the same content is played back simultaneously on all clients so that the same movie starts showing on the same day nationwide. I can't do it.

  Moreover, if the information regarding the content that is not yet distributed but is scheduled to be distributed in the near future can be notified in advance, the use of the content can be promoted.

Although a Peer to Peer type content distribution system is also disclosed (for example, Japanese Patent Application Laid-Open No. 2004-64769; Patent Document 1), no means for solving the above-described problem is disclosed.
JP 2004-64769 A JP 2003-163656 A

  An object of the present invention is to provide a content distribution system capable of acquiring information related to unpublished content in advance without frequently making inquiries.

  Another object of the present invention is to provide a content distribution system in which unpublished content can be downloaded in advance.

  Yet another object of the present invention is to provide a content distribution system capable of simultaneously reproducing content after publication.

Means for Solving the Problems and Effects of the Invention

  The content distribution system according to the present invention includes a center server and a plurality of peers connected to the center server and connected to each other. The center server includes distribution content information storage means for storing distribution content information including a content file download start time and a content release start time. Here, the time is typically a date, but it may be a date alone. Each of the peers includes content storage means, distribution content information acquisition means, content download means, content selection means, and content reproduction means. The content storage means is for storing content files. The distribution content information acquisition unit acquires distribution content information from the center server. The content download unit searches the distribution content information acquired by the distribution content information acquisition unit, extracts the content whose current time is after the download start time, downloads the content file from another peer, and stores the content Save to. The content selection means searches the distribution content information acquired by the distribution content information acquisition means, and selects content whose current time is after the publication start time. The content reproduction means reads the content file of the content selected by the content selection means from the content storage means and reproduces the content.

  In this content distribution system, since the download start time and the start time of the release are added to the distribution content information not only for the content that has been released but also for the content that has not been released (soon to be released in the near future), Information about unpublished content can be acquired in advance without frequently making inquiries. In addition, since the peer downloads content whose current time is after the download start time, it is possible to download unpublished content in advance. In addition, since the content whose current time is after the publication start time is selected and played back, unpublished content cannot be played back, but after the publication start time, even if it is downloaded for each peer. Even if there is a difference in the time, the contents can be reproduced all at once.

  Preferably, the content file includes a main video content file and a trailer video content file for one content. The download start time includes the download start time of the main video and the download start time of the trailer video. The release start time includes the release start time of the main video and the start start time of the trailer video.

  In this case, the peer can download and play the preview video in the same manner as the main video.

  Preferably, the distribution content information includes a schedule hierarchy, an item hierarchy positioned lower than the schedule hierarchy, and a video hierarchy positioned lower than the item hierarchy. The schedule hierarchy is composed of one or more theater blocks each assigned one content. Each theater block includes the content ID of the assigned content and the publication start time of the assigned content. The item hierarchy is composed of one or two or more item blocks each assigned one content. Each item block includes a content ID of the allocated content, a title of the allocated content and other meta information, and one or more video IDs of the allocated content. The video hierarchy is composed of one or more video blocks each assigned one video. Each video block includes a video ID of the assigned video, a download start time of the content file of the assigned video, and a release start time of the assigned video.

  In this case, if the peer searches the schedule hierarchy, the peer can grasp not only the contents that are currently published but also all the contents that are not published. The peer can also retrieve the meta information of the content by searching the item hierarchy. Peers can also retrieve video content by searching the video hierarchy. Thus, since the distribution content information has a hierarchical structure, the peer can search for necessary information in a short time.

  More preferably, the content download means searches the schedule hierarchy, specifies the content ID in each theater block in order, searches the item hierarchy using the specified content ID as a key, and either 1 or 1 in each item block A means for specifying two or more video IDs in sequence, a video hierarchy is searched using the specified video ID as a key, a video whose current time is after the download start time in each video block is extracted, and the content of the video Means for downloading a file.

  Preferably, each item block further includes identification information indicating a main part or a trailer given in association with each video ID. The content selection means searches the schedule hierarchy, extracts contents whose current time is after the publication start time in each theater block, specifies the content ID in the theater block in order, and the specified content ID The item hierarchy is searched using the key as a key, the video ID in which the identification information indicating the main part is assigned among the video IDs in each item block, and the video hierarchy is searched using the specified video ID as a key. Means for selecting a video whose time is after the public start time in each video block.

  In this case, the peer can handle the main video in the same manner as the trailer video, download the main video before the release, and play it immediately after the release.

  Alternatively, each item block further includes identification information indicating a main part or a trailer given in association with each video ID. The content selection means searches the schedule hierarchy, extracts contents whose current time is before the publication start time in each theater block, specifies the content ID in the theater block in order, and the specified content ID The item hierarchy is searched using the key as a key, and a means for specifying the video ID to which the identification information indicating the trailer is assigned among the video IDs in each item block, and the video hierarchy is searched using the specified video ID as a key, Means for selecting a video whose current time is after the public start time in each video block.

  In this case, the peer can handle the trailer video in the same manner as the main video, download the trailer video before the release, and play it immediately after the release.

  The peer computer according to the present invention is connectable to a center server that stores distribution content information including a content file download start time and a content release start time, and another peer computer connected to the center server. The peer computer includes content storage means, distribution content information acquisition means, content download means, and content reproduction means. The content storage means is for storing content files. The distribution content information acquisition unit acquires distribution content information from the center server. The content download unit searches the distribution content information acquired by the distribution content information acquisition unit, extracts the content whose current time is after the download start time, downloads the content file from another peer, and stores the content Save to. The content selection means searches the distribution content information acquired by the distribution content information acquisition means, and selects content whose current time is after the publication start time. The content reproduction means reads the content file of the content selected by the content selection means from the content storage means and reproduces the content.

  In this peer computer, the download start time and release start time are added to the distribution content information not only for the published content but also for the unpublished content, so the peer computer does not frequently make inquiries to the center server. Information regarding unpublished content can also be acquired in advance. In addition, since the peer computer downloads content whose current time is after the download start time, unpublished content can be downloaded in advance. In addition, since the content whose current time is after the publication start time is selected and played back, unpublished content cannot be played back, but after the publication start time, even if it is downloaded for each peer computer Even if there is a difference in the time taken for the contents, the contents can be reproduced all at once.

  A peer program according to the present invention provides a peer computer that can be connected to a center server that stores distribution content information including a content file download start time and a content release start time, and another peer computer connected to the center server. This is a program to be executed. The peer program acquires the distribution content information from the center server to the peer computer, searches the acquired distribution content information, extracts content whose current time is after the download start time, and extracts the content file to another A step of downloading from a peer and storing it in the content storage means, a step of searching the acquired distribution content information, selecting a content whose current time is after the publication start time, and a content file of the selected content And reading the content from the storage means and reproducing the content.

  In this peer program, the download start time and release start time are added to the distribution content information not only for the published content but also for the unreleased content, so the peer program does not frequently make inquiries to the center server. Information regarding unpublished content can also be acquired in advance. Further, since the peer program downloads content whose current time is after the download start time, unpublished content can be downloaded in advance. In addition, since the content whose current time is after the publication start time is selected and played back, unpublished content cannot be played back, but after the publication start time, even if downloaded for each peer program Even if there is a difference in the time taken for the contents, the contents can be reproduced all at once.

  The data structure of the distribution content information according to the present invention includes a schedule hierarchy, an item hierarchy positioned lower than the schedule hierarchy, and a video hierarchy positioned lower than the item hierarchy. The schedule hierarchy is composed of one or more theater blocks each assigned one content. Each theater block includes the content ID of the assigned content and the publication start time of the assigned content. The item hierarchy is composed of one or two or more item blocks each assigned one content. Each item block includes a content ID of the allocated content, a title of the allocated content and other meta information, and one or more video IDs of the allocated content. The video hierarchy is composed of one or more video blocks each assigned one video. Each video block includes a video ID of the assigned video, a download start time of the content file of the assigned video, and a release start time of the assigned video.

  By using the data structure of the distribution content information, it is possible to grasp all unpublished contents as well as contents that are currently published by searching the schedule hierarchy. Furthermore, if the item hierarchy is also searched, the meta information of the content can be acquired. Furthermore, if the video hierarchy is also searched, the video of the content can be acquired. Thus, since the distribution content information has a hierarchical structure, it is possible to search for necessary information in a short time.

  The content distribution system according to the present invention includes a server and a client connected to the server. The server includes content storage means and distribution content information storage means. The content storage means is for storing content files. The distribution content information storage means is for storing distribution content information including a content file download start time and a content release start time. The client includes content storage means, distribution content information acquisition means, content download means, content selection means, and content reproduction means. The content storage means is for storing content files. The distribution content information acquisition unit acquires distribution content information from the server. The content download unit searches the distribution content information acquired by the distribution content information acquisition unit, extracts content whose current time is after the download start time, downloads the content file from the server, and stores it in the content storage unit To do. The content selection means searches the distribution content information acquired by the distribution content information acquisition means, and selects content whose current time is after the publication start time. The content reproduction means reads the content file of the content selected by the content selection means from the content storage means and reproduces the content.

  In this content distribution system, since the download start time and the release start time are added to the distribution content information not only for the published content but also for the unreleased content, the client does not frequently contact the server, Information about unpublished content can also be acquired in advance. In addition, since the client downloads content whose current time is after the download start time, it is possible to download unpublished content in advance. Furthermore, since content that has a current time after the publication start time is selected and played back, unpublished content cannot be played back, but after the publication start time, even if it is downloaded for each client. Even if there is a difference in the time, the contents can be reproduced all at once.

  Hereinafter, embodiments of the present invention will be described in detail with reference to the drawings. In the drawings, the same or corresponding parts are denoted by the same reference numerals and description thereof will not be repeated.

[overall structure]
Referring to FIG. 1, a content distribution system according to an embodiment of the present invention includes a center server (computer) 10, a static peer (computer) 11, and a plurality of dynamic peers (computers) 12. These are typically connected to each other via the Internet 13, but may be connected to each other via a LAN (Local Area Network), a WAN (Wide Area Network), or other computer networks.

  The center server 10 and the static peer 11 are operated by a service provider, and the dynamic peer 12 is operated by a general user. The center server 10 monitors the dynamic peer 12 and has information on the content to be distributed (hereinafter referred to as “distributed content information”), information on the operation load on the dynamic peer 12, and the like, but has the content file itself. The static peer 11 functions as a client with respect to the center server 10 and functions as a server with respect to the dynamic peer 12 where the content file to be distributed is first registered. The content file is downloaded from the other peers 11 and 12, and the content is played back, and the content file is returned in response to a request from the other dynamic peer 12. The dynamic peer 12 receives the center server 10 and the status. In addition to functioning as a client for the network peer 11 and as a server for the other dynamic peers 12, this system is a hybrid peer-to-peer system having a center server 10 and is a download-type content distribution system. is there.

[Configuration of center server]
Referring to FIG. 2, the center server 10 includes a content management database 14 for storing distribution content information and the like, and a center server application (program) 16 that controls the center server 10. These are stored in a hard disk (not shown) in the center server 10. The center server application 16 registers the distribution content information uploaded from the static peer 11 in the content management database 14 or reads out the distribution content information from the content management database 14 in response to a request from the dynamic peer 12. Or reply to.

[Static Peer Configuration]
Referring to FIG. 3, the static peer 11 includes a content management database 18 for storing distribution content information and the like, a content database 20 for storing content files, and a static peer application (which controls the static peer 11). Program) 22. These are stored in a hard disk (not shown) in the static peer 11. The static peer application 22 registers new distribution content information in the content management database 18, uploads new distribution content information to the center server 10, registers a new content file in the content database 20, In response to a request from 12, the content file is read from the content database 20 and returned to the dynamic peer 12.

[Dynamic peer configuration]
Referring to FIG. 4, each dynamic peer 12 includes a content management database 24 for storing distribution content information, a video ID (details will be described later) of content that has already been downloaded, and a content database for storing content files. 26, a dynamic peer application (program) 28 for controlling the dynamic peer 12 and a content file downloaded from the static peer 11 or another dynamic peer 12 and stored in the content database 26, or a distribution downloaded from the center server 10 A downloader (program) 30 for registering content information in the content management database 24 and a program for reading content files from the content database 26 and reproducing the content. And a chromatography Ya (program) 32. These programs are stored in a hard disk (not shown) in the dynamic peer 12 and are programs for causing the dynamic peer 12 to execute steps S1 to S12, S21 to S27, and S31 to S37 described later. The dynamic peer application 28 reads a content file from the content database 26 in response to a request from another dynamic peer 12 and transmits the content file to the dynamic peer 12.

[Data structure of distributed content information]
Referring to FIG. 5, the distribution content information has a hierarchical structure. Specifically, the distribution content information includes the schedule hierarchy 40, the item hierarchy 42 positioned lower than the schedule hierarchy 40, the video hierarchy 44 positioned lower than the item hierarchy 42, and the item hierarchy 42. It includes a photo hierarchy 46 positioned at a lower level and a person hierarchy 48 positioned at a lower level than the item hierarchy 42.

  Referring to FIG. 6, the schedule hierarchy 40 is composed of one or more theater blocks. One content is assigned to each theater block. Each theater block includes a content ID of the assigned content, a title, a download start date / time, a release start date / time, and a release end date / time.

  The schedule hierarchy 40 is a hierarchy for storing the screening schedule of each content. Theater Block is equivalent to a virtual movie theater. For example, the content (movie) that is currently released is assigned to the theater blocks (1) to (3), and the unpublished content is assigned to the theater blocks (4) and (5). However, since information such as being published or unpublished is not given, it is not possible to directly determine whether or not the content is being published from this information alone. By comparing the registered date and time with the current time, it is determined whether or not the content is being published. Therefore, as long as the dynamic peer 12 searches only the schedule hierarchy 40, not only the currently published content but also all the unpublished content can be promptly displayed with the minimum necessary information such as the title and the publication period. it can.

  The item hierarchy 42 includes one or more item blocks. One content is assigned to each item block. Each item block includes a content ID of the assigned content, a title, a director, a performer, a genre, a synopsis, and other meta information, a price, and one or more video IDs.

  The item hierarchy 42 is a hierarchy for mainly storing meta information related to content. The meta information is divided into three types: static meta information, dynamic meta information, and content file information. The static meta information is static information such as a director, performers, genres, and synopses. The dynamic meta information is information that dynamically fluctuates, such as a price. The content file information is information related to videos, images, etc., and includes a video ID for specifying the main video and a video ID for specifying the trailer video. Each item block further includes, as content file information, identification information indicating a main part or a trailer given in association with each video ID.

  For content for which not only the main video but also the trailer video are prepared, the video ID for the trailer is registered in addition to the video ID for the main video. For content for which only the main video is prepared, only the video ID for the main video is registered. For content for which only a trailer video has been prepared, only the video ID for the trailer is registered. Therefore, if the dynamic peer 12 searches to the item hierarchy 42, the meta information of the content can be displayed quickly.

  The video hierarchy 44 is composed of one or more video blocks. One video is assigned to each video block. Each video block includes a video ID of an assigned video, a title, a download start date / time, a release start date / time, a release end date / time, and a URL (Uniform Resource Locator) list.

  The video hierarchy 44 is a hierarchy for storing information related to video. In the URL list, URLs where the video can be downloaded are listed. Specifically, in addition to the URL of the static peer 11, the URL of the dynamic peer 12 that has already downloaded the content is also listed. If the dynamic peer 12 searches up to the video hierarchy 44, the video of the content can also be acquired.

  The photo hierarchy 46 is a hierarchy for storing information of photo images related to the content. The person hierarchy 48 is a hierarchy for storing information on persons related to contents such as directors and performers.

[Operation]
Next, the operation of the content distribution system described above will be described.

[Download process]
First, the operation of the downloader 30 in the dynamic peer 12 will be described with reference to FIG.

  The downloader 30 periodically acquires distribution content information from the center server 10 (S1, S2). Specifically, when it is time to acquire the distribution content information (YES in S1), the downloader 30 downloads the distribution content information from the center server 10 and registers it in the content management database 24 to update the distribution content information. (S2).

  The downloader 30 first searches the schedule hierarchy 40 of the distributed content information registered in the content management database 24, and sequentially targets items assigned from the first theater block to the last theater block, and will be described later in steps S4 to S10. This process is repeated (S3, S11, S12). The downloader 30 further searches the item hierarchy 42 of the distribution content information, repeats the processes of steps S5 to S8 described later (S4, S9, and S10) for the related videos of each target item in order. the detail is right below.

  First, the downloader 30 sets an item assigned to the first theater block (in this example, theater block (1)) in the schedule hierarchy 40 as a target item (S3). Specifically, the downloader 30 specifies the content ID of the target item.

  Subsequently, the downloader 30 sets the first related video of the target item in the item hierarchy 42 (the main video in this example. However, if there is no main video, the trailer video; the same applies hereinafter) as the target video ( S4). Specifically, the downloader 30 searches the item hierarchy 42 using the content ID specified in step S3 as a key, and specifies the first video ID (the main video ID in this example) among the related videos of the target item. .

  Subsequently, the downloader 30 searches the video hierarchy 44 using the specified video ID as a key, and determines whether or not the current date is after the download start date of the target video (S5). If it is after the download start date and time (YES in S5), the process proceeds to the next step S6. If not (NO in S5), the process skips steps S6 to S8 and proceeds to step S9.

  If it is after the download start date and time (YES in S5), the downloader 30 determines whether or not the target video has already been downloaded (S6). Specifically, the downloader 30 searches the content management database 24 to determine whether or not the target video ID has already been registered. If the target video has already been downloaded (YES in S6), steps S7 to S8 are skipped and the process proceeds to step S9. If not (NO in S6), the process proceeds to the next step S7.

  If not already downloaded, the downloader 30 selects one URL from the URL list of the target video, and requests the content file of the target video by transmitting the target video ID to the peer 11 or 12 having the URL. . As a result, the downloader 30 downloads the content file of the target video from the peer 11 or 12 and stores it in the content database 26 (S7).

  If the download is successful, the downloader 30 registers the target video ID in the content management database 24 (S8).

  Next, the downloader 30 determines whether the target video is the last related video of the target item in the item hierarchy 42 (S9). If the target video is not the last related video (NO in S9), the downloader 30 sets the next related video (in this example, the trailer video) as the target video (S10), and executes steps S5 to S8 again. . Therefore, when the current date is after the download start date of the next target video and the target video has not yet been downloaded, the downloader 30 downloads the content file of the next target video from the peer 11 or 12 as described above. (S7) and the video ID is registered in the content management database 24 (S8). On the other hand, if the target video is the last related video (YES in S9), the process exits the routine of steps S5 to S10 and proceeds to step S11.

  Next, the downloader 30 determines whether or not the target item is an item assigned to the last theater block (seater block (5) in this example) in the schedule hierarchy 40 (S11). If the target item is not the item assigned to the last theater block (NO in S11), the downloader 30 sets the item assigned to the next theater block as the target item (S12), and repeats steps S4 to S10 again. Execute. On the other hand, if the target item is an item assigned to the last theater block (YES in S11), the process exits the routine of steps S4 to S12 and ends the download process.

  As described above, the downloader 30 sequentially follows the schedule hierarchy 40 to the video hierarchy 44, and if there is an unacquired video that has passed the download start date, downloads the content file.

[Changes in menu screen]
Next, the transition of the menu screen by the player 32 in the dynamic peer 12 will be described with reference to FIG.

  The player 32 displays the top menu M1 and accepts a selection operation by the user. In the top menu M1, an item “content selection” for moving to the content selection menu M2 and an item “distribution notice” for moving to the notice menu M3 are displayed.

  When “content selection” is selected, the player 32 displays a content selection menu M2 and accepts a selection operation by the user again. The content selection menu M2 displays the titles of one or more movies that are currently open to the public.

  When “Distribution notice” is selected, the player 32 displays a notice menu M3, and reproduces movie information (title, director, performer, etc.) and trailer video to be released in the near future.

  Next, when the desired content (movie title) is selected in the content selection menu M2, the player 32 displays the content menu M4 and accepts the selection operation by the user again. In the content menu M4, an item “main part reproduction” and an item “performer information” are displayed. When “main part playback” is selected, the player 32 plays back the main part video. When “Performer Information” is selected, the player 32 displays the names of the director and performers.

[Content selection menu processing]
In order to display the content selection menu M4, the player 32 searches for content during the public period. Specifically, with reference to FIG. 9, the player 32 searches the schedule hierarchy 40 of the distribution content information registered in the content management database 24, and finds items assigned from the first theater block to the last theater block. The processes in steps S22 to S25 described later are repeated in order (S21, S26, S27). the detail is right below.

  First, the player 32 sets the item assigned to the first theater block (in this example, theater block (1)) in the schedule hierarchy 40 as a target item (S21). Specifically, the player 32 specifies the content ID of the target item.

  Subsequently, the player 32 determines whether or not the current time is within the disclosure period of the target item (S22). Specifically, the player 32 searches the schedule hierarchy 40 using the specified content ID as a key, and determines whether or not the current date and time is between the publication start date and time and the publication end date and time of the target item. If the current date and time is within the disclosure period of the target item (YES in S22), the process proceeds to the next step S23. If not (NO in S22), the process skips steps S23 to S25 and proceeds to step S26.

  If the current date and time is within the disclosure period of the target item, the player 32 sets the main video of the target item in the item hierarchy 42 as the target video (S23). Specifically, the player 32 searches the item hierarchy 42 using the specified content ID as a key, and specifies the main video ID of the target item. Here, in order to identify the main video ID or the trailer video ID, the identification information indicating the main program or the trailer assigned in association with each video ID is referred to.

  Subsequently, the player 32 determines whether or not the current date and time is within the disclosure period of the target video (S24). Specifically, the player 32 searches the video hierarchy 44 using the specified video ID as a key, and determines whether or not the current date / time is between the start date / time and the end date / time of the target video. If the current date and time is within the target video release period (YES in S24), the process proceeds to the next step S25. If not (NO in S24), the process skips step S25 and proceeds to step S26.

  If the current date and time is within the target video release period, the player 32 displays information (movie title) on the target item in the content selection menu M2 (S25).

  Next, the player 32 determines whether or not the target item is an item assigned to the last theater block (the theater block (5) in this example) in the schedule hierarchy 40 (S26). If the target item is not the item assigned to the last theater block (NO in S26), the player 32 sets the item assigned to the next theater block as the target item (S27), and repeats steps S22 to S25 again. Execute. On the other hand, if the target item is an item assigned to the last theater block (YES in S26), the process exits the routine of steps S22 to S27 and ends the content selection menu process.

  As described above, the player 32 has a current date and time between the disclosure start date and time of the target item in the schedule hierarchy 40 and a disclosure start date and time of the target video (main video) in the video hierarchy 44. And search for all the content between the date and the end date and display them.

[Notice menu processing]
In order to display the notice menu M3, the player 32 searches for contents whose notice information is being published from unpublished contents. This advance notice menu processing is basically the same as the content selection menu described above except for steps S32, S33, and S35 described later. Specifically, referring to FIG. 10, the player 32 searches the schedule hierarchy 40 of the distribution content information registered in the content management database 24, and finds items assigned from the first theater block to the last theater block. The processes of steps S32 to S35 described later are repeated in order (S31, S36, S37). the detail is right below.

  First, the player 32 sets an item assigned to the first theater block (in this example, theater block (1)) in the schedule hierarchy 40 as a target item (S31). Specifically, the player 32 specifies the content ID of the target item.

  Subsequently, the player 32 determines whether or not the current time is before the disclosure start date and time of the target item (S32). Specifically, the player 32 searches the schedule hierarchy 40 using the specified content ID as a key, and determines whether or not the current date and time is before the publication start date and time of the target item. If the current date and time is before the date and time when the target item is released (YES in S32), the process proceeds to the next step S33. If not (NO in S32), the process skips steps S33 to S35 and proceeds to step S36.

  If the current date and time is before the target item release start date (YES in S32), the player 32 sets the trailer video of the target item in the item hierarchy 42 as the target video (S33). Specifically, the player 32 searches the item hierarchy 42 using the specified content ID as a key, and specifies the trailer video ID of the target item. Here, in the same manner as described above, the identification information is referred to in order to identify the main video ID or the trailer video ID.

  Subsequently, the player 32 searches the video hierarchy 44 using the specified video ID as a key, and determines whether or not the current date / time is between the disclosure start date / time and the disclosure end date / time of the target video (S34). If the current date / time is between the start date / time and the end date / time of the target video (YES in S34), the process proceeds to the next step S35; otherwise (NO in S34), step S35 is skipped and step S36 is skipped. Proceed to

  If the current date and time is between the disclosure start date and time of the target video (YES in S34), the player 32 plays the target video (trailer video) in the preview menu M3 (S35).

  Next, the player 32 determines whether or not the target item is an item assigned to the last theater block (in this example, theater block (5)) in the schedule hierarchy 40 (S36). If the target item is not the item assigned to the last theater block (NO in S36), the player 32 sets the item assigned to the next theater block as the target item (S37) and repeats steps S32 to S35 again. Execute. On the other hand, if the target item is an item assigned to the last theater block (YES in S36), the process exits the routine of steps S32 to S37 and ends the preview menu process.

  As described above, the player 32 has the current date and time before the publication start date and time of the target item in the schedule hierarchy 40, and the release date and time of the target video (trailer video) in the video hierarchy 44. Find and play all the content in between. Therefore, all the trailer videos are displayed in order.

  As described above, according to the embodiment of the present invention, the download start date / time, the publication start date / time, and the publication end date / time are added to the distribution content information not only for the published content but also for the unpublished content. The dynamic peer 12 can also acquire information related to unpublished content in advance without frequently making inquiries to the center server 10. In addition, since the dynamic peer 12 downloads content whose current time is after the download start date and time, it is possible to download unpublished content in advance. Furthermore, since the content whose current time is between the publishing start date and the publishing end date is selected and played back, unpublished content cannot be played back, but when the publishing start date is passed, Content can be played all at once.

  In the above embodiment, the peer-to-peer method is adopted, but instead, a client-server method may be adopted as shown in FIG. In this case, the server 50 includes the content database 20 in addition to the content management database 14. The client 52 has basically the same configuration as the dynamic peer except that the client 52 does not have a function of distributing content to other clients 52.

  In the above, a movie is taken as an example of content, but it can also be applied to music, still images, computer programs, and the like.

  While the embodiments of the present invention have been described above, the above-described embodiments are merely examples for carrying out the present invention. Therefore, the present invention is not limited to the above-described embodiment, and can be implemented by appropriately modifying the above-described embodiment without departing from the spirit thereof.

It is a functional block diagram which shows the whole structure of the content delivery system by embodiment of this invention. It is a functional block diagram which shows the structure of the center server in FIG. It is a functional block diagram which shows the structure of the static peer in FIG. It is a functional block diagram which shows the structure of the dynamic peer in FIG. It is explanatory drawing which shows the data structure of the delivery content information used for the content delivery system shown in FIG. It is explanatory drawing which shows the detail of the data structure shown in FIG. FIG. 5 is a flowchart showing download processing by a dynamic peer downloader shown in FIG. 4. FIG. 5 is an explanatory diagram showing transition of a menu screen by a dynamic peer player shown in FIG. 4. It is a flowchart which shows the process for displaying the content selection menu in FIG. It is a flowchart which shows the process for displaying the notice menu in FIG. It is a functional block diagram which shows the whole structure of the content delivery system by other embodiment of this invention.

Explanation of symbols

10 Center Server 11 Static Peer 12 Dynamic Peer 14, 18, 24 Content Management Database 20, 26 Content Database 30 Downloader 32 Player 40 Schedule Hierarchy 42 Item Hierarchy 44 Video Hierarchy 50 Server 52 Client

Claims (10)

A content distribution system comprising a center server and a plurality of peers connected to and connected to the center server,
The center server is
A distribution content information storage unit for storing distribution content information including a content file download start time and a content release start time;
Each of the peers
Content storage means for storing content files;
Distribution content information acquisition means for acquiring distribution content information from the center server;
The distribution content information acquired by the distribution content information acquisition unit is searched, the content whose current time is after the download start time is extracted, the content file is downloaded from another peer and stored in the content storage unit. Content download means;
Content selection means for searching the distribution content information acquired by the distribution content information acquisition means and selecting content whose current time is after the publication start time;
A content distribution system comprising: a content reproduction unit that reads out a content file of the content selected by the content selection unit from the content storage unit and reproduces the content. The content distribution system according to claim 1,
The content file includes a main content video content file and a trailer video content file for one content,
The download start time includes a main video download start time and a trailer video download start time, and the release start time includes a main video release start time and a trailer video release start time. Content distribution system. The content distribution system according to claim 1,
The distribution content information includes a schedule hierarchy, an item hierarchy positioned lower than the schedule hierarchy, and a video hierarchy positioned lower than the item hierarchy,
The schedule hierarchy includes one or two or more theater blocks each assigned one content, each theater block including a content ID of the assigned content and a publication start time of the assigned content.
The item hierarchy is composed of one or more item blocks each assigned one content, and each item block includes a content ID of the assigned content, a title of the assigned content, and other meta information, Including one or more video IDs of the allocated content,
The video hierarchy is composed of one or two or more video blocks each assigned one video, and each video block includes a video ID of the assigned video and a download start time of the content file of the assigned video. And a content distribution system including a release start time of the allocated video. The content distribution system according to claim 3,
The content download means includes
Means for searching the schedule hierarchy and sequentially identifying the content ID in each theater block;
Means for searching the item hierarchy using the specified content ID as a key, and sequentially specifying one or more video IDs in each item block;
Means for searching the video hierarchy using the specified video ID as a key, extracting a video whose current time is after the download start time in each video block, and downloading a content file of the video. A featured content distribution system. The content distribution system according to claim 3,
Each item block further includes identification information indicating a main part or a trailer given in association with each video ID,
The content selection means includes
Means for searching the schedule hierarchy, extracting content whose current time is after the publication start time in each theater block, and sequentially specifying the content ID in the theater block;
Means for searching the item hierarchy using the identified content ID as a key, and identifying a video ID to which identification information indicating a main part is assigned among video IDs in each item block;
And a means for searching the video hierarchy using the specified video ID as a key and selecting a video whose current time is after the public start time in each video block. The content distribution system according to claim 3,
Each item block further includes identification information indicating a main part or a trailer given in association with each video ID,
The content selection means includes
Means for searching the schedule hierarchy, extracting content whose current time is before the publication start time in each theater block, and sequentially identifying the content ID in the theater block;
Means for searching the item hierarchy using the specified content ID as a key, and specifying a video ID to which identification information indicating a trailer is assigned among video IDs in each item block;
And a means for searching the video hierarchy using the specified video ID as a key and selecting a video whose current time is after the public start time in each video block. A center computer that stores distribution content information including a content file download start time and a content release start time, and a peer computer connectable to another peer computer connected to the center server,
Content storage means for storing content files;
Distribution content information acquisition means for acquiring distribution content information from the center server;
The distribution content information acquired by the distribution content information acquisition unit is searched, the content whose current time is after the download start time is extracted, the content file is downloaded from another peer and stored in the content storage unit. Content download means;
Content selection means for searching the distribution content information acquired by the distribution content information acquisition means and selecting content whose current time is after the publication start time;
A peer computer, comprising: a content reproduction unit that reads out a content file of the content selected by the content selection unit from the content storage unit and reproduces the content. Peer program for causing a peer computer connectable to a center server storing distribution content information including a content file download start time and a content release start time, and another peer computer connected to the center server Because
Obtaining distribution content information from the center server;
Searching the acquired distribution content information, extracting content whose current time is after the download start time, downloading the content file from another peer and storing it in content storage means;
Searching the acquired distribution content information, and selecting a content whose current time is after the publication start time;
A peer program for causing a peer computer to execute a step of reading a content file of the selected content from the content storage means and reproducing the content. A data structure of distribution content information including a schedule hierarchy, an item hierarchy positioned lower than the schedule hierarchy, and a video hierarchy positioned lower than the item hierarchy,
The schedule hierarchy includes one or two or more theater blocks each assigned one content, each theater block including a content ID of the assigned content and a publication start time of the assigned content.
The item hierarchy is composed of one or more item blocks each assigned one content, and each item block includes a content ID of the assigned content, a title of the assigned content, and other meta information, Including one or more video IDs of the allocated content,
The video hierarchy is composed of one or two or more video blocks each assigned one video, and each video block includes a video ID of the assigned video and a download start time of the content file of the assigned video. And a data structure of distribution content information, including the start time of release of the allocated video. A content distribution system comprising a server and a client connected to the server,
The server
Content storage means for storing content files;
Distribution content information storage means for storing distribution content information including a content file download start time and a content release start time;
The client
Content storage means for storing content files;
Distribution content information acquisition means for acquiring distribution content information from the server;
Content that retrieves distribution content information acquired by the distribution content information acquisition unit, extracts content whose current time is after the download start time, downloads the content file from the server, and stores it in the content storage unit Download means,
Content selection means for searching the distribution content information acquired by the distribution content information acquisition means and selecting content whose current time is after the publication start time;
A content distribution system comprising: a content reproduction unit that reads out a content file of the content selected by the content selection unit from the content storage unit and reproduces the content.

Images