US20030037123A1 - Systems and method for providing video-on-demand services for broadcasting systems - Google Patents

Systems and method for providing video-on-demand services for broadcasting systems Download PDF

Info

Publication number
US20030037123A1
US20030037123A1 US10/179,800 US17980002A US2003037123A1 US 20030037123 A1 US20030037123 A1 US 20030037123A1 US 17980002 A US17980002 A US 17980002A US 2003037123 A1 US2003037123 A1 US 2003037123A1
Authority
US
United States
Prior art keywords
data
step
ra
matrix
data file
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Abandoned
Application number
US10/179,800
Inventor
Khoi Hoang
Original Assignee
Khoi Hoang
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Priority to US09/584,832 priority Critical patent/US6557030B1/en
Application filed by Khoi Hoang filed Critical Khoi Hoang
Priority to US10/179,800 priority patent/US20030037123A1/en
Publication of US20030037123A1 publication Critical patent/US20030037123A1/en
Application status is Abandoned legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L65/00Network arrangements or protocols for real-time communications
    • H04L65/40Services or applications
    • H04L65/4069Services related to one way streaming
    • H04L65/4076Multicast or broadcast
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L65/00Network arrangements or protocols for real-time communications
    • H04L65/40Services or applications
    • H04L65/4069Services related to one way streaming
    • H04L65/4084Content on demand
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L65/00Network arrangements or protocols for real-time communications
    • H04L65/40Services or applications
    • H04L65/4069Services related to one way streaming
    • H04L65/4092Control of source by destination, e.g. user controlling streaming rate of server
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L65/00Network arrangements or protocols for real-time communications
    • H04L65/60Media handling, encoding, streaming or conversion
    • H04L65/607Stream encoding details
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network-specific arrangements or communication protocols supporting networked applications
    • H04L67/06Network-specific arrangements or communication protocols supporting networked applications adapted for file transfer, e.g. file transfer protocol [FTP]
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/20Servers specifically adapted for the distribution of content, e.g. VOD servers; Operations thereof
    • H04N21/23Processing of content or additional data; Elementary server operations; Server middleware
    • H04N21/238Interfacing the downstream path of the transmission network, e.g. adapting the transmission rate of a video stream to network bandwidth; Processing of multiplex streams
    • H04N21/2385Channel allocation; Bandwidth allocation
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/20Servers specifically adapted for the distribution of content, e.g. VOD servers; Operations thereof
    • H04N21/25Management operations performed by the server for facilitating the content distribution or administrating data related to end-users or client devices, e.g. end-user or client device authentication, learning user preferences for recommending movies
    • H04N21/262Content or additional data distribution scheduling, e.g. sending additional data at off-peak times, updating software modules, calculating the carousel transmission frequency, delaying a video stream transmission, generating play-lists
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/20Servers specifically adapted for the distribution of content, e.g. VOD servers; Operations thereof
    • H04N21/25Management operations performed by the server for facilitating the content distribution or administrating data related to end-users or client devices, e.g. end-user or client device authentication, learning user preferences for recommending movies
    • H04N21/262Content or additional data distribution scheduling, e.g. sending additional data at off-peak times, updating software modules, calculating the carousel transmission frequency, delaying a video stream transmission, generating play-lists
    • H04N21/26208Content or additional data distribution scheduling, e.g. sending additional data at off-peak times, updating software modules, calculating the carousel transmission frequency, delaying a video stream transmission, generating play-lists the scheduling operation being performed under constraints
    • H04N21/26216Content or additional data distribution scheduling, e.g. sending additional data at off-peak times, updating software modules, calculating the carousel transmission frequency, delaying a video stream transmission, generating play-lists the scheduling operation being performed under constraints involving the channel capacity, e.g. network bandwidth
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/20Servers specifically adapted for the distribution of content, e.g. VOD servers; Operations thereof
    • H04N21/25Management operations performed by the server for facilitating the content distribution or administrating data related to end-users or client devices, e.g. end-user or client device authentication, learning user preferences for recommending movies
    • H04N21/262Content or additional data distribution scheduling, e.g. sending additional data at off-peak times, updating software modules, calculating the carousel transmission frequency, delaying a video stream transmission, generating play-lists
    • H04N21/26208Content or additional data distribution scheduling, e.g. sending additional data at off-peak times, updating software modules, calculating the carousel transmission frequency, delaying a video stream transmission, generating play-lists the scheduling operation being performed under constraints
    • H04N21/26233Content or additional data distribution scheduling, e.g. sending additional data at off-peak times, updating software modules, calculating the carousel transmission frequency, delaying a video stream transmission, generating play-lists the scheduling operation being performed under constraints involving content or additional data duration or size, e.g. length of a movie, size of an executable file
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/20Servers specifically adapted for the distribution of content, e.g. VOD servers; Operations thereof
    • H04N21/25Management operations performed by the server for facilitating the content distribution or administrating data related to end-users or client devices, e.g. end-user or client device authentication, learning user preferences for recommending movies
    • H04N21/262Content or additional data distribution scheduling, e.g. sending additional data at off-peak times, updating software modules, calculating the carousel transmission frequency, delaying a video stream transmission, generating play-lists
    • H04N21/26208Content or additional data distribution scheduling, e.g. sending additional data at off-peak times, updating software modules, calculating the carousel transmission frequency, delaying a video stream transmission, generating play-lists the scheduling operation being performed under constraints
    • H04N21/26241Content or additional data distribution scheduling, e.g. sending additional data at off-peak times, updating software modules, calculating the carousel transmission frequency, delaying a video stream transmission, generating play-lists the scheduling operation being performed under constraints involving the time of distribution, e.g. the best time of the day for inserting an advertisement or airing a children program
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/20Servers specifically adapted for the distribution of content, e.g. VOD servers; Operations thereof
    • H04N21/25Management operations performed by the server for facilitating the content distribution or administrating data related to end-users or client devices, e.g. end-user or client device authentication, learning user preferences for recommending movies
    • H04N21/262Content or additional data distribution scheduling, e.g. sending additional data at off-peak times, updating software modules, calculating the carousel transmission frequency, delaying a video stream transmission, generating play-lists
    • H04N21/26275Content or additional data distribution scheduling, e.g. sending additional data at off-peak times, updating software modules, calculating the carousel transmission frequency, delaying a video stream transmission, generating play-lists for distributing content or additional data in a staggered manner, e.g. repeating movies on different channels in a time-staggered manner in a near video on demand system
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/40Client devices specifically adapted for the reception of or interaction with content, e.g. set-top-box [STB]; Operations thereof
    • H04N21/41Structure of client; Structure of client peripherals
    • H04N21/418External card to be used in combination with the client device, e.g. for conditional access
    • H04N21/4181External card to be used in combination with the client device, e.g. for conditional access for conditional access
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/40Client devices specifically adapted for the reception of or interaction with content, e.g. set-top-box [STB]; Operations thereof
    • H04N21/43Processing of content or additional data, e.g. demultiplexing additional data from a digital video stream; Elementary client operations, e.g. monitoring of home network, synchronizing decoder's clock; Client middleware
    • H04N21/433Content storage operation, e.g. storage operation in response to a pause request, caching operations
    • H04N21/4331Caching operations, e.g. of an advertisement for later insertion during playback
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/40Client devices specifically adapted for the reception of or interaction with content, e.g. set-top-box [STB]; Operations thereof
    • H04N21/47End-user applications
    • H04N21/472End-user interface for requesting content, additional data or services; End-user interface for interacting with content, e.g. for content reservation or setting reminders, for requesting event notification, for manipulating displayed content
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/40Client devices specifically adapted for the reception of or interaction with content, e.g. set-top-box [STB]; Operations thereof
    • H04N21/47End-user applications
    • H04N21/472End-user interface for requesting content, additional data or services; End-user interface for interacting with content, e.g. for content reservation or setting reminders, for requesting event notification, for manipulating displayed content
    • H04N21/47202End-user interface for requesting content, additional data or services; End-user interface for interacting with content, e.g. for content reservation or setting reminders, for requesting event notification, for manipulating displayed content for requesting content on demand, e.g. video on demand
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/40Client devices specifically adapted for the reception of or interaction with content, e.g. set-top-box [STB]; Operations thereof
    • H04N21/47End-user applications
    • H04N21/482End-user interface for program selection
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/80Generation or processing of content or additional data by content creator independently of the distribution process; Content per se
    • H04N21/83Generation or processing of protective or descriptive data associated with content; Content structuring
    • H04N21/84Generation or processing of descriptive data, e.g. content descriptors
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/80Generation or processing of content or additional data by content creator independently of the distribution process; Content per se
    • H04N21/83Generation or processing of protective or descriptive data associated with content; Content structuring
    • H04N21/845Structuring of content, e.g. decomposing content into time segments
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04NPICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N7/00Television systems
    • H04N7/16Analogue secrecy systems; Analogue subscription systems
    • H04N7/173Analogue secrecy systems; Analogue subscription systems with two-way working, e.g. subscriber sending a programme selection signal
    • H04N7/17309Transmission or handling of upstream communications
    • H04N7/17318Direct or substantially direct transmission and handling of requests
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L29/00Arrangements, apparatus, circuits or systems, not covered by a single one of groups H04L1/00 - H04L27/00
    • H04L29/02Communication control; Communication processing
    • H04L29/06Communication control; Communication processing characterised by a protocol
    • H04L29/0602Protocols characterised by their application
    • H04L29/06027Protocols for multimedia communication
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network-specific arrangements or communication protocols supporting networked applications
    • H04L67/42Protocols for client-server architectures
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10TECHNICAL SUBJECTS COVERED BY FORMER USPC
    • Y10STECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10S707/00Data processing: database and file management or data structures
    • Y10S707/99941Database schema or data structure
    • Y10S707/99944Object-oriented database structure
    • Y10S707/99945Object-oriented database structure processing
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10TECHNICAL SUBJECTS COVERED BY FORMER USPC
    • Y10STECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10S707/00Data processing: database and file management or data structures
    • Y10S707/99941Database schema or data structure
    • Y10S707/99948Application of database or data structure, e.g. distributed, multimedia, or image

Abstract

A method for sending data to a client to provide data-on-demand services comprises the steps of: receiving a data file, specifying a time interval, parsing the data file into a plurality of data blocks based on the time interval such that each data block is displayable during a time interval, determining a required number of time slots to send the data file, allocating to each time slot at least a first of the plurality of data blocks and optionally one or more additional data blocks, such that starting from any of the time slots, (i) the data file can be displayed by accessing the first of the plurality of data blocks; (ii) at a consecutive time slot, a next data block sequential to a prior displayed data block is available for displaying; and (iii) repeating step (ii) until all of the plurality of data blocks for the data file has been displayed, and sending the plurality of data blocks based on the allocating step.

Description

    CROSS REFERENCES RELATED TO APPLICATION
  • This application is a divisional application of U.S. Ser. No. 09/584,832 filed on May 31, 2000 by Khoi Hoang.[0001]
  • BACKGROUND OF THE INVENTION
  • Video-on-demand (VOD) systems are one type of data-on-demand (DOD) systems. In VOD systems, video data files are provided by a server or a network of servers to one or more clients on a demand basis. [0002]
  • In a conventional VOD architecture, a server or a network of servers communicates with clients in a standard hierarchical client-server model. For example, a client sends a request to a server for a data file (e.g., a video data file). In response to the client request, the server sends the requested data file to the client. In the standard client-server model, a client's request for a data file can be fulfilled by one or more servers. The client may have the capability to store any received data file locally in non-volatile memory for later use. The standard client-server model requires a two-way communications infrastructure. Currently, two-way communications require building new infrastructure because existing cables can only provide one-way communications. Example of two-way communications infrastructure are hybrid fiber optics coaxial cable (HFC) or all fiber infrastructure. Replacing existing cables is very costly and the resulting services may not be affordable by most users. [0003]
  • In addition, the standard client-server model has many limitations when a service provider (e.g., a cable company) attempts to provide VOD services to a large number of clients. One limitation of the standard client-server model is that the service provider has to implement a mechanism to continuously listen and fulfill every request from each client within the network; thus, the number of clients who can receive service is dependent on the capacity of such a mechanism. One mechanism uses massively-parallel computers having large and fast disk arrays as local servers. However, even the fastest existing local server can only deliver video data streams to about 1000 to 2000 clients at one time. Thus, in order to service more clients, the number of local servers must increase. Increasing local servers requires more upper level servers to maintain control of the local servers. [0004]
  • Another limitation of the standard client-server model is that each client requires its own bandwidth. Thus, the total required bandwidth is directly proportional to the number of subscribing clients. Cache memory within local servers has been used to improve bandwidth limitation but using cache memory does not solve the problem because cache memory is also limited. [0005]
  • Presently, in order to make video-on-demand services more affordable for clients, existing service providers are increasing the ratio of clients per local server above the local server's capabilities. Typically, a local server, which is capable of providing service to 1000 clients, is actually committed to service 10,000 clients. This technique may work if most of the subscribing clients do not order videos at the same time. However, this technique is set up for failure because most clients are likely to want to view videos at the same time (i.e., evenings and weekends), thus, causing the local server to become overloaded. [0006]
  • Thus, it is desirable to provide a system that is capable of providing on-demand services to a large number of clients over virtually any transmission medium without replacing existing infrastructure. [0007]
  • SUMMARY OF THE INVENTION
  • In an exemplary embodiment, at a server side, a method for sending data to a client to provide data-on-demand services comprises the steps of: receiving a data file, specifying a time interval, parsing the data file into a plurality of data blocks based on the time interval such that each data block is displayable during the time interval, determining a required number of time slots to send the data file, allocating to each time slot at least a first of the plurality of data blocks and optionally one or more additional data blocks, such that the plurality of data blocks is available in sequential order to a client accessing the data file during any time slot, and sending the plurality of data blocks based on the allocating step. In one embodiment, the parsing step includes the steps of: determining an estimated data block size, determining a cluster size of a memory in a channel server, and parsing the data file based on the estimated data block size and the cluster size. In another embodiment, the determining step includes the step of assessing resource allocation and bandwidth availability. [0008]
  • In an exemplary embodiment, at a client side, a method for processing data received from a server to provide data-on-demand services comprises the steps of: (a) receiving a selection of a data file during a first time slot; (b) receiving at least one data block of the data file during a second time slot; (c) during a next time slot: receiving any data block not already received, sequentially displaying a data block of the data file, and repeating step (c) until all data blocks of the data file has been received and displayed. In one embodiment, the method for processing data received from a server is performed by a set-top box at the client side. [0009]
  • In an exemplary embodiment, a data file is divided into a number of data blocks and a scheduling matrix is generated based on the number of data blocks. At the server side, the scheduling matrix provides a send order for sending the data blocks, such that a client can access the data blocks in sequential order at a random time. In an exemplary embodiment, a method for generating a scheduling matrix for a data file comprises the steps of: (a) receiving a number of data blocks [x] for a data file; (b) setting a first variable [j] to zero; (c) setting a second variable [i] to zero; (d) clearing all entries in a reference array; (e) writing at least one data block stored in matrix positions of a column [(i+j) modulo x] in a matrix to a reference array, if the reference array does not already contain the data block; (f) writing a data block [i] into the reference array and a matrix position [(i+j) modulo x, j] of the matrix, if the reference array does not contain the data block [i]; (g) incrementing the second variable [i] by one and repeating step (e) until the second variable [i] is equal to the number of data blocks [x]; and (h) incrementing the first variable [j] by one and repeating the step (c) until the first variable [j] is equal to the number of data blocks [x]. In one embodiment, a scheduling matrix is generated for each data file in a set of data files and a convolution method is applied to generate a delivery matrix based on the scheduling matrices for sending the set of data files. [0010]
  • A data-on-demand system comprises a first set of channel servers, a central controlling server for controlling the first set of channel servers, a first set of up-converters coupled to the first set of channel servers, a combiner/amplifier coupled to the first set of up-converters, and a combiner/amplifier adapted to transmit data via a transmission medium. In an exemplary embodiment, the data-on-demand system further comprises a channel monitoring module for monitoring the system, a switch matrix, a second set of channel servers, and a second set of up-converters. The channel monitoring module is configured to report to the central controlling server when system failure occurs. The central controlling server, in response to report from the channel monitoring module, instructs the switch matrix to replace a defective channel server in the first set of channel servers with a channel server in the second set of channel servers and a defective up-converter in the first set of up-converters with an up-converter in the second set of up-converters. [0011]
  • A method for providing data-on-demand services comprises the steps of calculating a delivery matrix of a data file, sending the data file in accordance with the delivery matrix, such that a large number of clients is capable of viewing the data file on demand. In one embodiment, the data file includes a video file.[0012]
  • BRIEF DESCRIPTION OF THE DRAWINGS
  • FIG. 1A illustrates an exemplary DOD system in accordance with an embodiment of the invention. [0013]
  • FIG. 1B illustrates an exemplary DOD system in accordance with another embodiment of the invention. [0014]
  • FIG. 2 illustrates an exemplary channel server in accordance with an embodiment of the invention. [0015]
  • FIG. 3 illustrates an exemplary set-top box in accordance with an embodiment of the invention. [0016]
  • FIG. 4 illustrates an exemplary process for generating a scheduling matrix in accordance with an embodiment of the invention.[0017]
  • DETAILED DESCRIPTION OF THE INVENTION
  • FIG. 1A illustrates an exemplary DOD system [0018] 100 in accordance with an embodiment of the invention. In this embodiment, the DOD system 100 provides data files, such as video files, on demand. However, the DOD system 100 is not limited to providing video files on demand but is also capable of providing other data files, for example, game files on demand. The DOD system 100 includes a central controlling server 102, a central storage 103, a plurality of channel servers 104 a- 104 n, a plurality of up-converters 106 a-106 n, and a combiner/amplifier 108. The central controlling server 102 controls the channel servers 104. The central storage 103 stores data files in digital format. In an exemplary embodiment, data files stored in the central storage 103 is accessible via a standard network interface (e.g., ethernet connection) by any authorized computer, such as the central controlling server 102, connected to the network. Each channel server 104 is assigned to a channel and is coupled to an up-converter 106. The channel servers 104 provide data files that are retrieved from the central storage 103 in accordance with instructions from the central controlling server 102. The output of each channel server 104 is a quadrature amplitude modulation (QAM) modulated intermediate frequency (IF) signal having a suitable frequency for the corresponding up-converter 106. The QAM-modulated IF signals are dependent upon adopted standards. The current adopted standard in the United States is the data-over-cable-systems-interface-specification (DOCSIS) standard, which requires an approximately 43.75 MHz IF frequency. The up-converters 106 convert IF signals received from the channel servers 104 to radio frequency signals (RF signals). The RF signals, which include frequency and bandwidth, are dependent on a desired channel and adopted standards. For example, under the current standard in the United States for a cable television channel 80, the RF signal has a frequency of approximately 559.25 MHz and a bandwidth of approximately 6 MHz. The outputs of the up-converters 106 are applied to the combiner/amplifier 108. The combiner/amplifier 108 amplifies, conditions, and combines the received RF signals then outputs the signals out to a transmission medium 110.
  • In an exemplary embodiment, the central controlling server [0019] 102 includes a graphics user interface (not shown) to enable a service provider to schedule data delivery by a drag-and-drop operation. Further, the central controlling server 102 authenticates and controls the channel servers 104 to start or stop according to delivery matrices. In an exemplary embodiment, the central controlling server 102 automatically selects a channel and calculates delivery matrices for transmitting data files in the selected channel. The central controlling server 102 provides offline addition, deletion, and update of data file information (e.g., duration, category, rating, and/or brief description). Further, the central controlling server 102 controls the central storage 103 by updating data files and databases stored therein.
  • In an exemplary embodiment, an existing cable television system [0020] 120 may continue to feed signals into the combiner/amplifier 108 to provide non-DOD services to clients. Thus, the DOD system 100 in accordance with the invention does not disrupt present cable television services.
  • FIG. 1B illustrates another exemplary embodiment of the DOD system [0021] 100 in accordance with the invention. In addition to the elements illustrated in FIG. 1A, the DOD system 100 includes a switch matrix 112, a channel monitoring module 114, a set of back-up channel servers 116 a-116 b, and a set of back-up up-converters 118 a-118 b. In one embodiment, the switch matrix 112 is physically located between the up-converters 106 and the combiner/amplifier 108. The switch matrix 112 is controlled by the central controlling server 102. The channel monitoring module 114 comprises a plurality of configured set-top boxes, which simulate potential clients, for monitoring the health of the DOD system 100. Monitoring results are communicated by the channel monitoring module 114 to the central controlling server 102. In case of a channel failure (i.e., a channel server failure, an up-converter failure, or a communication link failure), the central controlling server 102 through the switch matrix 112 disengages the malfunctioning component and engages a healthy backup component 116 and/or 118 to resume service.
  • In an exemplary embodiment, data files being broadcasted from the DOD system [0022] 100 are contained in motion pictures expert group (MPEG) files. Each MPEG file is dynamically divided into data blocks and sub-blocks mapping to a particular portion of a data file along a time axis. These data blocks and sub-blocks are sent during a pre-determined time in accordance with three-dimensional delivery matrices provided by the central controlling server 102. A feedback channel is not necessary for the DOD system 100 to provide DOD services. However, if a feedback channel is available, the feedback channel can be used for other purpose, such as billing or providing Internet services.
  • FIG. 2 illustrates an exemplary channel server [0023] 104 in accordance with an embodiment of the invention. The channel server 104 comprises a server controller 202, a CPU 204, a QAM modulator 206, a local memory 208, and a network interface 210. The server controller 202 controls the overall operation of the channel server 104 by instructing the CPU 204 to divide data files into blocks (further into sub-blocks and data packets), select data blocks for transmission in accordance with a delivery matrix provided by the central controlling server 102, encode selected data, compress encoded data, then deliver compressed data to the QAM modulator 206. The QAM modulator 206 receives data to be transmitted via a bus (i.e., PCI, CPU local bus) or Ethernet connections. In an exemplary embodiment, the QAM modulator 206 may include a downstream QAM modulator, an upstream quadrature amplitude modulation/quadrature phase shift keying (QAM/QPSK) burst demodulator with forward error correction decoder, and/or an upstream tuner. The output of the QAM modulator 206 is an IF signal that can be applied directly to an up-converter 106.
  • The network interface [0024] 210 connects the channel server 104 to other channel servers 104 and to the central controlling server 102 to execute the scheduling and controlling instructions from the central controlling server 102, reporting status back to the central controlling server 102, and receiving data files from the cental storage 103. Any data file retrieved from the central storage 103 can be stored in the local memory 208 of the channel server 104 before the data file is processed in accordance with instructions from the server controller 202. In an exemplary embodiment, the channel server 104 may send one or more DOD data streams depending on the bandwidth of a cable channel (e.g., 6, 6.5, or 8 MHz), QAM modulation (e.g., QAM 64 or QAM 256), and a compression standard/bit rate of the DOD data stream (i.e., MPEG-1 or MPEG-2).
  • FIG. 3 illustrates an exemplary set-top box (STB) [0025] 300 in accordance with an embodiment of the invention. The STB 300 comprises a QAM demodulator 302, a CPU 304, a conditional access module 306 (e.g., a smart card system), a local memory 308, a buffer memory 309, a STB controller 310, a decoder 312, and a graphics overlay module 314. The STB controller 310 controls the overall operation of the STB 300 by controlling the CPU 302 and the QAM demodulator 302 to select data in response to a client's request, decode selected data, decompress decoded data, reassemble decoded data, store decoded data in the local memory 308 or the buffer memory 309, and deliver stored data to the decoder 312. In an exemplary embodiment, the STB controller 310 controls the overall operation of the STB 300 based on data packet headers in the data packets received from the transmission medium 110. In an exemplary embodiment, the local memory 308 comprises non-volatile memory (e.g., a hard drive) and the buffer memory 309 comprises volatile memory.
  • In one embodiment, the QAM demodulator [0026] 302 comprises transmitter and receiver modules and one or more of the following: privacy encryption/decryption module, forward error correction decoder/encoder, tuner control, downstream and upstream processor, CPU and memory interface circuits. The QAM demodulator 302 receives modulated IF signals, samples and demodulates the signals to restore data.
  • The conditional access module [0027] 306 permits a decoding process when access is granted after authentication and/or when appropriate fees have been charged. Access condition is determined by the service provider.
  • In an exemplary embodiment, when access is granted, the decoder [0028] 312 decodes at least one data block to transform the data block into images displayable on an output screen. The decoder 312 supports commands from a subscribing client, such as play, stop, pause, step, rewind, forward, etc.
  • The graphics overlay module [0029] 314 enhances displayed graphics quality by, for example, providing alpha blending or picture-in-picture capabilities. In an exemplary embodiment, the graphics overlay module 314 can be used for graphics acceleration during game playing mode, for example, when the service provider provides games-on-demand services using the system in accordance with the invention.
  • In an exemplary embodiment, although data files are broadcasted to all cable television subscribers, only the DOD subscriber who has a compatible STB [0030] 300 will be able to decode and enjoy data-on-demand services. In one exemplary embodiment, permission to obtain data files on demand can be obtained via a smart card system in the conditional access control module 306. A smart card may be rechargeable at a local store or vending machine set up by a service provider. In another exemplary embodiment, a flat fee system provides a subscriber an unlimited access to all available data files.
  • In an exemplary embodiment, data-on-demand interactive features permit a client to select at any time an available data file. The amount of time between when a client presses a select button and the time the selected data file begins playing is referred to as a response time. As more resources are allocated (e.g., bandwidth, server capability) to provide DOD services, the response time gets shorter. In an exemplary embodiment, a response time can be determined based on an evaluation of resource allocation and desired quality of service. [0031]
  • In an exemplary embodiment, a selected response time determines the duration of a time slot. The duration of a time slot (TS) is the time interval for playing a data block at normal speed by a client. In an exemplary embodiment, a data file, such as a video file, is divided into a number of data blocks such that each data block can support the playing of the data file for the duration of a time slot. [0032]
  • In one embodiment, the number of data blocks (NUM_OF_BLKS) for each data file can be calculated as follows: [0033]
  • Estimated_BLK_Size=(DataFile_Size*TS)/DataFile_Length   (1)
  • BLK SIZE=(Estimated BLK Size+CLUSTER_SIZE−1 Byte)/CLUSTER_SIZE   (2)
  • BLK_SIZE_BYTES=BLK_SIZE*CLUSTER_SIZE   (3)
  • NUM_OF_BLKS=(DataFile_Size+BLK_SIZE_BYTES−1 Byte)/BLK_SIZE_BYTES   (4)
  • In equations (1) to (4), the Estimated_BLK_Size is an estimated block size (in Bytes); the DataFile_Size is the data file size (in Bytes); TS represents the duration of a time slot (in seconds); DataFile_Length is the duration of the data file (in seconds); BLK SIZE is the number of clusters needed for each data block; CLUSTER_SIZE is the size of a cluster in the local memory [0034] 208 for each channel server 104 (e.g., 64 KBytes); BLK_SIZE_BYTES is a block size in Bytes. In this embodiment, the number of blocks (NUM_OF_BLKS) is equal to the data file size (in Bytes) plus a data block size in Bytes minus 1 Byte and divided by a data block size in Bytes. Equations (1) to (4) illustrate one specific embodiment. A person of skill in the art would recognize that other methods are available to calculate a number of data blocks for a data file. For example, dividing a data file into a number of data blocks is primarily a function of an estimated block size and the cluster size of the local memory 208 of a channel server 104. Thus, the invention should not be limited to the specific embodiment presented above.
  • FIG. 4 illustrates an exemplary process for generating a scheduling matrix for sending a data file in accordance with an embodiment of the invention. In an exemplary embodiment, this invention uses time division multiplexing (TDM) and frequency division multiplexing (FDM) technology to compress and schedule data delivery at the server side. In an exemplary embodiment, a scheduling matrix is generated for each data file. In one embodiment, each data file is divided into a number of data blocks and the scheduling matrix is generated based on the number of data blocks. Typically, a scheduling matrix provides a send order for sending data blocks of a data file from a server to clients, such that the data blocks are accessible in sequential order by any client who wishes to access the data file at a random time. [0035]
  • At step [0036] 402, a number of data blocks (x) for a data file is received. A first variable, j, is set to zero (step 404). A reference array is cleared (step 406). The reference array keeps track of data blocks for internal management purposes. Next, j is compared to x (step 408). If j is less than x, a second variable, i, is set to zero (step 412). Next, i is compared to x (step 414). If i is less than x, data blocks stored in the column [(i+j) modulo (x)] of a scheduling matrix are written into the reference array (step 418). If the reference array already has such data block(s), do not write a duplicate copy. Initially, since the scheduling matrix does not yet have entries, this step can be skipped. Next, the reference array is checked if it contains data block i (step 420). Initially, since all entries in the reference array has been cleared at step 406, there would be nothing in the reference array. If the reference array does not contain data block i, data block i is added into the scheduling matrix at matrix position [(i+j) modulo (x), j] and the reference array (step 422). After the data block i is added to the scheduling matrix and the reference array, i is incremented by 1, such that i=i+1 (step 424), then the process repeats at step 414 until i=x. If the reference array contains data block i, i is incremented by 1, such that i=i+1 (step 424), then the process repeats at step 414 until i=x. When i=x, j is incremented by 1, such that j=j+1 (step 416) and the process repeats at step 406 until j=x. The entire process ends when j=x (step 410).
  • In an exemplary embodiment, if a data file is divided into six data blocks (x=6), the scheduling matrix and the reference arrays are as follows: [0037] Scheduling Matrix (SM) TS0 TS1 TS2 TS3 TS4 TS5 [0, 0] blk0 [1, 0] blk1 [2, 0] blk2 [3, 0] blk3 [4, 0] blk4 [5, 0] blk5 [0, 1] [1, 1] blk0 [2, 1] [3, 1] [4, 1] [5, 0] [0, 2] [1, 2] [2, 2] blk0 [3, 2] blk1 [4, 2] [5, 1] [0, 3] [1, 3] [2, 3] [3, 3] blk0 [4, 3] [5, 2] blk2 [0, 4] [1, 4] blk3 [2, 4] [3, 4] [4, 4] blk0 [5, 3] blk1 [0, 5] [1, 5] [2, 5] [3, 5] blk4 [4, 5] [5, 4] blk0
  • [0038] Reference Array (RA) space0 space1 space2 space3 space4 space5 TS0 blk0 blk1 blk2 blk3 blk4 blk5 TS1 blk1 blk0 blk2 blk3 blk4 blk5 TS2 blk2 blk0 blk3 blk1 blk4 blk5 TS3 blk3 blk1 blk0 blk4 blk5 blk2 TS4 blk4 blk0 blk5 blk2 blk1 blk3 TS5 blk5 blk2 blk1 blk0 blk3 blk4
  • Appendix A attached to this application describes a step-by-step process of the exemplary process illustrated in FIG. 4 to generate the above scheduling matrix and reference arrays. In this exemplary embodiment, based on the scheduling matrix above, the six data blocks of the data file are sent in the following sequence: [0039]
  • TS0 [0040]
    Figure US20030037123A1-20030220-P00900
    blk0
  • TS1 [0041]
    Figure US20030037123A1-20030220-P00900
    blk0, blk1, blk3
  • TS2 [0042]
    Figure US20030037123A1-20030220-P00900
    blk0, blk2
  • TS3 [0043]
    Figure US20030037123A1-20030220-P00900
    blk0, blk1, blk3, blk4
  • TS4 [0044]
    Figure US20030037123A1-20030220-P00900
    blk0, blk4
  • TS5 [0045]
    Figure US20030037123A1-20030220-P00900
    blk0, blk1, blk2, blk5
  • In another exemplary embodiment, a look-ahead process can be used to calculate a look-ahead scheduling matrix to send a predetermined number of data blocks of a data file prior to a predicted access time. For example, if a predetermined look-ahead time is the duration of one time slot, for any time slot greater than or equal to time slot number four, data block 4 (blk4) of a data file should be received by a STB [0046] 300 at a subscribing client at or before TS3, but blk4 would not be played until TS4. The process steps for generating a look-ahead scheduling matrix is substantially similar to the process steps described above for FIG. 4 except that the look-ahead scheduling matrix in this embodiment schedules an earlier sending sequence based on a look-ahead time. Assuming a data file is divided into six data blocks, an exemplary sending sequence based on a look-ahead scheduling matrix, having a look-ahead time of the duration of two time slots, can be represented as follows:
  • TS0 [0047]
    Figure US20030037123A1-20030220-P00900
    blk0
  • TS1 [0048]
    Figure US20030037123A1-20030220-P00900
    blk0, blk1, blk3, blk4
  • TS2 [0049]
    Figure US20030037123A1-20030220-P00900
    blk0, blk2
  • TS3 [0050]
    Figure US20030037123A1-20030220-P00900
    blk0, blk1, blk3, blk4, blk5
  • TS4 [0051]
    Figure US20030037123A1-20030220-P00900
    blk0, blk5
  • TS5 [0052]
    Figure US20030037123A1-20030220-P00900
    blk0, blk1, blk2
  • A three-dimensional delivery matrix for sending a set of data files is generated based on the scheduling matrices for each data file of the set of data files. In the three-dimensional delivery matrix, a third dimension containing IDs for each data file in the set of data files is generated. The three-dimensional delivery matrix is calculated to efficiently utilize available bandwidth in each channel to deliver multiple data streams. In an exemplary embodiment, a convolution method, which is well known in the art, is used to generate a three-dimensional delivery matrix to schedule an efficient delivery of a set of data files. For example, a convolution method may include the following policies: (1) the total number of data blocks sent in the duration of any time slot (TS) should be kept at a smallest possible number; and (2) if multiple partial solutions are available with respect to policy (1), the preferred solution is the one which has a smallest sum of data blocks by adding the data blocks to be sent during the duration of any reference time slot, data blocks to be sent during the duration of a previous time slot (with respect to the reference time slot), and data blocks to be sent during the duration of a next time slot (with respect to the reference time slot). For example, assuming an exemplary system sending two short data files, M and N, where each data file is divided into six data blocks, the sending sequence based on a scheduling matrix is as follows: [0053]
  • TS0 [0054]
    Figure US20030037123A1-20030220-P00900
    blk0
  • TS1 [0055]
    Figure US20030037123A1-20030220-P00900
    blk0, blk1, blk3
  • TS2 [0056]
    Figure US20030037123A1-20030220-P00900
    blk0, blk2
  • TS3 [0057]
    Figure US20030037123A1-20030220-P00900
    blk0, blk1, blk3, blk4
  • TS4 [0058]
    Figure US20030037123A1-20030220-P00900
    blk0, blk4
  • TS5 [0059]
    Figure US20030037123A1-20030220-P00900
    blk0, blk1, blk2, blk5
  • Applying the exemplary convolution method as described above, possible combinations of delivery matrices are as follows: [0060] Total Data Blocks Option 1: Send video file N at shift 0 TS TS0 => M0, N0 2 TS1 => M0, M1, M3, N0, N1, N3 6 TS2 => M0, M2, N0, N2 4 TS3 => M0, M1, M3, M4, N0, N1, N3, N4 8 TS4 => M0, M4, N0, N4 4 TS5 => M0, M1, M2, M5, N0, N1, N2, N5 8 Option 2: Send video file N at shift 1 TS TS0 => M0, N0, N1, N3 4 TS1 => M0, M1, M3, N0, N2 5 TS2 => M0, M2, N0, N1, N3, N4 6 TS3 => M0, M1, M3, M4, N0, N4 6 TS4 => M0, M4, N0, N1, N2, N5 6 TS5 => M0, M1, M2, M5, N0 5 Option 3: Send video file N at shift 2 TS TS0 => M0, N0, N2 3 TS1 => M0, M1, M3, N0, N1, N3, N4 7 TS2 => M0, M2, N0, N4 4 TS3 => M0, M1, M3, M4, N0, N1, N2, N5 8 TS4 => M0, M4, N0 3 TS5 => M0, M1, M2, M5, N0, N1, N3 7 Option 4: Send video file N at shift 3 TS TS0 => M0, N0, N1, N3, N4 5 TS1 => M0, M1, M3, N0, N4 5 TS2 => M0, M2, N0, N1, N2, N5 6 TS3 => M0, M1, M3, M4, N0 5 TS4 => M0, M4, N0, N1, N3 5 TS5 => M0, M1, M2, M5, N0, N2 6 Option 5: Send video file N at shift 4 TS TS0 => M0, N0, N4 3 TS1 => M0, M1, M3, N0, N1, N2, N5 7 TS2 => M0, M2, N0 3 TS3 => M0, M1, M3, M4, N0, N1, N3 7 TS4 => M0, M4, N0, N2 4 TS5 => M0, M1, M2, M5, N0, N1, N3, N4 8 Option 6: Send video file N at shift 5 TS TS0 => M0, N0, N1, N2, N5 5 TS1 => M0, M1, M3, N0 4 TS2 => M0, M2, N0, N1, N3 5 TS3 => M0, M1, M3, M4, N0, N2 6 TS4 => M0, M4, N0, N1, N3, N4 6 TS5 => M0, M1, M2, M5, N0, N4 6
  • Applying policy (1), options 2, 4, and 6 have the smallest maximum number of data blocks (i.e., 6 data blocks) sent during any time slot. Applying policy (2), the optimal delivery matrix in this exemplary embodiment is option 4 because option 4 has the smallest sum of data blocks of any reference time slot plus data blocks of neighboring time slots (i.e., 16 data blocks). Thus, optimally for this embodiment, the sending sequence of the data file N should be shifted by three time slots. In an exemplary embodiment, a three-dimensional delivery matrix is generated for each channel server [0061] 104.
  • When data blocks for each data file are sent in accordance with a delivery matrix, a large number of subscribing clients can access the data file at a random time and the appropriate data blocks of the data file will be timely available to each subscribing client. In the example provided above, assume the duration of a time slot is equal to 5 seconds, the DOD system [0062] 100 sends data blocks for data files M and N in accordance with the optimal delivery matrix (i.e., shift delivery sequence of data file N by three time slots) in the following manner:
  • Time 00:00:00[0063]
    Figure US20030037123A1-20030220-P00900
    M0 N0 N1 N3 N4
  • Time 00:00:05[0064]
    Figure US20030037123A1-20030220-P00900
    M0 M1 M3 N0 N4
  • Time 00:00:10[0065]
    Figure US20030037123A1-20030220-P00900
    M0 M2 N0 N1 N2 N5
  • Time 00:00:15[0066]
    Figure US20030037123A1-20030220-P00900
    M0 M1 M3 M4 N0
  • Time 00:00:20[0067]
    Figure US20030037123A1-20030220-P00900
    M0 M4 N0 N1 N3
  • Time 00:00:25[0068]
    Figure US20030037123A1-20030220-P00900
    M0 M1 M2 M5 N0 N2
  • Time 00:00:30[0069]
    Figure US20030037123A1-20030220-P00900
    M0 N0N1 N3 N4
  • Time 00:00:35[0070]
    Figure US20030037123A1-20030220-P00900
    M0 M1 M3 N0 N4
  • Time 00:00:40[0071]
    Figure US20030037123A1-20030220-P00900
    M0 M2 N0 N1 N2 N5
  • Time 00:00:45[0072]
    Figure US20030037123A1-20030220-P00900
    M0 M1 M3 M4 N0
  • Time 00:00:50[0073]
    Figure US20030037123A1-20030220-P00900
    M0 M4 N0 N1 N3
  • Time 00:00:55[0074]
    Figure US20030037123A1-20030220-P00900
    M0 M1 M2 M5 N0 N2
  • If at time 00:00:00 a client A selects movie M, the STB [0075] 300 at client A receives, stores, plays, and rejects data blocks as follows:
  • Time 00:00:00 [0076]
    Figure US20030037123A1-20030220-P00900
    Receive M0
    Figure US20030037123A1-20030220-P00900
    play M0, store M0.
  • Time 00:00:05 [0077]
    Figure US20030037123A1-20030220-P00900
    Receive M1, M3
    Figure US20030037123A1-20030220-P00900
    play M1, store M0, M1, M3.
  • Time 00:00:10 [0078]
    Figure US20030037123A1-20030220-P00900
    Receive M2
    Figure US20030037123A1-20030220-P00900
    play M2, store M0, M1, M2 M3.
  • Time 00:00:15 [0079]
    Figure US20030037123A1-20030220-P00900
    Receive M4
    Figure US20030037123A1-20030220-P00900
    play M3, store M0, M1, M2, M3, M4.
  • Time 00:00:20 [0080]
    Figure US20030037123A1-20030220-P00900
    Receive none
    Figure US20030037123A1-20030220-P00900
    play M4, store M0, M1, M2, M3, M4.
  • Time 00:00:25 [0081]
    Figure US20030037123A1-20030220-P00900
    Receive M5
    Figure US20030037123A1-20030220-P00900
    play M5, store M0, M1, M2, M3, M4, M5.
  • If at time 00:00:10, a client B selects movie M, the STB [0082] 300 at client B receives, stores, plays, and rejects data blocks as follows:
  • Time 00:00:10 [0083]
    Figure US20030037123A1-20030220-P00900
    Rcv M0, M2
    Figure US20030037123A1-20030220-P00900
    play M0, store M0, M2.
  • Time 00:00:15 [0084]
    Figure US20030037123A1-20030220-P00900
    Rcv M1, M3, M4
    Figure US20030037123A1-20030220-P00900
    play M1, store M0, M1, M2, M3, M4.
  • Time 00:00:20 [0085]
    Figure US20030037123A1-20030220-P00900
    Rcv none
    Figure US20030037123A1-20030220-P00900
    play M2, store M0, M1, M2, M3, M4.
  • Time 00:00:25 [0086]
    Figure US20030037123A1-20030220-P00900
    Rcv M5
    Figure US20030037123A1-20030220-P00900
    play M3, store M0, M1, M2, M3, M4, M5.
  • Time 00:00:30 [0087]
    Figure US20030037123A1-20030220-P00900
    Rcv none
    Figure US20030037123A1-20030220-P00900
    play M4, store M0, M1, M2, M3, M4, M5.
  • Time 00:00:35[0088]
    Figure US20030037123A1-20030220-P00900
    Rcv none
    Figure US20030037123A1-20030220-P00900
    play M5, store M0, M1, M2, M3, M4, M5.
  • If at time 00:00:15, a client C selects movie N, the STB [0089] 300 of the client C receives, stores, plays, and rejects data blocks as follows:
  • Time 00:00:15 [0090]
    Figure US20030037123A1-20030220-P00900
    Rcv N0
    Figure US20030037123A1-20030220-P00900
    play N0, store N0.
  • Time 00:00:20 [0091]
    Figure US20030037123A1-20030220-P00900
    Rcv N1 N3
    Figure US20030037123A1-20030220-P00900
    play N1, store N0, N1, N3.
  • Time 00:00:25 [0092]
    Figure US20030037123A1-20030220-P00900
    Rcv N2
    Figure US20030037123A1-20030220-P00900
    play N2, store N0, N1, N2, N3.
  • Time 00:00:30 [0093]
    Figure US20030037123A1-20030220-P00900
    Rcv N4
    Figure US20030037123A1-20030220-P00900
    play N3, store N0, N1, N2, N3, N4.
  • Time 00:00:35 [0094]
    Figure US20030037123A1-20030220-P00900
    Rcv none
    Figure US20030037123A1-20030220-P00900
    play N4, store N0, N1, N2, N3, N4.
  • Time 00:00:40 [0095]
    Figure US20030037123A1-20030220-P00900
    Rcv N5
    Figure US20030037123A1-20030220-P00900
    play N5, store N0, N1, N2, N3, N4, N5.
  • If at time 00:00:30, a client D also selects movie N, the STB [0096] 300 at the client D receives, stores, plays, and rejects data blocks as follows:
  • Time 00:00:30 [0097]
    Figure US20030037123A1-20030220-P00900
    Rcv N0, N1, , N3, N4
    Figure US20030037123A1-20030220-P00900
    play N0, store N0, N1, N3, N4.
  • Time 00:00:35 [0098]
    Figure US20030037123A1-20030220-P00900
    Rcv none
    Figure US20030037123A1-20030220-P00900
    play N1, store N0, N1, N3, N4.
  • Time 00:00:40 [0099]
    Figure US20030037123A1-20030220-P00900
    Rcv N2, N5
    Figure US20030037123A1-20030220-P00900
    play N2, store N0, N1, N2, N3, N4, N5.
  • Time 00:00:45 [0100]
    Figure US20030037123A1-20030220-P00900
    Rcv none
    Figure US20030037123A1-20030220-P00900
    play N3, store N0, N1, N2, N3, N4, N5.
  • Time 00:00:50 [0101]
    Figure US20030037123A1-20030220-P00900
    Rcv none
    Figure US20030037123A1-20030220-P00900
    play N4, store N0, N1, N2, N3, N4, N5.
  • Time 00:00:55 [0102]
    Figure US20030037123A1-20030220-P00900
    Rcv none
    Figure US20030037123A1-20030220-P00900
    play N5, store N0, N1, N2, N3, N4, N5.
  • As shown in the above examples, any combination of clients can at a random time independently select and begin playing any data file provided by the service provider. [0103]
  • GENERAL OPERATION
  • A service provider can schedule to send a number of data files (e.g., video files) to channel servers [0104] 104 prior to broadcasting. The central controlling server 102 calculates and sends to the channel servers 104 three-dimensional delivery matrices (ID, time slot, and data block send order). During broadcasting, channel servers 104 consult the three-dimensional delivery matrices to send appropriate data blocks in an appropriate order. Each data file is divided into data blocks so that a large number of subscribing clients can separately begin viewing a data file continuously and sequentially at a random time. The size of a data block of a data file is dependent on the duration of a selected time slot and the bit rate of the data stream of the data file. For example, in a constant bit rate MPEG data stream, each data block has a fixed size of:
  • Block Size (MBytes)=BitRate (Mb/s)×TS (sec)/8   (1).
  • In an exemplary embodiment, a data block size is adjusted to a next higher multiple of a memory cluster size in the local memory [0105] 208 of a channel server 104. For example, if a calculated data block length is 720 Kbytes according to equation (1) above, then the resulting data block length should be 768 Kbytes if the cluster size of the local memory 208 is 64 Kbytes. In this embodiment, data blocks should be further divided into multiples of sub-blocks each having the same size as the cluster size. In this example, the data block has twelve sub-blocks of 64 KBytes.
  • A sub-block can be further broken down into data packets. Each data packet contains a packet header and packet data. The packet data length depends on the maximum transfer unit (MTU) of a physical layer where each channel server's CPU sends data to. In the preferred embodiment, the total size of the packet header and packet data should be less than the MTU. However, for maximum efficiency, the packet data length should be as long as possible. [0106]
  • In an exemplary embodiment, data in a packet header contains information that permits the subscriber client's STB [0107] 300 to decode any received data and determine if the data packet belongs to a selected data file (e.g., protocol signature, version, ID, or packet type information). The packet header may also contain other information, such as block/sub-block/packet number, packet length, cyclic redundancy check (CRC) and offset in a sub-block, and/or encoding information.
  • Once received by a channel server [0108] 104, data packets are sent to the QAM modulator 206 where another header is added to the data packet to generate a QAM-modulated IF output signal. The maximum bit rate output for the QAM modulator 206 is dependent on available bandwidth. For example, for a QAM modulator 206 with 6 MHz bandwidth, the maximum bit rate is 5.05 (bit/symbol)×6 (MHz)=30.3 Mbit/sec.
  • The QAM-modulated IF signals are sent to the up-converters [0109] 106 to be converted to RF signals suitable for a specific channel (e.g., for CATV channel 80, 559.250 MHz and 6 MHz bandwidth). For example, if a cable network has high bandwidth (or bit rate), each channel can be used to provide more than one data stream, with each data stream occupying a virtual sub-channel. For example, three MPEG1 data streams can fit into a 6 MHz channel using QAM modulation. The output of the up-converters 106 is applied to the combiner/amplifier 108, which sends the combined signal to the transmission medium 110.
  • In an exemplary embodiment, the total system bandwidth (BW) for transmitting “N” data streams is BW=N×bw, where bw is the required bandwidth per data stream. For example, three MPEG-1 data streams can be transmitted at the same time by a DOCSIS cable channel having a system bandwidth of 30.3 Mbits/sec because each MPEG- 1 data stream occupies 9 Mbits/sec of the system bandwidth. [0110]
  • Typically, bandwidth is consumed regardless of the number of subscribing clients actually accessing the DOD service. Thus, even if no subscribing client is using the DOD service, bandwidth is still consumed to ensure the on-demand capability of the system. [0111]
  • The STB [0112] 300, once turned on, continuously receives and updates a program guide stored in the local memory 308 of a STB 300. In an exemplary embodiment, the STB 300 displays data file information including the latest program guide on a TV screen. Data file information, such as video file information, may include movieID, movie title, description (in multiple languages), category (e.g., action, children), rating (e.g., R, PG13), cable company policy (e.g., price, length of free preview), subscription period, movie poster, and movie preview. In an exemplary embodiment, data file information is sent via a reserved physical channel, such as a channel reserved for firmware update, commercials, and/or emergency information. In another exemplary embodiment, information is sent in a physical channel shared by other data streams.
  • A subscribing client can view a list of available data files arranged by categories displayed on a television screen. When the client selects one of the available data files, the STB [0113] 300 controls its hardware to tune into a corresponding physical channel and/or a virtual sub-channel to start receiving data packets for that data file. The STB 300 examines every data packet header, decodes data in the data packets, and determines if a received data packet should be retained. If the STB 300 determines that a data packet should not be retained, the data packet is discarded. Otherwise, the packet data is saved in the local memory 308 for later retrieval or is temporarily stored in the buffer memory 309 until it is sent to the decoder 312.
  • To improve performance efficiency by avoiding frequent read/write into the local memory [0114] 308, in an exemplary embodiment, the STB 300 uses a “sliding window” anticipation technique to lock anticipated data blocks in the memory buffer 309 whenever possible. Data blocks are transferred to the decoder 312 directly out of the memory buffer 309 if a hit in an anticipation window occurs. If an anticipation miss occurs, data blocks are read from the local memory 308 into the memory buffer 309 before the data blocks are transferred to the decoder 312 from the memory buffer 309.
  • In an exemplary embodiment, the STB [0115] 300 responds to subscribing client's commands via infrared (IR) remote control unit buttons, an IR keyboard, or front panel pushbuttons, including buttons to pause, play in slow motion, rewind, zoom and single step. In an exemplary embodiment, if a subscribing client does not input any action for a predetermined period of time (e.g., scrolling program menu, or selecting a category or movie), a scheduled commercial is played automatically. The scheduled commercial is automatically stopped when the subscribing client provides an action (e.g., press a button in a remote control unit). In another exemplary embodiment, the STB 300 can automatically insert commercials while a video is being played. The service provider (e.g., a cable company) can set up a pricing policy that dictates how frequently commercials should interrupt the video being played.
  • If an emergency information bit is found in a data packet header, the STB [0116] 300 pauses any data receiving operation and controls its hardware to tune into the channel reserved for receiving data file information to obtain and decode any emergency information to be displayed on an output screen. In an exemplary embodiment, when the STB 300 is idled, it is tuned to the channel reserved for receiving data file information and is always ready to receive and display any emergency information without delay.
  • The foregoing examples illustrate certain exemplary embodiments of the invention from which other embodiments, variations, and modifications will be apparent to those skilled in the art. The invention should therefore not be limited to the particular embodiments discussed above, but rather is defined by the following claims. [0117]
  • APPENDIX A Systems and Methods for Providing Video-On-Demand Services for Broadcasting Systems
  • The following is a step-by-step description of the exemplary process illustrated in FIG. 4 for generating a scheduling matrix for a data file having six data blocks: [0118]
  • START [0119]
  • (Step [0120] 402) Receive a number of data blocks for a data file (x); assume the number of data blocks is equal to 6 (x=6).
  • (Step [0121] 404) Set j=0
  • (Step [0122] 406) Clear a Reference Array (RA)
  • (Step [0123] 408) Compare j to x.
  • (Step [0124] 412) j is less than x (0<6), let i=0
  • (Step [0125] 414) Compare i to x.
  • (Step [0126] 418) i is less than x (0<6). Read matrix positions of column [0] in the SM and write to RA; initially, the SM is empty so nothing is written into RA.
  • (Step [0127] 420) Does RA contain data block i or blk0?
  • (Step [0128] 422) RA does not contain anything because it is empty. Write blk0 into position [0, 0] in SM and the RA.
  • (Step [0129] 424) Add 1 to i (i=1) to derive value for position [1, 0]. Go back to Step 414.
  • (Step [0130] 414) Compare i to x.
  • (Step [0131] 418) i is less than x (1<6). Read matrix positions of column [1] in the SM and write to RA; initially, the SM is empty so nothing is written into RA.
  • (Step [0132] 420) Does RA contain data block i or blk1?
  • (Step [0133] 422) RA does not contain blk1. Write blk1 into position [1, 0] in SM and the RA.
  • (Step [0134] 424) Add 1 to i (i=2) to derive value for position [2, 0]. Go back to Step 414.
  • (Step [0135] 414) Compare i to x.
  • (Step [0136] 418) i is less than x (2<6). Read matrix positions of column [2] in the SM and write to RA; initially, the SM is empty so nothing is written into RA.
  • (Step [0137] 420) Does RA contain data block i or blk2?
  • (Step [0138] 422) RA does not contain blk2. Write blk2 into position [2, 0] in SM and the RA.
  • (Step [0139] 424) Add 1 to i (i=3) to derive value for position [3, 0]. Go back to Step 414.
  • (Step [0140] 414) Compare i to x.
  • (Step [0141] 418) i is less than x (3<6). Read matrix positions of column [3] in the SM and write to RA; initially, the SM is empty so nothing is written into RA.
  • (Step [0142] 420) Does RA contain data block i or blk3?
  • (Step [0143] 422) RA does not contain blk3. Write blk3 into position [3, 0] in SM and the RA.
  • (Step [0144] 424) Add 1 to i (i=4) to derive value for position [4, 0]. Go back to Step 414.
  • (Step [0145] 414) Compare i to x.
  • (Step [0146] 418) i is less than x (4<6). Read matrix positions of column [4] of the SM and write to RA; initially, the SM is empty so nothing is written into RA.
  • (Step [0147] 420) Does RA contain data block i or blk4?
  • (Step [0148] 422) RA does not contain blk4. Write blk4 into position [4, 0] in SM and the RA.
  • (Step [0149] 424) Add 1 to i (i=5) to derive value for position [5, 0]. Go back to Step 414.
  • (Step [0150] 414) Compare i to x.
  • (Step [0151] 418) i is less than x (5<6). Read matrix positions of column [5] of the SM and write to RA; initially, the SM is empty so nothing is written into RA.
  • (Step [0152] 420) Does RA contain data block i or blk5?
  • (Step [0153] 422) RA does not contain blk5. Write blk5 into position [5, 0] in SM and the RA.
  • (Step [0154] 424) Add 1 to i (i=6). Go back to Step 414.
  • (Step [0155] 414) Compare i to x.
  • (Step [0156] 416) i is equal to x (6=6). Increment j by 1 (j=1). Go to Step 406.
  • (Step [0157] 406) Clear a Reference Array (RA)
  • (Step [0158] 408) Compare j to x.
  • (Step [0159] 412) j is less than x (1<6), let i=0.
  • (Step [0160] 414) Compare i to x.
  • (Step [0161] 418) i is less than x (0<6). Read matrix positions of column [1] in the SM and write to RA. Position [1, 0] contains blk 1; thus, blk 1 is written into RA. All other positions are empty.
  • (Step [0162] 420) Does RA contain data block i or blk0?
  • (Step [0163] 422) RA does not contain blk0. Write blk0 into position [1, 1] in the SM and the RA. RA now has blk1 and blk 0.
  • (Step [0164] 424) Add 1 to i (i=1) to derive value for position [2, 1]. Go back to Step 414.
  • (Step [0165] 414) Compare i to x.
  • (Step [0166] 418) i is less than x (1<6). Read matrix positions of column [2] in the SM and write to RA. Position [2, 0] contains blk 2. All other positions are empty. RA now has blk1, blk 0, and blk 2.
  • (Step [0167] 420) Does RA contain data block i or blk1?
  • (Step [0168] 424) RA contains blk1. Thus, nothing is written into position [2, 1]. Add 1 to i (i=2) to derive value for position [3, 1]. Go back to Step 414.
  • (Step [0169] 414) Compare i to x.
  • (Step [0170] 418) i is less than x (2<6). Read matrix positions in column [3] of the SM and write to RA. Position [3, 0] contains blk3. All other positions are empty. RA now has blk1, blk0, blk2, and blk3.
  • (Step [0171] 420) Does RA contain data block i or blk2?
  • (Step [0172] 424) RA does contain blk2. Thus, nothing is written into position [3, 1]. Add 1 to i (i=3) to derive value for position [4, 1]. Go back to Step 414.
  • (Step [0173] 414) Compare i to x.
  • (Step [0174] 418) i is less than x (3<6). Read matrix positions of column [4] in the SM and write to RA. Position [4, 0] contains blk4. All other positions are empty. RA now has blk1, blk0, blk2, blk3, and blk4.
  • (Step [0175] 420) Does RA contain data block i or blk3?
  • (Step [0176] 424) RA does contain blk3. Thus, nothing is written into position [4, 1]. Add 1 to i (i=4) to derive value for position [5, 1]. Go back to Step 414.
  • (Step [0177] 414) Compare i to x.
  • (Step [0178] 418) i is less than x (4<6). Read matrix positions of column [5] in the SM and write to RA. Position [5, 0] contains blk5. All other positions are empty. RA now has blk1, blk0, blk2, blk3, blk4, and blk5.
  • (Step [0179] 420) Does RA contain data block i or blk4?
  • (Step [0180] 424) RA does contain blk4. Thus, nothing is written into position [5, 1]. Add 1 to i (i=5) to derive value for position [0, 1]. Go back to Step 414.
  • (Step [0181] 414) Compare i to x.
  • (Step [0182] 418) i is less than x (5<6). Read matrix positions of column [0] in the SM and write to RA. Position [0, 0] contains blk0. All other positions are empty. RA already contains blk0; thus, blk0 is discarded.
  • (Step [0183] 420) Does RA contain data block i or blk5?
  • (Step [0184] 424) RA does contain blk5. Thus, nothing is written into position [0, 1]. Add 1 to i (i=6). Go back to Step 414.
  • (Step [0185] 414) Compare i to x.
  • (Step [0186] 416) i is equal to x (6=6). Increment j by 1 (j=2). Go to Step 406.
  • (Step [0187] 406) Clear a Reference Array (RA)
  • (Step [0188] 408) Compare j to x.
  • (Step [0189] 412) j is less than x (2<6), let i=0.
  • (Step [0190] 414) Compare i to x.
  • (Step [0191] 418) i is less than x (0<6). Read matrix positions of column [2] in the SM and write to RA. Position [2, 0] contains blk 2. All other positions are empty. RA now has blk2.
  • (Step [0192] 420) Does RA contain data block i or blk0?
  • (Step [0193] 422) RA does not contain blk0. Write blk0 into position [2, 2] in the SM and the RA. RA now has blk2 and blk 0.
  • (Step [0194] 424) Add 1 to i (i=1) to derive value for position [3, 2]. Go back to Step 414.
  • (Step [0195] 414) Compare i to x.
  • (Step [0196] 418) i is less than x (1<6). Read matrix positions of column [3] in the SM and write to RA. Position [3, 0] contains blk3. All other positions are empty. RA now has blk2, blk 0, and blk 3.
  • (Step [0197] 420) Does RA contain data block i or blk1?
  • (Step [0198] 422) RA not contain blk1. Write blk1 into position [3, 2] in the SM and the RA. RA now has blk2, blk0, blk3, and blk1.
  • (Step [0199] 424) Add 1 to i (i=2) to derive value for position [4, 2]. Go back to Step 414.
  • (Step [0200] 414) Compare i to x.
  • (Step [0201] 418) i is less than x (2<6). Read matrix positions of column [4] in the SM and write to RA. Position [4, 0] contains blk4. All other positions are empty. RA now has blk2, blk0, blk3, blk1, and blk4.
  • (Step [0202] 420) Does RA contain data block i or blk2?
  • (Step [0203] 424) RA does contain blk2. Thus, nothing is written into position [4, 2]. Add 1 to i (i=3) to derive value for position [5, 2]. Go back to Step 414.
  • (Step [0204] 414) Compare i to x.
  • (Step [0205] 418) i is less than x (3<6). Read matrix positions of column [5] in the SM and write to RA. Position [5, 0] contains blk5. All other positions are empty. RA now has blk2, blk0, blk3, blk1, blk4, and blk5.
  • (Step [0206] 420) Does RA contain data block i or blk3?
  • (Step [0207] 424) RA does contain blk3. Thus, nothing is written into position [5, 2]. Add 1 to i (i=4) to derive value for position [0, 2]. Go back to Step 414.
  • (Step [0208] 414) Compare i to x.
  • (Step [0209] 418) i is less than x (4<6). Read matrix positions of column [0] in the SM and write to RA. Position [0, 0] contains blk0. All other positions are empty. RA already contain blk0; thus, blk0 is discarded.
  • (Step [0210] 420) Does RA contain data block i or blk4?
  • (Step [0211] 424) RA does contain blk4. Thus, nothing is written into position [0, 2]. Add 1 to i (i=5) to derive value for position [1, 2]. Go back to Step 414.
  • (Step [0212] 414) Compare i to x.
  • (Step [0213] 418) i is less than x (5<6). Read matrix positions of column [1] in the SM and write to RA. Position [1, 0] contains blk1 and position [1, 1] contains blk0. RA already contains blk1 and blk0; thus, blk1 and blk0 are discarded. All other positions are empty.
  • (Step [0214] 420) Does RA contain data block i or blk5?
  • (Step [0215] 424) RA does contain blk5. Thus, nothing is written into position [1, 2]. Add 1 to i (i=6). Go back to Step 414.
  • (Step [0216] 414) Compare i to x.
  • (Step [0217] 416) i is equal to x (6=6). Increment j by 1 (j=3). Go to Step 406.
  • (Step [0218] 406) Clear a Reference Array (RA)
  • (Step [0219] 408) Compare j to x.
  • (Step [0220] 412) j is less than x (3<6), let i=0.
  • (Step [0221] 414) Compare i to x.
  • (Step [0222] 418) i is less than x (0<6). Read matrix positions of column [3] in the SM and write to RA. Position [3, 0] contains blk3 and position [3, 2] contains blk1. Blk3 and blk1 are written into RA. All other positions are empty.
  • (Step [0223] 420) Does RA contain data block i or blk0?
  • (Step [0224] 422) RA does not contain blk0. Write blk0 into position [3, 3] in the SM and the RA. RA now has blk3, blk1, and blk0.
  • (Step [0225] 424) Add 1 to i (i=1) to derive value for position [4, 3]. Go back to Step 414.
  • (Step [0226] 414) Compare i to x.
  • (Step [0227] 418) i is less than x (1<6). Read matrix positions of column [4] in the SM and write to RA. Position [4, 0] contains blk 4. All other positions are empty. RA now has blk3, blk 1, blk 0 and blk 4.
  • (Step [0228] 420) Does RA contain data block i or blk1?
  • (Step [0229] 424) RA contains blk1. Thus, nothing is written into position [4, 3]. Add 1 to i (i=2) to derive value for position [5, 3]. Go back to Step 414.
  • (Step [0230] 414) Compare i to x.
  • (Step [0231] 418) i is less than x (2<6). Read matrix positions of column [5] in the SM and write to RA. Position [5, 0] contains blk5. All other positions are empty. RA now has blk3, blk1, blk0, blk4, and blk5.
  • (Step [0232] 420) Does RA contain data block i or blk2?
  • (Step [0233] 422) RA does not contain blk2. Write blk2 into position [5, 3] in the SM and the RA. RA now has blk3, blk1, blk0, blk4, blk5, and blk2.
  • (Step [0234] 424) Add 1 to i (i=3) to derive value for position [0, 3]. Go back to Step 414.
  • (Step [0235] 414) Compare i to x.
  • (Step [0236] 418) i is less than x (3<6). Read matrix positions of column [0] in the SM and write to RA. Position [0, 0] contains blk0. All other positions are empty. RA already contains blk0; thus, discard blk0.
  • (Step [0237] 420) Does RA contain data block i or blk3?
  • (Step [0238] 424) RA does contain blk3. Thus, nothing is written into position [0, 3]. Add 1 to i (i=4) to derive value for position [1, 3]. Go back to Step 414.
  • (Step [0239] 414) Compare i to x.
  • (Step [0240] 418) i is less than x (4<6). Read matrix positions of column [1] in the SM and write to RA. Position [1, 0] contains blk1 and position [1, 1] contains blk0. All other positions are empty. RA already contains blk 1 and blk0; do not write a duplicate copy.
  • (Step [0241] 420) Does RA contain data block i or blk4?
  • (Step [0242] 424) RA does contain blk4. Thus, nothing is written into position [1, 3]. Add 1 to i (i=5) to derive value for position [2, 3]. Go back to Step 414.
  • (Step [0243] 414) Compare i to x.
  • (Step [0244] 418) i is less than x (5<6). Read matrix positions of column [2] in the SM and write to RA. Position [2, 0] contains blk2 and position [2, 2] contains blk 0. All other positions are empty. RA already contains blk2 and blk0; do not write a duplicate copy.
  • (Step [0245] 420) Does RA contain data block i or blk5?
  • (Step [0246] 424) RA does contain blk5. Thus, nothing is written into position [2, 3]. Add 1 to i (i=6). Go back to Step 414.
  • (Step [0247] 414) Compare i to x.
  • (Step [0248] 416) i is equal to x (6=6). Increment j by 1 (j=4). Go to Step 406.
  • (Step [0249] 406) Clear a Reference Array (RA)
  • (Step [0250] 408) Compare j to x.
  • (Step [0251] 412) j is less than x (4<6), let i=0.
  • (Step [0252] 414) Compare i to x.
  • (Step [0253] 418) i is less than x (0<6). Read matrix positions of column [4] in the SM and write to RA. Position [4, 0] contains blk4. Blk4 is written into RA. All other positions are empty.
  • (Step [0254] 420) Does RA contain data block i or blk0?
  • (Step [0255] 422) RA does not contain blk0. Write blk0 into position [4, 4] in the SM and the RA. RA now has blk4 and blk0.
  • (Step [0256] 424) Add 1 to i (i=1) to derive value for position [5, 4]. Go back to Step 414.
  • (Step [0257] 414) Compare i to x.
  • (Step [0258] 418) i is less than x (1<6). Read matrix positions of column [5] in the SM and write to RA. Position [5, 0] contains blk5 and position [5, 3]contains blk2. All other positions are empty. RA now has blk4, blk0, blk 5, and blk2.
  • (Step [0259] 420) Does RA contain data block i or blk1 ?
  • (Step [0260] 422) RA does not contain blk1. Write blk1 into position [5, 4] of the SM and the RA. RA now has blk4, blk0, blk5, blk2, and blk1.
  • (Step [0261] 424) Add 1 to i (i=2) to derive value for position [0, 4]. Go back to Step 414.
  • (Step [0262] 414) Compare i to x.
  • (Step [0263] 418) i is less than x (2<6). Read matrix positions of column [0] in the SM and write to RA. Position [0, 0] contains blk0. All other positions are empty. RA already contains blk0; thus, do not write a duplicate copy.
  • (Step [0264] 420) Does RA contain data block i or blk2?
  • (Step [0265] 424) RA does contain blk2. Add 1 to i (i=3) to derive value for position [1, 4]. Go back to Step 414.
  • (Step [0266] 414) Compare i to x.
  • (Step [0267] 418) i is less than x (3<6). Read matrix positions of column [1] in the SM and write to RA. Position [1, 0] contains blk1 and position [1, 1] contains blk0. All other positions are empty. RA already contains blk1 and blk0; do not write a duplicate copy.
  • (Step [0268] 420) Does RA contain data block i or blk3?
  • (Step [0269] 422) RA does not contain blk3. Write blk3 into position [1, 4] of the SM and the RA. RA now has blk4, blk0, blk5, blk2, blk1, and blk3.
  • (Step [0270] 424) Add 1 to i (i=4) to derive value for position [2, 4]. Go back to Step 414.
  • (Step [0271] 414) Compare i to x.
  • (Step [0272] 418) i is less than x (4<6). Read matrix positions of column [2] in the SM and write to RA. Position [2, 0] contains blk2 and position [2, 2] contains blk0. All other positions are empty. RA already contains blk2 and blk0; do not write a duplicate copy.
  • (Step [0273] 420) Does RA contain data block i or blk4?
  • (Step [0274] 424) RA does contain blk4. Thus, nothing is written into position [2, 4]. Add 1 to i (i=5) to derive value for position [3, 4]. Go back to Step 414.
  • (Step [0275] 414) Compare i to x.
  • (Step [0276] 418) i is less than x (5<6). Read matrix positions of column [3] in the SM and write to RA. Position [3, 0] contains blk3, position [3, 2] contains blk1, and position [3, 3] contains blk0. All other positions are empty. RA already contains blk3, blk1, and blk0; do not write a duplicate copy.
  • (Step [0277] 420) Does RA contain data block i or blk5?
  • (Step [0278] 424) RA does contain blk5. Thus, nothing is written into position [3, 4]. Add 1 to i (i=6). Go back to Step 414.
  • (Step [0279] 414) Compare i to x.
  • (Step [0280] 416) i is equal to x (6=6). Increment j by 1 (j=5). Go to Step 406.
  • (Step [0281] 406) Clear a Reference Array (RA)
  • (Step [0282] 408) Compare j to x.
  • (Step [0283] 412)j is less than x (5<6), let i=0.
  • (Step [0284] 414) Compare i to x.
  • (Step [0285] 418) i is less than x (0<6). Read matrix positions of column [5] in the SM and write to RA. Position [5, 0] contains blk5, position [5, 3] contains blk2, and position [5, 4] contains blk1. Blk5, blk2, and blk1 are written into RA. All other positions are empty.
  • (Step [0286] 420) Does RA contain data block i or blk0?
  • (Step [0287] 422) RA does not contain blk0. Write blk0 into position [5, 5] in the SM and the RA. RA now has blk5, blk2, blk1, and blk0.
  • (Step [0288] 424) Add 1 to i (i=1) to derive value for position [0, 5]. Go back to Step 414.
  • (Step [0289] 414) Compare i to x.
  • (Step [0290] 418) i is less than x (1<6). Read matrix positions of column [0] in the SM and write to RA. Position [0, 0] contains blk0 and all other positions are empty. RA now has blk5, blk2, blk1, and blk0.
  • (Step [0291] 420) Does RA contain data block i or blk1?
  • (Step [0292] 424) RA does contain blk1. Add 1 to i (i=2) to derive value for position [1, 5]. Go back to Step 414.
  • (Step [0293] 414) Compare i to x.
  • (Step [0294] 418) i is less than x (2<6). Read matrix positions of column [1] in the SM and write to RA. Position [1, 0] contains blk 1, position [1, 1] contains blk0, and position [1, 4] contains blk3. All other positions are empty. RA already contains blk0 and blk1; thus, do not write a duplicate copy. Write blk3 into RA. RA now has blk5, blk2, blk2, blk1, blk0, and blk3.
  • (Step [0295] 420) Does RA contain data block i or blk2?
  • (Step [0296] 424) RA does contain blk2. Add 1 to i (i=3) to derive value for position [2, 5]. Go back to Step 414.
  • (Step [0297] 414) Compare i to x.
  • (Step [0298] 418) i is less than x (3<6). Read matrix positions of column [2] in the SM and write to RA. Position [2, 0] contains blk2 and position [2, 2] contains blk0. All other positions are empty. RA already contains blk2 and blk0; do not write a duplicate copy.
  • (Step [0299] 420) Does RA contain data block i or blk3?
  • (Step [0300] 424) RA does contain blk3. Add 1 to i (i=4) to derive value for position [3, 5]. Go back to Step 414.
  • (Step [0301] 414) Compare i to x.
  • (Step [0302] 418) i is less than x (4<6). Read matrix positions column [3] in the SM and write to RA. Position [3, 0] contains blk3, position [3, 2] contains blk1, position [3, 3] contains blk0. All other positions are empty. RA already contains blk3, blk1, and blk0; do not write a duplicate copy.
  • (Step [0303] 420) Does RA contain data block i or blk4?
  • (Step [0304] 422) RA does not contain blk4. Write blk4 into position [3, 5] of the SM and the RA. The RA now has blk5, blk2, blk1, blk0, blk3, and blk4.
  • (Step [0305] 424) Add 1 to i (i=5) to derive value for position [4, 5]. Go back to Step 414.
  • (Step [0306] 414) Compare i to x.
  • (Step [0307] 418) i is less than x (5<6). Read matrix positions of column [4] in the SM and write to RA. Position [4, 0] contains blk4 and position [4, 4] contains blk0. All other positions are empty. RA already contains blk4 and blk0; do not write a duplicate copy.
  • (Step [0308] 420) Does RA contain data block i or blk5?
  • (Step [0309] 424) RA does contain blk5. Thus, nothing is written into position [3, 4].
  • (Step [0310] 424) Add 1 to i (i=6). Go back to Step 414.
  • (Step [0311] 414) Compare i to x.
  • (Step [0312] 416) i is equal to x (6=6). Increment j by 1 (j=5). Go to Step 406.
  • (Step [0313] 406) Clear a Reference Array (RA)
  • (Step [0314] 408) Compare j to x.
  • (Step [0315] 410) j is equal to x (6=6); END.

Claims (11)

1. A method for generating a scheduling matrix for data file, and scheduling matrix provides a send order for sending data blocks for a data file, such that said data blocks are available in sequential order to a client receiving said data blocks, said method comprising the steps of:
(a) receiving a number of data blocks [x] for a data file;
(b) setting a first variable [i] to zero;
(c) setting a second variable [i] to zero;
(d) clearing all entries in a reference array;
(e) writing at least one data block stored in matrix positions of a column [(i+j) modulo x] in a matrix to a reference array, if said reference array does not already contain said data block;
(f) writing a data block [i] into said reference array and a matrix position [(i+j) modulu x,j] of said matrix, if said reference array does not contains aid data block [i];
(g) incrementing said second variable [i] is equal to said number of data blocks [x]; and
((h) incrementing said first variable [j] by one and repeating said step (c) until said first variable [j] is equal to said number of data blocks [x].
2. The method of claim 1, further comprising the steps of:
(i) repeating said steps (a) to (h) to generate a set of scheduling matrices for a set of data files; and
(j) applying a convolution method to generate a delivery matrix based on said set of scheduling matrices for sending said set of data files.
3. A method for calculating a delivery matrix, said delivery matrix provides a send order for sending data blocks of a set of data files, said method comprising the step of:
(a) calculating a scheduling matrix for each data file in a set of data files to form a set of scheduling matrices;
(b) generating an identification array containing an identification for each of said set of data files; and
(c) combining said set of scheduling matrices and said identification array to generate a delivery matrix for said set of data files.
4. The method of claim 3, wherein said calculating step includes the step of:
(i) generating an array containing a set of time slots for each data file; and
(ii) generating an array contain at least one data block of a data file to be sent during each time slot.
5. The method of claim 3, wherein said combining includes the step of using a convolution method.
6. A computer implemented on-demand data broadcast method comprising the act of preparing a delivery matrix defining a data transmission sequence suitable for broadcast, to a plurality of clients, on-demand data in a non client specific manner, whereby transmission of said on-demand data files requires an amount of transmission bandwidth that is independent of the number of said plurality of clients.
7. A computer implemented method as recited in claim 6, wherein the act of generating a delivery matrix comprises the act of:
preparing a first scheduling matrix suitable for transmission of a first data file, said first data file being represented by a first plurality of data blocks, said first scheduling matrix providing a first sequence for transmitting said first plurality of data blocks sequentially within time slots in a manner such that any client receiving transmission of said first data file according to said first scheduling matrix may begin accessing said first data file within one time slot.
8. A computer implemented method as recited in claim 7, wherein the act of preparing a delivery matrix further includes the acts of:
preparing a second scheduling matrix suitable for transmission of a second data file, said second data file being represented by a second plurality of data blocks, said second scheduling matrix providing a second sequence for transmitting said second plurality f data blocks sequentially within time slots in a manner such that any client receiving transmission of said second data file according to said second scheduling matrix may being accessing said second data file within one timeslot; and
generating said delivery matrix through a combination of said first and second scheduling matrices.
9. A computer implemented universal data broadcast method as recited in claim 6 further comprising the act of preparing an electronic program guide (EPG) suitable for broadcast to said plurality of clients.
10. A computer implemented method as recited in claim 6, wherein said on-demand data includes video data.
11. A computer implemented method as recited in claim 6, wherein said on-demand data includes game data.
US10/179,800 2000-05-31 2002-06-24 Systems and method for providing video-on-demand services for broadcasting systems Abandoned US20030037123A1 (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
US09/584,832 US6557030B1 (en) 2000-05-31 2000-05-31 Systems and methods for providing video-on-demand services for broadcasting systems
US10/179,800 US20030037123A1 (en) 2000-05-31 2002-06-24 Systems and method for providing video-on-demand services for broadcasting systems

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
US10/179,800 US20030037123A1 (en) 2000-05-31 2002-06-24 Systems and method for providing video-on-demand services for broadcasting systems

Related Parent Applications (1)

Application Number Title Priority Date Filing Date
US09/584,832 Division US6557030B1 (en) 2000-05-31 2000-05-31 Systems and methods for providing video-on-demand services for broadcasting systems

Publications (1)

Publication Number Publication Date
US20030037123A1 true US20030037123A1 (en) 2003-02-20

Family

ID=24338962

Family Applications (5)

Application Number Title Priority Date Filing Date
US09/584,832 Expired - Fee Related US6557030B1 (en) 2000-05-31 2000-05-31 Systems and methods for providing video-on-demand services for broadcasting systems
US09/709,948 Expired - Fee Related US6725267B1 (en) 2000-05-31 2000-11-10 Prefetched data in a digital broadcast system
US10/179,800 Abandoned US20030037123A1 (en) 2000-05-31 2002-06-24 Systems and method for providing video-on-demand services for broadcasting systems
US10/179,745 Abandoned US20030105834A1 (en) 2000-05-31 2002-06-25 Systems and method for providing video-on-demand services for broadcasting systems
US10/291,317 Abandoned US20030140122A1 (en) 2000-05-31 2002-11-07 Controlling digital data distribution in a relay server network

Family Applications Before (2)

Application Number Title Priority Date Filing Date
US09/584,832 Expired - Fee Related US6557030B1 (en) 2000-05-31 2000-05-31 Systems and methods for providing video-on-demand services for broadcasting systems
US09/709,948 Expired - Fee Related US6725267B1 (en) 2000-05-31 2000-11-10 Prefetched data in a digital broadcast system

Family Applications After (2)

Application Number Title Priority Date Filing Date
US10/179,745 Abandoned US20030105834A1 (en) 2000-05-31 2002-06-25 Systems and method for providing video-on-demand services for broadcasting systems
US10/291,317 Abandoned US20030140122A1 (en) 2000-05-31 2002-11-07 Controlling digital data distribution in a relay server network

Country Status (16)

Country Link
US (5) US6557030B1 (en)
EP (2) EP1285345A4 (en)
JP (1) JP2003535531A (en)
KR (2) KR20030071481A (en)
CN (1) CN1355904A (en)
AU (1) AU6795800A (en)
BR (1) BR0017253A (en)
CA (1) CA2404611A1 (en)
EA (2) EA200201286A1 (en)
IL (1) IL152762D0 (en)
MX (1) MXPA02011841A (en)
NO (1) NO20025710L (en)
PL (1) PL359130A1 (en)
TW (1) TW508949B (en)
WO (2) WO2001093060A1 (en)
ZA (4) ZA200209221B (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20010044867A1 (en) * 1998-09-11 2001-11-22 Mentor Data System, Inc. System and process based on hierarchical PCI bus architecture
US20040097288A1 (en) * 2002-11-14 2004-05-20 Sloate Jim A. Multiplexed secure video game play distribution
US20110317979A1 (en) * 2010-06-28 2011-12-29 Cox Communications, Inc. Bookmark exchange

Families Citing this family (113)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7010801B1 (en) 1999-06-11 2006-03-07 Scientific-Atlanta, Inc. Video on demand system with parameter-controlled bandwidth deallocation
US6817028B1 (en) 1999-06-11 2004-11-09 Scientific-Atlanta, Inc. Reduced screen control system for interactive program guide
US8069259B2 (en) 2000-06-09 2011-11-29 Rodriguez Arturo A Managing removal of media titles from a list
US7200857B1 (en) 2000-06-09 2007-04-03 Scientific-Atlanta, Inc. Synchronized video-on-demand supplemental commentary
US7992163B1 (en) 1999-06-11 2011-08-02 Jerding Dean F Video-on-demand navigational system
US8516525B1 (en) 2000-06-09 2013-08-20 Dean F. Jerding Integrated searching system for interactive media guide
US6868452B1 (en) * 1999-08-06 2005-03-15 Wisconsin Alumni Research Foundation Method for caching of media files to reduce delivery cost
US7975277B1 (en) 2000-04-03 2011-07-05 Jerding Dean F System for providing alternative services
US7934232B1 (en) 2000-05-04 2011-04-26 Jerding Dean F Navigation paradigm for access to television services
CN100399316C (en) * 2000-05-31 2008-07-02 派威公司 Universal STB architectures and control method
US20020026501A1 (en) * 2000-05-31 2002-02-28 Khoi Hoang Decreased idle time and constant bandwidth data-on-demand broadcast delivery matrices
US7962370B2 (en) 2000-06-29 2011-06-14 Rodriguez Arturo A Methods in a media service system for transaction processing
GB0023993D0 (en) * 2000-09-30 2000-11-15 Pace Micro Tech Plc Improvements to electronic programme guide
US7340759B1 (en) 2000-11-10 2008-03-04 Scientific-Atlanta, Inc. Systems and methods for adaptive pricing in a digital broadband delivery system
USRE42600E1 (en) 2000-11-20 2011-08-09 Polytechnic University Scheduling the dispatch of cells in non-empty virtual output queues of multistage switches using a pipelined arbitration scheme
US20020143499A1 (en) * 2001-01-12 2002-10-03 Graphin Co., Ltd Methods and apparatus for communicating information via a network
JP2002259282A (en) * 2001-02-27 2002-09-13 Matsushita Electric Ind Co Ltd Data broadcasting schedule system, and device, method, recording medium, or program concerned with the system
JP4586281B2 (en) * 2001-03-13 2010-11-24 コニカミノルタビジネステクノロジーズ株式会社 Data transmission management apparatus, a data transmission management method, data transmission management program, and a data transmission management program and computer readable recording medium
JP2002271758A (en) * 2001-03-13 2002-09-20 Sony Corp Transmitter, transmission method, receiver, receiving method, and transmitting and receiving system
EP1395904B1 (en) * 2001-05-22 2016-07-20 Accenture Global Services Limited Broadband communications
US8015271B2 (en) * 2001-03-26 2011-09-06 Accenture Global Services Limited Method and system of provisioning a desired communication service for a user across a network
CA2474879C (en) * 2001-07-03 2013-04-09 Imagine Broadband Limited Method and system for monitoring service performance over a virtual private network connection by simulating end user activity
US7006514B2 (en) * 2001-05-31 2006-02-28 Polytechnic University Pipelined maximal-sized matching cell dispatch scheduling
US7512964B2 (en) 2001-06-29 2009-03-31 Cisco Technology System and method for archiving multiple downloaded recordable media content
US7526788B2 (en) 2001-06-29 2009-04-28 Scientific-Atlanta, Inc. Graphic user interface alternate download options for unavailable PRM content
US7496945B2 (en) 2001-06-29 2009-02-24 Cisco Technology, Inc. Interactive program guide for bidirectional services
US8006262B2 (en) * 2001-06-29 2011-08-23 Rodriguez Arturo A Graphic user interfaces for purchasable and recordable media (PRM) downloads
US7191243B2 (en) * 2001-11-15 2007-03-13 Microsoft Corporation Scheduling and multiplexing data for broadcast transmission over multiple streams
US7437438B2 (en) * 2001-12-27 2008-10-14 Hewlett-Packard Development Company, L.P. System and method for energy efficient data prefetching
US7334251B2 (en) 2002-02-11 2008-02-19 Scientific-Atlanta, Inc. Management of television advertising
US20030204856A1 (en) * 2002-04-30 2003-10-30 Buxton Mark J. Distributed server video-on-demand system
US7111314B2 (en) * 2002-05-03 2006-09-19 Time Warner Entertainment Company, L.P. Technique for delivering entertainment programming content including interactive features in a communications network
US7552192B2 (en) * 2002-12-18 2009-06-23 Ronnie Gerome Carmichael Massively parallel computer network-utilizing MPACT and multipoint parallel server (MPAS) technologies
US8832758B2 (en) * 2003-03-17 2014-09-09 Qwest Communications International Inc. Methods and systems for providing video on demand
JP2005033627A (en) * 2003-07-09 2005-02-03 Nec Corp Content distribution system, distribution server device, client device, content distribution method and program
US7310807B2 (en) 2003-10-29 2007-12-18 Sbc Knowledge Ventures, L.P. System and method for local video distribution
EG23529A (en) 2003-11-05 2006-04-11 Amri Moosa E Al System and method to broadcast the video or tv anddisplaying on pc tv by choosing the required prog ram from the internet
US8161388B2 (en) 2004-01-21 2012-04-17 Rodriguez Arturo A Interactive discovery of display device characteristics
PL367409A1 (en) * 2004-04-20 2005-10-31 Advanced Digital Broadcast Ltd. Tv analogue and digital signal receiver and method for receiving analogue and digital signals
US8904458B2 (en) * 2004-07-29 2014-12-02 At&T Intellectual Property I, L.P. System and method for pre-caching a first portion of a video file on a set-top box
US8584257B2 (en) 2004-08-10 2013-11-12 At&T Intellectual Property I, L.P. Method and interface for video content acquisition security on a set-top box
US8473475B2 (en) * 2004-09-15 2013-06-25 Samsung Electronics Co., Ltd. Information storage medium for storing metadata supporting multiple languages, and systems and methods of processing metadata
US8086261B2 (en) * 2004-10-07 2011-12-27 At&T Intellectual Property I, L.P. System and method for providing digital network access and digital broadcast services using combined channels on a single physical medium to the customer premises
US20060090186A1 (en) * 2004-10-21 2006-04-27 Santangelo Bryan D Programming content capturing and processing system and method
US7716714B2 (en) 2004-12-01 2010-05-11 At&T Intellectual Property I, L.P. System and method for recording television content at a set top box
US8434116B2 (en) 2004-12-01 2013-04-30 At&T Intellectual Property I, L.P. Device, system, and method for managing television tuners
US7474359B2 (en) 2004-12-06 2009-01-06 At&T Intellectual Properties I, L.P. System and method of displaying a video stream
US7307574B2 (en) 2005-02-02 2007-12-11 Sbc Knowledge Ventures, Lp Remote control, apparatus, system and methods of using the same
US8214859B2 (en) 2005-02-14 2012-07-03 At&T Intellectual Property I, L.P. Automatic switching between high definition and standard definition IP television signals
TWI307589B (en) 2005-05-18 2009-03-11 Innovative Sonic Ltd Method and apparatus of data segmentation in a mobile communications system
US8054849B2 (en) 2005-05-27 2011-11-08 At&T Intellectual Property I, L.P. System and method of managing video content streams
US7908627B2 (en) 2005-06-22 2011-03-15 At&T Intellectual Property I, L.P. System and method to provide a unified video signal for diverse receiving platforms
US8893199B2 (en) 2005-06-22 2014-11-18 At&T Intellectual Property I, L.P. System and method of managing video content delivery
US8365218B2 (en) 2005-06-24 2013-01-29 At&T Intellectual Property I, L.P. Networked television and method thereof
US8635659B2 (en) 2005-06-24 2014-01-21 At&T Intellectual Property I, L.P. Audio receiver modular card and method thereof
US8282476B2 (en) 2005-06-24 2012-10-09 At&T Intellectual Property I, L.P. Multimedia-based video game distribution
US8190688B2 (en) 2005-07-11 2012-05-29 At&T Intellectual Property I, Lp System and method of transmitting photographs from a set top box
US7873102B2 (en) * 2005-07-27 2011-01-18 At&T Intellectual Property I, Lp Video quality testing by encoding aggregated clips
US8189472B2 (en) 2005-09-07 2012-05-29 Mcdonald James F Optimizing bandwidth utilization to a subscriber premises
US7397400B2 (en) * 2005-12-02 2008-07-08 Viasat, Inc. Variable length data encapsulation and encoding
KR101265643B1 (en) * 2006-08-22 2013-05-22 엘지전자 주식회사 A mothod of executing handover and controlling thereof in mobile communication system
KR101387500B1 (en) 2006-08-22 2014-04-21 엘지전자 주식회사 Method of transmitting and receiving control information in wireless communicaiton system
KR101430449B1 (en) * 2006-10-02 2014-08-14 엘지전자 주식회사 Method for transmitting and receiving paging message in wireless communication system
US8520644B2 (en) 2006-10-30 2013-08-27 Lg Electronics Inc. Method for re-direction of uplink access
EP2084928B1 (en) * 2006-10-30 2017-08-23 LG Electronics Inc. Method of performing random access in a wireless communication system
KR101443618B1 (en) * 2006-10-30 2014-09-23 엘지전자 주식회사 Method for transmitting random access channel message and response message, and Mobile communication terminal
KR100938754B1 (en) 2006-10-30 2010-01-26 엘지전자 주식회사 Data transmission method and data receiving method using discontinuous reception
JP4240331B2 (en) * 2006-11-02 2009-03-18 ソニー株式会社 Transmitting apparatus and method, program, and communication system,
US20080119178A1 (en) * 2006-11-21 2008-05-22 Samsung Electronics Co., Ltd. Allocating Compression-Based Firmware Over the Air
US7921221B2 (en) * 2007-01-22 2011-04-05 Minborg Invent I Goteborg Ab Method and apparatus for obtaining digital objects in a communication network
US8234354B2 (en) * 2007-03-09 2012-07-31 Mitsubishi Electric Corporation File transfer method and file transfer system
KR101461236B1 (en) * 2007-04-30 2014-11-12 엘지전자 주식회사 Methods for performing an Authentication of entities during establishment of wireless call connection
KR101469281B1 (en) * 2007-04-30 2014-12-04 엘지전자 주식회사 Method for state transition of mobile terminal
KR101386812B1 (en) * 2007-04-30 2014-04-29 엘지전자 주식회사 Methods for transmitting or receiving data unit(s) using a header field existence indicator
KR101464748B1 (en) * 2007-04-30 2014-11-24 엘지전자 주식회사 Method for triggering a measurement report of mobile terminal
EP2137910B1 (en) * 2007-04-30 2015-07-08 LG Electronics Inc. Methods of transmitting data blocks in wireless communication system
EP2132910B1 (en) * 2007-04-30 2016-01-06 LG Electronics Inc. Method of transmitting data in a wireless communication system
US8184570B2 (en) * 2007-04-30 2012-05-22 Lg Electronics Inc. Method of transmitting data in wireless communication system supporting multimedia broadcast/multicast service
KR101476188B1 (en) * 2007-04-30 2014-12-24 엘지전자 주식회사 Methods of generating data block in mobile communication system
KR20080097338A (en) * 2007-05-01 2008-11-05 엘지전자 주식회사 Discontinuous data transmittion/reception method
US20080273503A1 (en) * 2007-05-02 2008-11-06 Lg Electronics Inc. Method and terminal for performing handover in mobile communications system of point-to-multipoint service
US20080273482A1 (en) * 2007-05-02 2008-11-06 Lg Electronics Inc. Uplink access method for receiving a point-to-multipoint service
KR100917205B1 (en) * 2007-05-02 2009-09-15 엘지전자 주식회사 Method of configuring a data block in wireless communication system
US8005115B2 (en) * 2007-05-03 2011-08-23 Lg Electronics Inc. Method of transferring a data block in a wireless communication system
KR101470638B1 (en) 2007-06-18 2014-12-08 엘지전자 주식회사 Method for enhancing radio resource and informing status report in mobile telecommunications system and receiver of mobile telecommunications
KR101476194B1 (en) * 2007-06-18 2014-12-24 엘지전자 주식회사 Control channel reception method for receiving a broadcast or multicast service
EP2627146B1 (en) 2007-06-18 2017-09-20 LG Electronics Inc. Method and user equipment for performing uplink synchronization in wireless communication system
EP2168263B1 (en) * 2007-06-18 2018-04-18 Lg Electronics Inc. Paging information transmission method for effective call setup
KR101526971B1 (en) * 2007-06-18 2015-06-11 엘지전자 주식회사 Method for transmitting/receiving broadcast or multicast service and terminal thereof
KR101387537B1 (en) * 2007-09-20 2014-04-21 엘지전자 주식회사 A method for handling correctly received but header compression failed packets
WO2009038312A2 (en) * 2007-09-20 2009-03-26 Lg Electronics Inc. A method for handling correctly received but header compression failed packets
CN101889425B (en) 2007-12-14 2013-10-30 汤姆逊许可公司 Apparatus and method for simulcast over variable bandwidth channel
JP2011507127A (en) 2007-12-18 2011-03-03 トムソン ライセンシングThomson Licensing Apparatus and method for estimating the size of the file through a broadcast network
US8484162B2 (en) * 2008-06-24 2013-07-09 Commvault Systems, Inc. De-duplication systems and methods for application-specific data
FR2933213A1 (en) 2008-06-30 2010-01-01 Thomson Licensing User interface display method and corresponding emission method
JP2010081459A (en) * 2008-09-29 2010-04-08 Hitachi Ltd Vod receiving and playback device
US8775665B2 (en) * 2009-02-09 2014-07-08 Citrix Systems, Inc. Method for controlling download rate of real-time streaming as needed by media player
US8626621B2 (en) * 2010-03-02 2014-01-07 Microsoft Corporation Content stream management
US8577851B2 (en) 2010-09-30 2013-11-05 Commvault Systems, Inc. Content aligned block-based deduplication
US8572340B2 (en) 2010-09-30 2013-10-29 Commvault Systems, Inc. Systems and methods for retaining and using data block signatures in data protection operations
US9020900B2 (en) 2010-12-14 2015-04-28 Commvault Systems, Inc. Distributed deduplicated storage system
US8954446B2 (en) 2010-12-14 2015-02-10 Comm Vault Systems, Inc. Client-side repository in a networked deduplicated storage system
US9252916B2 (en) 2012-02-13 2016-02-02 Affirmed Networks, Inc. Mobile video delivery
WO2013188550A1 (en) 2012-06-13 2013-12-19 Commvault Systems, Inc. Client-side signature repository in a networked storage system
CN102917277B (en) * 2012-10-29 2015-01-21 清华大学深圳研究生院 Content fragment distribution method realizing on-demand casting through broadcasting
US9633033B2 (en) 2013-01-11 2017-04-25 Commvault Systems, Inc. High availability distributed deduplicated storage system
US20150089072A1 (en) * 2013-09-25 2015-03-26 Ericsson Television Inc System and method for managing adjacent channels in an adaptive streaming environment
US9444856B2 (en) * 2013-09-25 2016-09-13 Ericsson Ab System and method for managing adjacent channels in an adaptive streaming environment
US10380072B2 (en) 2014-03-17 2019-08-13 Commvault Systems, Inc. Managing deletions from a deduplication database
US9633056B2 (en) 2014-03-17 2017-04-25 Commvault Systems, Inc. Maintaining a deduplication database
US9575673B2 (en) 2014-10-29 2017-02-21 Commvault Systems, Inc. Accessing a file system using tiered deduplication
US10339106B2 (en) 2015-04-09 2019-07-02 Commvault Systems, Inc. Highly reusable deduplication database after disaster recovery
US10310953B2 (en) 2015-12-30 2019-06-04 Commvault Systems, Inc. System for redirecting requests after a secondary storage computing device failure

Citations (57)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4945563A (en) * 1986-11-05 1990-07-31 Satellite Technology Services, Inc. Video system and method for controlled viewing and videotaping
US4963995A (en) * 1988-12-27 1990-10-16 Explore Technology, Inc. Audio/video transceiver apparatus including compression means
US5132992A (en) * 1991-01-07 1992-07-21 Paul Yurt Audio and video transmission and receiving system
US5521630A (en) * 1994-04-04 1996-05-28 International Business Machines Corporation Frame sampling scheme for video scanning in a video-on-demand system
US5557316A (en) * 1990-09-28 1996-09-17 Ictv, Inc. System for distributing broadcast television services identically on a first bandwidth portion of a plurality of express trunks and interactive services over a second bandwidth portion of each express trunk on a subscriber demand basis
US5604528A (en) * 1992-06-10 1997-02-18 Scientific-Atlanta, Inc. Method and apparatus for providing periodic subscription television services
US5612742A (en) * 1994-10-19 1997-03-18 Imedia Corporation Method and apparatus for encoding and formatting data representing a video program to provide multiple overlapping presentations of the video program
US5619249A (en) * 1994-09-14 1997-04-08 Time Warner Entertainment Company, L.P. Telecasting service for providing video programs on demand with an interactive interface for facilitating viewer selection of video programs
US5632681A (en) * 1995-03-07 1997-05-27 International Business Machines Corporation Universal electronic video game renting/distributing system
US5654746A (en) * 1994-12-01 1997-08-05 Scientific-Atlanta, Inc. Secure authorization and control method and apparatus for a game delivery service
US5701582A (en) * 1989-08-23 1997-12-23 Delta Beta Pty. Ltd. Method and apparatus for efficient transmissions of programs
US5745758A (en) * 1991-09-20 1998-04-28 Shaw; Venson M. System for regulating multicomputer data transfer by allocating time slot to designated processing task according to communication bandwidth capabilities and modifying time slots when bandwidth change
US5751282A (en) * 1995-06-13 1998-05-12 Microsoft Corporation System and method for calling video on demand using an electronic programming guide
US5751709A (en) * 1995-12-28 1998-05-12 Lucent Technologies Inc. Adaptive time slot scheduling apparatus and method for end-points in an ATM network
US5768539A (en) * 1994-05-27 1998-06-16 Bell Atlantic Network Services, Inc. Downloading applications software through a broadcast channel
US5781228A (en) * 1995-09-07 1998-07-14 Microsoft Corporation Method and system for displaying an interactive program with intervening informational segments
US5790423A (en) * 1995-06-14 1998-08-04 Audible, Inc. Interactive audio transmission receiving and playback system
US5805804A (en) * 1994-11-21 1998-09-08 Oracle Corporation Method and apparatus for scalable, high bandwidth storage retrieval and transportation of multimedia data on a network
US5815146A (en) * 1994-06-30 1998-09-29 Hewlett-Packard Company Video on demand system with multiple data sources configured to provide VCR-like services
US5850258A (en) * 1995-03-21 1998-12-15 Samsung Electronics Co., Ltd. High level video decoding apparatus capable of decoding video data of a plurality of channels coded at a lower level
US5856973A (en) * 1996-09-10 1999-01-05 Thompson; Kenneth M. Data multiplexing in MPEG server to decoder systems
US5892535A (en) * 1996-05-08 1999-04-06 Digital Video Systems, Inc. Flexible, configurable, hierarchical system for distributing programming
US5909594A (en) * 1997-02-24 1999-06-01 Silicon Graphics, Inc. System for communications where first priority data transfer is not disturbed by second priority data transfer and where allocated bandwidth is removed when process terminates abnormally
US5915094A (en) * 1994-12-06 1999-06-22 International Business Machines Corporation Disk access method for delivering multimedia and video information on demand over wide area networks
US5949948A (en) * 1995-11-20 1999-09-07 Imedia Corporation Method and apparatus for implementing playback features for compressed video data
US5978649A (en) * 1996-12-27 1999-11-02 Hughes Electronics Corporation Method and apparatus for dynamic conditional channel authorization in a broadcast system
US5995092A (en) * 1996-08-30 1999-11-30 Yuen; Henry C. Television system and method for subscription of information services
US6005599A (en) * 1993-12-27 1999-12-21 Hitachi, Ltd. Video storage and delivery apparatus and system
US6012080A (en) * 1996-03-27 2000-01-04 Lucent Technologies Inc. Method and apparatus for providing enhanced pay per view in a video server
US6011798A (en) * 1997-08-15 2000-01-04 Intel Corporation Adaptive transmit rate control scheduler
US6018765A (en) * 1996-01-23 2000-01-25 Storage Concepts, Inc. Multi-channel multimedia data server
US6018359A (en) * 1998-04-24 2000-01-25 Massachusetts Institute Of Technology System and method for multicast video-on-demand delivery system
US6029045A (en) * 1997-12-09 2000-02-22 Cogent Technology, Inc. System and method for inserting local content into programming content
US6028847A (en) * 1997-07-31 2000-02-22 Hewlett-Packard Company Multiple stream traffic emulator
US6049332A (en) * 1996-10-07 2000-04-11 Sony Corporation Method and apparatus for the scheduling and ordering of elements in a multimedia environment
US6055560A (en) * 1996-11-08 2000-04-25 International Business Machines Corporation System and method to provide interactivity for a networked video server
US6055571A (en) * 1997-11-20 2000-04-25 Nec Usa, Inc. Computer network with microeconomic flow control
US6058122A (en) * 1997-08-12 2000-05-02 Electronics And Telecommunications Research Institute Device for splitting a screen in MPEG image signals at a completely compressed domain and the method thereof
US6075570A (en) * 1995-03-31 2000-06-13 Sony Corporation Electronic program guide system and electronic guide displaying method
US6076062A (en) * 1995-12-07 2000-06-13 U.S. Philips Corporation Method and device for transferring and decoding a non-PCM bitstream between a digital video disc and a multi-channel reproduction apparatus
US6112023A (en) * 1997-02-24 2000-08-29 Lucent Technologies Inc. Scheduling-based hardware-software co-synthesis of heterogeneous distributed embedded systems
US6118821A (en) * 1997-05-15 2000-09-12 Matsushita Electric Industrial Co., Ltd. Compressed code decoding device and audio decoding device
US6128467A (en) * 1996-03-21 2000-10-03 Compaq Computer Corporation Crosspoint switched multimedia system
US6160546A (en) * 1998-05-01 2000-12-12 United Video Properties, Inc. Program guide systems and methods
US6167085A (en) * 1997-07-31 2000-12-26 Sony Corporation Image data compression
US6169767B1 (en) * 1997-03-10 2001-01-02 Sarnoff Corporation Universal network interface module
US6198723B1 (en) * 1998-04-14 2001-03-06 Paxonet Communications, Inc. Asynchronous transfer mode traffic shapers
US6199076B1 (en) * 1996-10-02 2001-03-06 James Logan Audio program player including a dynamic program selection controller
US6219335B1 (en) * 1997-06-20 2001-04-17 Nortel Networks Corporation Method and apparatus for locating and isolating a fault within a token ring network
US6222530B1 (en) * 1998-08-21 2001-04-24 Corporate Media Partners System and method for a master scheduler
US6233389B1 (en) * 1998-07-30 2001-05-15 Tivo, Inc. Multimedia time warping system
US6246695B1 (en) * 1995-06-21 2001-06-12 Bell Atlantic Network Services, Inc. Variable rate and variable mode transmission system
US6263019B1 (en) * 1998-10-09 2001-07-17 Matsushita Electric Industrial Co., Ltd. Variable rate MPEG-2 video syntax processor
US6263114B1 (en) * 1997-07-31 2001-07-17 Sony Corporation Apparatus and method for compressing image data by determining a quantization factor which provides more efficient use of an available bit rate
US6272546B1 (en) * 1998-03-12 2001-08-07 Sony Corporation Method of and apparatus for managing resource allocation and bandwidth overflow in a cooperative, distributed computing environment
US6285685B1 (en) * 1997-06-26 2001-09-04 Samsung Electronics Co., Ltd. Apparatus and method for providing PC communication and internet service by using settop box
US6502139B1 (en) * 1999-06-01 2002-12-31 Technion Research And Development Foundation Ltd. System for optimizing video on demand transmission by partitioning video program into multiple segments, decreasing transmission rate for successive segments and repeatedly, simultaneously transmission

Family Cites Families (26)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4280221A (en) 1979-05-31 1981-07-21 The Boeing Company Digital data communication system
US5421031A (en) 1989-08-23 1995-05-30 Delta Beta Pty. Ltd. Program transmission optimisation
US5089982A (en) 1990-05-24 1992-02-18 Grumman Aerospace Corporation Two dimensional fast Fourier transform converter
US5724646A (en) 1995-06-15 1998-03-03 International Business Machines Corporation Fixed video-on-demand
US5751336A (en) * 1995-10-12 1998-05-12 International Business Machines Corporation Permutation based pyramid block transmission scheme for broadcasting in video-on-demand storage systems
EP0808064B1 (en) 1995-12-01 2004-03-03 Matsushita Electric Industrial Co., Ltd. Apparatus, system and method for information processing for data transfer network
US5594491A (en) * 1995-12-29 1997-01-14 Vxl/Hcr Technology Corporation Near-video-on-demand digital video distribution system utilizing asymmetric digital subscriber lines
CA2196622C (en) * 1996-02-06 2001-10-16 Hiroshi Jinzenji Network data distribution system
PT891669E (en) * 1996-04-01 2001-01-31 Macrovision Corp Method for controlling copy protection on digital video networks
US5831662A (en) * 1996-04-04 1998-11-03 Hughes Electronics Corporation Near on-demand digital information delivery system and method using signal fragmentation and sequencing to reduce average bandwidth and peak bandwidth variability
US5961603A (en) 1996-04-10 1999-10-05 Worldgate Communications, Inc. Access system and method for providing interactive access to an information source through a networked distribution system
JP3934174B2 (en) * 1996-04-30 2007-06-20 ブラザー工業株式会社 Relay server
US5778187A (en) * 1996-05-09 1998-07-07 Netcast Communications Corp. Multicasting method and apparatus
US6282195B1 (en) 1997-01-09 2001-08-28 Silicon Graphics, Inc. Packetized data transmissions in a switched router architecture
JP3354433B2 (en) * 1997-04-25 2002-12-09 株式会社日立製作所 Network communication system
US6049539A (en) 1997-09-15 2000-04-11 Worldgate Communications, Inc. Access system and method for providing interactive access to an information source through a networked distribution system
US6072808A (en) * 1997-12-23 2000-06-06 Intel Corporation Method of providing and retrieving a data segment
US6349098B1 (en) 1998-04-17 2002-02-19 Paxonet Communications, Inc. Method and apparatus for forming a virtual circuit
US6157949A (en) 1998-05-28 2000-12-05 Industrial Technology Research Institute Data placement on direct access devices for media servers with cyclic re-broadcast capability
US6266369B1 (en) 1998-06-09 2001-07-24 Worldgate Service, Inc. MPEG encoding technique for encoding web pages
US6237135B1 (en) * 1998-06-18 2001-05-22 Borland Software Corporation Development system with visual design tools for creating and maintaining Java Beans components
US6754905B2 (en) * 1998-07-23 2004-06-22 Diva Systems Corporation Data structure and methods for providing an interactive program guide
US6215526B1 (en) 1998-11-06 2001-04-10 Tivo, Inc. Analog video tagging and encoding system
US6219355B1 (en) 1998-11-30 2001-04-17 Qwest Communications International Inc. Video and data communication system
US6370688B1 (en) 1999-05-26 2002-04-09 Enounce, Inc. Method and apparatus for server broadcast of time-converging multi-media streams
JP4253830B2 (en) * 2000-02-10 2009-04-15 ソニー株式会社 Information recording apparatus, information reproducing apparatus, information recording and reproducing apparatus and method

Patent Citations (58)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4945563A (en) * 1986-11-05 1990-07-31 Satellite Technology Services, Inc. Video system and method for controlled viewing and videotaping
US4963995A (en) * 1988-12-27 1990-10-16 Explore Technology, Inc. Audio/video transceiver apparatus including compression means
US5701582A (en) * 1989-08-23 1997-12-23 Delta Beta Pty. Ltd. Method and apparatus for efficient transmissions of programs
US5557316A (en) * 1990-09-28 1996-09-17 Ictv, Inc. System for distributing broadcast television services identically on a first bandwidth portion of a plurality of express trunks and interactive services over a second bandwidth portion of each express trunk on a subscriber demand basis
US5132992A (en) * 1991-01-07 1992-07-21 Paul Yurt Audio and video transmission and receiving system
US5745758A (en) * 1991-09-20 1998-04-28 Shaw; Venson M. System for regulating multicomputer data transfer by allocating time slot to designated processing task according to communication bandwidth capabilities and modifying time slots when bandwidth change
US5604528A (en) * 1992-06-10 1997-02-18 Scientific-Atlanta, Inc. Method and apparatus for providing periodic subscription television services
US6005599A (en) * 1993-12-27 1999-12-21 Hitachi, Ltd. Video storage and delivery apparatus and system
US5521630A (en) * 1994-04-04 1996-05-28 International Business Machines Corporation Frame sampling scheme for video scanning in a video-on-demand system
US5768539A (en) * 1994-05-27 1998-06-16 Bell Atlantic Network Services, Inc. Downloading applications software through a broadcast channel
US5815146A (en) * 1994-06-30 1998-09-29 Hewlett-Packard Company Video on demand system with multiple data sources configured to provide VCR-like services
US5619249A (en) * 1994-09-14 1997-04-08 Time Warner Entertainment Company, L.P. Telecasting service for providing video programs on demand with an interactive interface for facilitating viewer selection of video programs
US5612742A (en) * 1994-10-19 1997-03-18 Imedia Corporation Method and apparatus for encoding and formatting data representing a video program to provide multiple overlapping presentations of the video program
US5805804A (en) * 1994-11-21 1998-09-08 Oracle Corporation Method and apparatus for scalable, high bandwidth storage retrieval and transportation of multimedia data on a network
US5654746A (en) * 1994-12-01 1997-08-05 Scientific-Atlanta, Inc. Secure authorization and control method and apparatus for a game delivery service
US6029046A (en) * 1994-12-01 2000-02-22 Scientific-Atlanta, Inc. Method and apparatus for a game delivery service including flash memory and a game back-up module
US5915094A (en) * 1994-12-06 1999-06-22 International Business Machines Corporation Disk access method for delivering multimedia and video information on demand over wide area networks
US5632681A (en) * 1995-03-07 1997-05-27 International Business Machines Corporation Universal electronic video game renting/distributing system
US5850258A (en) * 1995-03-21 1998-12-15 Samsung Electronics Co., Ltd. High level video decoding apparatus capable of decoding video data of a plurality of channels coded at a lower level
US6075570A (en) * 1995-03-31 2000-06-13 Sony Corporation Electronic program guide system and electronic guide displaying method
US5751282A (en) * 1995-06-13 1998-05-12 Microsoft Corporation System and method for calling video on demand using an electronic programming guide
US5790423A (en) * 1995-06-14 1998-08-04 Audible, Inc. Interactive audio transmission receiving and playback system
US6246695B1 (en) * 1995-06-21 2001-06-12 Bell Atlantic Network Services, Inc. Variable rate and variable mode transmission system
US5781228A (en) * 1995-09-07 1998-07-14 Microsoft Corporation Method and system for displaying an interactive program with intervening informational segments
US5949948A (en) * 1995-11-20 1999-09-07 Imedia Corporation Method and apparatus for implementing playback features for compressed video data
US6076062A (en) * 1995-12-07 2000-06-13 U.S. Philips Corporation Method and device for transferring and decoding a non-PCM bitstream between a digital video disc and a multi-channel reproduction apparatus
US5751709A (en) * 1995-12-28 1998-05-12 Lucent Technologies Inc. Adaptive time slot scheduling apparatus and method for end-points in an ATM network
US6018765A (en) * 1996-01-23 2000-01-25 Storage Concepts, Inc. Multi-channel multimedia data server
US6128467A (en) * 1996-03-21 2000-10-03 Compaq Computer Corporation Crosspoint switched multimedia system
US6012080A (en) * 1996-03-27 2000-01-04 Lucent Technologies Inc. Method and apparatus for providing enhanced pay per view in a video server
US5892535A (en) * 1996-05-08 1999-04-06 Digital Video Systems, Inc. Flexible, configurable, hierarchical system for distributing programming
US5995092A (en) * 1996-08-30 1999-11-30 Yuen; Henry C. Television system and method for subscription of information services
US5856973A (en) * 1996-09-10 1999-01-05 Thompson; Kenneth M. Data multiplexing in MPEG server to decoder systems
US6199076B1 (en) * 1996-10-02 2001-03-06 James Logan Audio program player including a dynamic program selection controller
US6049332A (en) * 1996-10-07 2000-04-11 Sony Corporation Method and apparatus for the scheduling and ordering of elements in a multimedia environment
US6055560A (en) * 1996-11-08 2000-04-25 International Business Machines Corporation System and method to provide interactivity for a networked video server
US5978649A (en) * 1996-12-27 1999-11-02 Hughes Electronics Corporation Method and apparatus for dynamic conditional channel authorization in a broadcast system
US6112023A (en) * 1997-02-24 2000-08-29 Lucent Technologies Inc. Scheduling-based hardware-software co-synthesis of heterogeneous distributed embedded systems
US5909594A (en) * 1997-02-24 1999-06-01 Silicon Graphics, Inc. System for communications where first priority data transfer is not disturbed by second priority data transfer and where allocated bandwidth is removed when process terminates abnormally
US6169767B1 (en) * 1997-03-10 2001-01-02 Sarnoff Corporation Universal network interface module
US6118821A (en) * 1997-05-15 2000-09-12 Matsushita Electric Industrial Co., Ltd. Compressed code decoding device and audio decoding device
US6219335B1 (en) * 1997-06-20 2001-04-17 Nortel Networks Corporation Method and apparatus for locating and isolating a fault within a token ring network
US6285685B1 (en) * 1997-06-26 2001-09-04 Samsung Electronics Co., Ltd. Apparatus and method for providing PC communication and internet service by using settop box
US6263114B1 (en) * 1997-07-31 2001-07-17 Sony Corporation Apparatus and method for compressing image data by determining a quantization factor which provides more efficient use of an available bit rate
US6028847A (en) * 1997-07-31 2000-02-22 Hewlett-Packard Company Multiple stream traffic emulator
US6167085A (en) * 1997-07-31 2000-12-26 Sony Corporation Image data compression
US6058122A (en) * 1997-08-12 2000-05-02 Electronics And Telecommunications Research Institute Device for splitting a screen in MPEG image signals at a completely compressed domain and the method thereof
US6011798A (en) * 1997-08-15 2000-01-04 Intel Corporation Adaptive transmit rate control scheduler
US6055571A (en) * 1997-11-20 2000-04-25 Nec Usa, Inc. Computer network with microeconomic flow control
US6029045A (en) * 1997-12-09 2000-02-22 Cogent Technology, Inc. System and method for inserting local content into programming content
US6272546B1 (en) * 1998-03-12 2001-08-07 Sony Corporation Method of and apparatus for managing resource allocation and bandwidth overflow in a cooperative, distributed computing environment
US6198723B1 (en) * 1998-04-14 2001-03-06 Paxonet Communications, Inc. Asynchronous transfer mode traffic shapers
US6018359A (en) * 1998-04-24 2000-01-25 Massachusetts Institute Of Technology System and method for multicast video-on-demand delivery system
US6160546A (en) * 1998-05-01 2000-12-12 United Video Properties, Inc. Program guide systems and methods
US6233389B1 (en) * 1998-07-30 2001-05-15 Tivo, Inc. Multimedia time warping system
US6222530B1 (en) * 1998-08-21 2001-04-24 Corporate Media Partners System and method for a master scheduler
US6263019B1 (en) * 1998-10-09 2001-07-17 Matsushita Electric Industrial Co., Ltd. Variable rate MPEG-2 video syntax processor
US6502139B1 (en) * 1999-06-01 2002-12-31 Technion Research And Development Foundation Ltd. System for optimizing video on demand transmission by partitioning video program into multiple segments, decreasing transmission rate for successive segments and repeatedly, simultaneously transmission

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20010044867A1 (en) * 1998-09-11 2001-11-22 Mentor Data System, Inc. System and process based on hierarchical PCI bus architecture
US20040097288A1 (en) * 2002-11-14 2004-05-20 Sloate Jim A. Multiplexed secure video game play distribution
US20070275780A1 (en) * 2002-11-14 2007-11-29 Nintendo Co., Ltd. Multiplexed secure video game play distribution
US7878908B2 (en) * 2002-11-14 2011-02-01 Nintendo Co., Ltd. Multiplexed secure video game play distribution
US8834273B2 (en) * 2002-11-14 2014-09-16 Nintendo Co., Ltd. Multiplexed secure video game play distribution
US20110317979A1 (en) * 2010-06-28 2011-12-29 Cox Communications, Inc. Bookmark exchange
US8488942B2 (en) * 2010-06-28 2013-07-16 Cox Communications, Inc. Bookmark exchange

Also Published As

Publication number Publication date
US20030140122A1 (en) 2003-07-24
EP1285345A1 (en) 2003-02-26
AU6795800A (en) 2001-12-11
KR20030071481A (en) 2003-09-03
EP1285345A4 (en) 2004-06-02
US20030105834A1 (en) 2003-06-05
PL359130A1 (en) 2004-08-23
BR0017253A (en) 2003-11-04
EP1285533A1 (en) 2003-02-26
CA2404611A1 (en) 2001-12-06
ZA200209221B (en) 2003-09-10
ZA200209222B (en) 2003-09-11
WO2001093060A1 (en) 2001-12-06
TW508949B (en) 2002-11-01
CN1355904A (en) 2002-06-26
US6725267B1 (en) 2004-04-20
MXPA02011841A (en) 2003-12-11
EA200201288A1 (en) 2003-08-28
JP2003535531A (en) 2003-11-25
WO2001093585A1 (en) 2001-12-06
US6557030B1 (en) 2003-04-29
IL152762D0 (en) 2003-06-24
ZA200209223B (en) 2003-09-11
KR20030034081A (en) 2003-05-01
ZA200209220B (en) 2003-09-01
EA200201286A1 (en) 2003-08-28
NO20025710D0 (en) 2002-11-14
NO20025710L (en) 2003-01-16

Similar Documents

Publication Publication Date Title
EP1670252B1 (en) Accelerated channel change in rate-limited environments
US7716700B2 (en) Technique for delivering entertainment programming content including commercial content therein over a communications network
US6141053A (en) Method of optimizing bandwidth for transmitting compressed video data streams
US5414455A (en) Segmented video on demand system
US5446490A (en) Interactive television with tailored programming
US5905522A (en) Resource allocation method for interactive televideo system
US5761416A (en) Method and apparatus for distributing network bandwidth on a video server for transmission of bit streams across multiple network interfaces connected to a single internet protocol (IP) network
US8726331B2 (en) System and method for the broadcast dissemination of time-ordered data
Juhn et al. Staircase data broadcasting and receiving scheme for hot video service
US5442390A (en) Video on demand with memory accessing and or like functions
US6211901B1 (en) Video data distributing device by video on demand
US7174384B2 (en) Method for delivering large amounts of data with interactivity in an on-demand system
US6999477B1 (en) Method and system for providing multiple services to end-users
Pâris et al. Zero-delay broadcasting protocols for video-on-demand
CN1321531C (en) Method and system for starting multimedia content timely
US20080282299A1 (en) Method and Apparatus for Delivering Consumer Entertainment Services Accessed Over an Ip Network
ES2542310T3 (en) Method and apparatus for changing channels of continuous stream content received
US7926080B2 (en) Trick mode support for VOD with long intra-frame intervals
US20130179932A1 (en) Programming Content Processing and Management System and Method
JP5373131B2 (en) Send and receive real-time data
US6018359A (en) System and method for multicast video-on-demand delivery system
US7849490B2 (en) Method and apparatus providing scalability for channel change requests in a switched digital video system
US8443411B2 (en) System and method to distribute video-on-demand content
US7610606B2 (en) Technique for effectively providing various entertainment services through a communications network
EP1071287A2 (en) Television advertisement delivery system and method

Legal Events

Date Code Title Description
STCB Information on status: application discontinuation

Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION