US 6,941,383 B1Grant

System, method and article of manufacture for java/javascript component in a multimedia synchronization framework

Issue Date:2005-09-06

•18 Claims

•19 Drawing Sheets

Abstract

A system, method and article of manufacture are provided for synchronizing an event on a plurality of client apparatuses. First, a plurality of client apparatuses are connected via a network. Next, an application program is embedded on a site on the network. In use, information is requested from a server on the network utilizing the application program. Such information relates to an event to be played back simultaneously on the client apparatuses. In response to such request, a script is received for displaying the information.

Metadata

Assignee

InterActual Technologies, Inc.

Inventors

Evgeniy M. Getsin
Michael J. Lewis
Todd R. Collart

Application Information

Application Number:US 09/488,155

Filing Date:2000-01-20

Priority Date:2000-01-20

Art Unit:2157

Patent Drawings (19 sheets)

Description

Field of the Invention

[0001] The present invention relates to network synchronization and more particularly to synchronizing the playback of a multimedia event on a plurality of client apparatuses.

Background of the Invention

[0002] Systems such as the Internet typically are point-to-point (or unicast) systems in which a message is converted into a series of addressed packets which are routed from a source node through a plurality of routers to a destination node. In most as communication protocols the packet includes a header which contains the addresses of the source and the destination nodes as well as a sequence number which specifies the packet's order in the message.

[0003] In general, these systems do not have the capability of broadcasting a message from a source node to all the other nodes in the network because such a capability is rarely of much use and could easily overload the network. However, there are situations where it is desirable for one node to communicate with some subset of all the nodes. For example, multi-party conferencing capability analogous to that found in the public telephone system and broadcasting to a limited number of nodes are of considerable interest to users of packet-switched networks. To satisfy such demands, packets destined for several recipients have been encapsulated in a unicast packet and forwarded from a source to a point in a network where the packets have been replicated and forwarded on to all desired recipients. This technique is known as IP Multicasting and the network over which such packets are routed is referred to as the Multicast Backbone or MBONE. More recently, routers have become available which can route the multicast addresses (class D addresses) provided for in communication protocols such as TCP/IP and UDP/IP. A multicast address is essentially an address for a group of host computers who have indicated their desire to participate in that group. Thus, a multicast packet can be routed from a source node through a plurality of multicast routers (or mrouters) to one or more devices receiving the multicast packets. From there the packet is distributed to all the host computers that are members of the multicast group.

[0004] These techniques have been used to provide on the Internet audio and video conferencing as well as radio-like broadcasting to groups of interested parties. See, for example, K. Savetz et al. MBONE Multicasting Tomorrow's Internet (IDG Books WorldWide Inc., 1996).

[0005] Further details concerning technical aspects of multicasting may be found in the Internet documents Request for Comments (RFC) 1112 and 1458 which are reproduced at Appendices A and B of the Savetz book and in D. P. Brutaman et al., “MBONE provides Audio and Video Across the Internet,” IEEE Computer, Vol. 27, No. 4, pp. 30-36 (April 1994), all of which are incorporated herein by reference.

[0006] Multimedia computer systems have become increasingly popular over the last several years due to their versatility and their interactive presentation style. A multimedia computer system can be defined as a computer system having a combination of video and audio outputs for presentation of audio-visual displays. A modem multimedia computer system typically includes one or more storage devices such as an optical drive, a CD-ROM, a hard drive, a videodisc, or an audiodisc, and audio and video data are typically stored on one or more of these mass storage devices. In some file formats the audio and video are interleaved together in a single file, while in other formats the audio and video data are stored in different files, many times on different storage media. Audio and video data for a multimedia display may also be stored in separate computer systems that are networked together.

[0007] In this instance, the computer system presenting the multimedia display would receive a portion of the necessary data from the other computer system via the network cabling.

[0008] Graphic images used in Windows multimedia applications can be created in either of two ways, these being bit-mapped images and vector-based images. Bit-mapped images comprise a plurality of picture elements (pixels) and are created by assigning a color to each pixel inside the image boundary. Most bit-mapped color images require one byte per pixel for storage, so large bit-mapped images create correspondingly large files. For example, a full-screen, 256-color image in 640-by-480-pixel VGA mode requires 307,200 bytes of storage, if the data is not compressed. Vector-based images are created by defining the end points, thickness, color, pattern and curvature of lines and solid objects comprised within the image. Thus, a vector-based image includes a definition which consists of a numerical representation of the coordinates of the object, referenced to a corner of the image.

[0009] Bit-mapped images are the most prevalent type of image storage format, and the most common bit-mapped-image file formats are as follows. A file format referred to as BMP is used for Windows bit-map files in 1-, 2-, 4-, 8-, and 24-bit color depths. BMP files contain a bit-map header that defines the size of the image, the number of color planes, the type of compression used (if any), and the palette used. The Windows DIB (device-independent bit-map) format is a variant of the BMP format that includes a color table defining the RGB (red green blue) values of the colors used. Other types of bit-map formats include the TIF (tagged image format file), the PCX (Zsoft Personal Computer Paintbrush Bitmap) file format, the GIF (graphics interchange file) format, and the TGA (Texas Instruments Graphic Architecture) file format.

[0010] The standard Windows format for bit-mapped images is a 256-color device independent bit map (DIB) with a BMP (the Windows bit-mapped file format) or sometimes a DIB extension. The standard Windows format for vector-based images is referred to as WMF (Windows meta file).

[0011] Full-motion video implies that video images shown on the computer's screen simulate those of a television set with identical (30 frames-per-second) frame rates, and that these images are accompanied by high-quality stereo sound. A large amount of storage is required for high-resolution color images, not to mention a full-motion video sequence. For example, a single frame of NTSC video at 640-by-400-pixel resolution with 16-bit color requires 512K of data per frame. At 30 flames per second, over 15 Megabytes of data storage are required for each second of full motion video. Due to the large amount of storage required for full motion video, various types of video compression algorithms are used to reduce the amount of necessary storage. Video compression can be performed either in real-time, i.e., on the fly during video capture, or on the stored video file after the video data has been captured and stored on the media In addition, different video compression methods exist for still graphic images and for full-motion video.

[0012] Examples of video data compression for still graphic images are RLE (run-length encoding) and JPEG (Joint Photographic Experts Group) compression. RLE is the standard compression method for Windows BMP and DIB files. The RLE compression method operates by testing for duplicated pixels in a single line of the bit map and stores the number of consecutive duplicate pixels rather than the data for the pixel itself JPEG compression is a group of related standards that provide either lossless (no image quality degradation) or lossy (imperceptible to severe degradation) compression types. Although JPEG compression was designed for the compression of still images rather than video, several manufacturers supply JPEG compression adapter cards for motion video applications.

[0013] In contrast to compression algorithms for still images, most video compression algorithms are designed to compress full motion video. Video compression algorithms for motion video generally use a concept referred to as interframe compression, which involves storing only the differences between successive frames in the data file. Interframe compression begins by digitizing the entire image of a key frame. Successive frames are compared with the key frame, and only the differences between the digitized data from the key frame and from the successive frames are stored. Periodically, such as when new scenes are displayed, new key frames are digitized and stored, and subsequent comparisons begin from this new reference point. It is noted that interframe compression ratios are content-dependent, i.e., if the video clip being compressed includes many abrupt scene transitions from one image to another, the compression is less efficient. Examples of video compression which use an interframe compression technique are MPEG, DVI and Indeo, among others.

[0014] MPEG (Moving Pictures Experts Group) compression is a set of methods for compression and decompression of full motion video images that uses the interframe compression technique described above. The MPEG standard requires that sound be recorded simultaneously with the video data, and the video and audio data are interleaved in a single file to attempt to maintain the video and audio synchronized during playback. The audio data is typically compressed as well, and the MPEG standard specifies an audio compression method referred to as ADPCM (Adaptive Differential Pulse Code Modulation) for audio data.

[0015] A standard referred to as Digital Video Interactive (DVI) format developed by Intel Corporation is a compression and storage format for full-motion video and high-fidelity audio data. The DVI standard uses interframe compression techniques similar to that of the MPEG standard and uses ADPCM compression for audio data. The compression method used in DVI is referred to as RTV 2.0 (real time video), and this compression method is incorporated into Intel's AVK (audio/video kernel) software for its DVI product line. IBM has adopted DVI as the standard for displaying video for its Ultimedia product line. The DVI file format is based on the Intel i750 chipset and is supported through the Media Control Interface (MCI) for Windows. Microsoft and Intel jointly announced the creation of the DV MCI (digital video media control interface) command set for Windows 3.1 in 1992.

[0016] The Microsoft Audio Video Interleaved (AVI) format is a special compressed file structure format designed to enable video images and synchronized sound stored on CD-ROMs to be played on PCs with standard VGA displays and audio adapter cards. The AVI compression method uses an interframe method, i.e., the differences between successive frames are stored in a manner similar to the compression methods used in DVI and MPEG. The AVI format uses symmetrical software compression-decompression techniques, i.e., both compression and decompression are performed in real time. Thus AVI files can be created by recording video images and sound in AVI format from a VCR or television broadcast in real time, if enough free hard disk space is available.

[0017] Despite these compression algorithms, it is very difficult to simultaneously multicast multimedia material due to bandwidth restraints. This problem is unavoidable with present technology since such large amounts of data must be transferred over networks such as the Internet from a single host server to numerous client computers.

Summary of the Invention

[0018] A system, method and article of manufacture are provided for synchronizing an event on a plurality of client apparatuses. First, a plurality of client apparatuses are connected via a network. Next, an application program is embedded on a site on the network. In use, information is requested from a server on the network utilizing the application program. Such information relates to an event to be played back simultaneously on the client apparatuses. In response to such request, a script is received for displaying the information.

[0019] In one embodiment of the present invention, the application program is further adapted to send a request to retrieve commands from the server for use with a playback device of one of the client apparatuses. In accordance with a primary aspect of the present invention, the playback device includes a digital video disc (DVD) player.

[0020] In another embodiment of the present invention, the commands may be adapted to playback the event on the playback device simultaneous with the playback of the event on the remaining client apparatuses. Further, the command may include a start time when the playback of the event is to begin on each of the client apparatuses. In one aspect of the present invention, the application program is a JAVA applet and the script is JAVAscript.

Brief Description of the Drawings

[0021] The invention will be better understood when consideration is given to the following detailed description thereof. Such description makes reference to the annexed drawings wherein:

[0022] FIG. 1 is a schematic diagram of a hardware implementation of one embodiment of the present invention;

[0023] FIG. 2 illustrates a flowchart delineating a method for synchronizing an event on a plurality of client apparatuses in accordance with one embodiment of the present invention;

[0024] FIG. 3 illustrates a flowchart delineating a method for storing synchronization information for subsequent playback of an event in accordance with one embodiment of the present invention;

[0025] FIG. 4 illustrates a flowchart setting forth a method for providing overlays during a synchronized event on a plurality of client apparatuses in accordance with one embodiment of the present invention;

[0026] FIG. 5 illustrates a flow diagram for delayed synchronization of an event on a plurality of client apparatuses in accordance with one embodiment of the present invention;

[0027] FIG. 6 illustrates a flow diagram for providing information on a synchronized event on a plurality of client apparatuses in accordance with one embodiment of the present invention;

[0028] FIG. 7 illustrates a method for creating a synchronizer object in order to playback an event simultaneously on a plurality of client apparatuses in accordance with one embodiment of the present invention;

[0029] FIG. 8 illustrates a flowchart for affording a scheduler object adapted to facilitate the playback of an event simultaneously on a plurality of networked client apparatuses in accordance with one embodiment of the present invention;

[0030] FIG. 9 is a flowchart delineating a method for identifying a plurality of events which are played back simultaneously on a plurality of networked client apparatuses in accordance with one embodiment of the present invention;

[0031] FIG. 10 shows a flowchart delineating a technique for interfacing a plurality of different types of playback devices of client apparatuses which are networked to simultaneously playback an event in accordance with one embodiment of the present invention;

[0032] FIG. 11 illustrates the manner in which a layer factory is created in accordance with one embodiment of the present invention;

[0033] FIG. 12 illustrates the manner in which user requests are processed in accordance with one embodiment of the present invention;

[0034] FIGS. 13-16 illustrate various class/component diagrams in accordance with one embodiment of the present invention;

[0035] FIG. 17 illustrates a logical sequence diagram in accordance with one embodiment of the present invention;

[0036] FIG. 18 illustrates a logical sequence diagram that shows server side collaboration in accordance with one embodiment of the present invention; and

[0037] FIG. 19 illustrates a logical sequence diagram showing client side collaboration in accordance with one embodiment of the present invention.

Detailed Description of the Preferred Embodiments

[0038] FIGS. 1-19 illustrate a system for synchronizing an event on a plurality of client apparatuses. Prior to use, an event is stored in memory on at least one of the client apparatuses. Such client apparatuses are adapted to be connected to a network along with a host computer(s). In operation, information is transmitted from the host computer to the at least one client apparatus utilizing the network. This information allows for the simultaneous and synchronous playback of the event on each of the client apparatuses.

[0039] In various embodiments, the client apparatuses may take the form of computers, televisions, stereos, home appliances, or any other types of devices. In one embodiment, the client apparatuses and the host computer each include a computer such as an IBM compatible computer, Apple Macintosh computer or UNIX based workstation.

[0040] A representative hardware environment is depicted in FIG. 1, which illustrates a typical hardware configuration of a workstation in accordance with a preferred embodiment having a central processing unit 110, such as a microprocessor, and a number of other units interconnected via a system bus 112. The workstation shown in FIG. 1 includes a Random Access Memory (RAM) 114, Read Only Memory (ROM) 116, an I/O adapter 118 for connecting peripheral devices such as disk storage units 120 (i.e. DVD playback device) to the bus 112, a user interface adapter 122 for connecting a keyboard 124, a mouse 126, a speaker 128, a microphone 132, and/or other user interface devices such as a touch screen (not shown) to the bus 112, communication adapter 134 for connecting the workstation to a communication network (e.g., a data processing network) and a display adapter 136 for connecting the bus 112 to a display device 138. The workstation typically has resident thereon an operating system such as the Microsoft Windows NT or Windows/95 Operating System (OS), the IBM OS/2 operating system, the MAC OS, or UNIX operating system. Those skilled in the art will appreciate that the present invention may also be implemented on platforms and operating systems other than those mentioned.

[0041] A preferred embodiment is written using JAVA, C, and the C++ language and utilizes object oriented programming methodology. Object oriented programming (OOP) has become increasingly used to develop complex applications. As OOP moves toward the mainstream of software design and development, various software solutions require adaptation to make use of the benefits of OOP. A need exists for these principles of OOP to be applied to a messaging interface of an electronic messaging system such that a set of OOP classes and objects for the messaging interface can be provided.

[0042] OOP is a process of developing computer software using objects, including the steps of analyzing the problem, designing the system, and constructing the program. An object is a software package that contains both data and a collection of related structures and procedures. Since it contains both data and a collection of structures and procedures, it can be visualized as a self-sufficient component that does not require other additional structures, procedures or data to perform its specific task. OOP, therefore, views a computer program as a collection of largely autonomous components, called objects, each of which is responsible for a specific task. This concept of packaging data, structures, and procedures together in one component or module is called encapsulation.

[0043] In general, OOP components are reusable software modules which present an interface that conforms to an object model and which are accessed at run-time through a component integration architecture. A component integration architecture is a set of architecture mechanisms which allow software modules in different process spaces to utilize each others capabilities or functions. This is generally done by assuming a common component object model on which to build the architecture. It is worthwhile to differentiate between an object and a class of objects at this point. An object is a single instance of the class of objects, which is often just called a class. A class of objects can be viewed as a blueprint, from which many objects can be formed.

[0044] OOP allows the programmer to create an object that is a part of another object. For example, the object representing a piston engine is said to have a composition-relationship with the object representing a piston. In reality, a piston engine comprises a piston, valves and many other components; the fact that a piston is an element of a piston engine can be logically and semantically represented in OOP by two objects.

[0045] OOP also allows creation of an object that “depends from” another object. If there are two objects, one representing a piston engine and the other representing a piston engine wherein the piston is made of ceramic, then the relationship between the two objects is not that of composition. A ceramic piston engine does not make up a piston engine. Rather it is merely one kind of piston engine that has one more limitation than the piston engine; its piston is made of ceramic. In this case, the object representing the ceramic piston engine is called a derived object, and it inherits all of the aspects of the object representing the piston engine and adds further limitation or detail to it. The object representing the ceramic piston engine “depends from” the object representing the piston engine. The relationship between these objects is called inheritance.

[0046] When the object or class representing the ceramic piston engine inherits all of the aspects of the objects representing the piston engine, it inherits the thermal characteristics of a standard piston defined in the piston engine class. However, the ceramic piston engine object overrides these ceramic specific thermal characteristics, which are typically different from those associated with a metal piston. It skips over the original and uses new functions related to ceramic pistons. Different kinds of piston engines have different characteristics, but may have the same underlying functions associated with it (e.g., how many pistons in the engine, ignition sequences, lubrication, etc.). To access each of these functions in any piston engine object, a programmer would call the same functions with the same names, but each type of piston engine may have different/overriding implementations of functions behind the same name. This ability to hide different implementations of a function behind the same name is called polymorphism and it greatly simplifies communication among objects.

[0047] With the concepts of composition-relationship, encapsulation, inheritance and polymorphism, an object can represent just about anything in the real world. In fact, one's logical perception of the reality is the only limit on determining the kinds of things that can become objects in object-oriented software. Some typical categories are as follows:

[0048] Objects can represent physical objects, such as automobiles in a traffic-flow simulation, electrical components in a circuit-design program, countries in an economics model, or aircraft in an air-traffic-control system.
[0049] Objects can represent elements of the computer-user environment such as windows, menus or graphics objects.
[0050] An object can represent an inventory, such as a personnel file or a table of the latitudes and longitudes of cities.
[0051] An object can represent user-defined data types such as time, angles, and complex numbers, or points on the plane.

[0052] With this enormous capability of an object to represent just about any logically separable matters, OOP allows the software developer to design and implement a computer program that is a model of some aspects of reality, whether that reality is a physical entity, a process, a system, or a composition of matter. Since the object can represent anything, the software developer can create an object which can be used as a component in a larger software project in the future.

[0053] If 90% of a new OOP software program consists of proven, existing components made from preexisting reusable objects, then only the remaining 10% of the new software project has to be written and tested from scratch. Since 90% already came from an inventory of extensively tested reusable objects, the potential domain from which an error could originate is 10% of the program. As a result, OOP enables software developers to build objects out of other, previously built objects.

[0054] This process closely resembles complex machinery being built out of assemblies and sub-assemblies. OOP technology, therefore, makes software engineering more like hardware engineering in that software is built from existing components, which are available to the developer as objects. All this adds up to an improved quality of the software as well as an increased speed of its development.

[0055] Programming languages are beginning to fully support the OOP principles, such as encapsulation, inheritance, polymorphism, and composition-relationship. With the advent of the C++ language, many commercial software developers have embraced OOP. C++ is an OOP language that offers a fast, machine-executable code. Furthermore, C++ is suitable for both commercial-application and systems-programming projects. For now, C++ appears to be the most popular choice among many OOP programmers, but there is a host of other OOP languages, such as Smalltalk, Common Lisp Object System (CLOS), and Eiffel. Additionally, OOP capabilities are being added to more traditional popular computer programming languages such as Pascal.

[0056] The benefits of object classes can be summarized, as follows:

[0057] Objects and their corresponding classes break down complex programming problems into many smaller, simpler problems.
[0058] Encapsulation enforces data abstraction through the organization of data into small, independent objects that can communicate with each other. Encapsulation protects the data in an object from accidental damage, but allows other objects to interact with that data by calling the object's member functions and structures.
[0059] Subclassing and inheritance make it possible to extend and modify objects through deriving new kinds of objects from the standard classes available in the system. Thus, new capabilities are created without having to start from scratch.
[0060] Polymorphism and multiple inheritance make it possible for different programmers to mix and match characteristics of many different classes and create specialized objects that can still work with related objects in predictable ways.
[0061] Class hierarchies and containment hierarchies provide a flexible mechanism for modeling real-world objects and the relationships among them.
[0062] Libraries of reusable classes are useful in many situations, but they also have some limitations. For example:
[0063] Complexity. In a complex system, the class hierarchies for related classes can become extremely confusing, with many dozens or even hundreds of classes.
[0064] Flow of control. A program written with the aid of class libraries is still responsible for the flow of control (i.e., it must control the interactions among all the objects created from a particular library). The programmer has to decide which functions to call at what times for which kinds of objects.
[0065] Duplication of effort. Although class libraries allow programmers to use and reuse many small pieces of code, each programmer puts those pieces together in a different way. Two different programmers can use the same set of class libraries to write two programs that do exactly the same thing but whose internal structure (i.e., design) may be quite different, depending on hundreds of small decisions each programmer makes along the way. Inevitably, similar pieces of code end up doing similar things in slightly different ways and do not work as well together as they should.

[0066] Class libraries are very flexible. As programs grow more complex, more programmers are forced to reinvent basic solutions to basic problems over and over again. A relatively new extension of the class library concept is to have a framework of class libraries. This framework is more complex and consists of significant collections of collaborating classes that capture both the small scale patterns and major mechanisms that implement the common requirements and design in a specific application domain. They were first developed to free application programmers from the chores involved in displaying menus, windows, dialog boxes, and other standard user interface elements for personal computers.

[0067] Frameworks also represent a change in the way programmers think about the interaction between the code they write and code written by others. In the early days of procedural programming, the programmer called libraries provided by the operating system to perform certain tasks, but basically the program executed down the page from start to finish, and the programmer was solely responsible for the flow of control. This was appropriate for printing out paychecks, calculating a mathematical table, or solving other problems with a program that executed in just one way.

[0068] The development of graphical user interfaces began to turn this procedural programming arrangement inside out. These interfaces allow the user, rather than program logic, to drive the program and decide when certain actions should be performed. Today, most personal computer software accomplishes this by means of an event loop which monitors the mouse, keyboard, and other sources of external events and calls the appropriate parts of the programmer's code according to actions that the user performs. The programmer no longer determines the order in which events occur. Instead, a program is divided into separate pieces that are called at unpredictable times and in an unpredictable order. By relinquishing control in this way to users, the developer creates a program that is much easier to use. Nevertheless, individual pieces of the program written by the developer still call libraries provided by the operating system to accomplish certain tasks, and the programmer must still determine the flow of control within each piece after it's called by the event loop. Application code still “sits on top of” the system.

[0069] Even event loop programs require programmers to write a lot of code that should not need to be written separately for every application. The concept of an application framework carries the event loop concept further. Instead of dealing with all the nuts and bolts of constructing basic menus, windows, and dialog boxes and then making these things all work together, programmers using application frameworks start with working application code and basic user interface elements in place. Subsequently, they build from there by replacing some of the generic capabilities of the framework with the specific capabilities of the intended application.

[0070] Application frameworks reduce the total amount of code that a programmer has to write from scratch. However, because the framework is really a generic application that displays windows, supports copy and paste, and so on, the programmer can also relinquish control to a greater degree than event loop programs permit. The framework code takes care of almost all event handling and flow of control, and the programmer's code is called only when the framework needs it (e.g., to create or manipulate a proprietary data structure).

[0071] A programmer writing a framework program not only relinquishes control to the user (as is also true for event loop programs), but also relinquishes the detailed flow of control within the program to the framework. This approach allows the creation of more complex systems that work together in interesting ways, as opposed to isolated programs, having custom code, being created over and over again for similar problems.

[0072] Thus, as is explained above, a framework basically is a collection of cooperating classes that make up a reusable design solution for a given problem domain. It typically includes objects that provide default behavior (e.g., for menus and windows), and programmers use it by inheriting some of that default behavior and overriding other behavior so that the framework calls application code at the appropriate times.

[0073] There are three main differences between frameworks and class libraries:

[0074] Behavior versus protocol. Class libraries are essentially collections of behaviors that you can call when you want those individual behaviors in your program. A framework, on the other hand, provides not only behavior but also the protocol or set of rules that govern the ways in which behaviors can be combined, including rules for what a programmer is supposed to provide versus what the framework provides.
[0075] Call versus override. With a class library, the code the programmer instantiates objects and calls their member functions. It's possible to instantiate and call objects in the same way with a framework (i.e., to treat the framework as a class library), but to take full advantage of a framework's reusable design, a programmer typically writes code that overrides and is called by the framework. The framework manages the flow of control among its objects. Writing a program involves dividing responsibilities among the various pieces of software that are called by the framework rather than specifying how the different pieces should work together.
[0076] Implementation versus design. With class libraries, programmers reuse only implementations, whereas with frameworks, they reuse design. A framework embodies the way a family of related programs or pieces of software work. It represents a generic design solution that can be adapted to a variety of specific problems in a given domain. For example, a single framework can embody the way a user interface works, even though two different user interfaces created with the same framework might solve quite different interface problems.

[0077] Thus, through the development of frameworks for solutions to various problems and programming tasks, significant reductions in the design and development effort for software can be achieved. A preferred embodiment of the invention utilizes HyperText Markup Language (HTML) to implement documents on the Internet together with a general-purpose secure communication protocol for a transport medium between the client and the Newco. HTTP or other protocols could be readily substituted for HTML without undue experimentation. Information on these products is available in T. Berners-Lee, D. Connoly, “RFC 1866: Hypertext Markup Language—2.0” (Nov. 1995); and R. Fielding, H, Frystyk, T. Berners-Lee, J. Gettys and J. C. Mogul, “Hypertext Transfer Protocol—HTTP/1.1: HTTP Working Group Internet Draft” (May 2, 1996). HTML is a simple data format used to create hypertext documents that are portable from one platform to another. HTML documents are SGML documents with generic semantics that are appropriate for representing information from a wide range of domains. HTML has been in use by the World-Wide Web global information initiative since 1990. HTML is an application of ISO Standard 8879; 1986 Information Processing Text and Office Systems; Standard Generalized Markup Language (SGML).

[0078] To date, Web development tools have been limited in their ability to create dynamic Web applications which span from client to server and interoperate with existing computing resources. Until recently, HTML has been the dominant technology used in development of Web-based solutions. However, HTML has proven to be inadequate in the following areas:

[0079] Poor performance;
[0080] Restricted user interface capabilities;
[0081] Can only produce static Web pages;
[0082] Lack of interoperability with existing applications and data; and
[0083] Inability to scale.

[0084] Sun Microsystem's Java language solves many of the client-side problems by:

[0085] Improving performance on the client side;
[0086] Enabling the creation of dynamic, real-time Web applications; and
[0087] Providing the ability to create a wide variety of user interface components.

[0088] With Java, developers can create robust User Interface (UI) components. Custom “widgets” (e.g., real-time stock tickers, animated icons, etc.) can be created, and client-side performance is improved. Unlike HTML, Java supports the notion of client-side validation, offloading appropriate processing onto the client for improved performance. Dynamic, real-time Web pages can be created. Using the abovementioned custom UI components, dynamic Web pages can also be created.

[0089] Sun's Java language has emerged as an industry-recognized language for “programming the Internet.” Sun defines Java as: “a simple, object-oriented, distributed, interpreted, robust, secure, architecture-neutral, portable, high-performance, multithreaded, dynamic, buzzword-compliant, general-purpose programming language. Java supports programming for the Internet in the form of platform-independent Java applets.” Java applets are small, specialized applications that comply with Sun's Java Application Programming Interface (API) allowing developers to add “interactive content” to Web documents (e.g., simple animations, page adornments, basic games, etc.). Applets execute within a Java-compatible browser (e.g., Netscape Navigator) by copying code from the server to client. From a language standpoint, Java's core feature set is based on C++. Sun's Java literature states that Java is basically, “C++ with extensions from Objective C for more dynamic method resolution.”

[0090] Another technology that provides similar function to JAVA is provided by Microsoft and ActiveX Technologies, to give developers and Web designers wherewithal to build dynamic content for the Internet and personal computers. ActiveX includes tools for developing animation, 3-D virtual reality, video and other multimedia content. The tools use Internet standards, work on multiple platforms, and are being supported by over 100 companies. The group's building blocks are called ActiveX Controls, small, fast components that enable developers to embed parts of software in hypertext markup language (HTML) pages. ActiveX Controls work with a variety of programming languages including Microsoft Visual C++, Borland Delphi, Microsoft Visual Basic programming system and, in the future, Microsoft's development tool for Java, code named “Jakarta” ActiveX Technologies also includes ActiveX Server Framework, allowing developers to create server applications. One of ordinary skill in the art readily recognizes that ActiveX could be substituted for JAVA without undue experimentation to practice the invention.

Synchronization Overview

[0091] FIG. 2 illustrates a flowchart delineating a method for synchronizing an event on a plurality of client apparatuses. First, in operation 200, an event is stored in memory on at least one of the client apparatuses. In various embodiments, the memory may take the form of an electromagnetic medium, or any type of optical storage device, i.e. CD-audio. In a primary aspect of the present invention, the memory includes a digital video disc (DVD) (audio or video). Further, for reasons that will soon become apparent, the information includes chapter information associated with the DVD. In such embodiment where the memory is portable, the user may be required to purchase the memory, i.e. DVD, in order to participate in a synchronized event, thus increasing the sale of DVD's.

[0092] It should be noted that the event need not be necessarily stored in memory on all of the client apparatuses, but rather stored on one or some of the client apparatuses and streamed to the remaining client apparatuses at variant rates. This may be feasibly accomplished if the client apparatus(es) containing the stored event has a high-bandwidth connection with the remaining client apparatuses. For example, the client apparatus(es) containing the stored event may include a server that has a connection to a plurality of televisions via a cable network, i.e. WEBTV. Similar functionality may be achieved via a broadcast medium. The present invention is thus flexible by having an ability to host user events and corporative events.

[0093] In one embodiment, the event includes a video and audio presentation such as movie, a concert, and/or a theatrical event. It should be noted, however, that the event may included any recording capable of being played back for entertainment, education, informative or other similar purposes.

[0094] In use, the client apparatuses and a host computer are adapted to be connected to a network. Such network may include a wide, local or any other type of communication network. For example, a wide area network such as the Internet may be employed which operates using TCP/IP or IPX protocols.

[0095] In operation 202, information is transmitted from the host computer to the appropriate client apparatuses utilizing the network. This information allows for the simultaneous and synchronous playback of the event on each of the client apparatuses. In one embodiment, the information may also include a start time when the playback of the event is to begin on each of the client apparatuses. Further, an ending time may be included when the playback of the event is to end on each of the client apparatuses. Still yet, “play” command information may be sent to the client apparatuses at the start time. As an option, input may be received from the user, and used to alter the playback of the event. The host server, or synchronization server, can also control various streams of a variant rate and different hardware associated with those streams.

[0096] The present invention thus has the ability to synchronize video playback for one or multiple (thousands) users from one or multiple physical locations, and to synchronize with external video, audio and/or data streams.

[0097] Users of the present invention are at multiple physical locations and host servers may also be at different locations. The present invention is thus a scalable system which is capable of servicing an unlimited number of users. Since the content is local to the user machine, no high network bandwidth is required.

History Download Capabilities

[0098] FIG. 3 illustrates a flowchart delineating a method for storing synchronization information for subsequent playback of an event. Initially, in operation 300, an event is stored in memory on at least one of the client apparatuses, as set forth earlier. These client apparatuses are adapted to be connected to a network along with a host computer during use.

[0099] In operation 302, information is stored on the host computer(s) for allowing the simultaneous playback of the event on each of the client apparatuses. In one embodiment, the information may include a history and data associated with the synchronous playback. In particular, the history may include any overlaid material (as will be described hereinafter in greater detail), any specific commands affecting the playback of the information, or any other type of general information, i.e. start time, end time, etc.

[0100] In operation 304, the information may be downloaded utilizing the network at any time after the synchronous playback of the event. Such downloaded information may then be used for playback after the simultaneous playback of the event. As such, the present invention has the ability to allow users to download a history and data associated with a particular synchronization event and play it later.

Overlay Synchronization

[0101] FIG. 4 illustrates a flowchart setting forth a method for providing overlays during a synchronized event on a plurality of client apparatuses or any other source. First, in operation 400, a plurality of client apparatuses are connected via a network. In operation 402, an event may be simultaneously played back on the client apparatuses utilizing the network, as set forth earlier.

[0102] During the playback of the event, visual and/or audio material may also be overlaid on the event based on input received from at least one of the client apparatuses. See operation 404. This may be accomplished by transmitting the overlay material from one of the client apparatuses to the host computer or any other server, and multicasting the same to the remaining client apparatuses.

[0103] As an option, the overlay material may include annotations on a display of the client apparatus. For example, the overlay material may include sketches which are inputted by way of a stylus-based input screen or a keyboard or the like, along with a voiceover inputted by way of a microphone or voice synthesizer. Such capability may also be quite valuable in an educational environment.

[0104] In one embodiment, the overlay material may also be displayed on each of the client apparatuses utilizing the network. This allows each of the users to experience the overlay in real-time during the simultaneous playback of the event. As an option, the user inputting the overlay material may select which users may experience the overlay material. The client apparatus that provided the overlay material may also be identified to the users experiencing the overlay material.

[0105] It should be noted that various bi-directional communication may be enabled for allowing data to travel to and from the server. For instance, the playback of the event on the client apparatuses may be altered in any feasible way based on input from a user.

Late Synchronization

[0106] FIG. 5 illustrates a flow diagram for delayed synchronization of an event on a plurality of client apparatuses. First, in operation 500, a plurality of client apparatuses are connected via a network and an event is stored in memory on the client apparatuses. The event is then simultaneously played back on the client apparatuses utilizing the network, as set forth earlier. Note operation 502.

[0107] During the simultaneous playback, a request may be received from one of the client apparatuses for that particular to be included in the synchronized event, as set forth in operation 504. This request may be received after the synchronized event has already begun while it is still playing. Further, the request may be submitted via a site on a network, i.e. website.

[0108] In response to the request, information is transmitted in operation 506 to the requesting client apparatus utilizing the network. This information is adapted for identifying a location in the memory where the event is currently being played back. This allows the simultaneous playback of the event on the requesting client apparatus.

[0109] The end users are thus able to come in at a later time and to be synchronized with the event. Targeted synchronization and various filters criteria can be applied to target different audiences. Also language and cultural differences can be taken into account. Still yet, the present invention may be adapted to address users on different hardware platforms (MAC, PC, set-top boxes). This may be accomplished by identifying the user using a cookie, a user profile which is identified by way of a log in, or a Bum Cut Area (BCA) of the disc.

[0110] An example setting forth details relating to identifying DVDs will now be set forth. First, a content owner (such as studio) requests use of the BCA on their DVDs. Based on request, the replicator (examples include WAMO, Panasonic, Nimbus, Technicolor, Pioneer, Crest) adds unique BCA number to every DVD. Adding BCA number to each DVD requires a special (YAG) laser. This may be the very last step in the manufacturing process. The BCA numbers for a specific DVD must then be entered into InterActual's BCA database. Information to track includes: DVD title, i.e. “Lost in Space”; BCA #/range, i.e. 12345687890; and Shipping Packaging/Tracking Container, i.e. Box 52221 to Hollywood Video.

[0111] After the BCA number is added to the DVDs, the DVDs are packaging/boxed for distribution to either the Distributor or the Retailer. It should be noted that many companies take multiple forms, so the replicator and distributor may be one in the same. Also, some retailers are large/important enough to get shipments directly from replicator. The way in which the DVDs are packaging/shipped is very important because one must track the BCA numbers to actual shipping containers (box, etc.). Therefore tracking information must also be added to the BCA database.

[0112] If packaged DVDs are then sent to distributor, the distributor also has mechanisms, i.e. scanners, input device, and monitoring devices, in place for tracking based on their distribution. For example, Deluxe may receive a “package” of 100,000 copies of “Lost in Space.” However, the distributor ships 10,000 to Retailer A and 5,000 to Retailer B. The distributor should be able to “input” retailer A and B's distribution information into the system. Ideally, this becomes a seamless/automated process.

[0113] Once the DVDs reach the retailer (either from the replicator or distributor), then DVDs may be further divided and distributed to local stores/outlets. In such a situation, the retailer should be able to automatically “track” distribution of these DVDs through to their stores. Over time, all three entitities (replicator, distributor, and retailer) are able to add tracking information to BCA database. Due to complexity and dependencies on existing business systems, the retail tracking concept will be rolled out in phases: replicator first most likely with key retail accounts. The distributors will be brought in. Retailers will then begin to embrace the ability to track based on local outlet/store.

[0114] By the foregoing design, easy deployment is thus afforded and minimal hardware is required to allow the synchronization of content without significant capital investments and with a very efficient control mechanism. The content delivery does not rely on high network bandwidth and is independent from the synchronization.

[0115] Internet Server Application Program Interface (ISAPI) extensions will be used on the server. ISAPI extensions provide a mechanism to maintain a temporary or permanent connection with the users. These connections allow the Synchronization Server to process request and to send the appropriate DVD commands. The permanent connections are known as “Keep Alive” connections. ISAPI extension can also be used as an HTTP interface to a more traditional server, with all data returned as text.

[0116] On the client side the approach is to use, but not limited to Java 1.1 applets, to initiate event start-up for the Synchronization server. The advantage of using Java 1.1 applets is to achieve platform independence for existing and future Java-enabled devices. JavaScript will be used to provide user interface navigation by “wrapping” the applet.

[0117] An ISAPI (Internet Server Application Program Interface) is a set of Windows program calls that let one write a Web server application that will run faster than a Common Gateway Interface (CGI) application. A disadvantage of a CGI application (or “executable file,” as it is sometimes called) is that each time it is run, it runs as a separate process with its own address space, resulting in extra instructions that have to be performed, especially if many instances of it are running on behalf of users.

[0118] Using ISAPI, you create a Dynamic Link Library (DLL) application file that can run as part of the Hypertext Transport Protocol (HTTP) application's process and address space. The DLL files are loaded into the computer when HTTP is started and remain there as long as they are needed; they don't have to be located and read into storage as frequently as a CGI application.

[0119] Existing CGI applications can be converted into ISAPI application DLLs without having to rewrite their logic. However, they do need to be written to be thread-safe so that a single instance of the DLL can serve multiple users.

[0120] A special kind of ISAPI DLL is called an ISAPI filter, which can be designated to receive control for every HTTP request. One can create an ISAPI filter for encryption or decryption, for logging, for request screening, or for other purposes.

[0121] One can write ISAPI server extension DLLs (ISAs) that can be loaded and called by the HTTP server. Users can fill out forms and click a submit button to send data to a Web server and invoke an ISA, which can process the information to provide custom content or store it in a database. Web server extensions can use information in a database to build Web pages dynamically, and then send them to the client computers to be displayed. An application can add other custom functionality and provide data to the client using HTTP and HTML.

[0122] One can write an ISAPI filter. The filter is also a DLL that runs on an ISAPI-enabled HTTP server. The filter registers for notification of events such as logging on or URL mapping. When the selected events occur, the filter is called, and one can monitor and change the data (on its way from the server to the client or vice versa). ISAPI filters can be used to provide custom encryption or compression schemes, or additional authentication methods.

[0123] Both server extensions and filters run in the process space of the Web server, providing an efficient way to extend the server's capabilities.

Overall Component Design

[0124] The various functional components of the software associated with the present invention will now be set forth. Such components include a Java/JavaScript Component, Synchronizer Component, LayerImpl Component, Business Layer Component, Configuration Manager Component, and DBConnect Component.

Java/JavaScript Component

[0125] FIG. 6 illustrates a flow diagram for providing information on a synchronized event on a plurality of client apparatuses in accordance with one embodiment of the present invention. First, in operation 600, a plurality of client apparatuses are connected via a network, as set forth earlier. Next, an application program is embedded on a site on the network in operation 602. Such application program may take the form of a JAVA applet, and the site may include a website on the Internet.

[0126] In use, information is requested from a server on the network utilizing the application program. See operation 604. Such information relates to an event to be played back simultaneously on the client apparatuses and may include general information such as a start and stop time of the event, or more specific information about the event itself.

[0127] In response to such request, a script is received for displaying the information. Note operation 606. The script may take any form such as Perl, REXX (on IBM mainframes), and Tcl/Tk, and preferably includes a JAVAscript.

[0128] In one embodiment of the present invention, the JAVA applet may be further adapted to send a request to retrieve command information from the server for use with a playback device of one of the client apparatuses. The commands may be adapted to playback the event on the playback device simultaneous with the playback of the event on the remaining client apparatuses. Further, the commands may include a start time when the playback of the event is to begin on each of the client apparatuses.

[0129] The JAVA applets and JAVAscript are used to communicate with the playback device of the client apparatuses. In one embodiment, the playback device includes a PCFriendly TM video player manufactured by Interactual®.

[0130] The Java applet is embedded within a web page and uses HTTP protocol to communicate to the synchronization server. The applet could request event information from the server, and display it to the user via JavaScript. The applet could also send a “Broadcast VideoEvent” request to retrieve DVD commands that can be passed to the video component, as set forth hereinabove.

Synchronizer Component

[0131] FIG. 7 illustrates a method for creating a synchronizer object in order to playback an event simultaneously on a plurality of client apparatuses. The synchronizer object is portion of the software that actually implements the synchronization procedure. First, in operation 700, a request is received utilizing a network for viewing an event. Next, the request is queued in memory in operation 702.

[0132] In response to the request, in operation 704, an object is created which is adapted to playback the event on a client apparatus simultaneous with the playback of the event on the remaining client apparatuses upon the receipt of activation signal. As an option, the activation signal may be provided using a clock of the client apparatus, or located at a different location, i.e. server. To accomplish this, the object identifies a start time when the playback of the event is to begin on each of the client apparatuses.

[0133] In operation 706, the object is sent to one of the client apparatuses utilizing the network for being stored therein. In accordance with a primary aspect of the present invention, the object may be adapted to playback the event which is stored in memory of the client apparatus. This may be accomplished by activating a digital video disc (DVD) player.

[0134] In summary, when the Synchronizer component receives a “BroadcastVideoEvent” from the applet, it then places the request in the thread queue for processing. To process a request, the thread creates a “call back” object, if one does not exist for this event. The thread then adds the request to the “call back” object queue. This “call back” object will be invoked when it is time to play the DVD. The Synchronizer component creates a Call Back COM object, LayerSink. The Synchronizer component is also responsible for creating the LayerFactory interface which will be set forth hereinafter in greater detail.

LayerImpl Component

[0135] FIG. 8 illustrates a flowchart for affording a scheduler object adapted to facilitate the playback of an event simultaneously on a plurality of networked client apparatuses. The present method ensures that critical information is tracked during the synchronization of the event. Such critical information not only ensures proper synchronization, but also enables various peripheral features.

[0136] First, in operation 800, various values are determined including a current time, a start time when an event is to start, and a stop time when the event is to end. Thereafter, a length of the event is calculated based on the start time and the stop time in operation 802. As an option, the current time is determined by querying a clock of one of the client apparatuses.

[0137] If any portion of the length of the event takes place during a predetermined threshold period, a command is stored in memory in operation 804. The command may be adapted to automatically begin playing back the event at the start time. In one embodiment, the threshold period includes the time the users can be queued before the event. As an option, chapter information may be stored in the memory if any portion of the length of the event takes place during the predetermined threshold period. This allows the command to automatically begin playing back the event at a predetermined chapter.

[0138] In operation 806, a loop is created at the start time during which a lapsed time of the event is tracked. This information may be used for various tracking purposes to decide when to issue commands to the user. In another embodiment, a second loop may be created upon the beginning of a chapter during which information on a next chapter is retrieved.

[0139] The “call back” object (LayerSink) is thus responsible for creating and communicating with the LayerImpl component. The LayerImpl component acts as a scheduler, determining when to issue commands to the user.

[0140] LayerImpl will issue different DVD commands, based on the type of decoder the user has in their PC. LayerImpl will differentiate between the decoders by using the decoder information submitted from the client. The LayerImpl will pass the correct DVD command to the client, based on the decoder's capabilities. For example, if the decoder does not support the TimePlay event, then the server may send a ChapterPlay event and wait appropriately.

[0141] The following is an enumerated summary of the steps the component uses to determine when the users will receive the DVD commands:

[0142] 1. Retrieves the current time, and the time the event starts and ends.
[0143] 2. Calculates the length of the event.
[0144] 3. If the event is within a threshold period (i.e. the time users can be queued before the event), then store the first DVD command in memory. Also, store the Chapter information in memory.
[0145] 4. Create a loop that processes request until the event has completed.
[0146] 5. In the loop, calculate the lapsed time of the event.
[0147] 6. In the loop, retrieve the next chapter information.
[0148] 7. Create another loop that will loop until time for the next chapter to be played.
[0149] 8. When the next chapter is ready to play, send the command that was retrieved from the Chapter table.
Business Layer Component

[0150] FIG. 9 is a flowchart delineating a method for identifying a plurality of events which are played back simultaneously on a plurality of networked client apparatuses. This features is important since a host server may be synchronizing more than one event at once, or during overlapping times. Such events must therefore be distinguished.

[0151] First, in operation 900, a plurality of events are stored in memory on a plurality of client apparatuses. Each of the events is assigned a unique identifier which is stored in the memory.

[0152] In operation 902, the client apparatuses are adapted to be coupled to a host computer via a network, as set forth hereinabove. In operation 904, the identifier of the event which is stored in the memory of the client apparatuses is then retrieved utilizing the network. Such identifier is subsequently compared with an identifier of a scheduled event, as set forth in operation 906. If the comparison renders a match, the playback of the event is begun on the appropriate client apparatuses. Note operation 908.

[0153] CbusinessLayer thus differentiates events by the disk and location ids, uploaded by the client to guarantee backwards compatibility. As set forth earlier, late arrivals can always re-sync with the event.

Configuration Manager Component

[0154] FIG. 10 shows a flowchart delineating a technique for identifying playback devices of a plurality of client apparatuses which are networked to simultaneously playback an event. The present technique is important since the playback devices of the various client apparatuses may differ in make and model. Thus, different commands are required therefor.

[0155] In operation 1000, a type of the playback devices of the client apparatuses is first identified. Such “type” may refer to a make, model, or any other distinguishing characteristic of the particular playback devices. A command associated with the identified type of the playback device is then looked up in a look-up table. Note operation 1002. Such table may be located at the host server, or at any other location such as the client apparatuses.

[0156] Thereafter, in operation 1004, the command is sent to the corresponding client apparatus for beginning the playback of the event simultaneously with the playback of the event on each of the remaining client apparatuses.

[0157] This component is thus responsible for identifying what type of reference player is hosting the event. The reference player can be the database, which contains the DVD commands or a real time player. When the initial DVD is command is requested, the “Synchronizer” table is queried for the host type. From that point forward, the scheduler would know from whom to receive data.

DBConnect Component

[0158] This component is responsible for communicating with the Synchronizer tables, and for providing access methods for the retrieved data. All interaction from the tables is on a read-only basis. The LayerImpl component communicates with this component to retrieve DVD commands and event information.

[0159] Even though current implementation may be based on a Microsoft platform, hard dependencies on Microsoft or any other 3rd-party development tools may be avoided. To address such issues, the following considerations may be made throughout the code:

[0160] MFC specific code may be avoided. Instead, STL may be used. ATL and/or MFC code may be encapsulated into separate classes and portioned from the rest of the code. Class implementations may use aggregation pattern to delegate business logic to the portable classes. Database connection classes maybe separated and the communication protocol may be separated with respect to portability to Oracle and other platforms.

[0161] FIGS. 11 and 12 illustrate the order of events among the various components of the present invention. In particular, FIG. 11 illustrates the manner in which a layer factory is created. As shown, an event is first checked in a database server after which a business layer is created in a WEB server in a manner set forth hereinabove. The foregoing components are then created. FIG. 12 illustrates the manner in which user requests are processed. As shown, communication is afforded with the video player on the client machine by means of JAVAscript and JAVA applets. The WEB server, in turn, communicates DVD commands to the video player via the JAVA applets, and also interfaces the database server via the various components thereof which were set forth hereinabove.

Alternate Embodiments

[0162] To support future enhancements, further components may be included with extendibility as the major objective. Various future enhancements of the product and how they will be addressed will now be set forth.

- [0163] Hosted Real Time Players

[0164] While spirals may retrieve pre-recorded DVD commands from the database, alternate spirals may support a consumer as a host. The architecture may also support plug-in components. Alternate spirals may support the RealTimeConnector component, which accepts host user request and forwards them to the clients. The instant architecture supports the DBConnector which accepts events from the database.

- [0165] Keep Alive Connections

[0166] Clients may maintain connections throughout the event. This allows the host to send a various number of commands to the client of the event. Although the spiral disconnects users once a PLAY command has been issued, the Synchronizer class (which will be set forth later) adds each connection to a Thread Pool. This pool of connections can be left open during the life of the event.

- [0167] Logging Participants

[0168] Each request may be logged into the database to provide a reference for the future.

- [0169] DVD Positioning

[0170] As an option, connections may be pooled to allow the synchronization server to direct consumer's machines to the certain locations throughout the entire event.

[0171] Synchronization events in alternate spirals may be defined as a combination of play from location event and the actual event. This way, one describes each event in the unambiguous way on the client side and synchronizes it with the server. For example, a situation may be considered where one fast forwards after a movie is played for 15 min and thereafter plays the scene in the movie. In such situation, one has to submit the information to the client player, indicating that it (player) has to start time play from 15 min into the movie and fast-forward to the certain location. A better way would be to analyze what is the next event after fast forwarding occurred and perform a combination for the play from location and next event. This design would require significant changes to the client infrastructure, including video object, remoteagent and provider and should be taken into consideration in any alternate client design.

Classes/Component Diagrams

[0172] FIGS. 13-16 illustrate various class/component diagrams. In particular, FIGS. 13-16 illustrate a Synchronizer Class Diagram 1300, LayerImpl Class Diagram 1400, Business Layer Class Diagram 1500, and DBConnect Class Diagram 1600, respectively.

Sequence Diagrams

[0173] FIG. 17 illustrates a logical sequence diagram 1700. As shown, when the server receives a user request, it analyzes the authentication information of the request (date/time, disc id, user id, and BCA number) and the appropriate synchronization event stored in the database. The database contains an event start threshold value measured in milliseconds. This threshold defines the amount of time prior to an event that a consumer is eligible to “connect” for the start of the event.

[0174] If the date/time of the user request lies within the event start threshold, the user is put into wait queue and receive the appropriate data when the time elapses. Note steps 1,2,3,5,6,7 of the Logical Sequence diagram. Otherwise, a message is sent informing the user when the event will occur. Note step 4 of the Logical Sequence diagram.

Server Side Collaboration Diagram

[0175] FIG. 18 illustrates a logical sequence diagram 1800 that shows server side collaboration. As shown, server ISAPI extension receives a BroadcastVideoEvents request. It calls IA_BusinessServer via BeginProcess, to retrieve configuration information. Configuration information contains a playback connector. Playback connector identifies whether the server will have to communicate with a reference player or will it perform playback from the database.

[0176] At step 6, ISAPI extension will call IA_BusinessServer CompareTime method and based on the results will send to the user a predefined web page indicating to retry later or return control to the web server, notifying it (web server) to keep the connection open. At this point connection is pooled and will be processed by the IA_BusinessServer at a time of the event.

Client Collaboration Diagram

[0177] FIG. 19 illustrates a logical sequence diagram 1900 showing client side collaboration in accordance with one embodiment of the present invention.

Classes/Interfaces Definition

[0178] Definitions of one embodiment of the various classes associated with the software which implements the present invention will now be set forth.

Class Applet1

- [0179] Purpose:

[0180] This is the class that implements the applet. The browser will use it to bootstrap our applet.

- [0181] Responsibilities:
- [0182] Request a BroadCastVideo event and to gather event status information.
- [0183] Collaborations:

[0184] BroadCastEvent, CITIEncrypt

- [0185] Base class and implemented interfaces:

[0186] Javax.Applet

- [0187] Public interface:
[0188] getChapter Returns the current chapter the reference player is playing.
[0189] Return type: String
[0190] Parameters: void
[0191] Pre-conditions: None.
[0192] Post-conditions: None.
[0193] getTitleInfo Returns the current title the reference player is playing
[0194] Return type: String
[0195] Parameters: void
[0196] Pre-conditions: None.
[0197] Post-conditions: None.
[0198] getStartTime Returns the time the event is scheduled to start
[0199] <SS:MM:HH:DD:MM:YYYY>
[0200] Return type: String
[0201] Parameters: void
[0202] Pre-conditions: None.
[0203] Post-conditions: None.
[0204] getStartTimeSec Returns the time the event starts in seconds.
[0205] Return type: String
[0206] Parameters: void
[0207] Pre-conditions: None.
[0208] Post-conditions: None.
[0209] getStartTimeMinReturns the time the event starts in minutes.
[0210] Return type: String
[0211] Parameters: void
[0212] Pre-conditions: None.
[0213] Post-conditions: None.
[0214] getStartTimeHrReturns the time the event starts in Hours.
[0215] Return type: String
[0216] Parameters: void
[0217] Pre-conditions: None.
[0218] Post-conditions: None.
[0219] GetStartTimeDay Returns the time the event starts in days.
[0220] Return type: String
[0221] Parameters: void
[0222] Pre-conditions: None.
[0223] Post-conditions: None.
[0224] GetStartTimeMnth Returns the time the event starts in months.
[0225] Return type: String
[0226] Parameters: void
[0227] Pre-conditions: None.
[0228] Post-conditions: None.
[0229] GetStartTimeYr Returns the time the event starts in year.
[0230] Return type: String
[0231] Parameters: void
[0232] Pre-conditions: None.
[0233] Post-conditions: None.
[0234] GetLenOfEvent Returns the length of the event.
[0235] Return type: String
[0236] Parameters: void
[0237] Pre-conditions: None.
[0238] Post-conditions: None.
[0239] GetExpiredTime: Returns lapse time of the event.
[0240] Return type: String
[0241] Parameters: void
[0242] Pre-conditions: None.
[0243] Post-conditions: None.
[0244] getServerTime: Returns the servers current time <SS:MM:HH:DD:MM:YYYY>.
[0245] Return type: String
[0246] Parameters: void
[0247] Pre-conditions: None.
[0248] Post-conditions: None.
[0249] getServerTimeSec: Returns the servers current in seconds.
[0250] Return type: String
[0251] Parameters: void
[0252] Pre-conditions: None.
[0253] Post-conditions: None.
[0254] getServerTimeMin: Returns the servers current in minutes.
[0255] Return type: String
[0256] Parameters: void
[0257] Pre-conditions: None.
[0258] Post-conditions: None.
[0259] getServerTimeHr: Returns the servers current in hours.
[0260] Return type: String
[0261] Parameters: void
[0262] Pre-conditions: None.
[0263] Post-conditions: None.
[0264] getServerTimeDay: Returns the servers current in day.
[0265] Return type: String
[0266] Parameters: void
[0267] Pre-conditions: None.
[0268] Post-conditions: None.
[0269] getServerTimeMnth: Returns the servers current in month.
[0270] Return type: String
[0271] Parameters: void
[0272] Pre-conditions: None.
[0273] Post-conditions: None.
[0274] getServerTimeYr: Returns the servers current in year.
[0275] Return type: String
[0276] Parameters: void
[0277] Pre-conditions: None.
[0278] Post-conditions: None.
[0279] startProc: Calls the ISAPIs “ServerInfo” method.
[0280] Return type: void
[0281] Parameters: String disk id, String location id
[0282] Pre-conditions: None.
[0283] Post-conditions: None.
[0284] msgEvent: Calls BroadCastEvent applet.
[0285] Return type: void
[0286] Parameters: void
[0287] Pre-conditions: None.
[0288] Post-conditions: None.
Class BroadCastEvent
- [0289] Purpose:

[0290] This is the class that invokes the Synchronizer.

- [0291] Responsibilities:
- [0292] Sets the JavaScript with the command returned from the server.
- [0293] Collaborations:

[0294] CITEEncrypt

- [0295] Base class and implemented interfaces:

[0296] Java.Thread

Class CDBConnect

- [0297] Purpose:

[0298] This is the class provides a public interface for components to request information from the DB tables.

- [0299] Responsibilities:
- [0300] Opens the database and Synchronizer, Chapter_Disk tables.
- [0301] Queries the Synchronizer by the specified disk id and location id.
- [0302] Queries the Chapter_Disk by disk id.
- [0303] Provides the next chapter that is scheduled to play.
- [0304] Queries the Decoder_Capabilities table to determine if the requested player is time or chapter play.
- [0305] Collaborations:
[0306] DBSyncSet
[0307] DBReferenceSet
[0308] CDBChapterSet
[0309] CDecoderCapabilities
- [0310] Base class and implemented interfaces:
- [0311] Public interface:
[0312] Get_NextChapter: Returns the next chapter to play.
[0313] Return type: String
[0314] Parameters: long time, long title, BSTR Chapter
[0315] Pre-conditions: None.
[0316] Post-conditions: None.
[0317] chkevent: Checks if an event is scheduled for the disk and location id.
[0318] Return type: String
[0319] Parameters: long time, long title, BSTR Chapter
[0320] Pre-conditions: None.
[0321] Post-conditions: None.
[0322] get_initialDVDCommand: Returns the first DVD command to play.
[0323] Return type: String
[0324] Parameters: BSTR &
[0325] Pre-conditions: None.
[0326] Post-conditions: None.
[0327] get_nextDVDCommand: Returns the next DVD command to play.
[0328] Return type: String
[0329] Parameters: BSTR &
[0330] Pre-conditions: None.
[0331] Post-conditions: None.
[0332] decoderArray: Returns an array of decoder types.
[0333] Return type: String
[0334] Parameters: long **, long **
[0335] Pre-conditions: None.
[0336] Post-conditions: None.
Class CCConfigMgrImpl
- [0337] Purpose:

[0338] This is the class provides a public interface for components to determine the type of reference player hosting the event.

- [0339] Responsibilities:
- [0340] Opens the database and Synchronizer, Chapter_Disk tables.
- [0341] Queries the Synchronizer by the specified disk id and location id.
- [0342] Stores the reference player type.
- [0343] Collaborations:
  CConfigMgrRecSet
- [0344] Base class and implemented interfaces:
- [0345] Public interface:
[0346] get_hostType: Returns the reference player host type.
[0347] Return type: String
[0348] Parameters: short
[0349] Pre-conditions: None.
[0350] Post-conditions: None.
Class threadFunctor
- [0351] Purpose:

[0352] This class provides a threading model that classes can use to derive.

- [0353] Responsibilities:
- [0354] Calls the CreateEvent function, which opens a named or unnamed event objec.
- [0355] Calls_beginthread, which creates a thread begins execution of a routine at start_address. The routine at start_address must use the_cdecl calling convention and should have no return value. When the thread returns from that routine, it is terminated automatically.
- [0356] Calls the WaitForSingleObject function, which checks the current state of the specified object. If the object's state is nonsignaled, the calling thread enters an efficient wait state.
- [0357] Calls the ResetEvent function, which sets the state of the specified event object to nonsignaled.
- [0358] The state of an event object remains nonsignaled until it is explicitly set to signaled by the SetEvent or PulseEvent function.
- [0359] Collaborations:
  CConfigMgrRecSet
- [0360] Base class and implemented interfaces:
- [0361] Public interface:
[0362] start: Starts the thread.
[0363] Return type: void
[0364] Parameters: void
[0365] Pre-conditions: None.
[0366] Post-conditions: None.
[0367] stop: Stops the thread. Calls CloseHandle for the thread and event.
[0368] Return type: void
[0369] Parameters: void
[0370] Pre-conditions: None.
[0371] Post-conditions: None.
Class isapithread
- [0372] Purpose:

[0373] This creates an ISAPI thread.

- [0374] Responsibilities:
- [0375] a Adds a request to a vector.
- [0376] Creates the sink object.
- [0377] a Stores the request into sink object.
- [0378] Sends the time information to JavaScript.
- [0379] Collaborations:
[0380] LayerSink
[0381] factorySink
- [0382] Base class and implemented interfaces:
[0383] threadFunctor
- [0384] Public interface:
[0385] addrequest: Adds the request to its vector.
[0386] Return type: void
[0387] Parameters: void
[0388] Pre-conditions: None.
[0389] Post-conditions: None.
[0390] getBLayerInfo: Responsible for getting information about the event.
[0391] Return type: void
[0392] Parameters: std:string&,std::string&, ChttpServerContext*
[0393] Pre-conditions: None.
[0394] Post-conditions: None.
Class factorySink
- [0395] Purpose:

[0396] Manages the layerSink and businessLayerProp objects.

- [0397] Responsibilities:
- [0398] Stores a layerSink object.
- [0399] Returns the “businesssLayerProp”<Business Layer Properties>
- [0400] Creates the “businessLayerProp”<Business Layer structure>
- [0401] Collaborations:
[0402] LayerSink
[0403] businessLayerProp
- [0404] Base class and implemented interfaces:
- [0405] Public interface:
[0406] construct: Stores a layerSink object.
[0407] Return type: void
[0408] Parameters: void
[0409] Pre-conditions: None.
[0410] Post-conditions: None.
[0411] notifyCreateLayer: Responsible for creating a “businessLayerProp”.
[0412] Return type: void
[0413] Parameters: BSTR, BSTR, DATE, DATE, LONG
[0414] Pre-conditions: None.
[0415] Post-conditions: None.
Class layerSink
- [0416] Purpose:

[0417] layerSink represents a sink interface and stores a queue of requests. It creates a connection point object.

[0418] This call back object, allows asynchronously processing.

- [0419] Responsibilities:
- [0420] Acts as the client sink object.
- [0421] Sends the results to the user
- [0422] Creates the “BusinessLayer” and makes it a connection point object.
- [0423] Closes the users connection.
- [0424] Creates a Factory interface by calling “createFactory”.
- [0425] Creates a connection point for the factory.
- [0426] Stores the LayerSink in the FactorySink object.
- [0427] Creates a connection point (call back) by calling AtlAdvise, between the connection point container and the client sink object. This allows the client to receive events.
- [0428] Calls the connectable objects “getServerLayer”. This method fires an event to the clients sink object.
- [0429] Create a business layer,
- [0430] Store the request in its vector.
- [0431] Release the Sink Object (client)
- [0432] Calls AtlUnadvise to terminates the ability of the client to receive events.
- [0433] Collaborations:
- [0434] Base class and implemented interfaces:
- [0435] Public interface:
[0436] construct: Creates a connection point.
[0437] Return type: void
[0438] Parameters: void
[0439] Pre-conditions: None.
[0440] Post-conditions: None.
[0441] addRequest: Adds the request to its vector.
[0442] Return type: void
[0443] Parameters: BSTR, BSTR, DATE, DATE, LONG
[0444] Pre-conditions: None.
[0445] Post-conditions: None.
[0446] createBusinessLayer: Creates a business layer. Create the connection point.
[0447] Return type: void
[0448] Parameters: businessLayerProp &
[0449] Pre-conditions: None.
[0450] Post-conditions: None.
[0451] updatetime: This call back function translates the time and sends the command to the user.
[0452] Return type: void
[0453] Parameters: long,long
[0454] Pre-conditions: None.
[0455] Post-conditions: None.
Class CBusinessLayer
- [0456] Purpose:

[0457] Creates a layerthread object. This object is responsible for providing access methods, which provide event information.

- [0458] Responsibilities:
- [0459] The “Synchronizers” createBusinessLayer method creates a class object from the “IBusinessLayer” interface. <The class object is part of the LayerImpl project>
- [0460] The BusinesLayers class object <m_ilayer> calls its “Initialize” method. <Note: m_ilayer is the connection point object. It identifies the “Sink Interface”.
- [0461] It then calls the “Initialize” method of the connection point.
- [0462] The “initialize” method then calls the “ChkValidEvent” method, which then creates a layerthread object.
- [0463] Collaborations:
[0464] CBusinessLayer
[0465] layerthread
- [0466] Base class and implemented interfaces:
- [0467] Public interface:
[0468] Initialize: Calls the “ChkValidEvent” method which kicks of a layer thread.
[0469] Return type: void
[0470] Parameters: void
[0471] Pre-conditions: None.
[0472] Post-conditions: None.
Class layerthread
- [0473] Purpose:

[0474] This object acts as a scheduler, processing request from its queue.

- [0475] Responsibilities:
- [0476] Send DVD commands to the user.
- [0477] “Syncs” up late comers to the events.
- [0478] Collaborations:
[0479] CBusinessLayer
[0480] CDBConnect
- [0481] Base class and implemented interfaces:
- [0482] Public interface:
[0483] startThread: Processes requests from the queue
[0484] Return type: void
[0485] Parameters: void
[0486] Pre-conditions: None.
[0487] Post-conditions: None.
Class CLayerFactory
- [0488] Purpose:

[0489] This object manages businesslayer objects. Business layer objects communicate with the reference player and notify the user which DVD command to play.

- [0490] Responsibilities:
- [0491] Send DVD commands to the user.
- [0492] “Syncs” up late comers to the events.
- [0493] This object Implements the IID_LayerFactory interface.
- [0494] This COM object is the servers Connectable Point object.
- [0495] This server object supports connections to sink interfaces. These sink interfaces reside on the client side and are equivalent to the “call back” functions in Windows.
- [0496] Collaborations:
[0497] CBusinessLayer
[0498] CDBConnect
- [0499] Base class and implemented interfaces:
- [0500] Public interface:
[0501] getServerLayer: “Fires” an event to create a business layer with the properties
[0502] retrieved from the pipe object.
[0503] Return type: void
[0504] Parameters: void
[0505] Pre-conditions: None.
[0506] Post-conditions: None.
[0507] put_set_layer: call the “CLayerFactoryImpl” add() method. Supplying the “businesslayer” object.
[0508] This will added to shared memory queue and written to a file.
[0509] Return type: void
[0510] Parameters: void
[0511] Pre-conditions: None.
[0512] Post-conditions: None.
[0513] FinalConstruct: Calls the “CLayerFactoryImpl” FinalConstruct COM class object.
[0514] Return type: void
[0515] Parameters: void
[0516] Pre-conditions: None.
[0517] Post-conditions: None.

[0518] Although only a few embodiments of the present invention have been described in detail herein, it should be understood that the present invention may be embodied in many other specific forms without departing from the spirit or scope of the invention. Therefore, the present examples and embodiments are to be considered as illustrative and not restrictive, and the invention is not to be limited to the details given herein, but may be modified within the scope of the appended claims.

Claims

1. A method for synchronizing an event on a plurality of client apparatuses, comprising the steps of:

(a) connecting a plurality of client apparatuses via a network;

(b) embedding an application on a site on the network;

(c) sending information from a server on the network utilizing the application program, wherein the information relates to a scheduled event to be played back simultaneously on the client apparatuses;

(d) sending a script for displaying the information; and

(e) sending an object for allowing the scheduled event to be played back simultaneously on the client apparatuses, the object adapted to start the scheduled event simultaneously on the plurality of client apparatuses upon detection of an activation signal.

2. A method as recited in claim 1, wherein the application program is further adapted to send a request to retrieve commands from the server for use with a playback device of one of the client apparatuses.

3. A method as recited in claim 2, wherein the playback device includes a digital video disc (DVD) player.

4. A method as recited in claim 2, wherein the commands are adapted to playback the scheduled event on the playback device simultaneous with the playback of the scheduled event on the remaining client apparatuses.

5. A method as recited in claim 2, wherein the command includes a start time when the playback of the scheduled event is to begin on each of the client apparatuses.

6. A method as recited in claim 1, wherein application program is a JAVA applet and the script is JAVAscript.

7. A computer program embodied on a computer readable medium for synchronizing an event on a plurality of client apparatuses, comprising:

(a) a code segment for connecting a plurality of client apparatuses via a network;

(b) a code segment for embedding an application program on a site on the network;

(c) a code segment for sending information from a server on the network utilizing the application program, wherein the information relates to a scheduled event to be played back simultaneously on the client apparatuses;

(d) a code segment for sending a script for displaying the information; and

(e) a code segment for sending an object for allowing the scheduled event to be played back simultaneously on the client apparatuses, the object adapted to start the scheduled event simultaneously on the plurality of client apparatuses upon detection of an activation signal.

8. A computer program as recited in claim 7, wherein the application program is further adapted to send a request to retrieve commands from the server for use with a playback device of one of the client apparatuses.

9. A computer program as recited in claim 8, wherein the playback device includes a digital video disc (DVD) player.

10. A computer program as recited in claim 8, wherein the commands are adapted to playback the scheduled event on the playback device simultaneous with the playback of the scheduled event on the remaining client apparatuses.

11. A computer program as recited in claim 8, wherein the command includes a start time when the playback of the scheduled event is to begin on each of the client apparatuses.

12. A computer program as recited in claim 7, wherein application program is a JAVA applet and the script is JAVAscript.

13. A system for synchronizing an event on a plurality of client apparatuses, comprising:

(a) logic for connecting a plurality of client apparatuses via a network;

(b) logic for embedding an application program on a site on the network;

(c) logic for sending information from a server on the network utilizing the application program, wherein the information relates to a scheduled event to be played back simultaneously on the client apparatuses;

(d) logic for sending a script for displaying the information; and

(e) logic for sending an object for allowing the scheduled event to be played back simultaneously on the client apparatuses, the object adapted to start the scheduled event simultaneously on the plurality of client apparatuses upon detection of an activation signal.

14. A system as recited in claim 13, wherein the application program is further adapted to send a request to retrieve commands from the server for use with a playback device of one of the client apparatuses.

15. A system as recited in claim 14, wherein the playback device includes a digital video disc (DVD) player.

16. A system as recited in claim 14, wherein the commands are adapted to playback the scheduled event on the playback device simultaneous with the playback of the scheduled event on the remaining client apparatuses.

17. A system as recited in claim 14, wherein the command includes a start time when the playback of the scheduled event is to begin on each of the client apparatuses.

18. A system as recited in claim 13, wherein application program is a JAVA applet and the script is JAVAscript.

Patent Citations (217)

Patent	Date	Inventor	Cited By
US4672572(A)	1987-06-01	Alsberg	Applicant
US4709813(A)	1987-12-01	Wildt	Applicant
US4710754(A)	1987-12-01	Montean	Applicant
US4739510(A)	1988-04-01	Jeffers et al.	Applicant
US4888638(A)	1989-12-01	Bohn	Applicant
US4967185(A)	1990-10-01	Montean	Applicant
US4993068(A)	1991-02-01	Piosenka et al.	Applicant
US5023907(A)	1991-06-01	Johnson et al.	Applicant
US5109482(A)	1992-04-01	Bohrman	Applicant
US5128752(A)	1992-07-01	Von Kohorn	Applicant
US5289439(A)	1994-02-01	Koulopoulos et al.	Applicant
US5305195(A)	1994-04-01	Murphy	Applicant
US5305197(A)	1994-04-01	Axler et al.	Applicant
US5347508(A)	1994-09-01	Montbriand et al.	Applicant
US5353218(A)	1994-10-01	De Lapa et al.	Applicant
US5400402(A)	1995-03-01	Garfinkle	Applicant
US5410343(A)	1995-04-01	Coddington et al.	Applicant
US5413383(A)	1995-05-01	Laurash et al.	Applicant
US5420403(A)	1995-05-01	Allum et al.	Applicant
US5457746(A)	1995-10-01	Dolphin	Applicant
US5483658(A)	1996-01-01	Grube et al.	Applicant
US5509074(A)	1996-04-01	Choudhury et al.	Applicant
US5530686(A)	1996-06-01	Schylander et al.	Applicant
US5550577(A)	1996-08-01	Verbiest et al.	Applicant
US5568275(A)	1996-10-01	Norton et al.	Applicant
US5619733(A)	1997-04-01	Noe et al.	Applicant
US5640453(A)	1997-06-01	Schuchman et al.	Applicant
US5640560(A)	1997-06-01	Smith	Applicant
US5642171(A)	1997-06-01	Baumgartner et al.	Applicant
US5651064(A)	1997-07-01	Newell	Applicant
US5659792(A)	1997-08-01	Walmsley	Applicant
US5673195(A)	1997-09-01	Schwartz et al.	Applicant
US5677953(A)	1997-10-01	Dolphin	Applicant
US5694546(A)	1997-12-01	Reisman	Applicant
US5696898(A)	1997-12-01	Baker et al.	Applicant
US5734719(A)	1998-03-01	Tsevdos et al.	Applicant
US5734898(A)	1998-03-01	He	Applicant
US5736977(A)	1998-04-01	Hughes	Applicant
US5751672(A)	1998-05-01	Yankowski	Applicant
USRE35839(E)	1998-07-01	Asai et al.	Applicant
US5790753(A)	1998-08-01	Krishnamoorthy	Applicant
US5801685(A)	1998-09-01	Miller et al.	Applicant
US5802294(A)	1998-09-01	Ludwig et al.	Applicant
US5804810(A)	1998-09-01	Woolley et al.	Applicant
US5805442(A)	1998-09-01	Crater et al.	Applicant
US5808662(A)	1998-09-01	Kinney et al.	Examiner
US5809471(A)	1998-09-01	Brodsky	Applicant
US5812661(A)	1998-09-01	Akiyama et al.	Applicant
US5819284(A)	1998-10-01	Farber	Applicant
US5822291(A)	1998-10-01	Brindze et al.	Applicant
US5825876(A)	1998-10-01	Peterson, Jr.	Applicant
US5857021(A)	1999-01-01	Kataoka et al.	Applicant
US5860068(A)	1999-01-01	Cook	Applicant
US5869819(A)	1999-02-01	Knowles et al.	Applicant
US5872747(A)	1999-02-01	Johnson	Examiner
US5875296(A)	1999-02-01	Shi et al.	Applicant
US5878020(A)	1999-03-01	Takahashi	Applicant
US5878233(A)	1999-03-01	Schloss	Applicant
US5882291(A)	1999-03-01	Bradshaw et al.	Applicant
US5887143(A)	1999-03-01	Saito et al.	Examiner
US5889980(A)	1999-03-01	Smith, Jr.	Applicant
US5892825(A)	1999-04-01	Mages et al.	Applicant
US5892900(A)	1999-04-01	Ginter et al.	Applicant
US5892908(A)	1999-04-01	Hughes et al.	Applicant
US5893910(A)	1999-04-01	Martineau et al.	Applicant
US5895073(A)	1999-04-01	Moore	Applicant
US5899980(A)	1999-05-01	Wilf et al.	Applicant
US5907322(A)	1999-05-01	Kelly et al.	Applicant
US5907704(A)	1999-05-01	Gudmundson et al.	Applicant
US5909551(A)	1999-06-01	Tahara et al.	Applicant
US5913210(A)	1999-06-01	Call	Applicant
US5915093(A)	1999-06-01	Berlin et al.	Applicant
US5920694(A)	1999-07-01	Carleton et al.	Applicant
US5922045(A)	1999-07-01	Hanson	Applicant
US5924013(A)	1999-07-01	Guido et al.	Applicant
US5930238(A)	1999-07-01	Nguyen	Applicant
US5930767(A)	1999-07-01	Reber et al.	Applicant
US5933497(A)	1999-08-01	Beetcher et al.	Applicant
US5940504(A)	1999-08-01	Griswold	Applicant
US5943304(A)	1999-08-01	Kamada et al.	Applicant
US5950173(A)	1999-09-01	Perkowski	Applicant
US5956482(A)	1999-09-01	Agraharam et al.	Applicant
US5960398(A)	1999-09-01	Fuchigami et al.	Applicant
US5969898(A)	1999-10-01	Hansen et al.	Applicant
US5978773(A)	1999-11-01	Hudetz et al.	Applicant
US5987454(A)	1999-11-01	Hobbs	Applicant
US5987525(A)	1999-11-01	Roberts et al.	Examiner
US5991374(A)	1999-11-01	Hazenfield	Applicant
US5991399(A)	1999-11-01	Graunke et al.	Applicant
US5991798(A)	1999-11-01	Ozaki et al.	Applicant
US5995965(A)	1999-11-01	Experton	Applicant
US6006328(A)	1999-12-01	Drake	Applicant
US6009410(A)	1999-12-01	LeMole et al.	Applicant
US6012071(A)	2000-01-01	Krishna et al.	Applicant
US6016166(A)	2000-01-01	Huang et al.	Examiner
US6018768(A)	2000-01-01	Ullman et al.	Applicant
US6021307(A)	2000-02-01	Chan	Applicant
US6034937(A)	2000-03-01	Kumagai	Applicant
US6035329(A)	2000-03-01	Mages et al.	Examiner
US6044403(A)	2000-03-01	Gerszberg et al.	Applicant
US6052717(A)	2000-04-01	Reynolds	Applicant
US6052785(A)	2000-04-01	Lin et al.	Applicant
US6055314(A)	2000-04-01	Spies et al.	Applicant
US6061057(A)	2000-05-01	Knowlton et al.	Applicant
US6064979(A)	2000-05-01	Perkowski	Applicant
US6073124(A)	2000-06-01	Krishnan et al.	Applicant
US6076733(A)	2000-06-01	Wilz, Sr. et al.	Applicant
US6080207(A)	2000-06-01	Kroening et al.	Applicant
US6081785(A)	2000-06-01	Oshima et al.	Applicant
US6083276(A)	2000-07-01	Davidson et al.	Applicant
US6097291(A)	2000-08-01	Tsai et al.	Applicant
US6097814(A)	2000-08-01	Mochizuki	Applicant
US6101180(A)	2000-08-01	Donahue et al.	Applicant
US6101534(A)	2000-08-01	Rothschild	Applicant
US6108002(A)	2000-08-01	Ishizaki	Applicant
US6125388(A)	2000-09-01	Reisman	Applicant
US6128649(A)	2000-10-01	Smith et al.	Applicant
US6128652(A)	2000-10-01	Toh et al.	Applicant
US6134533(A)	2000-10-01	Shell	Applicant
US6134593(A)	2000-10-01	Alexander	Applicant
US6138150(A)	2000-10-01	Nichols et al.	Applicant
US6141010(A)	2000-10-01	Hoyle	Applicant
US6145006(A)	2000-11-01	Vishlitsky et al.	Applicant
US6154738(A)	2000-11-01	Call	Applicant
US6154773(A)	2000-11-01	Roberts	Applicant
US6154844(A)	2000-11-01	Touboul et al.	Applicant
US6157953(A)	2000-12-01	Chang	Applicant
US6161132(A)	2000-12-01	Roberts et al.	Examiner
US6175842(B1)	2001-01-01	Kirk et al.	Applicant
US6175872(B1)	2001-01-01	Neumann et al.	Examiner
US6182222(B1)	2001-01-01	Oparaji	Applicant
US6184877(B1)	2001-02-01	Dodson et al.	Applicant
US6189032(B1)	2001-02-01	Susaki et al.	Applicant
US6192340(B1)	2001-02-01	Abecassis	Applicant
US6195693(B1)	2001-02-01	Berry et al.	Examiner
US6199048(B1)	2001-03-01	Hudetz et al.	Applicant
US6208805(B1)	2001-03-01	Abecassis	Applicant
US6219675(B1)	2001-04-01	Pal et al.	Applicant
US6226235(B1)	2001-05-01	Wehmeyer	Applicant
US6229523(B1)	2001-05-01	Czako	Applicant
US6230174(B1)	2001-05-01	Berger et al.	Applicant
US6233618(B1)	2001-05-01	Shannon	Applicant
US6239793(B1)	2001-05-01	Barnert et al.	Applicant
US6240459(B1)	2001-05-01	Roberts et al.	Applicant
US6240555(B1)	2001-05-01	Shoff et al.	Applicant
US6243692(B1)	2001-06-01	Floyd et al.	Applicant
US6246778(B1)	2001-06-01	Moore	Applicant
US6263501(B1)	2001-07-01	Schein et al.	Applicant
US6263505(B1)	2001-07-01	Walker et al.	Applicant
US6289165(B1)	2001-09-01	Abecassis	Applicant
US6301661(B1)	2001-10-01	Shambroom	Applicant
US6321252(B1)	2001-11-01	Bhola et al.	Applicant
US6331865(B1)	2001-12-01	Sachs et al.	Applicant
US6341375(B1)	2002-01-01	Watkins	Applicant
US6374402(B1)	2002-04-01	Schmeidler et al.	Applicant
US6389467(B1)	2002-05-01	Eyal	Applicant
US6389473(B1)	2002-05-01	Carmel et al.	Applicant
US6415438(B1)	2002-07-01	Blackketter et al.	Applicant
US6449653(B2)	2002-09-01	Klemets et al.	Examiner
US6453420(B1)	2002-09-01	Collart	Applicant
US6453459(B1)	2002-09-01	Brodersen et al.	Applicant
US6460086(B1)	2002-10-01	Swaminathan et al.	Applicant
US6499057(B1)	2002-12-01	Portuesi	Applicant
US6505169(B1)	2003-01-01	Bhagavath et al.	Applicant
US6510467(B1)	2003-01-01	Behfar et al.	Examiner
US6516467(B1)	2003-02-01	Schindler et al.	Applicant
US6522463(B1)	2003-02-01	Shimomura et al.	Applicant
US6526580(B2)	2003-02-01	Shimomura et al.	Applicant
US6529949(B1)	2003-03-01	Getsin et al.	Examiner
US6535909(B1)	2003-03-01	Rust	Applicant
US6543053(B1)	2003-04-01	Li et al.	Applicant
US6567980(B1)	2003-05-01	Jain et al.	Applicant
US6580870(B1)	2003-06-01	Kanazawa et al.	Applicant
US6591420(B1)	2003-07-01	McPherson et al.	Applicant
US6609253(B1)	2003-08-01	Swix et al.	Applicant
US6625656(B2)	2003-09-01	Goldhor et al.	Examiner
US6659861(B1)	2003-12-01	Faris et al.	Examiner
US6691106(B1)	2004-02-01	Sathyanarayan	Applicant
US6691126(B1)	2004-02-01	Syeda-Mahmood	Applicant
US6694309(B2)	2004-02-01	Cho et al.	Applicant
US6698020(B1)	2004-02-01	Zigmond et al.	Applicant
US6760043(B2)	2004-07-01	Markel	Applicant
US6769130(B1)	2004-07-01	Getsin	Applicant
US2001/0001160(A1)	2001-05-01	Shoff	Applicant
US2002/0026321(A1)	2002-02-01	Faris et al.	Applicant
US2002/0057893(A1)	2002-05-01	Wood et al.	Examiner
US2002/0073152(A1)	2002-06-01	Andrew et al.	Applicant
US2002/0078144(A1)	2002-06-01	Lamkin et al.	Applicant
US2002/0088011(A1)	2002-07-01	Lamkin et al.	Applicant
US2002/0143774(A1)	2002-10-01	Vandersluis	Applicant
US2003/0005461(A1)	2003-01-01	Shinohara	Applicant
US2003/0028892(A1)	2003-02-01	Gewickey et al.	Applicant
US2003/0101232(A1)	2003-05-01	Ullman et al.	Applicant
US2004/0024889(A1)	2004-02-01	Getsin et al.	Applicant
US2004/0040042(A1)	2004-02-01	Feinleib	Applicant
DE4242992(A1)	1994-06-01		Applicant
EP372716(A2)	1990-06-01		Applicant
EP762422(A2)	1997-03-01		Applicant
EP802527(A1)	1997-10-01		Applicant
EP809244(A3)	1997-11-01		Applicant
EP814419(A2)	1997-12-01		Applicant
EP849734(A2)	1998-06-01		Applicant
EP853315(A2)	1998-07-01		Applicant
EP809244(A2)	1998-12-01		Applicant
EP849734(A3)	1999-03-01		Applicant
EP853315(A3)	1999-12-01		Applicant
JP10063562	1998-06-01		Applicant
JP11039262(A)	1999-12-01		Applicant
WO98/47080	1998-10-01		Applicant
WO98/58368	1998-12-01		Applicant
WO99/14678	1999-03-01		Applicant
WO99/51031	1999-10-01		Applicant
WO/02385	2000-01-01		Applicant
WO/08855	2000-02-01		Applicant
WO/16229	2000-03-01		Applicant
WO/18054	2000-03-01		Applicant
WO/24192	2000-04-01		Applicant

Non-Patent Literature (73)

U.S. Appl. No. 09/649,215, filed Aug. 28, 2000, Allan Lamkin.Applicant
U.S. Appl. No. 09/476,190, filed Jan. 3, 2000, Todd R. Collart.Applicant
U.S. Appl. No. 09/488,345, filed Jan. 20, 2000, Todd R. Collart.Applicant
U.S. Appl. No. 09/488,337, filed Jan. 20, 2000, Evgeniy Getsin.Applicant
U.S. Appl. No. 09/488,613, filed Jan. 20, 2000, Evgeniy Getsin.Applicant
U.S. Appl. No. 09/489,597, filed Jan. 20, 2000, Evgeniy Getsin.Applicant
U.S. Appl. No. 09/489,600, filed Jan. 20, 2000, Evgeniy Getsin.Applicant
U.S. Appl. No. 09/488,614, filed Jan. 20, 2000, Evgeniy Getsin.Applicant
U.S. Appl. No. 09/489,596, filed Jan. 20, 2000, Todd R. Collart.Applicant
U.S. Appl. No. 09/489,601, filed Jan. 20, 2000, Evgeniy Getsin.Applicant
“World-Wide Web: a distributed paadigm for global hetworking”; Heylighen, F., Proceeding SHARE Europe Spring Conference; pp. 355-368; Apr. 18, 1994.Applicant
“A Simplified and an Efficient Packet Level Internet Access Control Scheme”; Igbal, MS, et al.; ICCS/ISITA '92; Singapore; IEEE Publications; 1992; pp. 963-967.Applicant
“CDLink”, Duguid, Brian; The Wire, Apr. 1996, available at http://www.hyperreal.org/˜duguid/wirecdlk/html.Applicant
“CDLink: Multimedia Liner Notes to Complement Your Music Collection”, Mirapaul, Matthew; N.Y. Times (online ed.); Jan. 25, 1996; available at http://is.gseis.ucla.edu/impact/w96/News/News3/0125mirapaul.html.Applicant
“Voyager CDLink Turns Audio CDs into CD-ROMs”; Press Release, Voyager Co.; (Jul. 12, 1995), available at http://www.voyagerco.com from Jul. 12, 1995 to 1997.Applicant
“Net Surf”, Wired Magazine, Issue 4.05 (May 1996), available at http://www.wired.com/wired/archive/4.05/net_surf.html.Applicant
“Voyager CDLink (VCD) Control Language Reference”, available at http:web.archive.org/web/19970213172801/www.voyager.com/cdlink/about/vcd_ref/cmdref.html, orginally available at http:www.voagerco.com/cdlink/about/vcd_ref/cmdref.html on Aug. 8, 1995.Applicant
“Labels Link CDs, Web Sites Via CDLink”, Marilyn A. Gillen, Billboard, Jul. 22, 1995, at 58.Applicant
HyperLOCK Technologies at a Trade Show at the Jacob K. Javits Convention Center, New York, New York, taken Aug. 1, 1996.Applicant
“Hybrid 'Net: CD-ROMs & the Web working in tandem”; Rosebush, et al.; www.netscapeworld.com/netscapeworld/nw-08-1996/nw-08-hybridcd.html; published Aug. 15, 1996.Applicant
“Going Hybrid: The Online CD-ROM Connection”; Stansberry; NEWMEDIA, Jun. 1995, pp. 34-40.Applicant
“CD-ROM and Web browsers: HTML as the Lingua Franca”, CD-ROM Professional, Aug. 1996, vol. 9, No. 8 at p. 26.Applicant
Standard ECMA-130, “Data Interchange on read-only 120 mm optical data disks (CD-ROM)”, 2nd Edition, Jun. 1996.Applicant
“Relative Uniform Resource Locators”, Fielding, Jun. 1995, available at http://www.w3.org/Addressing/rfc1808.txt.Applicant
“A Beginners Guide to URLs”, available at http://archive.ncsa.uiuc.edu/demoweb/url-pimer.html.Applicant
“Naming and Addressing: URls, URLs, . . . ” available at http://www.w3.org/Addressing/.Applicant
Sastry, Chellury R. et al., “Webtour: A System to Record and Playback Dynamic Multimedia Annotations on Web Document Content” Proceedings of the seventh ACM international conference on Multimedia; Oct. 1999, pp. 175-178.Applicant
Nkane, et al., Development of combined HDD and recordable-DVD video recorder, consumer Electronics, 2002, IEEE, 2002 Digest of Technical Papers, International Conference on Jun. 18-20, 2002, pp. 264-265.Applicant
Advanced Television Enhancement Forum Specification (ATVEF), Comment Draft Version 1.0r1, 1-20 copy of printout from web site Http://www.atvef.com/atvef_spec/TVE-public.htm (Oct. 18, 1998).Applicant
MBONE Multicasting Tomorrow's Internet, Request for Comments (RFC) 112 and 1458, Appendices A and B, Copyright 1996, 1998.Applicant
Abstract of “MBone Provides Audio and Video Across the Internet,”, M. R. Macedonia and D. P. Brutzman, IEEE Computer, vol. 27, No. 4, pp. 30-36 (Apr. 1994).Applicant
Family Tree Maker Announces 5.0 Patch, by Rick Roberts, The Global Gazette, http://globalgazette.net/gaztec/gaztec15.htm, posted Sep. 27, 1998, vol. II, No. 13.Applicant
Chen, Herng-Yow et al., MultiSync: A Synchronization Model for Multimedia Systems, IBEE Journal On Selected Areas In Communications, vol. 14, No. 1, Jan. 1996.Applicant
“When Signed, Sealed, Delivered, It's Yours,” by Precision Marketing, p30(1), Jul. 21, 1997.Applicant
http://www.spinware.net/portanet/portanet.html, printed Jan. 8, 2003.Applicant
Abstract of Edgar Weippl, “An Approach to Role-Based Access Control for Digital Content,” 2001, IEEE, pp. 290-294.Applicant
Henry M. Gladney, “Safeguarding Digital Library Contents and Users: Document Access Control,” Dlib Magazine, http://www.dlib.org/dlib/june97/ibm/06gladdney.html, Jun. 1997.Applicant
“All power to the Web; CD-ROM is dead—or is it?” by Richard Reisman, President, Teleshuttle Corporation, Jan. 1996 Teleshuttle white paper on Distributed Media, http://www.teleshuttle.com/tsdistrib.htm.Applicant
“CyberMedia Secures Major Licensing Agreement With Sony for Oil Change Software,” http://www.cypbermedia.com/company/pr/sony.html, printed Nov. 26, 2001.Applicant
MarketScape's WebCD Pro Publisher, Ron Gustavson, Emedia Professional, Dec. 1997, http://www.emdialive.com/awards/award11.html.Applicant
“Hybrid CD-ROM/Online Titles Will Surge in 1996,” DCD Business, Apr. 1996, http://www.tapediscbusiness.com/issues/1996/0496/apr_index.html.Applicant
“Trends Online: Intel's Internet Plans: Hybrid Applications”, By Andy Grove, PC Magazine, Jul. 24, 1996.Applicant
“Internet tool triggers audio CDs,” by Cate C. Corcoran, Jul. 24, 1995, http://www.access.ch/power/infoservices/MacWeek/MacWeek240795.html.Applicant
“MarketScape(R) WebCD(TM) 1.0 Bypasses Internet Bottlenecks,” DialogWeb, Aug. 26, 1996, http://www.dialogweb.com.Applicant
“Microsoft Expands Benefits for Site Builder Network Members,” Microsoft Press Release, San Jose, CA, Oct. 29, 1996, http://www.spindia.com/trisoftdesign/Press/SBN/SBNwkpr.htm.Applicant
“CD-ROM/Online Hybrids, The Missing Link?”, by Richard R. Reisman, CD-ROM Professional, vol. 8, No. 4, Apr. 1995, http://www.teleshuttle.com/cdpart.htm.Applicant
Netstuff postings; Sep. 2-6, 1996, Aug. 26-30, 1996, Aug. 19-23, 1996, Aug. 12-16, 1996, edited by James Careless with files from the Newsbytes News Network, http://www.monitor.ca/monitor/issues/vol4iss1/netstuff.html.Applicant
“Oil Change software hunts down upgrades,” by Bary Cooper, The Orlando Sentinel, Web-Posted Oct. 30, 1996, The Augusta Chronicle Online, http://www.augustachronicle.com/headlines/103196/oil_change.html.Applicant
Player 2.0 Product Description, Copyright 1995-2000,InterActual Technologies.Applicant
Resource Guide on Distributed Media: Local/CD-ROM/Online/Web, updated Nov. 25, 1996, Richard R. Reisman, President, Teleshuttle, http://www.teleshuttle.com/resource.Applicant
“Topic is Veritably Everywhere: CD-ROM, the Web, Intranets, etc.,” Seybold Report on Desktop Publishing, vol. 10, No. 7, Copyright 1996 by Seybold Publications Inc.Applicant
“Spin Webs around a CD-ROM: The Next Generation of CD/Web Hybrids,” Richard R. Reisman, President, Teleshuttle Corporation, Mass High Tech, Sep. 2, 1996, http://www.teleshuttle.com/nextgen.htm.Applicant
“Update Your Software While You Sleep,” Edited by Paul M. Eng, Bits & Bytes, BusinessWeek, McGraw-Hill, Updated Jun. 17, 1996, http://www.businessweek.com/1996/25/b3480140.htm.Applicant
“Verity smooths Net searches,” by CNET News.com Staff, Tech News—CNET.com, Feb. 20, 1996.Applicant
“Web/CD-ROM hybrids: A working definition,” site established Oct. 2, 1998, http://www.philb.com/webcd.htm.Applicant
Who's Who Hybrid Internet/CD-ROM Magazine/Catalog, Google cache printed Nov. 26, 2001, http://www.ecatcorp.com/alpha/mci.htm.Applicant
WebCD, Internet Posting, Roger Clarke, Dec. 1, 1996, http://www.anu.edu.au/people/Roger.Clarke/II/WebCD.html.Applicant
Re: WebCD, Internet Positing, Ron Ipsen, Dec. 1, 1996, http://www.anu.edu.au/mail-archives/link/link9612/0006.html.Applicant
Re: WebCD, Internet Postings, George Michaelson, Dec. 1, 1996, http://www.anu.edu.au/mail-archives/link/link9612/0003.hmtl and Dec. 21, 1996, http://www.anu.edu.au/mail-archives/link/link9612/0011.html.Applicant
Re: WebCD, Internet Positing, Liddy Nevile, Dec. 21, 1996, http://www.anu.edu.au/mail-archives/link/link9612/0010.html.Applicant
Re: WebCD, Internet Posting, Rachel Polanskis, Dec. 2, 1996, http://www.anu.edu.au/mail-archives/link/link9612/0013.html.Applicant
“Video and Audio: Organization and Retrieval in the WWW”, White Paper. (1996) http://vosaic.com/corp/papers/www5.html. Http://citeseer.nj.nec.com/chen96video.html.Applicant
www.techdirt.com/articles/20030516/1358202.shtml, May 16, 2003.Applicant
www.techdirt.com/articles/990616/1020235_F.shtml, Jun. 16, 2003.Applicant
Interactive Education: Transitioning CD-ROMs to the Web by Michael Mascha and Gary Seaman, Department of Anthropology, University of Southern California, Los Angeles, California, USA, Computer Networks and ISDN Systems 27 (1994) 267-272.Applicant
Active Video Watching Using Annotation by Nuno Correia and Teresa Chambel, ACM Digital Library, International Multimedia Conference, Oct. 30-Nov. 5, 1999, in Orlando, Florida.Applicant
No Modem Needed: TV Signals Bring the Web to Your PC by Michael S. Lasky, Computing Storypage, CNN IDG.net, May 19, 1998.Applicant
All About DIVX, Where the Facts are Told and the Decision is Y ours! Webmaster's Note Jan. 26, 1999, http://www.prodivx.com.Applicant
David Doering, NSM Galxy Jukebox, E Media Professionals Reviews, (pp. 78-80).Applicant
U.S. Appl. No. 10/880,351, filed Jun. 2, 2004, Allan Lamkin.Applicant
U.S. Appl. No. 10/880,350, filed Jun. 2, 2004, Allan Lamkin.Applicant
U.S. Appl. No. 10/877,644, filed Jun. 25, 2004, Todd R. Collart.Applicant
U.S. Appl. No. 10/880,272, filed Jun. 28, 2004, Evgeniy Getsin.Applicant

Abstract