Secure transfer of previously broadcasted content

Information

  • Patent Grant
  • 10440342
  • Patent Number
    10,440,342
  • Date Filed
    Monday, February 8, 2016
    8 years ago
  • Date Issued
    Tuesday, October 8, 2019
    4 years ago
Abstract
A method and apparatus for secure transfer of previously broadcasted content enables the secure transfer of previously broadcasted content between DVRs on a computer network.
Description
FIELD OF THE INVENTION

The present invention relates to the secure transfer of content between devices over a network. Specifically, the invention relates to a method and apparatus for obtaining previously broadcasted content and the secure transfer of the content.


BACKGROUND

The approaches described in this section are approaches that could be pursued, but not necessarily approaches that have been previously conceived or pursued. Therefore, unless otherwise indicated, the approaches described in this section may not be prior art to the claims in this application and are not admitted to be prior art by inclusion in this section.


TV viewers can record broadcasted TV programs using a videocassette recorder (VCR). As such, A VCR user can record a particular TV program at the time it is broadcasted and play the same recorded TV program at a later time. In order to accomplish this, A VCR changes the electrical signals representing a TV program into magnetic signals and stores the magnetic signals on magnetic tape. The magnetic tape is usually in the form of a videocassette tape inserted into the VCR by the VCR user. When a VCR user decides to play back the TV program, the process is reversed, and the VCR changes the magnetic signals stored on the videocassette tape into electrical signals and sends the electrical signals to a TV set.


With the development of digital technology, VCRs are being replaced by digital video recorders (DVRs). Like a VCR, a DVR records broadcasted TV programs for later playback by changing electrical signals of the TV program into digital information and storing the digital information in a memory device. When the user plays back the recorded TV program, the DVR converts the digital information back to analog signals and sends the signals to the TV set which displays the TV program for the viewer.


DVRs are becoming increasingly popular and widely used for recording broadcasted TV programs. However, DVR users frequently forget to record or schedule the recording of particular TV programs. Further, users may not realize the program was broadcasted, or simply did not desire to record the show at the time. Because the DVR did not record the program, the DVR user has no way of viewing the program again unless it is re-broadcasted. Further, DVRs occasionally do not record a program that a user scheduled for recording because of a conflict or other reasons. Thus, a particular drawback to a conventional DVR is the inability to playback content that was not previously recorded by the DVR.


What is desired is to establish a communication system through which a DVR may receive previously broadcasted content from one or more DVRs across a network.





BRIEF DESCRIPTION OF THE DRAWINGS

The present invention is illustrated by way of example, and not by way of limitation, in the figures of the accompanying drawings and in which like reference numerals refer to similar elements and in which:



FIG. 1A is a block diagram illustrating a communication system for secure transfer of previously broadcasted content according to one embodiment of the invention;



FIG. 1B is a block diagram illustrating a general overview of the components of a Digital Video Recorder (DVR) according to one embodiment of the invention;



FIG. 1C is a block diagram illustrating a communication system for validating requests for previously broadcasted content according to one embodiment of the invention;



FIG. 1D is a block diagram illustrating a communication system for authorizing requests for previously broadcasted content according to one embodiment of the invention;



FIG. 2 is a block diagram illustrating a user-interface presented to a user of a DVR for requesting the transfer of previously broadcasted content according to one embodiment of the invention;



FIG. 3 is a block diagram illustrating a communication system for creation a pool of DVRs according to one embodiment of the present invention;



FIG. 4A is a block diagram illustrating a method for initiating a “push” transfer of previously broadcasted content according to one embodiment of the invention;



FIG. 4B is a block diagram illustration a method for initiating a “pull” transfer of previously broadcasted content according to one embodiment of the invention;



FIG. 5 is a block diagram illustrating portions of previously broadcasted content for transfer according to one embodiment of the invention; and



FIG. 6 is a block diagram of a system on which embodiments of the invention may be implemented.





DETAILED DESCRIPTION

A method and apparatus for providing secure transfer of previously broadcasted content is described. In the following description, for the purposes of explanation, numerous specific details are set forth in order to provide a thorough understanding of the present invention. It will be apparent, however, that the present invention may be practiced without these specific details. In other instances, well-known structures and devices are shown in block diagram form in order to avoid unnecessarily obscuring the present invention.


Embodiments are described herein according to the following outline:

    • 1.0 General Overview
    • 2.0 Structural Overview
    • 3.0 Approach for Secure Transfer of Previously Broadcasted Content
      • 3.1 Requesting Previously Broadcasted Content
      • 3.2 Validation and Authorization
      • 3.3 Creating a DVR Pool
      • 3.4 Initiating a Transfer of Previously Broadcasted Content
    • 4.0 Implementation Mechanisms—Hardware Overview
    • 5.0 Extensions and Alternatives


      1.0 General Overview


The needs identified in the foregoing Background, and other needs and objects that will become apparent for the following description, are achieved in the present invention, which comprises, in one aspect, a method for secure transfer of previously broadcasted content. DVR users are offered a means by which they may request and receive previously broadcasted content not recorded or stored on the user's DVR.


A DVR user who wishes to retrieve content that was previously broadcasted but not recorded is presented with a user interface for requesting the previously broadcasted content. Once the user selects the previously broadcasted content, the request is sent to the service provider, which validates and authorizes the request. The service provider validates the request by inspecting data associated with the user to determine if the user should be allowed to retrieve the previously broadcasted content. The service provider authorizes the request by inspecting data associated with the previously broadcasted content to determine if the previously broadcasted content is allowed to be retrieved.


Once the service provider validates and authorizes the request, the service provider identifies one or more DVRs on a computer network that currently have the previously broadcasted content stored on their respective storage devices. The service provider filters the one or more DVRs according to a number of factors, including bandwidth, to create a pool of DVRs for transferring the previously broadcasted content.


The service provider initiates the transfer by either requesting each DVR in the pool of DVRs to begin transferring the previously broadcasted content to the requesting DVR, or by directly requesting the DVR to retrieve the content from the pool of DVRs. The previously broadcasted content is sent to the requesting DVR in portions which are re-assembled at the DVR and stored for later playback.


In other aspects, the invention encompasses a computer apparatus and a computer-readable medium configured to carry out the foregoing steps.


2.0 Structural Overview


Referring to FIG. 1A, in accordance with one embodiment, a communication system for distributing content between DVRs across a network is shown. The communication system contains DVRs 101, 102, 103, 104 and 105. DVRs 101-105 are communicatively coupled to Internet 107 through any proper communication interface, such as an Ethernet or wireless communications port. Further, DVRs 101-105 may initiate a connection to Internet 107 by calling a local access telephone number for an Internet service provider (ISP). The functionality of a DVR is typified in U.S. Pat. No. 6,233,389 which is owned by the Applicant and is hereby incorporated by reference.


Content Server 109 may be a network device which stores programming content for retrieval by other network devices. For instance, Content Server 109 may be a web server consisting of multimedia content for download. Further Content Server 109 may be a personal computer (PC) connected to Internet 107.


In one embodiment, Content Provider 108 provides original broadcast programming content to DVR users. Thus, Content Provider 108 controls access to any of its program content and authorizes DVR transactions by communicating with the Service Provider 106. Service Provider 106 communicates with Content Provider 108 to authorize DVR transfers and determine program content restrictions.


Service Provider 106, Content Provider 108 and Content Server 109 are also communicatively coupled to Internet 107 through any proper interface. Accordingly, each DVR 101-105 may establish a connection with Service Provider 106, Content Provider 108 or Content Server 109 through Internet 107 using any acceptable communications protocol. Alternatively, each DVR 101-105 may be directly connected to the Service Provider 106 by using an internal telephone modem to dial into an incoming call modem bank located at the Service Provider 106.


In one embodiment, DVR 101 communicates with Service Provider 106, which provides program guide data, graphical resources (such as fonts, pictures, etc.), service information, software programs, advertisements, and other forms of data that enable DVR 101 to operate independently of the Service Provider 106 to satisfy viewer interests. Communication between DVR 101 and Service Provider 106 utilizes a secure distribution architecture to transfer data between the DVR 101 and the Service Provider 106 such that both the service data and the user's privacy are protected.


Further, each DVR may use Internet 107 to establish communication with other DVRs. For instance, DVR 101 may use Internet 107 to establish a communication channel with DVRs 102-105 and vice versa. When one DVR 101 wishes to establish a communication channel with another DVR 102, each DVR may utilize a secure communication path through the use of encryption keys to ensure that third parties do not intercept any messages between DVRs 101 and 102.


Referring to FIG. 1B, in an embodiment, DVR 101 generally comprises a plurality of components, signified by Signal Converter 154, that are necessary to digitize an analog television signal and convert it into a digital data stream or to accept a digital data stream. DVR 101 receives broadcast signals from an antenna, from a cable TV system, satellite receiver, etc., via Input 152A. Input 152A may comprise a plurality of tuning modules that allow a plurality of signals to be received and recorded simultaneously.


Recording Module 160 records the incoming data stream by storing the digital data stream on at least one storage facility, signified by Storage 164 that is designed to retain segments of the digital data stream. A Signal Converter 154 retrieves segments of the data stream, convert the data stream into an analog signal, and then modulate the signal onto a RF carrier, via Output 152B, through which the signal is delivered to a standard TV set. Output 152B may alternatively deliver a digital signal to a TV set or video monitor. For example, DVR 101 may utilize a Digital Visual Interface port (DVI) for sending digital signals to a TV via a DVI cable.


DVR 101 also includes a Communication Interface 162, through which the DVR 101 communicates with Network 105 via Ethernet, wireless network, modem, or other communications standard.


In another embodiment, DVR 101 generally comprises a plurality of components necessary to receive, record, store, transfer and playback digital data signals from a plurality of sources, such as a PC, a DVR, a service provider, or content server. DVR 101 can transfer digital data signals to another DVR or PC. DVR 101 may encode or decode digital signals via Encoder 156A and Decoder 156B into a plurality of formats for playback, storage or transfer. DVR 101 can also encrypt or decrypt digital data signals using Encryptor/Decryptor 158 for storage, transfer or playback of the digital data signals. Further, DVR 101 may be integrated into a TV system such that the components described above are housed in a TV set capable of performing the functions of each component of DVR 101.


In the discussion below reference is frequently made to DVR 101. However, it should be noted that DVR 101 may instead be a PC, a portable device such as a Personal Digital Assistant (PDA) or mobile phone, or any other device capable of performing the functions of DVR 101.


3.0 Approach for Secure Transfer of Previously Broadcasted Content


3.1 Requesting Previously Broadcasted Content


In one embodiment, assume the user of DVR 101 wishes to obtain program content that was previously broadcasted but DVR 101 did not record. Thus, the program content is not stored on DVR 101 and is not available for playback.


Through the control interface of DVR 101, a user may view a listing of programs the DVR has previously recorded. In one embodiment, the DVR 101 can display a list of shows the user requested the DVR to record but the DVR did not record for any particular reason. One such reason could be, for instance, the recording would have conflicted with another program the DVR was scheduled to record. Further, DVR 101 can display programs that the user might have been interested in but did not record. For instance DVR 101 may track the viewing habits of a particular user to identify similar programs that might be of interest to a user. Additionally, a viewer might simply not record a program but later decide the program should have been recorded. Regardless, DVR 101 provides an interface for requesting any previously broadcasted program through the user-interface of the DVR 101. For instance, DVR 101 may provide a program guide of previously broadcasted program content for the user. A user can thus select any program in the program guide and proceed to request the previously broadcasted content for download. Typically, the DVR has an electronic program guide that covers several weeks and the user has access to several past days of programming.


When the user decides to retrieve the previously broadcasted content, the user can use an appropriate control interface, such as a remote control to select the particular program content and initiate a request. Alternatively, instead of using the DVR interface, the user can submit a request for the previously recorded content through the Service Provider 106 website. For instance, a user can log on to the web site of Service Provider 106 and provide information regarding the previously broadcasted program. Alternatively, the Service Provider 106 may provide a user with a program guide similar to the program guide provided by DVR 101 for selecting program content.


Referring to FIG. 2, according to one embodiment, a user interface for requesting previously broadcasted content is shown. Through a standard TV set or monitor connected to DVR 101, DVR 101 causes screen 201 to be presented to a user of DVR 101. Screen 201 contains selectable options, one of which is the “Video Connect” option for requesting previously broadcasted content. Alternatively, Screen 201 may contain a listing of broadcasted content the user has requested to be recorded, but DVR 101 failed to record. Further, Screen 201 may simply be a TV program guide of previously broadcasted shows for the user to select.


A user of DVR 101 can select options displayed on Screen 201 by utilizing any appropriate control interface, such as a remote control associated with DVR 101. When the user selects the “Video Connect” option, DVR 101 causes screen 202 to be presented. Screen 202 displays information regarding the previously broadcasted program. In one embodiment, such information may be the title, duration, and description of the multimedia content. Further, Screen 202 may contain additional information, such as the availability of the content as well as the estimated amount of time it will take to obtain the previously broadcasted content. Further, Screen 202 can present additional information, such as the number of DVRs in the DVR pool for the selected program. Such information may be obtained by DVR 101 when DVR 101 communicates with Service Provider 106 through Internet 107 or a standard telephone line. When the user selects the particular multimedia content, DVR 101 causes screen 203 to be presented to the user. According to one embodiment, Screen 203 is a confirmation screen which requests that a DVR user confirm the selection of previously broadcasted content.


Alternatively, Screen 203 includes an option for purchasing the previously broadcasted content, if required, and for requesting the transfer of the content from the DVR Pool 110. Once the user selects to purchase and download the multimedia content, DVR 101 sends a request to Content Server 106B to initiate a transfer of the multimedia content to DVR 101. In other embodiments, the user may receive the previously broadcasted content free of charge. For instance, the user may have previously paid for the multimedia content or the multimedia content may be free of charge.


In another embodiment, a user may request previously broadcasted content by logging onto the website of Service Provider 106. Thus, Screens 201, 202 and 203 may be web pages presented to a user accessing the Service Provider 106 through Internet 107. To request the transfer of previously broadcasted content to DVR 101, a user will enter information identifying the previously broadcasted content, as well as a unique identifier for DVR 101. The Service Provider 106 uses this information to locate the DVR 101 and the content and to proceed with the transaction.


In another embodiment, whether through the DVR interface or through the website of Service Provider 106, a payment structure can be built into the system such that the user is charged each time a previously broadcasted program content is received by DVR 101. Thus, an additional screen requesting billing or payment information may be displayed to the user to enter in the appropriate information. This information is then supplied to the Service Provider 106 as part of the request for content. Alternatively, the billing or payment information may have been previously supplied to and stored by the Service Provider 106, such that any subsequent request for previously broadcasted program content is automatically processed without presenting another screen to the DVR user.


Next, the request message, along with any additional data, is sent to the Service Provider 106. The message may be sent through Internet 107 via a communication interface of the DVR. Alternatively, the request can be stored by the DVR and sent to the Service Provider 106 when the DVR establishes a connection to Service Provider 106 directly through a telephone line using a built-in modem.


3.2 Validation and Authorization


When the Service Provider 106 receives the request, the Service Provider 106 processes the request by validating the user or DVR 101, authorizing the transfer of the previously broadcasted program content, creating a pool of source DVRs and initiating a transfer between the source DVRs and DVR 101.


Referring to FIG. 1C, according to one embodiment, Service Provider 106 is communicatively coupled to a database containing information for each user and/or DVR associated with the Service Provider 106. The database is comprised of data gathered by the Service Provider 106 when it establishes a connection with any DVR. Thus, each time DVRs 101-105 connect to the Service Provider 106, whether through Internet 107 or via a telephone line, Service Provider 106 gathers various data from each DVR, such as the content stored on the DVR, a schedule of upcoming recordings, billing information, user information, encryption keys and any other appropriate information. The transfer of such information from DVRs 101-105 to Service Provider 106 is conducted via a secure distribution architecture such that any sensitive information is not intercepted by third parties. Once Service Provider 106 has received this information, it stores it in Database 140. Database 140 is communicatively coupled to Service Provider 106. In one embodiment, Database 140 is located on a storage device of Service Provider 106. In another embodiment, Database 140 may be located on a local network.


In order to determine that a particular DVR or user is allowed to receive previously broadcasted content, the Service Provider 106 can check the database to determine if the user's subscription type allows for previously broadcasted content. In one embodiment, the Service Provider 106 may require the user to pay a specific subscription fee for accessing all previously recorded content. Alternatively, the Service Provider 106 may provide a pay-per-program structure such that the user is billed each time previously recorded content is sent to the user's DVR. The Service Provider 106 may alternatively provide a pay-per-program structure such that the user is billed each time previously recorded content is viewed.


When Service Provider 106, receives the request for previously broadcasted content, in one embodiment, the Service Provider 106 first performs a validation of the request to determine whether the user is authorized to receive the previously broadcasted content. For example, to accomplish this Service Provider 106 performs a query operation on Database 140 to retrieve Table 150. In one embodiment Table 150 contains N number of rows, each containing information for a particular DVR user. Table 150 may be comprised of columns representing a User ID field 152, a DVR field 154, a Subscription Type field 156 and Billing Information field 158 for N number of DVRs or DVR users. The User ID field 152 corresponds to a unique user ID for each user of a DVR. The user information may be a user name supplied to the Service Provider 106 when a DVR user registers and activates a DVR 101 with Service Provider 106. DVR field 154 represents the particular DVR associated with each user ID in 152. The DVR field may identify DVRs by a number unique to each DVR, such as a DVR serial number or MAC address. It should be noted that a particular user, User 2, for instance, may own more than one DVR. Thus, Table 150 indicates that DVRs 102 and 103 are owned by User 2.


In this particular example, Service Provider 106 receives a request from DVR 101 for previously broadcasted content. When Service Provider 106 queries Database 140, the returned information will indicate that DVR 101 is owned by User 1. Further, the information indicates that the subscription type 156 for DVR 101 is an unlimited subscription, such that DVR 101 is authorized to download an unlimited amount of previously broadcasted program content.


Suppose Service Provider 106 receives a request for previously broadcasted content from DVR 102. In this scenario, when Service Provider 106 queries Database 140, the data would indicate that the subscription type of DVR 102 is a pay per-view type subscription. Thus, every time DVR 102 receives previously broadcasted program content, Service Provider 106 enters a charge transaction for User 2 into Database 140 using the Billing Information provided in field 158. Alternatively, the charge transaction may be entered into a separate billing database dedicated to storing and processing fee transactions.


Additionally, the subscription type may indicate that a particular user has not subscribed to the channel, for instance, because it is a premium channel. Therefore, the Service Provider 106 can deny the request. Alternatively, the Service Provider 106 can present a DVR user with the opportunity to subscribe to the premium channel or to receive the previously recorded content for a fee.


At this point, Service Provider 106 may proceed to select one or more DVRs to create a DVR Pool as described in section 3.3. However, in another embodiment, content providers that originally provide the broadcasted content may provide rules for accessing previously broadcasted content. For instance, some content providers may not allow any previously broadcasted content to be sent to user's who did not record the broadcasted content. Thus, after validating the request for previously broadcasted content, Service Provider 106 may optionally determine from a content provider whether the requested program content is authorized for transfer.


Referring to FIG. 1D, according to one optional embodiment, Database 140 contains data supplied from Content Provider 108. Table 160 represents the data supplied from a plurality of Content Providers. Service Provider 106 may obtain the data from Content Providers using a number of methods. For instance, Service Provider 106 may communicate directly with Content Provider 108 through Internet 107 to provide the data.


In this particular embodiment, Table 160 includes N number of rows, each containing 4 columns representing a Content Provider field 162, a Program field 164, an Access field 166 and a Fee field 168. The Content Provider field 162 represents the identification of the content provider. For instance, Content Provider A supplies programs different from Content Provider B. The Program field 164 represents a particular program supplied and/or broadcasted by a particular Content Provider. In this embodiment, Content Provider A broadcasts Programs A and B while Content Provider B broadcasts Programs X and Y. Further, the Access field 166 specifies specific access rules for each program. Access to a program may be Unlimited, such that anyone may retrieve the content at any time or Prohibited, such that the content is not available for retrieval. Further, a program may be classified as Pay only or pay-per-view, such that the program content is only available for retrieval for a fee.


Assume, for instance, that DVR 101 requests previously broadcasted Program A. In order to approve the request, Service Provider 106 queries Database 140 to obtain the information in Table 160. According to Table 160 Program A is classified as an unlimited access program. Therefore, Service Provider 106 approves the request and proceeds to initiate the transfer of Program A to DVR 101. In one embodiment, the Service Provider 106 can notify DVR 101 that the request has been approved.


However, assume that DVR 101 requests previously broadcasted Program B. According to Table 160, retrieval of Program B is prohibited. Therefore, Service Provider 106 denies the request and notifies DVR 101 that retrieval of Program B is now allowed.


Alternatively, if DVR 101 requests Program X, Service Provider 106 will determine that retrieval of Program X requires a fee. To determine the amount of the fee, in one embodiment, Service Provider 106 can examine the Fee field 168 of Table 160. Accordingly, the fee for program X is listed as 2 credits. When the Service Provider 106 determines that a fee is required to retrieve a program, the Service Provider 106 may send a message to DVR 101 indicating the same. When DVR 101 receives the message, DVR 101 causes a screen to be displayed to a user of DVR 101 requesting that payment be authorized. Alternatively, Service Provider 106 automatically authorizes the payment for Program X by querying Database 140 for billing information from Billing field 158 of Table 150.


3.3 Pool Selection


Once the Service Provider 106 determines the user is authorized to receive the content and that the content is available for transfer, the Service Provider 106 proceeds to form a pool of selected DVRs.


Referring to FIG. 3, according to one embodiment, each DVR 102-105 stores previously broadcasted content that it has recorded for a limited amount of time, typically because each DVR has differing memory demands and may have to delete old content to make room for new content. Periodically, each DVR 102-105 may supply a list of stored content, as well as the amount of time the content is expected to be stored, to Service Provider 106, which stores the information in Database 140. When Service Provider 106 receives and validates a request for a previously broadcasted program from DVR 101, Service Provider 106 queries Database 140 to determine which DVRs currently have the content available for transfer.


Assume, for instance, that DVR 101 requests previously broadcasted Program X. The Service Provider 106 receives the request and queries database 140 to retrieve Tables 310-313. In one embodiment, Tables 310-313 each contain N number of rows, each row corresponding to specific content stored on the storage device of a corresponding DVR. Each of Tables 310-313 can contain 2 columns, one column representing the title or identifier of the content, and the second column representing the amount of time left before the content is deleted from the storage device.


In one embodiment, Service Provider 106 determines that DVRs 102, 103 and 104 have recorded and stored Program X. Further, in another embodiment, Service Provider 106 determines that although DVR 105 has stored and recorded program X, it is scheduled to be deleted shortly. Therefore, Service Provider 106 initially selects DVRs 102, 103 and 104 for inclusion in DVR Pool list 300.


Further, Service Provider 106 can specify additional criteria for filtering DVRs for DVR Pool List 300. For instance, each DVR 102-105 may contain information identifying a bandwidth associated with the DVR. DVR Pool List 300 may contain a DVR field 302, a Bandwidth field 304, and a Pool Status field 306. In Bandwidth field 304, a high bandwidth indicates that DVR can transfer program content at a higher than average rate, a medium bandwidth indicates an average rate, and a low bandwidth indicates a lower than average rate. In one embodiment, Service Provider 106 can favor DVRs with higher bandwidth, such that any DVR with low bandwidth will be ejected from the DVR pool. According to DVR Pool List 300, DVR 103 has a low bandwidth; thus, in one embodiment, Service Provider 106 removes DVR 103 from the DVR Pool list 300. Alternatively, Service Provider 106 can decide to leave DVR 103 on the DVR Pool list 300 but favor DVRs 102 and 104 for transfers. Hence, DVR 103 can act as a back up DVR if any of DVRs 102 or 104 encounter an error in the transfer


Additionally, the Service Provider can favor DVRs not already part of another DVR pool for transferring program content. For instance, according to Pool Status field 306, DVR 103 is already assigned to Pool Y. Therefore, Service Provider 106 can remove DVR 103 from the DVR Pool List 300 or give DVR 103 a lower priority for transfers in the current Pool list 300.


3.4 Initiating a Transfer of Previously Broadcasted Content


Once the Service Provider 106 has created a DVR pool for the particular request, the Service Provider 106 initiates a transfer between the DVR pool and the requesting DVR. To initiate a transfer between the DVR pool and the requesting DVR, the Service Provider 106 may communicate with each DVR 102-104 in the DVR Pool list 300 to request each DVR 102-104 to send the program content to the requesting DVR. In one embodiment, the requesting DVR is DVR 101. It should be noted, however, that DVR 101 may be a PC, a portable device such as a PDA or mobile phone, or any other device capable of receiving content from one or more DVRs.


Referring to FIG. 4A, according to one embodiment, Service Provider 106 sends a transfer request to each DVR 102, 103 and 104 in the DVR Pool. This request instructs each DVR to transmit a portion of the previously broadcasted content to the requesting DVR 101. Alternatively, the request can instruct a particular DVR to send the full portion of the previously broadcasted content to the requesting DVR 101.


When each DVR 102, 103 and 104 receives the request, the DVRs initiate a transfer of the content through Internet 107 to DVR 101. In one embodiment, each DVR is designated a portion of the content to send. Referring to FIG. 5, according to one embodiment, the previously broadcasted content is divided into four portions A, B, C and D. Each of portions A, B, C and D contains sub-portions. For instance, portion A consists of sub portions A1, A2 and A3, portion B consists of sub portions B1, B2, and B3, portion C consists of sub portions C1 and C2 and portion D consists of sub portion Dl.


In this manner, Service Provider 106 can instruct each DVR 102-104 in the DVR pool to transfer one or more portions or sub-portions. For instance, Service Provider 106 may instruct DVR 102 to transfer portion A, DVR 103 to transfer portion B, and DVR 104 to transfer portion C and D. In other embodiments, the program content can be divided into any number of portions which may be assigned to one or more DVRs. Further, each DVR may be assigned a plurality of portions to send. For instance, if Service Provider 106 determines that DVR 102 has a higher bandwidth than DVR 103 or 104, Service Provider 106 can instruct DVR 102 to send portions A and B.


In one embodiment, each DVR 102, 103 and 104 sends each program sub-portion in a content segment 502 in FIG. 5. Content segment 502 contains Content data 503 and Placement data 505. Further, each DVR in the DVR Pool may also encrypt the data of each content segment for secure transfer over Internet 107. In one embodiment, each DVR uses a Message Digest-5 (MD5) encryption of its MAC address. In other embodiments, each DVR may use any appropriate encryption method such as public key or Secure Hash Algorithm-1 (SHA-1) encryption.


Further, Service Provider 106 may include a load balancing circuit 407. The load balancing circuit 407 communicates with each DVR 102-104 in DVR pool to determine the optimal division of program portions and sub-portions among the DVRs for transfer. Thus, load balancing circuit 407 may dynamically adjust the distribution of the program content between DVRs 102, 103 and 104. For instance, if during transfer, DVR 102 goes offline or the bandwidth of DVR 102 becomes extremely low, load balancing circuit 207 can instruct either DVR 103 or 104 to transfer all or just the remaining portion of content assigned to DVR 102 for transfer. Hence, assuming that DVR 102 was originally assigned to transfer portion A to DVR 101, load balancing circuit 207 assigns any sub-portions of A that were not transferred to DVR 103, DVR 104, or both. Alternatively, load balancing circuit 207 can assign every sub-portion of A to DVR 103, DVR 104, or both, to ensure that no sub-portions are lost due to the failure of DVR 102.


When DVR 101 receives the sub-portions from each DVR 102, 103, and 104, it begins to piece the sub-portions of the content together using a combining module 402 on DVR 101. In combining module 402, portions A, B, C and D are assembled together as each sub-portion is received to create one stream of program data. In order to accomplish this, in one embodiment, combining module 402 reads the Placement Data 505 of Content Segment 502 to determine the correct placement of the portion in the overall program content. For instance, portion A may indicate it needs to be placed before portion C, and portion B2 before portion B3. Next, according to one embodiment, DVR 101 combines all the portions and sub-portions of the previously broadcasted program content 500 to create a digital data stream. The digital data stream is then placed in Storage Module 406 for storage and further playback.


Alternatively, DVR 101 can use the time stamps in the sub-portions to assemble the digital data stream.


When the program content is combined and stored, in one embodiment, DVR 101 may further use combining module 402 to perform an integrity check of the entire content. An integrity check ensures that DVR 101 has received the full program content free from error. Once DVR 101 has determined it has received the program content with no errors, DVR 101 can send a message to Service Provider 106 indicating that it has received the file. Alternatively, DVR 101 can send a message to each DVR 102, 103, and 104 in the DVR pool to indicate the same.


Further, each DVR 102, 103 and 104 in the DVR pool may contain a module for tracking the progress of each transfer. When each DVR has detected that it has completed transferring its portion, it sends a message to Service Provider 106 indicating the same. Thus, when Service Provider 106 has received messages from each DVR in the DVR pool indicating that the transfer is complete, Service Provider 106 logs the transfer in Database 140. At this point, if the previously broadcasted content required a fee for transfer, Service Provider 106 can complete the payment transaction by deducting the fee from the user's account and transferring the fee to the Service Provider's account. Alternatively, the Service Provider 106 can deduct its own fee before crediting a Content Provider's account.


Alternatively, DVR 101 can report to Service Provider 106 when the download has completed. To bypass a user hacking the DVR 101 to not report back the download completion, the DVR 101 can hide the content until the Service Provider 106 informs the DVR 101 hat it can release the content to the user. Service Provider 106 can complete the payment transaction before informing the DVR 101 that it can release the content.


Referring to FIG. 4B, according to another embodiment, instead of sending a transfer request message to DVRs 102-104, Service Provider 106 can initiate a transfer by sending the transfer request message directly to DVR 101. When Service Provider 106 sends the transfer requests, it may also provide the DVR Pool list 300 to DVR 101. When DVR 101 receives the request, it determines which DVRs to contact by reading the DVR Pool list 300. In one embodiment, the DVR Pool List may contain the IP addresses of each DVR 102-104. Thus, using Communication Interface 404, DVR 101 initiates a transfer with each DVR 102-104 via Internet 107 using the corresponding IP addresses. Further, DVR 101 may indicate to each DVR 102-104 a portion of the program content 500 to transfer. Alternatively, when DVRs 102-104 receive the request from DVR 101, DVRs 102-104 can communicate with Service Provider 106 to determine which DVRs 102-104 are assigned which program content portions and sub-portions. Once DVRs 102-104 have determined which portions to send, DVRs 102-104 begin transferring the portions to DVR 101. At this point, the method for secure transfer of previously broadcasted content proceeds as discussed in reference to FIG. 4A.


4.0 Hardware Overview


FIG. 6 is a block diagram that illustrates a computer system 600 upon which an embodiment of the invention may be implemented. Computer system 600 includes a bus 602 or other communication mechanism for communicating information, and a processor 604 coupled with bus 602 for processing information. Computer system 600 also includes a main memory 606, such as a random access memory (RAM) or other dynamic storage device, coupled to bus 602 for storing information and instructions to be executed by processor 604. Main memory 606 also may be used for storing temporary variables or other intermediate information during execution of instructions to be executed by processor 604. Computer system 600 further includes a read only memory (ROM) 608 or other static storage device coupled to bus 602 for storing static information and instructions for processor 604. A storage device 610, such as a magnetic disk or optical disk, is provided and coupled to bus 602 for storing information and instructions.


Computer system 600 may be coupled via bus 602 to a display 612, such as a cathode ray tube (CRT), for displaying information to a computer user. An input device 614, including alphanumeric and other keys, is coupled to bus 602 for communicating information and command selections to processor 604. Another type of user input device is cursor control 616, such as a mouse, a trackball, or cursor direction keys for communicating direction information and command selections to processor 604 and for controlling cursor movement on display 612. This input device typically has two degrees of freedom in two axes, a first axis (e.g., x) and a second axis (e.g., y), that allows the device to specify positions in a plane.


The invention is related to the use of computer system 600 for implementing the techniques described herein. According to one embodiment of the invention, those techniques are performed by computer system 600 in response to processor 604 executing one or more sequences of one or more instructions contained in main memory 606. Such instructions may be read into main memory 606 from another machine-readable medium, such as storage device 610. Execution of the sequences of instructions contained in main memory 606 causes processor 604 to perform the process steps described herein. In alternative embodiments, hard-wired circuitry may be used in place of or in combination with software instructions to implement the invention. Thus, embodiments of the invention are not limited to any specific combination of hardware circuitry and software.


The term “machine-readable medium” as used herein refers to any medium that participates in providing data that causes a machine to operation in a specific fashion. In an embodiment implemented using computer system 600, various machine-readable media are involved, for example, in providing instructions to processor 604 for execution. Such a medium may take many forms, including but not limited to, non-volatile media, volatile media, and transmission media. Non-volatile media includes, for example, optical or magnetic disks, such as storage device 610. Volatile media includes dynamic memory, such as main memory 606. Transmission media includes coaxial cables, copper wire and fiber optics, including the wires that comprise bus 602. Transmission media can also take the form of acoustic or light waves, such as those generated during radio-wave and infra-red data communications. All such media must be tangible to enable the instructions carried by the media to be detected by a physical mechanism that reads the instructions into a machine.


Common forms of machine-readable media include, for example, a floppy disk, a flexible disk, hard disk, magnetic tape, or any other magnetic medium, a CD-ROM, any other optical medium, punchcards, papertape, any other physical medium with patterns of holes, a RAM, a PROM, and EPROM, a FLASH-EPROM, any other memory chip or cartridge, a carrier wave as described hereinafter, or any other medium from which a computer can read.


Various forms of machine-readable media may be involved in carrying one or more sequences of one or more instructions to processor 604 for execution. For example, the instructions may initially be carried on a magnetic disk of a remote computer. The remote computer can load the instructions into its dynamic memory and send the instructions over a telephone line using a modem. A modem local to computer system 600 can receive the data on the telephone line and use an infra-red transmitter to convert the data to an infra-red signal. An infra-red detector can receive the data carried in the infra-red signal and appropriate circuitry can place the data on bus 602. Bus 602 carries the data to main memory 606, from which processor 604 retrieves and executes the instructions. The instructions received by main memory 606 may optionally be stored on storage device 610 either before or after execution by processor 604.


Computer system 600 also includes a communication interface 618 coupled to bus 602. Communication interface 618 provides a two-way data communication coupling to a network link 620 that is connected to a local network 622. For example, communication interface 618 may be an integrated services digital network (ISDN) card or a modem to provide a data communication connection to a corresponding type of telephone line. As another example, communication interface 618 may be a local area network (LAN) card to provide a data communication connection to a compatible LAN. Wireless links may also be implemented. In any such implementation, communication interface 618 sends and receives electrical, electromagnetic or optical signals that carry digital data streams representing various types of information.


Network link 620 typically provides data communication through one or more networks to other data devices. For example, network link 620 may provide a connection through local network 622 to a host computer 624 or to data equipment operated by an Internet Service Provider (ISP) 626. ISP 626 in turn provides data communication services through the world wide packet data communication network now commonly referred to as the “Internet” 628. Local network 622 and Internet 628 both use electrical, electromagnetic or optical signals that carry digital data streams. The signals through the various networks and the signals on network link 620 and through communication interface 618, which carry the digital data to and from computer system 600, are exemplary forms of carrier waves transporting the information.


Computer system 600 can send messages and receive data, including program code, through the network(s), network link 620 and communication interface 618. In the Internet example, a server 630 might transmit a requested code for an application program through Internet 628, ISP 626, local network 622 and communication interface 618.


The received code may be executed by processor 604 as it is received, and/or stored in storage device 610, or other non-volatile storage for later execution. In this manner, computer system 600 may obtain application code in the form of a carrier wave.


In the foregoing specification, embodiments of the invention have been described with reference to numerous specific details that may vary from implementation to implementation. Thus, the sole and exclusive indicator of what is the invention, and is intended by the applicants to be the invention, is the set of claims that issue from this application, in the specific form in which such claims issue, including any subsequent correction. Any definitions expressly set forth herein for terms contained in such claims shall govern the meaning of such terms as used in the claims. Hence, no limitation, element, property, feature, advantage or attribute that is not expressly recited in a claim should limit the scope of such claim in any way. The specification and drawings are, accordingly, to be regarded in an illustrative rather than a restrictive sense.

Claims
  • 1. A method, comprising: sending, by a server, to a remote device, a web page that includes a selectable list, the selectable list comprising previously broadcasted content;receiving, by the server, a selection of a particular previously broadcasted content from the selectable list;receiving, by the server from the media device, a request for delivery of the particular previously broadcasted content;generating a plurality of requests for a plurality of media devices, wherein each request of the plurality of requests comprises a command to transmit, to the media device, a corresponding portion of the particular previously broadcasted content;sending, from the server, to each of the plurality of media devices a corresponding request of the plurality of requests;causing, by the server, delivery of the plurality of portions of the particular previously broadcasted content from the plurality of media devices to the media device.
  • 2. The method of claim 1, wherein the server determines whether the media device is authorized to receive the particular previously broadcasted content.
  • 3. The method of claim 2, further comprising: sending, by the server, to the remote device, a web page that includes an estimated amount of time it will take for the media device to obtain the particular previously broadcasted content.
  • 4. The method of claim 2, further comprising: sending, by the server, to the remote device, a web page that includes a number of media devices that have the particular previously broadcasted content stored.
  • 5. A server, comprising: control circuitry, implemented at least partially in hardware, that: sends to a remote device, a web page that includes a selectable list, the selectable list comprising previously broadcasted content;receives a selection of a particular previously broadcasted content from the selectable list;receives, from the media device, a request for delivery of the particular previously broadcasted content;generates a plurality of requests for a plurality of media devices, wherein each request of the plurality of requests comprises a command to transmit, to the media device, a corresponding portion of the particular previously broadcasted content;sends, to each of the plurality of media devices, a corresponding request of the plurality of requests;causes delivery of the plurality of portions of the particular previously broadcasted content from the plurality of media devices to the media device, the media device storing the plurality of portions of the particular previously broadcasted content.
  • 6. The server of claim 5, wherein the server determines whether the media device is authorized to receive the particular previously broadcasted content.
  • 7. The server of claim 6, wherein the web page generator sends to the remote device, a web page that includes an estimated amount of time it will take for the media device to obtain the particular previously broadcasted content.
  • 8. The server of claim 6, wherein the web page generator sends to the remote device, a web page that includes a number of media devices that have the particular previously broadcasted content stored.
  • 9. One or more non-transitory computer-readable storage media, storing one or more sequences of instructions, which when executed by one or more processors cause performance of: sending, by a server, to a remote device, a web page that includes a selectable list, the selectable list comprised of previously broadcasted programs;receiving, by the server, a selection of a particular previously broadcasted content from the selectable list;receiving, by the server from the media device, a request for delivery of the particular previously broadcasted content;generating a plurality of requests for a plurality of media devices, wherein each request of the plurality of requests comprises a command to transmit, to the media device, a corresponding portion of the particular previously broadcasted content;sending, from the server, to each of the plurality of media devices a corresponding request of the plurality of requests;causing, by the server, delivery of the plurality of portions of the particular previously broadcasted content from the plurality of media devices to the media device, the media device storing the plurality of portions of the particular previously broadcasted content.
  • 10. The one or more non-transitory computer-readable storage media of claim 9, wherein the server determines whether the media device is authorized to receive the particular previously broadcasted content.
  • 11. The one or more non-transitory computer-readable storage media of claim 10, wherein the one or more sequences of instructions, which when executed by the one or more processors further cause performance of: sending, by a server, to the remote device, a web page that includes an estimated amount of time it will take for the media device to obtain the particular previously broadcasted content.
  • 12. The one or more non-transitory computer-readable storage media of claim 10, wherein the one or more sequences of instructions, which when executed by the one or more processors further cause performance of: sending, by a server, to the remote device, a web page that includes a number of media devices that have the particular previously broadcasted content stored.
CROSS-REFERENCE TO RELATED APPLICATIONS

This application claims benefit under 35 U.S.C. § 120 as a Continuation of U.S. application Ser. No. 14/285,411, filed Nov. 21, 2005, which claims the benefit of Provisional Application No. 60/630,398, filed Nov. 19, 2004, the entire contents of the aforementioned are hereby incorporated by reference as if fully set forth herein. The applicant(s) hereby rescind any disclaimer of claim scope in the parent application(s) or the prosecution history thereof and advise the USPTO that the claims in this application may be broader than any claim in the parent application(s).

US Referenced Citations (307)
Number Name Date Kind
4488179 Krüger et al. Dec 1984 A
4697209 Kiewit et al. Sep 1987 A
4908707 Kinghorn Mar 1990 A
4930158 Vogel May 1990 A
4931865 Scarampi Jun 1990 A
5014125 Pocock et al. May 1991 A
5034902 Steinmann Jul 1991 A
5057932 Lang Oct 1991 A
5113294 Kim May 1992 A
5134499 Sata et al. Jul 1992 A
5282247 McLean et al. Jan 1994 A
5307173 Yuen et al. Apr 1994 A
5363481 Tilt Nov 1994 A
5371551 Logan et al. Dec 1994 A
5371794 Diffie et al. Dec 1994 A
5375160 Guidon et al. Dec 1994 A
5377051 Lane et al. Dec 1994 A
5414455 Hooper et al. May 1995 A
5469207 Chambers Nov 1995 A
5481294 Thomas et al. Jan 1996 A
5519684 Iizuka et al. May 1996 A
5519780 Woo et al. May 1996 A
5535008 Yamagishi et al. Jul 1996 A
5555441 Haddad Sep 1996 A
5559653 Shouji et al. Sep 1996 A
5574662 Windrem et al. Nov 1996 A
5578068 Laske et al. Nov 1996 A
5600775 King et al. Feb 1997 A
5631743 Inoue May 1997 A
5659368 Landis Aug 1997 A
5671412 Christiano Sep 1997 A
5696866 Iggulden et al. Dec 1997 A
5708787 Nakano et al. Jan 1998 A
5719982 Kawamura et al. Feb 1998 A
5721933 Walsh et al. Feb 1998 A
5742768 Gennaro et al. Apr 1998 A
5758068 Brandt et al. May 1998 A
5767913 Kassatly Jun 1998 A
5790664 Coley et al. Aug 1998 A
5805763 Lawler et al. Sep 1998 A
5808702 Yoshinobu et al. Sep 1998 A
5812732 Dettmer et al. Sep 1998 A
5872588 Aras et al. Feb 1999 A
5892536 Logan Apr 1999 A
5896566 Averbuch et al. Apr 1999 A
5911029 Sakaguchi et al. Jun 1999 A
5929849 Kikinis Jul 1999 A
5940504 Griswold Aug 1999 A
5957695 Redford et al. Sep 1999 A
5987210 Iggulden et al. Nov 1999 A
5987509 Portuesi Nov 1999 A
5990881 Inoue et al. Nov 1999 A
5990884 Douma et al. Nov 1999 A
5991503 Miyasaka et al. Nov 1999 A
5999225 Yagasaki et al. Dec 1999 A
5999688 Iggulden et al. Dec 1999 A
5999691 Takagi et al. Dec 1999 A
6009525 Horstmann Dec 1999 A
6018775 Vossler Jan 2000 A
6029195 Herz Feb 2000 A
6052554 Hendricks et al. Apr 2000 A
6057901 Xu May 2000 A
6058430 Kaplan May 2000 A
6072393 Todd Jun 2000 A
6072982 Haddad Jun 2000 A
6075550 Lapierre Jun 2000 A
6092201 Turnbull et al. Jul 2000 A
6094234 Nonomura et al. Jul 2000 A
6100941 Dimitrova et al. Aug 2000 A
6115057 Kwoh et al. Sep 2000 A
6148140 Okada et al. Nov 2000 A
6157413 Hanafee et al. Dec 2000 A
6166730 Goode et al. Dec 2000 A
6169976 Colosso Jan 2001 B1
6172605 Matsumoto et al. Jan 2001 B1
6216231 Stubblebine Apr 2001 B1
6219839 Sampsell Apr 2001 B1
6247176 Schein et al. Jun 2001 B1
6249863 Redford et al. Jun 2001 B1
6260142 Thakkar et al. Jul 2001 B1
6262951 Shimizu et al. Jul 2001 B1
6263503 Margulis Jul 2001 B1
6269099 Borella et al. Jul 2001 B1
6285407 Yasuki et al. Sep 2001 B1
6289169 Okuyama Sep 2001 B1
6295093 Park et al. Sep 2001 B1
6311011 Kuroda Oct 2001 B1
6349410 Lortz Feb 2002 B1
6351538 Uz Feb 2002 B1
6380978 Adams et al. Apr 2002 B1
6404977 Iggulden Jun 2002 B1
6412111 Cato Jun 2002 B1
6442328 Elliott et al. Aug 2002 B1
RE37881 Haines Oct 2002 E
6473903 Balakrishnan et al. Oct 2002 B2
6480353 Sacks et al. Nov 2002 B1
6480667 O'Connor Nov 2002 B1
6496981 Wistendahl et al. Dec 2002 B1
6526581 Edson Feb 2003 B1
6535465 Shigetomi et al. Mar 2003 B1
6564996 Hoffman et al. May 2003 B2
6611803 Furuyama et al. Aug 2003 B1
6614987 Ismail et al. Sep 2003 B1
6637032 Feinleib Oct 2003 B1
6694200 Naim Feb 2004 B1
6751321 Kato et al. Jun 2004 B1
6788882 Geer et al. Sep 2004 B1
6832388 Du Val Dec 2004 B1
6839851 Saitoh et al. Jan 2005 B1
6895166 Schriebman May 2005 B1
6898762 Ellis et al. May 2005 B2
6909837 Unger Jun 2005 B1
6931531 Takahashi Aug 2005 B1
6941387 Takihara Sep 2005 B1
6959221 Kataoka Oct 2005 B1
6973256 Dagtas Dec 2005 B1
6981147 Hamann et al. Dec 2005 B1
7003790 Inoue et al. Feb 2006 B1
7006881 Hoffberg et al. Feb 2006 B1
7028327 Dougherty et al. Apr 2006 B1
7055166 Logan et al. May 2006 B1
7065778 Lu Jun 2006 B1
7080400 Navar Jul 2006 B1
7103908 Tomsen Sep 2006 B2
7107608 Wagner et al. Sep 2006 B2
7110658 Iggulden et al. Sep 2006 B1
7140033 Durden et al. Nov 2006 B1
7155451 Torres Dec 2006 B1
7159232 Blackketter et al. Jan 2007 B1
7188087 Goldstein Mar 2007 B1
7194754 Tomsen et al. Mar 2007 B2
7213005 Mourad et al. May 2007 B2
7225142 Apte May 2007 B1
7231516 Sparrell et al. Jun 2007 B1
7260715 Pasieka Aug 2007 B1
7269330 Iggulden Sep 2007 B1
7308698 Heughebaert et al. Dec 2007 B1
7313802 Tomsen Dec 2007 B1
7333153 Hartson et al. Feb 2008 B2
7373651 Palazzo et al. May 2008 B2
7395546 Asmussen Jul 2008 B1
7404148 Lincke et al. Jul 2008 B2
7457511 Putterman et al. Nov 2008 B2
7529465 Barton et al. May 2009 B2
7661121 Smith Feb 2010 B2
7681141 Tu Mar 2010 B2
7716588 Iwamura May 2010 B2
7743326 Kanai Jun 2010 B2
7814511 Macrae et al. Oct 2010 B2
7818763 Sie et al. Oct 2010 B2
7870584 Russ et al. Jan 2011 B2
7877765 Bhogal et al. Jan 2011 B2
7877766 Wu et al. Jan 2011 B1
7886337 Williams et al. Feb 2011 B2
7889964 Barton et al. Feb 2011 B1
7929560 Morioka Apr 2011 B2
8046803 Lee Oct 2011 B1
8122236 Hayward Feb 2012 B2
8146130 Smith et al. Mar 2012 B2
8156528 Baumgartner et al. Apr 2012 B2
8161412 Weeks et al. Apr 2012 B2
8196168 Bryan et al. Jun 2012 B1
8214422 Woodward, Jr. Jul 2012 B1
8296792 Sahota et al. Oct 2012 B2
8453193 Barton et al. May 2013 B2
8457475 Ellis et al. Jun 2013 B2
8526781 Barton et al. Sep 2013 B2
8528032 Ellis et al. Sep 2013 B2
8584184 Thomas et al. Nov 2013 B2
8601507 Billmaier et al. Dec 2013 B2
8627385 Davies et al. Jan 2014 B2
8824865 Barton et al. Sep 2014 B2
8875198 Goodwin Oct 2014 B1
8893180 Barton et al. Nov 2014 B2
8948569 Barton et al. Feb 2015 B2
8965173 Barton et al. Feb 2015 B2
9258592 Stam Feb 2016 B2
20010003184 Ching et al. Jun 2001 A1
20010003554 Mori et al. Jun 2001 A1
20010014206 Artigalas et al. Aug 2001 A1
20010016884 Sato et al. Aug 2001 A1
20010029583 Palatov et al. Oct 2001 A1
20010039660 Vasilevsky et al. Nov 2001 A1
20010042246 Yuen et al. Nov 2001 A1
20010049648 Naylor et al. Dec 2001 A1
20010051996 Cooper et al. Dec 2001 A1
20020002523 Kossovsky et al. Jan 2002 A1
20020003949 Mamiya et al. Jan 2002 A1
20020013950 Tomsen Jan 2002 A1
20020016965 Tomsen Feb 2002 A1
20020032906 Grossman Mar 2002 A1
20020032907 Daniels Mar 2002 A1
20020048349 Bixler et al. Apr 2002 A1
20020054091 Tomsen et al. May 2002 A1
20020057893 Wood et al. May 2002 A1
20020059363 Katz et al. May 2002 A1
20020067725 Oguchi Jun 2002 A1
20020078456 Hudson et al. Jun 2002 A1
20020082973 Marbach et al. Jun 2002 A1
20020100052 Daniels Jul 2002 A1
20020104086 Tomsen et al. Aug 2002 A1
20020120515 Morimoto et al. Aug 2002 A1
20020120925 Logan Aug 2002 A1
20020124250 Proehl et al. Sep 2002 A1
20020146237 Safadi Oct 2002 A1
20020157002 Messerges et al. Oct 2002 A1
20020163532 Thomas et al. Nov 2002 A1
20020164156 Bilbrey Nov 2002 A1
20020178368 Yin et al. Nov 2002 A1
20030005463 Macrae et al. Jan 2003 A1
20030014754 Chang Jan 2003 A1
20030033606 Puente et al. Feb 2003 A1
20030050966 Dutta Mar 2003 A1
20030053540 Wang et al. Mar 2003 A1
20030066093 Cruz-Rivera et al. Apr 2003 A1
20030076955 Alve et al. Apr 2003 A1
20030093790 Logan et al. May 2003 A1
20030095791 Barton et al. May 2003 A1
20030097338 Mankovich et al. May 2003 A1
20030110503 Perkes Jun 2003 A1
20030118014 Iyer et al. Jun 2003 A1
20030122922 Saffer et al. Jul 2003 A1
20030145323 Hendricks et al. Jul 2003 A1
20030149988 Ellis et al. Aug 2003 A1
20030158958 Chiu Aug 2003 A1
20030174549 Yaguchi et al. Sep 2003 A1
20030188153 Demoff et al. Oct 2003 A1
20030192060 Levy Oct 2003 A1
20030204613 Hudson Oct 2003 A1
20030204856 Buxton Oct 2003 A1
20030215211 Coffin, III Nov 2003 A1
20030217328 Agassi et al. Nov 2003 A1
20030229893 Sgaraglino Dec 2003 A1
20030229900 Reisman Dec 2003 A1
20030233663 Rao et al. Dec 2003 A1
20040003079 Aiu et al. Jan 2004 A1
20040008289 Hwang et al. Jan 2004 A1
20040078829 Patel Apr 2004 A1
20040086120 Akins et al. May 2004 A1
20040086263 Arora May 2004 A1
20040117483 Singer et al. Jun 2004 A1
20040122746 Charlier et al. Jun 2004 A1
20040123129 Ginter et al. Jun 2004 A1
20040125761 Yamaguchi et al. Jul 2004 A1
20040139047 Reshsteiner et al. Jul 2004 A1
20040163130 Gray et al. Aug 2004 A1
20040187158 Fellenstein et al. Sep 2004 A1
20040215469 Fukushima et al. Oct 2004 A1
20040216164 Hayhurst Oct 2004 A1
20040237100 Pinder et al. Nov 2004 A1
20040237104 Cooper et al. Nov 2004 A1
20040250291 Rao et al. Dec 2004 A1
20040261093 Rebaud et al. Dec 2004 A1
20040268407 Sparrell et al. Dec 2004 A1
20050022251 Ohnuma et al. Jan 2005 A1
20050028208 Ellis et al. Feb 2005 A1
20050055640 Alten Mar 2005 A1
20050066362 Rambo Mar 2005 A1
20050076359 Pierson et al. Apr 2005 A1
20050086705 Jarman et al. Apr 2005 A1
20050108519 Barton et al. May 2005 A1
20050120386 Stone Jun 2005 A1
20050132401 Boccon-Gibod et al. Jun 2005 A1
20050166258 Vasilevsky et al. Jul 2005 A1
20050177853 Williams et al. Aug 2005 A1
20050226601 Cohen et al. Oct 2005 A1
20050289591 Vermola et al. Dec 2005 A1
20060013556 Poslinski Jan 2006 A1
20060089843 Flather Apr 2006 A1
20060095472 Krikorian et al. May 2006 A1
20060123455 Pai et al. Jun 2006 A1
20060127039 Van Stam Jun 2006 A1
20060136966 Folk, II Jun 2006 A1
20060184961 Lee et al. Aug 2006 A1
20070015237 Bailey et al. Jan 2007 A1
20070086724 Grady et al. Apr 2007 A1
20070250445 Ache Oct 2007 A1
20080010130 Pyhalammi et al. Jan 2008 A1
20080066127 Schechinger et al. Mar 2008 A1
20080092168 Logan et al. Apr 2008 A1
20080104199 Kalaboukis May 2008 A1
20080104202 Barrett et al. May 2008 A1
20080212949 Wachtfogel Sep 2008 A1
20090028529 Kuhns Jan 2009 A1
20090136215 Barton et al. May 2009 A1
20090241158 Campagna et al. Sep 2009 A1
20090284693 Adachi et al. Nov 2009 A1
20090320056 Wu et al. Dec 2009 A1
20100049867 Panwar Feb 2010 A1
20100192175 Bachet et al. Jul 2010 A1
20100226627 Barton et al. Sep 2010 A1
20100280876 Bowra Nov 2010 A1
20100313238 Baumgartner et al. Dec 2010 A1
20110116766 Sie et al. May 2011 A1
20110135271 Van Hoff et al. Jun 2011 A1
20120027383 Barton et al. Feb 2012 A1
20120131631 Bhogal et al. May 2012 A1
20130163954 Barton et al. Jun 2013 A1
20130243393 Barton et al. Sep 2013 A1
20130247092 Barton et al. Sep 2013 A1
20130315569 Ellis et al. Nov 2013 A1
20140003791 Barton et al. Jan 2014 A1
20140016912 Lockett et al. Jan 2014 A1
20140056572 Barton et al. Feb 2014 A1
20140059593 Smith et al. Feb 2014 A1
20140089984 Fujita Mar 2014 A1
20140380353 Barton et al. Dec 2014 A1
Foreign Referenced Citations (72)
Number Date Country
078440 Jul 1997 EP
0933891 Aug 1999 EP
0977 200 Feb 2000 EP
0987 888 Mar 2000 EP
375923 Nov 2002 GB
02-071633 Mar 1990 JP
H02-71633 Mar 1990 JP
05-114194 May 1993 JP
05-182294 Jul 1993 JP
07-212331 Aug 1995 JP
H09-65267 Mar 1997 JP
09-135391 May 1997 JP
H10-164521 Jun 1998 JP
10-208392 Aug 1998 JP
H11-103452 Apr 1999 JP
11-187324 Jul 1999 JP
H11-187324 Jul 1999 JP
2000-013755 Jan 2000 JP
2001-126009 May 2001 JP
2001-160003 Jun 2001 JP
2001-325461 Nov 2001 JP
2001-338242 Dec 2001 JP
2002-222138 Aug 2002 JP
2003-108371 Apr 2003 JP
2003141031 May 2003 JP
2003-224794 Aug 2003 JP
2003-229903 Aug 2003 JP
2003-525550 Aug 2003 JP
2003-259333 Sep 2003 JP
2003-324432 Nov 2003 JP
2003-324711 Nov 2003 JP
2003-333574 Nov 2003 JP
2004-007185 Jan 2004 JP
2004-078424 Mar 2004 JP
2004-193920 Jul 2004 JP
2004-222014 Aug 2004 JP
2006-506883 Feb 2006 JP
2007-052574 Mar 2007 JP
WO1992022938 Dec 1992 WO
WO1992022983 Dec 1992 WO
WO1997015143 Apr 1997 WO
WO1998007273 Feb 1998 WO
WO1998011723 Mar 1998 WO
WO 9817064 Apr 1998 WO
WO1998017064 Apr 1998 WO
WO1998048566 Oct 1998 WO
WO1998058306 Dec 1998 WO
WO 9917549 Apr 1999 WO
WO1999038321 Jul 1999 WO
WO9949717 Oct 1999 WO
WO1999052278 Oct 1999 WO
WO2000004549 Jan 2000 WO
WO2000036833 Jun 2000 WO
WO 0110127 Feb 2001 WO
WO2001022729 Mar 2001 WO
WO 0145407 Jun 2001 WO
WO 0153963 Jul 2001 WO
WO 0165862 Sep 2001 WO
WO 0167756 Sep 2001 WO
WO2002001330 Jan 2002 WO
WO 0243353 May 2002 WO
WO 02098063 Dec 2002 WO
WO2003043326 May 2003 WO
WO2003043326 May 2003 WO
WO2004001614 Dec 2003 WO
WO2004008289 Jan 2004 WO
WO2005060659 Jul 2005 WO
WO 2005079499 Sep 2005 WO
WO2007144728 Dec 2007 WO
WO2008002309 Jan 2008 WO
WO2008054802 May 2008 WO
WO2009026411 Feb 2009 WO
Non-Patent Literature Citations (112)
Entry
Chinese Patent Office, Application No. 200410039972.8, Claims dated Nov. 2005, 9 pages.
Chinese Patent Office, Application No. 200410039972.8, Office Action dated Nov. 4, 2005, 8 pages.
Chinese Patent Office, Application No. 200580039507.7, Foreign Office Action dated Jun. 30, 2015.
Chinese Patent Office, Application No. 200580039507.7, Pending Claims as of Jun. 30, 2015.
Chinese Patent Office, Application No. 201210083646.1, Foreign Office Action dated Oct. 17, 2014.
Chinese Patent Office, Application No. 201210083646.1, Notice of Allowance dated May 27, 2015.
Chinese Patent Office, Application No. 201210083646.1, Pending Claims as of Oct. 17, 2014.
Chinese Patent Office, Application No. 201210083646.1, Pending Claims as of May 27, 2015.
European Patent Office, Application No. 04700913.9, Pending Claims as of Aug. 12, 2015.
European Patent Office, Application No. 04700913.9, Summons to Oral Proceedings dated Aug. 12, 2015.
European Patent Office, Application No. 04814400.0, Office Action dated Sep. 6, 2013.
European Patent Office, Application No. 04814400.0, Pending Claims as of Sep. 6, 2013.
European Patent Office, Application No. 04814401.8, Foreign Office Action dated Nov. 27, 2014.
European Patent Office, Application No. 04814401.8, Pending Claims as of Nov. 27, 2014.
European Patent Office, Application No. 05851949.7, Pending Claims as of Oct. 27, 2015.
European Patent Office, Application No. 05851949.7, Summons to Oral Proceedings dated Oct. 27, 2015.
European Patent Office, Application No. 10153517.7, Extended European Search Report dated Aug. 31, 2012.
European Patent Office, Application No. 10153517.7, Pending Claims as of Aug. 31, 2012.
European Patent Office, Application No. 10180631.3, Extended European Search Report dated Aug. 31, 2012.
European Patent Office, Application No. 10180631.3, Pending Claims as of Aug. 31, 2012.
European Patent Office, Application No. 11182065.0, Foreign Office Action dated Dec. 4, 2015.
European Patent Office, Application No. 11182065.0, Pending Claims as of Dec. 4, 2015.
European Patent Office, Application No. 12167801.5, Extended European Search Report dated Sep. 10, 2015.
European Patent Office, Application No. 12167801.5, Pending Claims as of Sep. 10, 2015.
Japanese Patent Office, Application No. 2007-508490, Foreign Office Action dated Jul. 9, 2013.
Japanese Patent Office, Application No. 2007-508490, Pending Claims as of Jul. 9, 2013.
Japanese Patent Office, Application No. 2010-239085, Foreign Office Action dated Dec. 24, 2013.
Japanese Patent Office, Application No. 2010-239085, Pending Claims as of Dec. 24, 2013.
Japanese Patent Office, Application No. 2012-052320, Foreign Office Action dated Jul. 9, 2013.
Japanese Patent Office, Application No. 2012-052320, Foreign Office Action dated Jun. 17, 2014.
Japanese Patent Office, Application No. 2012-052320, Notice of Allowance dated Jan. 13, 2015.
Japanese Patent Office, Application No. 2012-052320, Pending Claims as of Jul. 9, 2013.
Japanese Patent Office, Application No. 2012-052320, Pending Claims as of Jun. 17, 2014.
Japanese Patent Office, Application No. 2012-052320, Pending Claims as of Jan. 13, 2015.
United States Patent and Trademark Office, U.S. Appl. No. 10/339,700, Final Office Action dated Oct. 20, 2006.
United States Patent and Trademark Office, U.S. Appl. No. 10/339,700, Final Office Action dated Feb. 7, 2007.
United States Patent and Trademark Office, U.S. Appl. No. 10/741,596, Advisory Action dated Jul. 20, 2012.
United States Patent and Trademark Office, U.S. Appl. No. 12/651,339, Final Office Action dated Aug. 10, 2012.
United States Patent and Trademark Office, U.S. Appl. No. 12/910,741, Non-Final Office Action dated Jan. 2, 2013.
United States Patent and Trademark Office, U.S. Appl. No. 12/651,339, Non-Final Office Action dated Apr. 5, 2013.
United States Patent and Trademark Office, U.S. Appl. No. 12/948,174, Non-Final Office Action dated Apr. 5, 2013.
United States Patent and Trademark Office, U.S. Appl. No. 10/741,596, Non-Final Office Action dated May 3, 2013.
United States Patent and Trademark Office, U.S. Appl. No. 12/910,741, Final Office Action dated Jun. 3, 2013.
United States Patent and Trademark Office, U.S. Appl. No. 12/704,245, Non-Final Office Action dated Jun. 11, 2013.
United States Patent and Trademark Office, U.S. Appl. No. 10/741,596, Final Office Action dated Oct. 11, 2013.
United States Patent and Trademark Office, U.S. Appl. No. 12/651,339, Final Office Action dated Feb. 5, 2014.
United States Patent and Trademark Office, U.S. Appl. No. 10/741,596, Final Office Action dated Mar. 25, 2014.
United States Patent and Trademark Office, U.S. Appl. No. 12/704,245, Final Office Action dated Apr. 7, 2014.
United States Patent and Trademark Office, U.S. Appl. No. 12/910,741, Non-Final Office Action dated Dec. 5, 2014.
United States Patent and Trademark Office, U.S. Appl. No. 12/910,741, Final Office Action dated Apr. 10, 2015.
United States Patent and Trademark Office, U.S. Appl. No. 12/651,339, Non-Final Office Action dated Jun. 18, 2015.
United States Patent and Trademark Office, U.S. Appl. No. 12/704,245, Non-Final Office Action dated Jun. 24, 2015.
United States Patent and Trademark Office, U.S. Appl. No. 14/460,993, Non-Final Office Action dated Oct. 21, 2015.
United States Patent and Trademark Office, U.S. Appl. No. 12/539,505, Non-Final Office Action dated Aug. 20, 2012.
United States Patent and Trademark Office, U.S. Appl. No. 12/572,023, Non-Final Office Action dated Sep. 12, 2012.
United States Patent and Trademark Office, U.S. Appl. No. 12/572,037, Non-Final Office Action dated Sep. 13, 2012.
United States Patent and Trademark Office, U.S. Appl. No. 12/539,505, Final Office Action dated Dec. 3, 2012.
United States Patent and Trademark Office, U.S. Appl. No. 12/572,037, Final Office Action dated Jan. 11, 2013.
United States Patent and Trademark Office, U.S. Appl. No. 11/285,411, Final Office Action dated Jan. 22, 2013.
United States Patent and Trademark Office, U.S. Appl. No. 13/027,117, Final Office Action dated Feb. 25, 2013.
United States Patent and Trademark Office, U.S. Appl. No. 10/958,897, Non-Final Office Action dated Mar. 5, 2013.
United States Patent and Trademark Office, U.S. Appl. No. 12/572,037, Non-Final Office Action dated Mar. 28, 2013.
United States Patent and Trademark Office, U.S. Appl. No. 12/539,505, Non-Final Office Action dated Apr. 9, 2013.
United States Patent and Trademark Office, U.S. Appl. No. 12/572,023, Notice of Allowance dated Apr. 11, 2013.
United States Patent and Trademark Office, U.S. Appl. No. 13/267,855, Non-Final Office Action dated Jun. 5, 2013.
United States Patent and Trademark Office, U.S. Appl. No. 12/572,037, Notice of Allowance dated Jun. 21, 2013.
United States Patent and Trademark Office, U.S. Appl. No. 13/027,078, Non-Final Office Action dated Jul. 15, 2013.
United States Patent and Trademark Office, U.S. Appl. No. 11/285,411, Non-Final Office Action dated Aug. 2, 2013.
United States Patent and Trademark Office, U.S. Appl. No. 13/267,855, Interview Summary dated Aug. 26, 2013.
United States Patent and Trademark Office, U.S. Appl. No. 13/021,625, Final Office Action dated Sep. 5, 2013.
United States Patent and Trademark Office, U.S. Appl. No. 12/539,505, Notice of Allowance dated Sep. 10, 2013.
United States Patent and Trademark Office, U.S. Appl. No. 13/253,913, Final Office Action dated Sep. 24, 2013.
United States Patent and Trademark Office, U.S. Appl. No. 12/572,037, Final Office Action dated Oct. 10, 2013.
United States Patent and Trademark Office, U.S. Appl. No. 10/418,646, Advisory Action dated Nov. 7, 2013.
United States Patent and Trademark Office, U.S. Appl. No. 13/867,932, Final Office Action dated Dec. 4, 2013.
United States Patent and Trademark Office, U.S. Appl. No. 13/267,855, Final Office Action dated Dec. 4, 2013.
United States Patent and Trademark Office, U.S. Appl. No. 10/418,646, Non-Final Office Action dated Jan. 7, 2014.
United States Patent and Trademark Office, U.S. Appl. No. 13/021,625, Final Office Action dated Jan. 8, 2014.
United States Patent and Trademark Office, U.S. Appl. No. 11/285,411, Final Office Action dated Jan. 30, 2014.
United States Patent and Trademark Office, U.S. Appl. No. 13/007,619, Non-Final Office Action dated Mar. 10, 2014.
United States Patent and Trademark Office, U.S. Appl. No. 13/253,913, Notice of Allowance dated Mar. 13, 2014.
United States Patent and Trademark Office, U.S. Appl. No. 13/459,995, Non-Final Office Action dated Jun. 4, 2014.
United States Patent and Trademark Office, U.S. Appl. No. 13/867,932, Non-Final Office Action dated Aug. 1, 2014.
United States Patent and Trademark Office, U.S. Appl. No. 13/867,932, Final Office Action dated Aug. 1, 2014.
United States Patent and Trademark Office, U.S. Appl. No. 13/021,625, Final Office Action dated Aug. 11, 2014.
United States Patent and Trademark Office, U.S. Appl. No. 13/459,995, Final Office Action dated Nov. 3, 2014.
United States Patent and Trademark Office, U.S. Appl. No. 13/267,855, Non-Final Office Action dated Dec. 18, 2014.
United States Patent and Trademark Office, U.S. Appl. No. 11/285,490, Non-Final Office Action dated Mar. 3, 2015.
United States Patent and Trademark Office, U.S. Appl. No. 11/285,411, Notice of Allowance dated Jun. 5, 2015
United States Patent and Trademark Office, U.S. Appl. No. 11/285,490, Final Office Action dated Aug. 7, 2015.
United States Patent and Trademark Office, U.S. Appl. No. 11/285,411, Notice of Allowance dated Sep. 30, 2015.
United States Patent and Trademark Office, U.S. Appl. No. 14/460,993, Final Office Action dated Feb. 19, 2016.
United States Patent and Trademark Office, U.S. Appl. No. 12/651,339, Final Office Action dated Mar. 25, 2016.
Chinese Patent Office, Application No. 200480033609.3, Foreign Office Action dated Oct. 9, 2013.
Chinese Patent Office, Application No. 200480033609.3, Foreign Office Action dated Apr. 30, 2014.
Chinese Patent Office, Application No. 200480033609.3, Pending Claims as of Oct. 9, 2013.
Chinese Patent Office, Application No. 200480033609.3, Pending Claims as of Apr. 30, 2014.
European Patent Office, Application No. 05851948.9, Office Action dated Feb. 13, 2013.
European Patent Office, Application No. 05851948.9, Pending Claims as of Feb. 13, 2013.
European Patent Office, Application No. 05851948.9, Pending Claims as of Nov. 2, 2015.
European Patent Office, Application No. 05851948.9, Summons to Oral Proceedings dated Nov. 2, 2015.
European Patent Office, Application No. 11195319.6, Foreign Office Action dated Mar. 21, 2014.
European Patent Office, Application No. 11195319.6, Pending Claims as of Mar. 21, 2014.
Iannella, R. “Open Digital Rights Language (ODRL): Version 0.9”, IPR Systems Pty Ltd. 2001, Jun. 29, 2001 (46 pages).
United States Patent and Trademark Office, U.S. Appl. No. 14/460,993, Non-Final Office Action dated Aug. 5, 2016.
United States Patent and Trademark Office, U.S. Appl. No. 12/910,741, Final Office Action dated Nov. 9, 2016.
European Patent Office, Application No. 11182065.0, Notice of Allowance dated Nov. 29, 2016.
European Patent Office, Application No. 11182065.0, Pending Claims as of Nov. 29, 2016.
U.S. Appl. No. 60/379,635.
United States Patent and Trademark Office, U.S. Appl. No. 12/910,741, Non-Final Office Action dated Apr. 14, 2016.
United States Patent and Trademark Office, U.S. Appl. No. 12/704,245, Final Office Action dated Apr. 26, 2016.
United States Patent and Trademark Office, U.S. Appl. No. 11/285,490, Non-Final Office Action dated Jun. 13, 2016.
Related Publications (1)
Number Date Country
20160191988 A1 Jun 2016 US
Provisional Applications (1)
Number Date Country
60630398 Nov 2004 US
Continuations (1)
Number Date Country
Parent 11285411 Nov 2005 US
Child 15018856 US