US 7,665,111 B1Grant

Data storage management and scheduling system

Issue Date:2010-02-16

•108 Claims

•12 Drawing Sheets

Abstract

A data storage management and scheduling system schedules the recording, storing, and deleting of television and Web page program material on a client system storage medium. The invention accepts as input a prioritized list of program viewing preferences which is compared with a database of program guide objects which indicate when programs of interest are actually broadcast. A schedule of time versus available storage space is generated that is optimal for the viewer's explicit or derived preferred programs. The preferred programs include television broadcast programs and Universal Resource Locators (URLs). The viewer may request that certain programs be captured, which results in the highest possible priority for those programs, or express preferences using appurtenances provided through the viewer interface. Preferences may additionally be inferred from viewing patterns. The invention correlates an input schedule that tracks the free and occupied time slots for each input source with a space schedule that tracks all currently recorded programs and the programs that have been scheduled to be recorded in the future, to schedule new programs to record and resolve recording conflicts. A program is recorded if at all times between when the recording would be initiated and when it expires, sufficient space is available to hold it. All scheduling conflicts are resolved as early as possible. A background scheduler schedules each preferred program in turn until the list of preferred programs is exhausted or no further opportunity to record is available.

Metadata

Assignee

TiVo Inc.

Inventors

James M. Barton
Brian Beach

Application Information

Application Number:US 09/422,121

Filing Date:1999-10-20

Priority Date:1999-10-20

Art Unit:2424

Classifications

IPC:

H04N5/91H04N5/445H04N7/173

Patent Drawings (12 sheets)

Description

Background of the Invention

[0001] 1. Technical Field

[0002] The invention relates to the storing and viewing of television program material in a computer environment. More particularly, the invention relates to the management of data on a storage medium in a computer environment.

[0003] 2. Description of the Prior Art

[0004] A classic tension exists in the design of automated data processing systems between pure client-server based systems, such as computer mainframe systems or the World Wide Web, and pure distributed systems, such as Networks of Workstations (NOWS) that are used to solve complex computer problems, such as modeling atomic blasts or breaking cryptographic keys.

[0005] Client-server systems are popular because they rely on a clean division of responsibility between the server and the client. The server is often costly and specially managed, since it performs computations or stores data for a large number of clients. Each client is inexpensive, having only the local resources needed to interact with the user of the system. A network of reasonable performance is assumed to connect the server and the client. The economic model of these systems is that of centralized management and control driving down the incremental cost of deploying client systems.

[0006] However, this model has significant costs that must be considered. For instance, the incremental cost of adding a new client system may be quite high. Additional network capacity must be available, sufficient computing resources must be available to support that client, including storage, memory and computing cycles, and additional operational overhead is needed for each client because of these additional resources. As the central servers become larger and more complex they become much less reliable. Finally, a system failure of the server results in all clients losing service.

[0007] Distributed systems are popular because the resources of the system are distributed to each client, which enables more complex functionality within the client. Access to programs or data is faster since they are located with the client, reducing load on the network itself. The system is more reliable, since the failure of a node affects only it. Many computing tasks are easily broken down into portions that can be independently calculated, and these portions are cheaply distributed among the systems involved. This also reduces network bandwidth requirements and limits the impact of a failed node.

[0008] On the other hand, a distributed system is more complex to administer, and it may be more difficult to diagnose and solve hardware or software failures.

[0009] Television viewing may be modeled as a client-server system, but one where the server-to-client network path is for all intents and purposes of infinite speed, and where the client-to-server path is incoherent and unmanaged. This is a natural artifact of the broadcast nature of television. The cost of adding another viewer is zero, and the service delivered is the same as that delivered to all other viewers.

[0010] There have been, and continue to be, many efforts to deliver television programming over computer networks, such as the Internet, or even over a local cable television plant operating as a network. The point-to-point nature of computer networks makes these efforts unwieldy and expensive, since additional resources are required for each additional viewer. Fully interactive television systems, where the viewer totally controls video streaming bandwidth through a client settop device, have proven even more uneconomical because dedication of server resources to each client quickly limits the size of the system that can be profitably built and managed.

[0011] However, television viewers show a high degree of interest in choice and control over television viewing. This interest results in the need for the client system to effectively manage the memory demands of program material that a viewer wants to record. Additionally, the management of recording desired program material is of equal importance to the memory management task.

[0012] It would be advantageous to provide a data storage management and scheduling system that manages the available data space on a storage medium and any input sources. It would further be advantageous to provide a data storage management and scheduling system that efficiently schedules the insertion and deletion of data on a medium.

Summary of the Invention

[0013] The invention provides a data storage management and scheduling system. The system schedules the storing and deleting of input source data on a storage medium. In addition, the invention provides a system that manages the available free space on the storage medium such that the available free space is used efficiently.

[0014] A client device, typified in application Ser. No. 09/126,071, owned by the Applicant, provides functionality typically associated with central video servers, such as storage of a large amount of video content, ability to choose and play this content on demand, and full “VCR-like” control of the delivery of the content, as typified in application Ser. No. 09/054,604, owned by the applicant.

[0015] A preferred embodiment of the invention schedules the recording, storing, and deleting of television and Web page program material on a client system storage medium. The invention accepts as input a prioritized list of program viewing preferences which is compared with a database of program guide objects. The program guide objects indicate when programs of interest are actually broadcast.

[0016] A schedule of time versus available storage space is generated that is optimal for the viewer's explicit or derived preferred programs. The preferred programs include television broadcast programs and Universal Resource Locators (URLs). The viewer may request that certain programs be captured, which results in the highest possible priority for those programs.

[0017] The viewer may also explicitly express preferences using appurtenances provided through the viewer interface. Preferences may additionally be inferred from viewing patterns. These preferences correspond to objects stored in a replicated database.

[0018] The invention correlates an input schedule that tracks the free and occupied time slots for each input source with a space schedule that tracks all currently recorded programs and the programs that have been scheduled to be recorded in the future, to schedule new programs to record and resolve recording conflicts. A program is recorded if at all times between when the recording would be initiated and when it expires, sufficient space is available to hold it. Programs scheduled for recording based on inferred preferences automatically lose all conflict decisions. All scheduling conflicts are resolved as early as possible. Schedule conflicts resulting from the recording of aggregate objects are resolved using the preference weighting of the programs involved.

[0019] A background scheduler attempts to schedule each preferred program in turn until the list of preferred programs is exhausted or no further opportunity to record is available. A preferred program is scheduled if and only if there are no conflicts with other scheduled programs

[0020] Other aspects and advantages of the invention will become apparent from the following detailed description in combination with the accompanying drawings, illustrating, by way of example, the principles of the invention.

Brief Description of the Drawings

[0021] FIG. 1 is a block schematic diagram of a preferred embodiment of a distributed television viewing management system according to the invention;

[0022] FIG. 2 is a block schematic diagram of the structure of a viewing object in computer storage for programmatic access according to the invention;

[0023] FIG. 3 is a block schematic diagram showing how the schema for a viewing object is structured in computer storage for programmatic access according to the invention;

[0024] FIG. 4 is a block schematic diagram showing an example graph of relationships between viewing objects which describe information about programs according to the invention;

[0025] FIG. 5 is a block schematic diagram showing an example graph of relationships generated when processing viewer preferences to determine programs of interest according to the invention;

[0026] FIG. 6 is a block schematic diagram showing the scheduling of inputs and storage space for making recordings according to the invention;

[0027] FIG. 7 is a flowchart showing the steps taken to schedule a recording using the mechanism depicted in FIG. 6 according to the invention;

[0028] FIG. 8 is a block schematic diagram of a preferred embodiment of the invention showing the bootstrap system configuration according to the invention;

[0029] FIG. 9a is a block schematic diagram of the decision flowchart for the bootstrap component according to the invention;

[0030] FIG. 9b is a block schematic diagram of the decision flowchart for the bootstrap component according to the invention; and

[0031] FIG. 10 is a block schematic diagram of the decision flowchart for the software installation procedure according to the invention.

Detailed Description of the Invention

[0032] The invention is embodied in a data storage management and scheduling system in a computer environment. A system according to the invention schedules the storing and deleting of input source data on a storage medium. In addition, the invention provides a system that manages the available free space on the storage medium such that the available free space is used efficiently.

[0033] The invention is exemplified as part of a television viewing information transmission and collection system that improves the ability of the individual viewer to select and automatically timeshift television programs while providing opportunities for a service provider to enhance and direct the viewing experience. The following describes a system which is fully distributed, in that calculations pertaining to an individual viewer are performed personally for that viewer within a local client device, while providing for the reliable aggregation and dissemination of information concerning viewing habits, preferences or purchases.

The Database of Television Viewing Information

[0034] FIG. 1 gives a schematic overview of the invention. Central to the invention is a method and apparatus for maintaining a distributed database of television viewing information among computer systems at a central site 100 and an extremely large number of client computing systems 101. The process of extracting suitable subsets of the central copy of the database is called “slicing” 102, delivering the resulting “slices” to clients is called “transmission” 103, delivering information collected about or on behalf of the viewer to the central site is called “collection” 104, and processing the collected information to generate new television viewing objects or reports is called “analysis” 107; in all cases, the act of recreating an object from one database within another is called “replication” 105. Data items to be transmitted or collected are termed “objects” 106, and the central database and each replicated subset of the central database contained within a client device is an “object-based” database. The objects within this database are often termed “television viewing objects”, “viewing objects”, or simply “objects”, emphasizing their intended use. However, one skilled in the art will readily appreciate that objects can be any type of data.

[0035] The viewing object database provides a consistent abstract software access model for the objects it contains, independent of and in parallel with the replication activities described herein. By using this interface, applications may create, destroy, read, write and otherwise manipulate objects in the database without concern for underlying activities and with assurance that a consistent and reliable view of the objects in the database and the relationships between them is always maintained.

Basic Television Viewing Object Principles

[0036] Referring to FIG. 2, television viewing objects are structured as a collection of “attributes” 200. Each attribute has a type 201, e.g., integer, string or boolean, and a value 202. All attribute types are drawn from a fixed pool of basic types supported by the database.

[0037] The attributes of an object fall into two groups: “basic” attributes, which are supplied by the creator or maintainer of the viewing object; and “derived” attributes, which are automatically created and maintained by mechanisms within the database. Basic attributes describe properties of the object itself; derived attributes describe the relationships between objects. Basic attributes are replicated between databases, whereas derived attributes are not.

[0038] With respect to FIG. 3, there is a small set of fundamental object types defined by the invention; each object type is represented as a specific set of related attributes 300, herein called a “schema”. The schema defines a template for each attribute type 301, which includes the type 302 and name of the attribute 303. Actual television viewing objects are created by allocating resources for the object and assigning values to the attributes defined by the schema. For example, a “program” schema might include attributes such as the producer, director or actors in the program, an on-screen icon, a multi-line description of the program contents, an editorial rating of the program, etc. A physical program object is created by allocating storage for it, and filling in the attributes with relevant data.

[0039] There is one special object type predefined for all databases called the schema type. Each schema supported by the database is represented by a schema object. This allows an application to perform “introspection” on the database, i.e., to dynamically discover what object types are supported and their schema. This greatly simplifies application software and avoids the need to change application software when schemas are changed, added or deleted. Schema objects are handled the same as all other viewing objects under the methods of this invention.

[0040] Referring again to FIG. 2, each object in a database is assigned an “object ID” 203 which must be unique within the database. This object ID may take many forms, as long as each object ID is unique. The preferred embodiment uses a 32-bit integer for the object ID, as it provides a useful tradeoff between processing speed and number of unique objects allowed. Each object also includes a “reference count” 204, which is an integer giving the number of other objects in the database which refer to the current object. An object with a reference count of zero will not persist in the database (see below).

[0041] One specific type of viewing object is the “directory” object. A directory object maintains a list of object IDs and an associated simple name for the object. Directory objects may include other directory objects as part of the list, and there is a single distinguished object called the “roof” directory. The sequence of directory objects traversed starting at the root directory and continuing until the object of interest is found is called a “path” to the object; the path thus indicates a particular location within the hierarchical namespace created among all directory objects present in the database. An object may be referred to by multiple paths, meaning that one object may have many names. The reference count on a viewing object is incremented by one for each directory which refers to it.

Methods for the Maintenance of Database Consistency and Accuracy

[0042] One of the features of a preferred embodiment of the invention is to insure that each database replica remains internally consistent at all times, and that this consistency is automatically maintained without reference to other databases or the need for connection to the central site. There is no assurance that transmission or collection operations happen in a timely manner or with any assured periodicity. For instance, a client system may be shut off for many months; when a transmission to the system is finally possible, the replication of objects must always result in a consistent subset of the server database, even if it is not possible to transmit all objects needed to bring the central and client databases into complete synchronization.

[0043] Even more serious, there can be no guarantee of a stable operational environment while the database is in use or being updated. For example, electrical power to the device may cease. This invention treats all database updates as “transactions”, meaning that the entire transaction will be completed, or none of it will be completed. The specific technique chosen is called “two-phase commit”, wherein all elements of the transaction are examined and logged, followed by performing the actual update. One familiar in the art will appreciate that a standard journaling technique, where the transaction is staged to a separate log, combined with a roll-forward technique which uses the log to repeat partial updates that were in progress when the failure occurred, is sufficient for this purpose.

[0044] One required derived attribute of every object is the “version”, which changes with each change to the object; the version attribute may be represented as a monotonically increasing integer or other representation that creates a monotonic ordering of versions. The schema for each object that may be replicated includes an attribute called “source version” which indicates the version of the object from which this one was replicated.

[0045] Transmission of a viewing object does not guarantee that every client receives that object. For instance, while the object is being broadcast, external factors such as sunspots, may destroy portions of the transmission sequence. Viewing objects may be continually retransmitted to overcome these problems, meaning that the same object may be presented for replication multiple times. It is inappropriate to simply update the database object each time an object to be replicated is received, as the version number will be incremented although no change has actually occurred. Additionally, it is desirable to avoid initiating a transaction to update an object if it is unnecessary; considerable system resources are consumed during a transaction. Two approaches are combined to resolve this problem. First, most objects will have a basic attribute called “expiration”. This is a date and time past which the object is no longer valid, and should be discarded. When a new object is received, the expiration time is checked, and the object discarded if it has expired. Expiration handles objects whose transmission is delayed in some fashion, but it does not handle multiple receptions of the same unexpired object.

[0046] The source version attribute handles this problem. When a viewing object is transmitted, this attribute is copied from the current version attribute of the source object. When the viewing object is received, the source version of the received object is compared with the source version of the current object. If the new object has a higher source version attribute, it is copied over the existing object, otherwise it is discarded.

[0047] It is assumed that a much greater number of viewing objects are transmitted than are of interest to any particular client system. For example, a “channel” viewing object which describes the channels on a particular cable system is of no interest to clients attached to other cable systems. Because of the overhead of capturing and adding new objects to the database, it would be advantageous for received objects to be filtered on other attributes in addition to those described above. The invention accomplishes this by using a filtering process based on object type and attribute values. In one implementation, this filtering process is based on running executable code of some kind, perhaps as a sequence of commands, which has been written with specific knowledge of various object types and how they should be filtered.

[0048] In a preferred embodiment of the invention, a “filter” object is defined for each object type which indicates what attributes are required, should not be present, or ranges of values for attributes that make it acceptable for addition to the database. One skilled in the art will readily appreciate that this filter object may contain executable code in some form, perhaps as a sequence of executable commands. These commands would examine and compare attributes and attribute values of object being filtered, resulting in an indication of whether the object should be the subject of further processing.

[0049] Viewing objects are rarely independent of other objects. For example, a “showing” object (describing a specific time on a specific channel) is dependent on a “program” object (describing a specific TV program). One important aspect of maintaining consistency is to insure that all dependent objects either already exist in the database or are to be added as part of a single transaction before attempting to add a new viewing object. This is accomplished using a basic attribute of the new viewing object called the “dependency” attribute, which simply lists the object IDs and source versions of objects that the new object is dependent on. Clearly, new versions of an object must be compatible, in the sense that the schema defining new versions be the same or have a strict superset of the attributes of the original schema.

[0050] When a new viewing object is received, the database is first checked to see if all dependencies of that object are present; if so, the object is added to the database. Otherwise, the new object is “staged”, saving it in a holding area until all dependent objects are also staged. Clearly, in order for a new set of viewing objects to be added to the database, the dependency graph must be closed between objects in the staging area and objects already existing in the database, based on both object ID and source version. Once closure is achieved, meaning all dependent objects are present, the new object(s) are added to the database in a single atomic transaction.

Naming and Finding Television Viewing Objects

[0051] Directory objects have been described previously. Referring to FIG. 4, the collection of directory objects, and the directed graph formed by starting at the root path 400 and enumerating all possible paths to viewing objects is called a “namespace”. In order for an object to be found without knowing a specific object ID, one or more paths within this namespace must refer to it. For instance, application software has little interest in object IDs, instead the software would like to refer to objects by paths, for instance “/tvschedule/today”. In this example, the actual object referred to may change every day, without requiring changes in any other part of the system.

[0052] One way in which a path to an object may be established is by specifying a “pathname” basic attribute on the object. The object is added to the database, and directory objects describing the components of the path are created or updated to add the object. Such naming is typically used only for debugging the replication mechanisms. Setting explicit paths is discouraged, since the portions of the central database replicated on each client system will be different, leading to great difficulty in managing pathnames among all replicas of the database.

[0053] A preferred method for adding an object to the database namespace is called “indexing”. In a preferred embodiment of the invention, an “indexer” object is defined for each object type which indicates what attributes are to be used when indexing it into the database namespace. One skilled in the art will readily appreciate that this indexer object may contain executable code in some form, perhaps as a sequence of executable commands. These commands would examine and compare attributes and attribute values of object being indexed, resulting in an indication of where the object should be located in the namespace.

[0054] Based on the object type, the indexer examines a specific set of attributes attached to the object. When such attributes are discovered the indexer automatically adds a name for the object, based on the value of the attribute, within the hierarchical namespace represented by the graph of directories in the database. Referring again to FIG. 4, a program object may have both an “actor” attribute with value “John Wayne” and a “director” attribute with value “John Ford” 401. The root directory might indicate two sub-directories, “byactor” 402 and “bydirector” 403. The indexer would then add the paths “/byactor/John Wayne” and “/bydirector/John Ford” to the database, both of which refer to the same object 401.

[0055] A derived attribute is maintained for each object listing the directory objects which refer to this object 404. As the indexer adds paths to the namespace for this object, it adds the final directory ID in the path to this list. This insures closure of the object graph—once the object has been found, all references to that object within the database are also found, whether they are paths or dependencies.

[0056] This unique and novel method of adding objects to the database has significant advantages over standard approaches. The indexer sorts the object into the database when it is added. Thus, the search for the object associated with a particular path is a sequence of selections from ordered lists, which can be efficiently implemented by one familiar with the art.

Deleting Objects from the Database

[0057] While the rules for adding objects to the database are important, the rules for removing objects from the database are also important in maintaining consistency and accuracy. For example, if there were no robust rules for removing objects, the database might grow unboundedly over time as obsolete objects accumulate.

[0058] The cardinal rule for deleting objects from the database is based on reference counting; an object whose reference count drops to zero is summarily deleted. For instance, this means that an object must either be referred to by a directory or some other object to persist in the database. This rule is applied to all objects in the closed dependency graph based on the object being deleted. Thus, if an object which refers to other objects (such as a directory) is deleted, then the reference count on all objects referred to is decremented, and those objects similarly deleted on a zero count, and so forth.

[0059] There is also an automatic process which deletes objects from the database called the “reaper”. Periodically, the reaper examines all objects in the database, and depending on the object type, further examines various attributes and attribute values to decide if the object should be retained in the database. For example, the expiration attribute may indicate that the object is no longer valid, and the reaper will delete the object.

[0060] In the preferred embodiment, using a method similar to (or perhaps identical to) the filtering and indexing methods described above, the reaper may instead access a reaper object associated with the object type of the current object, which may contain executable code of various kinds, perhaps a sequence of executable commands. This code examines the attributes and attribute values of the current object, and determines if the object should be deleted.

[0061] The overhead of individually deleting every object for which the reference count has been decremented to zero may be quite high, since every such deletion results in a transaction with the database. It would be advantageous to limit the performance impact of reaping objects, such that foreground operations proceed with maximum speed. In a preferred embodiment, this is accomplished using a technique based on common garbage collection methods.

[0062] For instance, instead of deleting an object whose reference count has been decremented to zero, the reaper performs no other action. Periodically, a background task called the garbage collector examines each object in the database. If the object has a reference count of zero, it is added to a list of objects to be deleted. In one embodiment, once the garbage collector has examined the entire database, it would delete all such objects in a single transaction. One familiar in the art will appreciate that this method may also result in a significant performance penalty, as other accesses to the database may be delayed while the objects are being deleted. In addition, if all objects are to be properly deleted, changes to the database may have to be delayed while the garbage collector is active, resulting in even worse performance.

[0063] In a preferred embodiment, the garbage collector examines the database in a series of passes. Once a specific number of objects has been collected, they are deleted in a single transaction. Said process continues until all objects have been examined. This technique does not guarantee that all garbage objects are collected during the examination process, since parallel activities may release objects previously examined. These objects will be found, however, the next time the garbage collector runs. The number of objects deleted in each pass is adjustable to achieve acceptable performance for other database activities.

Operations on the Distributed Television Viewing Object Database

Considerations in Maintaining the Distributed Viewing Object Database

[0064] The replication of television viewing objects among the instances of the distributed database necessarily requires the transmission of objects over unreliable and unsecure distribution channels.

[0065] For example, if the objects are transmitted over a broadcast mechanism, such as within a radio or television transmission, there can be no assurance that the data is transmitted accurately or completely. Weather, such as rainstorms, may cause dropouts in the transmission. Other sources of interference may be other broadcast signals, heavy equipment, household appliances, etc.

[0066] One skilled in the art will readily appreciate that there are standard techniques for managing the transmission of data over unreliable channels, including repeated transmissions, error correcting codes, and others, which may be used for transmission, any or all of which may be used in any particular instance.

[0067] For efficiency, objects to be replicated are gathered together into distribution packages, herein called “slices”. A slice is a subset of the television viewing object database which is relevant to clients within a specific domain, such as a geographic region, or under the footprint of a satellite transmitter.

[0068] Security of these slices is quite important. Slices are used to add objects to the database which are used to provide valuable services to users of the database, as well as to store information that may be considered private or secret. Because of the broadcast-oriented nature of slice transmission, slices may be easily copied by third parties as they are transmitted. A practical solution to these problems is to encrypt the slice during transmission. An ideal reference text on the techniques employed in the invention is “Applied Cryptography: Protocols, Algorithms, and Source Code in C” by Bruce Schneier, John Wiley and Sons, 1995.

[0069] In a preferred embodiment of the invention, a secure, encrypted channel is established using techniques similar to those described in U.S. Pat. No. 4,405,829, often described as asymmetric key encryption, or sometimes public/private key pair encryption. A practitioner skilled in the art will recognize that protocols based on asymmetric key encryption serves as a reliable and efficient foundation for authentication of client devices and secure distribution of information. In general, authentication is provided using an exchange of signed messages between the client and central systems. Secure distribution is provided by encrypting all communications using a short-lived symmetric key sent during an authentication phase.

[0070] Successful security requires that sender and receiver agree beforehand on the asymmetric key pair to be used for encryption. Such key distribution is the weakest link in any cryptographic system for protecting electronic data. Application Ser. No. 09/357,183, entitled “Self-Test Electronic Assembly and Test System,” filed Jul. 19, 1999, also owned by the Applicant, describes a mechanism whereby the client device generates the asymmetric key pair automatically as the final step in the manufacturing process. The private key thus generated is stored within a secure microprocessor embedded within the client device, such that the key is never presented to external devices. The public key thus generated is transmitted to a local manufacturing system, which records the key along with the client serial number in a secure database. This database is later securely transmitted to the central distribution system, where it is used to perform secure communications with the client.

[0071] This unique and novel application of key generation solves the problem of key distribution, as the private key is never presented to external components in the client, where it might be discerned using special tools, such as a logic analyzer. Instead, it may only be used within the security microprocessor itself to decrypt messages originally encrypted with the public key, the results of which are then provided to external components.

[0072] The remainder of this discussion assumes that all communications between client and central systems are authenticated and encrypted as described above.

Transmitting Viewing Objects to the Client Systems

[0073] Referring again to FIG. 1, in a preferred embodiment of the invention the following steps constitute “transmission” of television viewing objects from the central database using slices:

[0074] 1. There may be many mechanisms for transmitting slices to the universe of client viewing devices. For instance, the slices may be directly downloaded over a telephone modem or cable modem 109, they may be modulated into lines of the Vertical Blanking Interval (VBI) of a standard television broadcast 108, or added to a digital television multiplex signal as a private data channel. One skilled in the art will readily appreciate that any mechanism which can transmit digital information may be used to transmit slices of the television viewing object database.
- [0075] The first step in preparing television viewing objects for transmission is recognizing the transmission mechanism to be used for this particular instance, and creating a slice of a subset of the database that is customized for that mechanism. For example, the database may contain television viewing objects relating to all programs in the country. However, if television viewing objects are to be sent using VBI modulation on a local television signal, only those television viewing objects relating to programs viewable within the footprint of the television broadcast being used to carry them should be contained within the relevant slice. Alternatively, if some of the television viewing objects contain promotional material related to a particular geographic region, those objects should not be transmitted to other geographic regions.
- [0076] In a preferred embodiment of the invention, the speed and periodicity of traversing the database and generating slices for transmission is adjustable in an arbitrary fashion to allow useful cost/performance tradeoffs to be made. For instance, it may only be necessary to create slices for certain transmission methods every other day, or every hour.
- [0077] The final step in preparing each slice is to encrypt the slice using a short-lived symmetric key. Only client devices which have been authenticated using secure protocols will have a copy of this symmetric key, making them able to decrypt the slice and access the television viewing objects within it.
[0078] 2. Once a slice is complete, it is copied to the point at which the transmission mechanism can take and send the data 110. For telephone connections, the slice is placed on a telephony server 111 which provides the data to each client as it calls in. If television broadcast is used, the slice is copied onto equipment co-resident with the station television transmitter, from whence it is modulated onto the signal. In these and similar broadcast-oriented cases, the slice is “carouseled”, i.e., the data describing the slice is repeated continually until a new slice is provided for transmission.
- [0079] This repetitive broadcast of slices is required because there can be no assurance that the signal carrying the data arrives reliably at each client. The client device may be powered off, or there may be interference with reception of the signal. In order to achieve a high degree of probability that the transmitted slices are properly received at all client devices, they are continually re-broadcast until updated slices are available for transmission.
- [0080] A preferred embodiment of the invention uses broadcast mechanisms such as a television signal to transmit the slice. However, it is desirable to provide for download over a connection-based mechanism, such as a modem or Internet connection. Using a connection-based mechanism usually results in time-based usage fees, making it desirable to minimize the time spent transmitting the slice.
- [0081] This is accomplished using a two-step process. When the connection is established, the client system sends an inventory of previously received slices to telephony servers 111. The server compares this inventory with the list of slices that should have been processed by that client. Slices which were not processed are transmitted to the client system.
[0082] 3. The slice is transmitted by breaking the encrypted slice into a succession of short numbered data packets. These packets are captured by client systems and held in a staging area until all packets in the sequence are present. The packets are reassembled into the slice, which is then decrypted. The television viewing objects within the slice are then filtered for applicability, possibly being added to the local television viewing object database. This process replicates a portion of the central database of television viewing objects reliably into the client.
- [0083] The invention keeps track of the time at which data packets are received. Data packets which are older than a selected time period are purged from the staging area on a periodic basis; this avoids consuming space for an indefinite period while waiting for all parts of a slice to be transmitted.
- [0084] Especially when transmitting the objects over a broadcast medium, errors of various kinds may occur in the transmitted data. Each data packet is stamped with an error detecting code (a parity field or CRC code, for example). When an error is detected the data packet is simply discarded. The broadcast carousel will eventually retransmit the data packet, which is likely to be received properly. Slices of any size may thus be sent reliably; this is achieved at the cost of staging received portions of the object on the client until all portions are properly received.
[0085] 4. There may be one or more “special” slices transmitted which communicate service related data to the client system, particularly service authorization information. It is important that the service provider be able to control the client system's access to premium services if the viewer has failed to pay his bill or for other operational reasons.
- [0086] One particular type of special slice contains an “authorization” object. Authorization objects are generally encrypted using asymmetric key encryption based on the public/private key pair associated with a specific client. If the slice can be successfully decrypted by the security microprocessor using the embedded private key, the slice will contain an object indicating the allowable time delay before another authorization object is received, as well as one or more symmetric keys valid for a short time period. The delay value is used to reset a timestamp in the database indicating when the client system will stop providing services. The symmetric keys are stored in the local television viewing object database, to be used in decrypting new slices which may be received.
- [0087] If the client has not received a proper authentication object by the time set in the database, it will commence denial of most services to the viewer (as specified by the service provider). Also contained within an authentication object are one or more limited-lifetime download keys which are needed to decrypt the slices that are transmitted. Clearly, if a client system is unable to authenticate itself, it will not be able to decrypt any objects.

[0088] Each authorization slice is individually generated and transmitted. If broadcast transmission is used for the slices, all relevant authorizations are treated identically to all other slices and carouseled along with all other data. If direct transmission is used, such as via a phone connection, only the authentication slice for that client is transmitted.

[0089] 5. Once the client device has received a complete database slice, it uses the methods described earlier to add the new object contained within it to the database.
Collecting Information from the Client Systems

[0090] Referring again to FIG. 1, in a preferred embodiment of the invention the following steps constitute “collection” of television viewing objects from each client database:

[0091] 1. As the viewer navigates the television channels available to him, the client system records interesting information, such as channel tuned to, time of tuning, duration of stay, VCR-like actions (e.g., pause, rewind), and other interesting information. This data is stored in a local television viewing object.
- [0092] Additionally, the viewer may indicate interest in offers or promotions that are made available, or he may indicate a desire to purchase an item. This information is also recorded into a local television viewing object.
- [0093] Additionally, operation of the client device may result in important data that should be recorded into a television viewing object. For example, errors may occur when reading from the hard disk drive in the client, or the internal temperature of the device may exceed operational parameters. Other similar types of information might be failure to properly download an object, running out of space for various disk-based operations, or rapid power cycling.
[0094] 2. At a certain time, which may be immediate or on a periodic basis, the client system contacts the central site via a direct connection 104 (normally via phone and/or an Internet connection). The client device sends a byte sequence identifying itself which is encrypted with its secret key. The server fetches the matching television viewing object for the client device from the database, and uses the key stored there to decrypt the byte sequence. At the same time, the server sends a byte sequence to the client, encrypted in its secret key, giving the client a new one-time encryption key for the session.
- [0095] Both sides must successfully decrypt their authentication message in order to communicate. This two-way handshake is important, since it assures both client and server that the other is valid. Such authentication is necessary to avoid various attacks that may occur on the client system. For example, if communications were not authenticated in such a fashion, a malicious party might create an “alias” central site with a corrupt television viewing object database and provide bad information to a client system, causing improper operation. All further communication is encrypted using the one-time session key. Encrypted communication is necessary because the information may pass across a network, such as the Internet, where data traffic is open to inspection by all equipment it passes through. Viewing objects being collected may contain information that is considered private, so this information must be fully protected at all times.
- [0096] Assuming that the authentication phase is successful, the two parties treat the full-duplex phone line as two one-way broadcast channels. New slices are delivered to the client, and viewing data to be collected is sent back. The connection is ended when all data is delivered.
- [0097] One skilled in the art will readily appreciate that this connection may take place over a network, such as the Internet running standard TCP/IP protocols, transparently to all other software in the system.
[0098] 3. Uploaded information is handled similarly by the server; it is assumed to represent television viewing objects to be replicated into the central database. However, there may be many uploaded viewing objects, as there may be many clients of the service. Uploaded objects are therefore assigned a navigable attribute containing information about their source; the object is then indexed uniquely into the database namespace when it is added.
- [0099] Uploaded viewing objects are not immediately added to the central database; instead they are queued for later insertion into the database. This step allows the processing of the queue to be independent of the connection pattern of client devices. For instance, many devices may connect at once, generating a large number of objects. If these objects were immediately added to the central database, the performance of all connections would suffer, and the connection time would increase. Phone calls are charged by duration, thus any system in which connection time increases as a function of load is not acceptable.
- [0100] Another advantage of this separation is that machine or network failures are easily tolerated. In addition, the speed at which viewing objects are processed and added to the central database may be controlled by the service provider by varying the computer systems and their configurations to meet cost or performance goals.
- [0101] Yet another advantage of this separation is that it provides a mechanism for separating data collected to improve service operations and data which might identify an individual viewer. It is important that such identifying data be kept private, both for legal reasons and to increase the trust individuals have in the service. For instance, the navigable attribute assigned to a viewing object containing the record of a viewer's viewing choices may contain only the viewer's zip code, meaning that further processing of those objects can construct no path back to the individual identity.
- [0102] Periodic tasks are invoked on the server to cull these objects from the database and dispose of them as appropriate. For example, objects indicating viewer behavior are aggregated into an overall viewer behavior model, and information that might identify an individual viewer is discarded. Objects containing operational information are forwarded to an analysis task, which may cause customer service personnel to be alerted to potential problems. Objects containing transactional information are forwarded to transaction or commerce systems for fulfillment.
- [0103] Any of these activities may result in new television viewing objects being added to the central database, or in existing objects being updated. These objects will eventually be transmitted to client devices. Thus, the television viewing management system is closed loop, creating a self-maintaining replicated database system 105 which can support any number of client systems.
  Processing of Television Viewing Objects by Client Systems

[0104] Television viewing objects may contain the following types of information: television program descriptions and showing times; cable, satellite or broadcast signal originator information, such as channel numbering and identification; viewer preference information, such as actors, genre, showing times, etc.; software, such as enhanced database software, application software, operating system software, etc.; statistical modeling information such as preference vectors, demographic analysis, etc.; and any other arbitrary information that may be represented as digital data.

Methods Applied to Program Guide Objects

[0105] Program guide objects contain all information necessary for software running in the client system to tune, receive, record and view programs of interest to the user of the client system, selecting from among all available programs and channels as described by objects within the database.

[0106] This program guide information is updated on a regular basis by a service provider. This is handled by the provider acquiring program guide information in some manner, for instance, from a commercial supplier of such information or other sources of broadcast schedule information. This data is then processed using well-understood software techniques to reduce the information to a collection of inter-related viewing objects.

[0107] Referring again to FIG. 4, a typical relationship between program guide objects is shown. A television “network” object 407 is any entity which schedules and broadcasts television programming, whether that broadcast occurs over the air, cable, satellite, or other suitable medium. A television “program” object 401 is a description of any distinct segment of a television broadcast signal, such as a particular program, commercial advertisement, station promotion, opener, trailer, or any other bounded portion of a television signal. A “showing” object 406 is a portion of the broadcast schedule for a network on which a program is broadcast. A “channel map” object maps a network broadcast onto a particular broadcast channel for the medium being used; for instance, a channel map object for a satellite broadcast service would include information about the transponder and data stream containing the broadcast. Using the previously described methods, this program guide data is replicated from the central site to the client systems, where application software in the client systems use the data to manage television viewing.

[0108] The service provider may also provide aggregation viewing objects, which describe a set of program guide objects that are interrelated in some fashion. For instance, a “Star-Trek” collection might contain references to all program guide objects associated with this brand name. Clearly, any arbitrary set of programs may be aggregated in this fashion. Aggregation objects are similar to directories. For instance, the Star Trek collection might be found at “/showcases/Star Trek” in the hierarchical namespace. Aggregation objects are also program guide objects, and may be manipulated in a similar fashion, including aggregating aggregation objects, and so forth.

[0109] The client system may further refine the collection of program objects. In a system where programming may be captured to internal storage, each captured program is represented by a new program guide object, becoming available for viewing, aggregation, etc. Explicit viewer actions may also result in creation of program guide objects. For instance, the viewer may select several programs and cause creation of a new aggregation object.

[0110] This description of types of program guide objects is not meant to be inclusive; there may be many different uses and ways of generating program guide objects not herein described which still benefit from the fundamental methods of the invention.

[0111] Program guide objects are used by the application software in five ways:

[0112] 1. In the simplest case, the viewer may wish to browse these objects to discern current or soon-to-be-available programming. The application software will map the object relationships described by the database to some form of visual and audible interface that is convenient and useful for the viewer. The viewer may indicate that a particular program is of interest, resulting in some application-specific action, such as recording the program to local storage when it is broadcast.
[0113] 2. Application software may also directly process program guide objects to choose programs that may be of interest to the viewer. This process is typically based on an analysis of previously watched programming combined with statistical models, resulting in a priority ordering of all programs available. The highest priority programs may be processed in an application specific manner, such as recording the program to local storage when it is broadcast. Portions of the priority ordering so developed may be presented to the viewer for additional selection as in case 1.
- [0114] One skilled in the art will readily appreciate that there is a great deal of prior art centered on methods for selecting programming for a viewer based on previous viewing history and explicit preferences, e.g., U.S. Pat. No. 5,758,257. The methods described in this application are unique and novel over these techniques as they suggest priorities for the capture of programming, not the broadcast or transmission of programming, and there is no time constraint on when the programming may be broadcast. Further details on these methods are given later in this description.
- [0115] In general, explicit viewer choices of programming have the highest priority for capture, followed by programming chosen using the preference techniques described herein.
[0116] 3. A client system will have a small number of inputs capable of receiving television broadcasts or accessing Web pages across a network such as an intranet or the Internet. A scheduling method is used to choose how each input is tuned, and what is done with the resulting captured television signal or Web page.
- [0117] Referring to FIG. 6, generally, the programs of interest to the viewer may be broadcast at any time, on any channel, as described by the program guide objects. Additionally, the programs of interest may be Web page Universal Resource Locators (URL) across a network, such as an intranet or the Internet. The channel metaphor is used to also describe the location, or URL, of a particular Web site or page.
- [0118] A viewer, for example, can “tune” into a Web site by designating the Web site URL as a channel. Whenever that channel is selected, the Web site is displayed. A Web page may also be designated as a program of interest and a snapshot of the Web page will be taken and recorded at a predetermined time.
- [0119] The scheduler accepts as input a prioritized list of program viewing preferences 603, possibly generated as per the cases above. The scheduling method then compares this list with the database of program guide objects, which indicate when programs of interest are actually broadcast. It then generates a schedule of time versus available storage space 601 that is optimal for the viewer's explicit or derived preferred programs. Further details on these methods are given later in this description.
[0120] 4. When a captured program is viewed, the matching program guide object is used to provide additional information about the program, overlaid on the display using any suitable technique, preferably an On Screen Display (OSD) of some form. Such information may include, but is not limited to: program name; time, channel or network of original broadcast; expiration time; running time or other information.
[0121] 5. When live programming is viewed, the application uses the current time, channel, and channel map to find the matching program guide object. Information from this object is displayed using any suitable technique as described above. The information may be displayed automatically when the viewer changes channels, when a new program begins, on resumption of the program after a commercial break, on demand by the viewer, or based on other conditions.
[0122] 6. Using techniques similar to those described in case 2, application software may also capture promotional material that may be of interest to the viewer. This information may be presented on viewer demand, or it may be automatically inserted into the output television signal at some convenient point. For example, an advertisement in the broadcast program might be replaced by a different advertisement which has a higher preference priority. Using the time-warping apparatus, such as that described in application Ser. No. 09/126,071, entitled “Multimedia Time Warping System,” filed Jul. 30, 1998, it is possible to insert any stored program into the output television signal at any point. The time-warping apparatus allows the overlaid program to be delayed while the stored program is inserted to make this work.
Methods for Generating a List of Preferred Programs

[0123] Viewer preferences may be obtained in a number of ways. The viewer may request that certain programs be captured, which results in the highest possible priority for those programs. Alternatively, the viewer may explicitly express preferences using appurtenances provided through the viewer interface, perhaps in response to a promotional spot for a particular program, or even during the viewing of a program. Finally, preferences may be inferred from viewing patterns: programs watched, commercial advertisements viewed or skipped, etc.

[0124] In each case, such preferences must correspond to television viewing objects stored in the replicated database. Program objects included a wealth of information about each particular program, for example: title, description, director, producer, actors, rating, etc. These elements are stored as attributes attached to a program object.

[0125] Each individual attribute may result in the generation of a preference object. Such objects store the following information:

[0126] 1. The type of the preference item, such as actor or director preference;
[0127] 2. The weight of the preference given by the viewer, which might be indicated by multiple button presses or other means;
[0128] 3. The statically assigned significance of the preference in relation to other preferences, for example, actor preference are more significant than director preferences;
[0129] 4. The actual value of the preference item, for instance the name of the director.

[0130] With respect to FIG. 5, preference objects are stored in the database as a hierarchy similar to that described for program guide objects, however this hierarchy is built incrementally as preferences are expressed 500. The hierarchy thus constructed is based on “direct” preferences, e.g., those derived from viewer actions or inferred preferences.

[0131] A similar hierarchy is developed based on “indirect” preferences pointing to the same preference objects 501. In general, indirect preferences are generated when preferences for aggregate objects are generated, and are used to further weight the direct preferences implied by the collection of aggregated objects. The preference objects referenced through the indirect preference hierarchy are generated or updated by enumerating the available program objects which are part of the aggregate object 502, and generating or updating preference objects for each attribute thus found.

[0132] The weight of a particular preference 503 begins at zero, and then a standard value is added based on the degree of preference expressed (perhaps by multiple button presses) or a standard value is subtracted if disinterest has been expressed. If a preference is expressed based on an aggregate viewing object, all preferences generated by all viewing objects subordinate to the aggregated object are similarly weighted. Therefore, a new weighting of relevant preference elements is generated from the previous weighting. This process is bounded by the degree of preference which is allowed to be expressed, thus all weightings fall into a bounded range.

[0133] In a preferred embodiment of the invention, non-linear combinations may be used for weighting a preference item. For instance, using statistical models provided by the central site, the client may infer that a heavily weighted preference for three attributes in conjunction indicates that a fourth attribute should be heavily weighted as well.

[0134] The list of preferred programs is generated as follows:

[0135] 1. A table 504 is constructed which lists each possible program object attribute, and any preference objects for that attribute that are present are listed in that entry.
[0136] 2. If the preference item is a string, such as an actor name, a 32-bit digital signature for that string is calculated using a 32-bit CRC algorithm and stored with the table item, rather than the string itself. This allows for much faster scanning of the table as string comparisons are avoided, at the slight risk of two different strings generating the same digital signature.
[0137] 3. For each program object in the database, and for each attribute of that program, the attribute is looked up in the table. If present, the list of preference objects for that attribute is examined for a match with the attribute of the current program object. If a match occurs, the weight associated with that preference object is added to weighting associated with the program object to generate a single weight for the program.
[0138] 4. Finally, the program objects are rank-ordered based on the overall weighting for each program, resulting in a list of most-preferred to least-preferred programs.

[0139] Given this final prioritized list, a recording schedule is generated using the methods described below, resulting in a collection of recorded programs of most interest to the viewer.

Methods Applied to Scheduling Recording Versus Available Storage Space

[0140] As has been described previously, recorded programs will in general have an expiration date, after which the recorded program is removed from client storage. The viewer may at any time indicate that a program should be saved longer, which delays expiration by a viewer-selected interval. The invention views the available storage for recording programs as a “cache”; unviewed programs are removed after a time, based on the assumption they will not be watched if not watched soon after recording. Viewed programs become immediate candidates for deletion, on the assumption they are no longer interesting.

[0141] With proper scheduling of recording and deletion of old programs, it is possible to make a smaller storage area appear to be much larger, as there is an ongoing flushing of old programs and addition of new programs. Additionally, if resources are available, recordings may be scheduled of programs based on inferred preferences of the viewer; these are called “fuzzy” recordings. This results in a system where the program storage area is always “full” of programming of interest to the viewer; no program is removed until another program is recorded in its place or the viewer explicitly deletes it.

[0142] Additionally, the viewer may select a program for recording at any time, and the recording window may conflict with other scheduled recordings, or there may not be sufficient space obtainable when the program must be recorded. The invention includes unique and novel methods of resolving such conflicts.

[0143] Conflicts can arise for two reasons: lack of storage space, or lack of input sources. The television viewing system described herein includes a fixed number of input sources for recording video and a storage medium, such as a magnetic disk, of finite capacity for storing the recorded video. Recording all television programs broadcast over any significant period of time is not possible. Therefore, resolving the conflicts that arise because of resource limitations is the key to having the correct programs available for viewing.

[0144] Referring again to FIG. 6, the invention maintains two schedules, the Space Schedule 601 and the Input Schedule 602. The Space Schedule tracks all currently recorded programs and those which have been scheduled to be recorded in the future. The amount of space available at any given moment in time may be found by generating the sum of all occupied space (or space that will be occupied at that time) and subtracting that from the total capacity available to store programs. Programs scheduled for recording based on inferred preferences (“fuzzy” recordings) are not counted in this calculation; such programs automatically lose all conflict decisions.

[0145] A program may be recorded 603 if at all times between when the recording would be initiated and when it expires, sufficient space is available to hold it. In addition, for the duration of the program, there must be an input available from which to record it. The Input Schedule 602 tracks the free and occupied time slots for each input source. In a preferred embodiment of the invention, the input sources may not be used for identical services, e.g., one input may be from a digital television signal and another from an analog television signal with different programming. In this case, only those inputs from which the desired program can be recorded are considered during scheduling.

[0146] With respect to FIG. 7, a flowchart is shown describing the steps taken to schedule a recording in the preferred embodiment. First, an ordered list of showings of the program of interest are generated 701. Although a preferred embodiment of the invention orders these showings by time, such that the recording is made as soon as possible, any particular ordering might be chosen. Each showing in this list 702 is then checked to see if input 703 or space 704 conflicts occur as described above. If a showing is found with no conflicts, then the program is scheduled for recording 705.

[0147] Otherwise, a preferred embodiment of the invention selects only those showings of the program which have no input conflicts 706. Referring again to FIG. 6, one can see that over the lifetime of a recording the amount of available space will vary as other programs are recorded or expire. The list of showings is then sorted, preferably by the minimum amount of available space during the lifetime of the candidate recording. Other orderings may be chosen.

[0148] Referring again to FIG. 7, for each candidate showing, the viewer is presented with the option of shortening the expiration dates on conflicting programs 708, 709. This ordering results in the viewer being presented these choices in order from least impact on scheduled programs to greatest 707; there is no requirement of the invention that this ordering be used versus any other.

[0149] Should the viewer reject all opportunities to shorten expiration times, the final step involves selecting those showings with input conflicts 710, and sorting these showings as in the first conflict resolution phase 711. The viewer is then presented with the option to cancel each previously scheduled recording in favor of the desired program 712, 713. Of course, the viewer may ultimately decide that nothing new will be recorded 714.

[0150] In a preferred embodiment of the invention, all conflicts are resolved as early as possible, giving the viewer more control over what is recorded. When the viewer makes an explicit selection of a program to record, the algorithm described in FIG. 7 is used to immediately schedule the recording and manage any conflicts that arise. Once an explicit selection has been made, and the viewer informed that the recording will be done, it will not be canceled without explicit approval of the viewer.

[0151] Fuzzy recordings are periodically scheduled by a background task on the client device. Given the prioritized list of preferred programs as described earlier, the background scheduler attempts to schedule each preferred program in turn until the list is exhausted or no further opportunity to record is available. A preferred program is scheduled if and only if there are no conflicts with other scheduled programs. A preferred program which has been scheduled may be deleted under two conditions: first, if it conflicts with an explicit selection, and second, if a change in viewer preferences identifies a higher priority program that could be recorded at that time.

[0152] A further complication arises when handling aggregate viewing objects for which recording is requested. If conflict resolution was handled according to the method above for such objects, a potentially large number of conflicts might be generated, leading to a confusing and frustrating experience for the viewer in resolving the conflicts. Thus, when aggregate objects are chosen for recording, conflicts are automatically resolved in favor of the existing schedule.

[0153] In a preferred embodiment of the invention, conflicts resulting from the recording of aggregate objects will be resolved using the preference weighting of the programs involved; if multiple conflicts are caused by a particular program in the aggregate object, it will only be recorded if its preference exceeds that of all conflicting programs.

Methods Applied to Software Objects

[0154] The client system requires a complex software environment for proper operation. An operating system manages the interaction between hardware devices in the client and software applications which manipulate those devices. The television viewing object database is managed by a distinct software application. The time-warping software application is yet another application.

[0155] It is desirable to add new features or correct defects in these and other software subsystems which run on the client hardware device. Using the methods described herein, it is possible to replicate viewing objects containing updated software modules into the client system database. Once present in the client system database, the following unique and novel methods are used to install the updated software and cause the client system to begin executing the new software.

[0156] The software environment of the device is instantiated as a sequence of steps that occur when power is first applied to the device, each step building up state information which supports proper application of the following step. The last step launches the applications which manage the device and interact with the viewer. These steps are:

[0157] 1. A read-only or electrically programmable memory in the device holds an initial bootstrap sequence of instructions. These instructions initialize low-level parameters of the client device, initialize the disk storage system, and load a bootstrap loader from the disk into memory, to which execution is then passed. This initial bootstrap may be changed if it resides in an electrically programmable memory.
[0158] 2. The second stage boot loader then locates the operating system on the disk drive, loads the operating system into memory, and passes execution to the operating system. This loader must exist at a specific location on the disk so as to be easily located by the initial loader.

[0159] The operating system performs necessary hardware and software initialization. It then loads the viewing object database software from the disk drive, and begins execution of the application. Other application software, such as the time-warping software and viewer interaction software, are also loaded and started. This software is usually located in a separate area on the disk from the object database or captured television programs.

[0160] Ideally, new software would be installed by simply copying it to the appropriate place on the disk drive and rebooting the device. This operation is fraught with danger, especially in a home environment. Power may fail while copying the software, resulting in an inconsistent software image and potential operating problems. The new software may have defects which prevent proper operation. A failure may occur on the disk drive, corrupting the software image.

[0161] Although the methods of this invention have referred to a disk drive, one skilled in the art will readily appreciate that the methods described here apply generally to any persistent storage system. A disk drive, and other persistent storage systems, are typically formatted into a sequence of fixed-size blocks, called sectors. “Partitions” are sequential, non-overlapping subsets of this sequence which break up the storage into logically independent areas.

[0162] With respect to FIG. 8, the invention maintains a sector of information at a fixed location on the disk drive 803 called the “boot sector” 804. The boot sector 804 contains sufficient information for the initial bootstrap 801 to understand the partitioning of the drive 803, and to locate the second stage boot loader 806.

[0163] The disk is partitioned into at least seven (7) partitions. There are two (2) small partitions dedicated to holding a copy of the second stage boot loader 806, two (2) partitions holding a copy of the operating system kernel 807, two (2) partitions containing a copy of the application software 808, and a partition to be used as scratch memory 809. For duplicated partitions, an indication is recorded in the boot sector 805 in which one of the partitions is marked “primary”, and the second is marked “backup”.

[0164] One skilled in the art will readily appreciate that, although two partitions are described herein for redundancy, triple, quadruple or greater degrees of redundancy can be achieved by creating more duplicated partitions.

[0165] With respect to FIGS. 9a and 9b, on boot 901, the initial bootstrap code reads the boot sector 902, scans the partition table and locates the “primary” partition for the second stage boot loader. It then attempts to load this program into memory 903. If it fails 904, for instance, due to a failure of the disk drive, the boot loader attempts to load the program in the “backup” partition into memory 905. Whichever attempt succeeds, the boot loader then passes control to the newly loaded program, along with an indication of which partition the program was loaded from 906.

[0166] Similarly, the second stage boot loader reads the partition table and locates the “primary” operating system kernel 907. If the kernel can not be loaded 908, the “backup” kernel is loaded instead 909. In any case, control is passed to the operating system along with an indication of the source partition, along with the passed source partition from above 910.

[0167] Finally, the operating system locates the “primary” partition containing application software and attempts to load the initial application 911. If this fails 912, then the operating system locates the “backup” partition and loads the initial application from it 913. An indication of the source partition is passed to the initial application, along with the source partition information from the previous steps. At this point, application software takes over the client system and normal viewing management behavior begins 914.

[0168] This sequence of operations provides a reasonable level of protection from disk access errors. It also allows for a method which enables new software at any of these levels to be installed and reliably brought into operation.

[0169] An “installer” viewing object in the object database is used to record the status of software installation attempts. It records the state of the partitions for each of the three levels above, including an indication that an attempt to install new software is underway 915. This operation is reliable due to the transactional nature of the database.

[0170] Referring to FIG. 10, installing a new software image at any of the three levels is handled as follows: the new software image is first copied into the appropriate backup partition 1001, and an indication is made in the database that a software installation is underway 1002. The primary and backup partition indications in the partition table are then swapped 1003, and the system rebooted 1004. Eventually, control will be passed to the initial application.

[0171] Referring again to FIG. 9b, the first task of this application is to update the installer object. For each level 921, 922, the application checks if an installation was in process 916, 917, and verifies that the level was loaded off of the primary partition 918. If so, the installation at that level was successful, and the installer object is updated to indicate success for that level 919. Otherwise, the application copies the backup partition for that level over the primary partition and indicates failure in the installer object for that level 920. Copying the partition insures that a backup copy of known good software for a level is kept available at all times.

[0172] In a preferred embodiment of the invention, finalization of the installation for the top application level of software may be delayed until all parts of the application environment have been successfully loaded and started. This provides an additional level of assurance that all parts of the application environment are working properly before permanently switching to the new software.

Methods Applied to Operations Status Objects

[0173] Operations status objects are a class of viewing object in which information about the usage, performance and behavior of the client system is recorded. These objects are collected by the central site whenever communication with the central site is established.

[0174] The following operations status indicators are recorded for later collection along with a time stamp:

[0175] 1. Viewer actions, primarily pressing buttons on a remote control device, are recorded. Each “button press” is recorded along with the current time, and any other contextual information, such as the current viewer context. Post-processing of this object at the central site results in a complete trace of viewer actions, including the context in which each action is taken.
[0176] 2. Automatic actions, such as beginning or ending the recording of a program, or choosing a program to record based on viewer preferences, are recorded. In addition, deletion of captured programs is recorded. Post-processing of this object at the central site results in a complete trace of program capture actions taken by the client system, including the programs residing in the persistent store at any point in time.
[0177] 3. Software installation actions, including reception, installation, and post-reboot results are recorded.
[0178] 4. Hardware exceptions of various kinds, including but not limited to: power fail/restart, internal temperature profile of the device, persistent storage access errors, memory parity errors and primary partition failures.

[0179] Since all actions are recorded along with a time stamp, it is possible to reconstruct the behavior of the client system using a linear time-based ordering. This allows manual or automatic methods to operate on the ordered list of events to correlate actions and behaviors. For instance, if an expected automatic action does not occur soon after rebooting with new software, it may be inferred that the new software was defective.

Processing of Television Viewing Objects by Central Site Systems

Sources of Television Viewing Objects

[0180] A client system has a single source of television viewing objects: the central site. The central site object database has many sources of television viewing objects:

[0181] 1. Program guide information obtained from outside sources is processed to produce a consistent set of program guide objects, indicating “programs”, “showings”, “channels”, “networks” and other related objects. This set of objects will have dependencies (“channels” depend on “networks”, “showings” depend on “programs”) and other interrelationships. When a complete, consistent set of objects is ready, it is added to the database as an atomic operation.
[0182] 2. New software, including new applications or revisions of existing software, are first packaged into “software” viewing objects. As above, the software may have interdependencies, such as an application depending on a dynamically loaded library, which must be reflected in the interrelationships of the software objects involved. In another example, there may be two types of client systems in use, each of which requires different software objects; these software objects must have attributes present indicating the type of system they are targeted at. Once a consistent set of objects is available, it is added to the database as an atomic operation.
[0183] 3. Each client system has a unique, secret key embedded within it. The public key matching this secret key is loaded into a “client” management object, along with other interesting information about the client, such as client type, amount of storage in the system, etc. These objects are used to generate authentication objects as necessary.
[0184] 4. Aggregation program guide objects are added in a similar fashion. In this case, however, the aggregation object must refer to primitive program guide objects already present in the database. Also attached to the aggregation object are other objects, such as a textual description, a screen-based icon, and other informational attributes. Once a consistent set of ancillary objects to the aggregation is available, it is added to the database as an atomic operation.
[0185] 5. Data collected from client systems.

[0186] It should be clear that there may be any number of sources of viewing objects, and this enumeration simply shows the most basic possible sources.

Operations on Television Viewing Objects

[0187] There are a large number of possible operations on the central television viewing object database. The following examples are meant to show the type of processing that may be performed, however the potential operations are not limited to these examples:

[0188] 1. Using various viewing objects, a number of interesting statistical analysis tasks may be performed:
- [0189] 1.1. By examining large numbers of uploaded operations status objects, it is possible to perform extensive analysis of hardware reliability trends and failure modes. For instance, it is possible to correlate internal temperature with expected MTBF (Mean Time Between Failures) of client devices.
- [0190] 1.2. By examining large numbers of uploaded viewing information, it is possible to derive demographic or psychographic information about various populations of client devices. For example, it is possible to correlate TV programs most watched within specific zip codes in which the client devices reside.
- [0191] 1.3. Similarly, by examining large numbers of viewing information objects, it is possible to generate “rating” and “share” values for particular programs with fully automated methods, unlike existing program rating methods.
- [0192] 1.4. There are many other examples of statistical analysis tasks that might be performed on the viewing object database; these examples are not meant to limit the applicability of the invention, but to illustrate by example the spectrum of operations that might be performed.
[0193] 2. Specialty aggregation objects may be automatically generated based on one or more attributes of all available viewing objects.
- [0194] Such generation is typically performed by first extracting information of interest from each viewing object, such as program description, actor, director, etc., and constructing a simple table of programs and attributes. An aggregate viewing object is then generated by choosing one or more attributes, and adding to the aggregate those programs for which the chosen attributes match in some way.
- [0195] These objects are then included in the slices generated for transmission, possibly based on geographic or other information. Some example aggregates that might be created are:
- [0196] 2.1. Aggregates based on events, such as a major league football game in a large city. In this case, all programs viewable by client devices in or around that city are collected, and the program description searched for the names of the teams playing, coaches names, major player's names, the name of the ballpark, etc. Matching program objects are added to the aggregate, which is then sliced for transmission only to client devices in regions in and around the city.
- [0197] 2.2. Aggregates based on persons of common interest to a large number of viewers. For instance, an aggregate might be constructed of all “John Wayne” movies to be broadcast in the next week.
- [0198] 2.3. Aggregates based on viewing behavior can be produced. In this case, uploaded viewing objects are scanned for elements of common interest, such as types of programs viewed, actual programs viewed, etc. For example, a “top ten list” aggregate of programs viewed on all client devices in the last week might be generated containing the following week's showing of those programs.
- [0199] 2.4. Aggregates based on explicit selections by viewers. During viewing of a program, the viewer might be presented with an opportunity to “vote” on the current program, perhaps on the basis of four perceived attributes (storyline, acting, directing, cinematography), which generates viewing objects that are uploaded later. These votes are then scanned to determine an overall rating of the program, which is transmitted to those who voted for their perusal.
- [0200] 2.5. There are many other examples of how the basic facilities of this invention allow the service operator to provide pre-sorted and pre-selected groups of related programs to the user of the client device for perusal and selection. These examples are not meant to limit the applicability of the invention, but to illustrate by example the spectrum of operations that might be performed.
[0201] 3. Manual methods may also be used to generate aggregate objects, a process sometimes called “authoring”. In this case, the person creating the aggregate chooses programs for explicit addition to the aggregate. It is then transmitted in the same manner as above.

[0202] Clearly, aggregation program objects may also permit the expression of preferences or recording of other information. These results may be uploaded to the central site to form a basis for the next round of aggregate generation or statistical analysis, and so on.

[0203] This feedback loop closes the circuit between service provider and the universe of viewers using the client device. This unique and novel approach provides a new form of television viewing by providing unique and compelling ways for the service provider to present and promote the viewing of television programs of interest to individuals while maintaining reliable and consistent operation of the service.

[0204] Although the invention is described herein with reference to the preferred embodiment, one skilled in the art will readily appreciate that other applications may be substituted for those set forth herein without departing from the spirit and scope of the present invention. Accordingly, the invention should only be limited by the Claims included below.

Claims

The invention claimed is:

1. A method for scheduling recording, storing, and deleting of television and/or Web page program material on a storage medium in a computer environment, comprising:

generating, in a multimedia recording device, a prioritized list of program viewing preferences;

wherein said list contains a viewer's explicit preferred program selections for recording and inferred preferred program selections for recording;

comparing said list with a database of program guide objects;

wherein said program guide objects indicate when programs of interest are broadcast;

generating a schedule of time versus available storage space that is optimal for the viewer's explicit or inferred preferred programs using said database of program guide objects, said schedule of time versus available storage space tracks all stored programs and programs that have been scheduled to be recorded in the future;

wherein said explicit and inferred preferred programs include television broadcast programs and/or Universal Resource Locators (URLs);

generating an ordered list of future showings of a specific program of interest using said database of program guide objects;

checking showing(s) of said specific program of interest in said ordered list for input source or storage space conflicts with programs previously scheduled for recording using said schedule of time versus available storage space until a particular showing of said specific program of interest is found having no input and/or space conflicts for the time the particular showing is available such that a recording of said specific program of interest is made as soon as possible and scheduling said particular showing of said specific program of interest for recording;

wherein said checking step makes a determination of conflicts for an explicitly selected program immediately upon the viewer making the explicit selection of the program to record;

upon the checking step failing to find a particular showing of said specific program of interest having no input and/or space conflicts for the time the particular showing is available, sorting said ordered list of future showings; and

wherein the ordering of said ordered list of future showings results in the viewer being presented with any conflicting explicit preferred program selections in order from least impact on programs previously scheduled for recording to greatest.

2. The method of claim 1, wherein a highest possible priority is assigned to programs that the viewer requests to be captured.

3. The method of claim 1, wherein the viewer explicitly expresses preferences using appurtenances provided through a viewer interface.

4. The method of claim 1, wherein said preferences are inferred from viewing patterns.

5. The method of claim 1, wherein schedule conflicts between explicit program selections and inferred program selections are resolved in favor of said explicit selections without asking the viewer.

6. The method of claim 1, wherein said preferences correspond to television viewing objects stored in a replicated database.

7. The method of claim 1, further comprising:

creating an input schedule; and

wherein said input schedule tracks free and occupied time slots for each input source.

8. The method of claim 7, wherein a total amount of space available at any given moment in time is found by generating a sum of all occupied space or space that will be occupied at that particular time, and subtracting the sum from total capacity available to store programs.

9. The method of claim 7, wherein there must be an input available from which to record for the duration of the program.

10. The method of claim 7, wherein only those types of inputs from which the desired program can be recorded are considered during scheduling.

11. The method of claim 1, wherein inferred programs previously scheduled for recording automatically lose conflict decisions with explicit program selections.

12. The method of claim 1, wherein a program is recorded if at all times between when the recording would be initiated and when it expires, sufficient space is available to hold it.

13. The method of claim 1, wherein for each candidate showing in said list, the viewer is presented with an option of shortening expiration dates for conflicting explicit preferred program selections.

14. The method of claim 1, wherein the viewer is presented with the option to cancel each previously scheduled recording that has an input conflict with the desired program.

15. The method of claim 1, further comprising:

scheduling, by a background scheduler, each explicit and inferred preferred program in turn until the list of explicit and inferred preferred programs is exhausted or no further opportunity to record is available.

16. The method of claim 15, wherein an inferred preferred program is scheduled if and only if there are no conflicts with other scheduled programs.

17. The method of claim 1, wherein an inferred preferred program which has been scheduled is deleted if it conflicts with an explicit selection or if a change in viewer preferences identifies a higher priority program that could be recorded at that time.

18. The method of claim 1, wherein all conflicts are resolved as early as possible.

19. The method of claim 1, wherein when there are schedule conflicts with other programs that the viewer has explicitly selected, the viewer is asked which scheduled recordings should be canceled and which should be completed.

20. The method of claim 1, wherein an expiration time of at least one conflicting stored inferred preferred program is shortened to exactly that needed to allow recording of said particular showing of said specific program of interest when said specific program of interest is an explicit preferred program.

21. The method of claim 1, wherein schedule conflicts resulting from the recording of aggregate objects are resolved using preference weighting of the programs involved.

22. The method of claim 1, wherein when multiple conflicts are caused by a particular program in an aggregate object, it will only be recorded when its preference exceeds that of all conflicting programs.

23. An apparatus for scheduling recording, storing, and deleting of television and/or Web page program material on a storage medium in a computer environment, comprising:

a multimedia recording device that generates a prioritized list of program viewing preferences;

wherein said list contains a viewer's explicit preferred program selections for recording and derived preferred program selections for recording;

a subsystem in said multimedia recording device that compares said list with a database of program guide objects;

wherein said program guide objects indicate when programs of interest are broadcast;

a subsystem in said multimedia recording device that generates a schedule of time versus available storage space that is optimal for the viewer's explicit or inferred preferred programs using said database of program guide objects, said schedule of time versus available storage space tracks all stored programs and programs that have been scheduled to be recorded in the future;

wherein said explicit and inferred preferred programs include television broadcast programs and/or Universal Resource Locators (URLs);

a subsystem in said multimedia recording device that generates an ordered list of future showings of a specific program of interest using said database of program guide objects;

a subsystem in said multimedia recording device that checks showing(s) of said specific program of interest in said ordered list for input source or storage space conflicts with programs previously scheduled for recording using said schedule of time versus available storage space-until a particular showing of said specific program of interest is found having no input and/or space conflicts for the time the particular showing is available such that a recording of said specific program of interest is made as soon as possible and scheduling said particular showing of said specific program of interest for recording;

wherein said subsystem that checks showings makes a determination of conflicts for an explicitly selected program immediately upon the viewer making the explicit selection of the program to record;

a subsystem in said multimedia recording device that sorts said ordered list of future showings upon failure of said subsystem that checks showings to find a particular showing of said specific program of interest having no input and/or space conflicts for the time the particular showing is available; and

24. The apparatus of claim 23, wherein a highest possible priority is assigned to programs that the viewer requests to be captured.

25. The apparatus of claim 23, wherein the viewer explicitly expresses preferences using appurtenances provided through a viewer interface.

26. The apparatus of claim 23, wherein said preferences are inferred from viewing patterns.

27. The apparatus of claim 23, wherein schedule conflicts between explicit program selections and inferred program selections are resolved in favor of said explicit selections without asking the viewer.

28. The apparatus of claim 23, wherein said preferences correspond to television viewing objects stored in a replicated database.

29. The apparatus of claim 23, further comprising:

an input schedule; and

wherein said input schedule tracks the free and occupied time slots for each input source.

30. The apparatus of claim 29, wherein a total amount of space available at any given moment in time is found by generating a sum of all occupied space or space that will be occupied at that particular time, and subtracting the sum from total capacity available to store programs.

31. The apparatus of claim 29, wherein a program is recorded if at all times between when the recording would be initiated and when it expires, sufficient space is available to hold it.

32. The apparatus of claim 29, wherein there must be an input available from which to record for the duration of the program.

33. The apparatus of claim 29, wherein only those types of inputs from which the desired program can be recorded are considered during scheduling.

34. The apparatus of claim 23, wherein inferred programs previously scheduled for recording automatically lose conflict decisions with explicit program selections.

35. The apparatus of claim 23, wherein for each candidate showing in said list, the viewer is presented with an option of shortening expiration dates for conflicting explicit preferred program selections.

36. The apparatus of claim 23, wherein the viewer is presented with the option to cancel each previously scheduled recording that has an input conflict with the desired program.

37. The apparatus of claim 23, further comprising:

a background scheduler that schedules each explicit and inferred preferred program in turn until the list of explicit and inferred preferred programs is exhausted or no further opportunity to record is available.

38. The apparatus of claim 37, wherein an inferred preferred program is scheduled if and only if there are no conflicts with other scheduled programs.

39. The apparatus of claim 23, wherein an inferred preferred program which has been scheduled is deleted if it conflicts with an explicit selection or if a change in viewer preferences identifies a higher priority program that could be recorded at that time.

40. The apparatus of claim 23, wherein all conflicts are resolved as early as possible.

41. The apparatus of claim 23, wherein when there are schedule conflicts with other programs that the viewer has explicitly selected, the viewer is asked which scheduled recordings should be canceled and which should be completed.

42. The apparatus of claim 23, wherein an expiration time of at least one conflicting stored inferred preferred program is shortened to exactly that needed to allow recording of said particular showing of said specific program of interest when said specific program of interest is an explicit preferred program.

43. The apparatus of claim 23, wherein schedule conflicts resulting from the recording of aggregate objects are resolved using preference weighting of the programs involved.

44. The apparatus of claim 23, wherein when multiple conflicts are caused by a particular program in an aggregate object, it will only be recorded when its preference exceeds that of all conflicting programs.

45. A computer-readable medium carrying one or more sequences of instructions for scheduling recording, storing, and deleting of television and/or Web page program material on a storage medium, wherein execution of the one or more sequences of instructions by one or more processors causes the one or more processors to perform:

generating, in a multimedia recording device, a prioritized list of program viewing preferences;

wherein said list contains a viewer's explicit preferred program selections for recording and derived preferred program selections for recording;

comparing said list with a database of program guide objects;

wherein said program guide objects indicate when programs of interest are broadcast;

wherein said explicit and inferred preferred programs include television broadcast programs and/or Universal Resource Locators (URLs);

generating an ordered list of future showings of a specific program of interest using said database of program guide objects;

wherein said checking step makes a determination of conflicts for an explicitly selected program immediately upon the viewer making the explicit selection of the program to record;

46. The computer-readable medium of claim 45, wherein a highest possible priority is assigned to programs that the viewer requests to be captured.

47. The computer-readable medium of claim 45, wherein the viewer explicitly expresses preferences using appurtenances provided through a viewer interface.

48. The computer-readable medium of claim 45, wherein said preferences are inferred from viewing patterns.

49. The computer-readable medium of claim 45, wherein schedule conflicts between explicit program selections and inferred program selections are resolved in favor of said explicit selections without asking the viewer.

50. The computer-readable medium of claim 45, wherein said preferences correspond to television viewing objects stored in a replicated database.

51. The computer-readable medium of claim 45, further comprising:

creating an input schedule; and

wherein said input schedule tracks the free and occupied time slots for each input source.

52. The computer-readable medium of claim 51, wherein a total amount of space available at any given moment in time is found by generating a sum of all occupied space or space that will be occupied at that particular time, and subtracting the sum from the total capacity available to store programs.

53. The computer-readable medium of claim 51, wherein there must be an input available from which to record for the duration of the program.

54. The computer-readable medium of claim 51, wherein only those types of inputs from which the desired program can be recorded are considered during scheduling.

55. The computer-readable medium of claim 45, wherein inferred programs previously scheduled for recording automatically lose conflict decisions with explicit program selections.

56. The computer-readable medium of claim 45, wherein a program is recorded if at all times between when the recording would be initiated and when it expires, sufficient space is available to hold it.

57. The computer-readable medium of claim 45, wherein for each candidate showing in said list, the viewer is presented with an option of shortening expiration dates for conflicting explicit preferred program selections.

58. The computer-readable medium of claim 45, wherein the viewer is presented with the option to cancel each previously scheduled recording that has an input conflict with the desired program.

59. The computer-readable medium of claim 45, further comprising:

60. The computer-readable medium of claim 59, wherein an inferred preferred program is scheduled if and only if there are no conflicts with other scheduled programs.

61. The computer-readable medium of claim 45, wherein an inferred preferred program which has been scheduled is deleted if it conflicts with an explicit selection or if a change in viewer preferences identifies a higher priority program that could be recorded at that time.

62. The computer-readable medium of claim 45, wherein all conflicts are resolved as early as possible.

63. The computer-readable medium of claim 45, wherein when there are schedule conflicts with other programs that the viewer has explicitly selected, the viewer is asked which scheduled recordings should be canceled and which should be completed.

64. The computer-readable medium of claim 45, wherein an expiration time of at least one conflicting stored inferred preferred program is shortened to exactly that needed to allow recording of said particular showing of said specific program of interest when said specific program of interest is an explicit preferred program.

65. The computer-readable medium of claim 45, wherein schedule conflicts resulting from the recording of aggregate objects are resolved using preference weighting of the programs involved.

66. The computer-readable medium of claim 45, wherein when multiple conflicts are caused by a particular program in an aggregate object, it will only be recorded when its preference exceeds that of all conflicting programs.

67. A method for scheduling recording, storing, and deleting of television and/or Web page program material on a storage medium, comprising:

deriving, in a multimedia recording device, an ordered list of future showings of a specific program of interest from a database of program guide objects;

wherein said program guide objects indicate when programs are broadcast or transmitted;

determining storage medium memory space and input source scheduling conflicts between showing(s) of said specific program of interest in said ordered list and programs that have been scheduled to be recorded in the future, the determining step checking a plurality of input sources for input sources appropriate for each showing of said specific program of interest in said ordered list;

wherein said programs that have been scheduled to be recorded in the future comprise a viewer's explicit program selections and inferred program selections;

scheduling for recording a particular showing of said specific program of interest that is found having no memory space and/or input conflicts such that a recording of said specific program of interest is made as soon as possible; and

upon a failing to find a particular showing of said specific program of interest having no memory space and/or input conflicts, sorting said list of future showings, the ordering of said list of future showings results in the viewer being presented with any conflicting showings of said specific program of interest in order from least impact on programs previously scheduled for recording to greatest.

68. The method of claim 67, wherein a highest possible priority is assigned to programs that the viewer requests to be captured.

69. The method of claim 67, wherein said inferred program selections are inferred from the viewer's viewing patterns.

70. The method of claim 67, wherein said inferred program selections are inferred from the viewer's indicated preferences.

71. The method of claim 67, wherein inferred programs already scheduled for recording automatically lose conflict decisions with explicit program selections.

72. The method of claim 67, wherein a program is recorded when at all times between when the recording would be initiated and when it expires, sufficient storage medium space is available to hold it.

73. The method of claim 67, wherein there must be an input available from which to record for the duration of the program.

74. The method of claim 67, wherein only those inputs from which a desired program can be recorded are considered during scheduling.

75. The method of claim 67, wherein said specific program of interest is an inferred program selection.

76. The method of claim 67, wherein said specific program of interest is an explicit program selection.

77. The method of claim 76, wherein the viewer is presented with an option to cancel each previously scheduled recording that has an input conflict with the viewer's explicit program selection.

78. The method of claim 76, wherein the viewer is presented with an option to shorten each previously recorded program's expiration date that has a storage medium memory space conflict with the viewer's explicit program selection.

79. The method of claim 78, wherein the viewer's explicit program selection is scheduled to be recorded if the viewer shortens each of the previously recorded program's expiration dates that have a storage medium memory space conflict with the viewer's explicit program selection.

80. The method of claim 76, wherein if any previously scheduled programs conflict with an explicit program selection, then the viewer is asked which previously scheduled program should be canceled and which should be completed.

81. An apparatus for scheduling recording, storing, and deleting of television and/or Web page program material on a storage medium, comprising:

one or more storage medium;

two or more input sources;

a multimedia recording device that derives an ordered list of future showings of a specific program of interest from a database of program guide objects;

wherein said program guide objects indicate when programs are broadcast or transmitted;

a subsystem in said multimedia recording device that determines storage medium memory space and input source scheduling conflicts between showings of said specific program of interest in said ordered list and programs that have been scheduled to be recorded in the future, the subsystem that determines storage medium space and input source scheduling conflicts checks a plurality of input sources for input sources appropriate for each showing of said specific program of interest in said ordered list;

wherein said programs that have been scheduled to be recorded in the future comprise a viewer's explicit program selections and inferred program selections; and

a subsystem in said multimedia recording device for that schedules for recording a particular showing of said specific program of interest that is found having no memory space and/or input conflicts such that a recording of said specific program of interest is made as soon as possible; and

a subsystem in said multimedia recording device that, upon a failing to find a particular showing of said specific program of interest having no memory space and/or input conflicts, sorts said list of future showings, the ordering of said list of future showings results in the viewer being presented with any conflicting showings of said specific program of interest in order from least impact on programs previously scheduled for recording to greatest.

82. The apparatus of claim 81, wherein a highest possible priority is assigned to programs that the viewer requests to be captured.

83. The apparatus of claim 81, wherein said inferred program selections are inferred from the viewer's viewing patterns.

84. The apparatus of claim 81, wherein said inferred program selections are inferred from the viewer's indicated preferences.

85. The apparatus of claim 81, wherein inferred programs already scheduled for recording automatically lose conflict decisions with explicit program selections.

86. The apparatus of claim 81, wherein a program is recorded when at all times between when the recording would be initiated and when it expires, sufficient storage medium space is available to hold it.

87. The apparatus of claim 81, wherein there must be an input available from which to record for the duration of the program.

88. The apparatus of claim 81, wherein only those inputs from which a desired program can be recorded are considered during scheduling.

89. The apparatus of claim 81, wherein said specific program of interest is an inferred program selection.

90. The apparatus of claim 81, wherein said specific program of interest is an explicit program selection.

91. The apparatus of claim 90, wherein the viewer is presented with an option to cancel each previously scheduled recording that has an input conflict with one of the viewer's explicit program selections.

92. The apparatus of claim 90, wherein the viewer is presented with an option to shorten each previously recorded program's expiration date that has a storage medium memory space conflict with one of the viewer's explicit program selections.

93. The apparatus of claim 92, wherein the viewer's explicit program selection is scheduled to be recorded if the viewer shortens each of the previously recorded program's expiration dates that have a storage medium memory space conflict with the viewer's explicit program selection.

94. The apparatus of claim 90, wherein if any previously scheduled programs conflict with an explicit program selection, then the viewer is asked which previously scheduled program should be canceled and which should be completed.

95. A computer-readable medium carrying one or more sequences of instructions for scheduling recording, storing, and deleting of television and/or Web page program material on a storage medium, wherein execution of the one or more sequences of instructions by one or more processors causes the one or more processors to perform:

deriving, in a multimedia recording device, an ordered list of future showings of a specific program of interest from a database of program guide objects;

wherein said program guide objects indicate when programs are broadcast or transmitted;

determining storage medium memory space and input source scheduling conflicts between showings of said specific program of interest in said ordered list and programs that have been scheduled to be recorded in the future, the determining step checking a plurality of input sources for input sources appropriate for each showing of said specific program of interest in said ordered list;

wherein said programs that have been scheduled to be recorded in the future comprise a viewer's explicit program selections and inferred program selections; and

96. The computer-readable medium of claim 95, wherein a highest possible priority is assigned to programs that the viewer requests to be captured.

97. The computer-readable medium of claim 95, wherein said inferred program selections are inferred from the viewer's viewing patterns.

98. The computer-readable medium of claim 95, wherein said inferred program selections are inferred from the viewer's indicated preferences.

99. The computer-readable medium of claim 95, wherein inferred programs already scheduled for recording automatically lose conflict decisions with explicit program selections.

100. The computer-readable medium of claim 95, wherein a program is recorded when at all times between when the recording would be initiated and when it expires, sufficient storage medium space is available to hold it.

101. The computer-readable medium of claim 95, wherein there must be an input available from which to record for the duration of the program.

102. The computer-readable medium of claim 95, wherein only those inputs from which a desired program can be recorded are considered during scheduling.

103. The computer-readable medium of claim 95, wherein said specific program of interest is an inferred program selection.

104. The computer-readable medium of claim 95, wherein said specific program of interest is an explicit program selection.

105. The computer-readable medium of claim 104, wherein the viewer is presented with an option to cancel each previously scheduled recording that has an input conflict with one of the viewer's explicit program selections.

106. The computer-readable medium of claim 104, wherein the viewer is presented with an option to shorten each previously recorded program's expiration date that has a storage medium memory space conflict with one of the viewer's explicit program selections.

107. The computer-readable medium of claim 106, wherein the viewer's explicit program selection is scheduled to be recorded if the viewer shortens each of the previously recorded program's expiration dates that have a storage medium memory space conflict with the viewer's explicit program selection.

108. The computer-readable medium of claim 104, wherein if any previously scheduled programs conflict with an explicit program selection, then the viewer is asked which previously scheduled program should be canceled and which should be completed.

Patent Citations (80)

Patent	Date	Inventor	Cited By
US4600989(A)	1986-07-01	Schwartz	Applicant
US4706121(A)	1987-11-01	Young	Applicant
US5034902(A)	1991-07-01	Steinmann	Applicant
US5038211(A)	1991-08-01	Hallenbeck	Applicant
US5063547(A)	1991-11-01	Custers et al.	Applicant
US5175631(A)	1992-12-01	Juri et al.	Applicant
US5307713(A)	1994-05-01	White	Applicant
US5335079(A)	1994-08-01	Yuen et al.	Applicant
US5353121(A)	1994-10-01	Young et al.	Applicant
US5502504(A)	1996-03-01	Marshall et al.	Applicant
US5515173(A)	1996-05-01	Mankovitz et al.	Applicant
US5585838(A)	1996-12-01	Lawler et al.	Applicant
US5596373(A)	1997-01-01	White et al.	Examiner
US5701383(A)	1997-12-01	Russo et al.	Applicant
US5710601(A)	1998-01-01	Marshall et al.	Applicant
US5734444(A)	1998-03-01	Yoshinobu	Examiner
US5745710(A)	1998-04-01	Clanton, III et al.	Applicant
US5758257(A)	1998-05-01	Herz et al.	Applicant
US5758259(A)	1998-05-01	Lawler	Applicant
US5774664(A)	1998-06-01	Hidary et al.	Applicant
US5790198(A)	1998-08-01	Roop et al.	Applicant
US5793438(A)	1998-08-01	Bedard	Applicant
US5801747(A)	1998-09-01	Bedard	Applicant
US5801787(A)	1998-09-01	Schein et al.	Examiner
US5805235(A)	1998-09-01	Bedard	Applicant
US5805763(A)	1998-09-01	Lawler et al.	Applicant
US5809204(A)	1998-09-01	Young et al.	Applicant
US5828945(A)	1998-10-01	Klosterman	Applicant
US5850218(A)	1998-12-01	LaJoie et al.	Applicant
US5861906(A)	1999-01-01	Dunn et al.	Applicant
US5872588(A)	1999-02-01	Aras et al.	Applicant
US5878186(A)	1999-03-01	Bennett et al.	Applicant
US5878222(A)	1999-03-01	Harrison	Applicant
US5923362(A)	1999-07-01	Klosterman	Applicant
US5940073(A)	1999-08-01	Klosterman et al.	Applicant
US5959688(A)	1999-09-01	Schein et al.	Applicant
US6002394(A)	1999-12-01	Schein et al.	Applicant
US6028600(A)	2000-02-01	Rosin et al.	Examiner
US6029195(A)	2000-02-01	Herz	Applicant
US6061503(A)	2000-05-01	Chamberlain	Examiner
US6177931(B1)	2001-01-01	Alexander et al.	Applicant
US6208799(B1)	2001-03-01	Marsh et al.	Examiner
US6209132(B1)	2001-03-01	Harrison et al.	Applicant
US6288716(B1)	2001-09-01	Humpleman et al.	Applicant
US6344878(B1)	2002-02-01	Emura	Examiner
US6374406(B2)	2002-04-01	Hirata	Applicant
US6400996(B1)	2002-06-01	Hoffberg et al.	Applicant
US6412112(B1)	2002-06-01	Barrett et al.	Applicant
US6425128(B1)	2002-07-01	Krapf et al.	Applicant
US6481011(B1)	2002-11-01	Lemmons et al.	Applicant
US6493876(B1)	2002-12-01	DeFreese et al.	Examiner
US6507951(B1)	2003-01-01	Wugofski	Examiner
US6532589(B1)	2003-03-01	Proehl et al.	Examiner
US6614987(B1)	2003-09-01	Ismail et al.	Examiner
US6654546(B1)	2003-11-01	Levin et al.	Applicant
US6658663(B1)	2003-12-01	Bruynsteen	Applicant
US6675388(B1)	2004-01-01	Beckmann et al.	Applicant
US6725281(B1)	2004-04-01	Zintel et al.	Applicant
US6898762(B2)	2005-05-01	Ellis et al.	Applicant
US7003790(B1)	2006-02-01	Inoue et al.	Applicant
US7046911(B2)	2006-05-01	Zimmerman et al.	Applicant
US7124431(B2)	2006-10-01	Hanai et al.	Examiner
US7224886(B2)	2007-05-01	Akamatsu et al.	Examiner
US2001/0053274(A1)	2001-12-01	Roelofs et al.	Applicant
US2002/0054752(A1)	2002-05-01	Wood et al.	Examiner
US2002/0083153(A1)	2002-06-01	Sweatt, III et al.	Applicant
US2003/0154477(A1)	2003-08-01	Hassell et al.	Examiner
US2005/0251750(A1)	2005-11-01	Vallone et al.	Applicant
EP435370(B1)	1994-03-01		Applicant
EP889649(A2)	1999-01-01		Applicant
EP691651(B1)	1999-02-01		Applicant
EP898279(A2)	1999-02-01		Applicant
EP889649(A3)	1999-08-01		Applicant
EP764951(B1)	2002-09-01		Applicant
WO93/08664(A1)	1993-04-01		Applicant
WO94/14282(A1)	1994-06-01		Applicant
WO96/38008(A1)	1996-11-01		Applicant
WO98/12872(A1)	1998-03-01		Applicant
WO98/56188	1998-12-01		Applicant
WO/76130(A1)	2000-12-01		Applicant

Non-Patent Literature (6)

Official Action from CN for foreign patent application No. 200410039972.8 dated Nov. 4, 2005 (8 pgs)—attached.Applicant
Current Claims in CN patent application No. 200410039972.8 (9 pgs)—attached.Applicant
Microsoft Press Computer Dictionary, 1997, Microsoft Press, Third Edition, p. 355.Applicant
Office Action from PCT Patent Application No. PCT/USO4/00561, dated Dec. 8, 2004, (11 pgs).Applicant
Current Claims in PCT Patent Application No. PCT/USO4/00561 (6 pgs).Applicant
McFedries, Paul, “The Complete Idiot's Guide to Windows 95,” 1997, Que Corporation, 2nd Edition, pp. 36-39.Applicant

Abstract