The invention relates to communications systems and methods, and more particularly to a system and method for delivering programming content, along with alternate targeted advertisements, through a communications network, e.g., a cable TV network.
In traditional cable networks, a broadcast stream containing program material, e.g., a TV show, typically contains one or more splice points (commonly referred to as advertisement breaks) allowing for the insertion of advertisements. Many cable operators utilize these splice points to insert local advertisements or for self-promotion. For example, a cable operator may broadcast an advertisement for a local car dealership at a splice point during the TV show “Friends.” Although this form of advertising has been used for years, it is inefficient because in many instances the majority of subscribers watching the respective program material may not be a member of the audience for whom the advertisement is intended. For instance, in the example given above, many teenagers watch “Friends,” but relatively few teenagers are potential purchasers of automobiles.
In response to this problem, an improved technique known as targeted advertising has been used recently in some cable networks. Targeted advertising generally allows a cable operator to generate one or more sets of “targeted advertisements” aimed at various demographic groups, and deliver the targeted advertisements to those groups. Several techniques exist for delivering targeted advertisements to subscribers* set-top terminals (STTs) in a cable television network. According to one such technique, a cable operator's headend facility provides one or more sets of advertisements targeted at various demographic groups. Each STT in the network receives these targeted advertisements at opportune times, such as between 2:00 am and 6:00 am when the STT is not active, and stores them in memory. Subsequently, when subscribers are watching a cable program, the STT detects an upcoming advertisement break in the program and substitutes one or more of the targeted advertisements stored in memory for the regularly scheduled advertisements. The STT may use demographic information associated with the program currently being watched, or subscriber-related data collected by the STT, to select an appropriate substitute advertisement from among those stored in memory. In accordance with this technique, the targeted advertisements are inserted into the broadcast stream being received by the STT.
In accordance with another technique, a cable operator assigns, for a given program channel, a predetermined number of transmission channels to carry alternate targeted advertisements to the subscribers watching the given program channel. Using this technique, the cable operator prepares in advance a collection of targeted advertisements, without knowledge of the make-up of the actual audience of the given program channel at an advertisement break. To generate targeted advertisements, the cable operator utilizes a database containing demographic information describing the whole subscriber base. Typically, multiple targeted advertisement streams are generated for various demographic groups identified within the subscriber base. When an advertisement break occurs, the cable operator transmits the prepared streams of targeted advertisements through the respective transmission channels. Each stream of targeted advertisements contains control information indicating the demographic group for which the advertisements are intended. An STT in the network selects one of the streams of targeted advertisements based on one or more factors. These factors may include a demographic profile associated with the TV show currently being shown, or information known about the respective STT household. The STT tunes to the appropriate transmission channel, plays the selected stream of targeted advertisements during the advertisement break, and then re-tunes to the original TV show channel after the advertising break ends. However, this technique proves to be ineffective especially when members of a demographic group for which a targeted advertisement is intended are not present in the actual audience of the show.
The prior art techniques described above are inefficient for other reasons as well. For example, they require the installation and maintenance on STTs in the network of special software applications that perform tasks such as monitoring a program channel for advertisement breaks, maintaining and analyzing demographic information concerning the subscriber, and selecting one or more advertisements appropriate for the subscriber household. For many cable operators, it is costly and inefficient to install and maintain software applications in large numbers of STTs in a network.
The invention is premised upon the recognition that, in prior art, a cable operator does not know which subscribers are in fact watching material from a given program channel at the moment an advertising break occurs. Consequently, the cable operator does not know precisely who the target is. Not having the capability to determine precisely who is watching material from a respective program channel at a given moment, prior art systems require the cable operator to prepare a stream of targeted advertisements well in advance of the instant when an advertising break occurs. As a result, the prior art systems fail to to provide the cable operator a high level of accuracy in “targeting” advertisements.
In accordance with the invention, in response to a signal indicative of an event (e.g., an advertising break) in the delivery of programming content, an audience currently receiving the programming content is determined. Data descriptive of at least one group of members of the audience is then determined. At least one programming segment containing, e.g., targeted advertisements is generated based at least on the data. The at least one programming segment is provided, in lieu of the programming content, to the at least one group during the event.
Thus, the invention allows multiple sets of substitute advertisements to be generated, targeted at various demographic groups among the subscribers. In such case, a first specified set of set-top terminals (STTs) shows a first set of substitute advertisements, a second specified set of STTs shows a second set of substitute advertisements, etc.
In an illustrative embodiment of the invention, upon a detection of an upcoming advertising break on a program channel stream, the set-top terminals (STTs) that are currently receiving the program channel stream (the “targeted STTs) is dynamically identified. Data is obtained which is descriptive of the subscribers associated with the targeted STTs. The number of available transmission channels in the network is also determined. One or more streams of substitute advertisements targeted at all or a portion of the targeted STTs are generated. The substitute advertisements may be generated based on a variety of factors, including demographic data concerning the subscribers associated with the targeted STTs, and data indicating the number of unused transmission channels in the network.
During the advertising break, one or more streams of substitute advertisements are transmitted over one or more assigned transmission channels, respectively. The targeted STTs are directed to tune to the assigned transmission channels during the advertising break, and receive a stream of substitute advertisements. Consequently, the subscribers are shown substitute advertisements instead of the regularly-scheduled advertisements.
Further objects, features and advantages of the invention will become apparent from the following detailed description taken in conjunction with the accompanying drawings showing illustrative embodiments of the invention, in which:
The invention is directed to delivering program materials and targeted advertisements to subscribers through a broadband communications network, e.g., a cable TV network. The program materials transmitted over such a network may comprise one or more broadcast programs, e.g., TV shows, which typically are interrupted by advertisements. In this illustrative embodiment, streams containing the program materials of various program channels are transmitted through the network in accordance with a switched broadcast technique. One such switched broadcast technique is described, e.g., in Patent Application Publication No. 20030056217 published Mar. 20, 2003 and entitled “TECHNIQUE FOR EFFECTIVELY PROVIDING PROGRAM MATERIAL IN A CABLE TELEVISION SYSTEM”, hereby incorporated by reference. As fully described below, using the switched broadcast technique, the cable TV network makes available to subscribers in the same service area selected program channels on an as needed basis. As a result, the number of program channels furnished here, although not simultaneously, may exceed the maximum number of carriers or transmission channels allowed in the network.
The term “transmission channel” used here should not be confused with “program channel.” A “transmission channel” signifies a designated frequency band through which a stream containing program material is transmitted. On the other hand, a “program channel” signifies the source of the program material selected by a subscriber to view. For example, a subscriber may select program channel 18 to view program material provided by CBS, program channel 5 to view program material provided by FOX, program channel 7 to view program material provided by HBO, etc. In addition, as used herein, “program channel stream” refers to a stream containing program material provided by a respective program channel. “Program transmission channel” refers to a transmission channel through which a program channel stream is transmitted.
The aforementioned switched broadcast technique is particularly well-suited to targeted advertising. Because in accordance with such a technique, program channel streams are provided on an as needed basis, not all transmission channels in the network are utilized to transmit program channel streams all the time, resulting in one or more unused transmission channels in the network from time to time. The invention takes advantage of these unused transmission channels to transmit to subscribers alternate, targeted advertisements which, because of their short durations, do not occupy the unused transmission channels for an extended period of time anyway.
In accordance with the invention, when an upcoming advertisement break in a program is detected, one or more sets of substitute advertisements are generated in real time as alternates to the regularly-scheduled advertisements. The substitute advertisements may be generated based on demographic data descriptive of the subscribers currently receiving the program, i.e., the actual audience of the program. During the advertisement break, the sets of substitute advertisements are transmitted on unused transmission channels, respectively. A subscriber's STT may be directed to tune to a selected, unused transmission channel at the beginning of the advertisement break to receive a particular set of substitute advertisements, which may be targeted at the subscriber or his/her demographic group. Consequently, a first specified set of STTs may be directed to receive a first stream of substitute advertisements, a second specified set of STTs directed to receive a second stream of substitute advertisements, etc. After the advertisement break, those STTs having tuned away to receive substitute advertisements re-tune to the program transmission channel to receive the original programming.
In headend 100, program material processing unit 102 receives program materials from various sources via satellites, terrestrial microwave transmissions, cable, etc. The program materials are processed by unit 102 to form K individual program channel streams in a digital format, where K is an integer. Each program channel stream contains program material, which requires a transmission channel having a specified frequency band for its distribution.
Switching unit 104, under control of controller 112, selectively switches a subset of the K program channel streams, say, p program channel streams (where p≠K), to p input ports of ad cue detector 105, respectively. The p program channel streams are selected in a manner described below. The p input ports of detector 105 are selected by controller 112 which correspond to the appropriate inputs of modulators in modulator bank 106 so that the p program channel streams, after being processed by detector 105, are modulated onto the respective p carriers assigned by controller 112.
Ad cue detector 105 processes the p program channel streams to detect signals indicating that an advertisement break is imminent in a stream. Such signals may include, e.g., cue messages placed in the program channel stream in accordance with industry standards. Ad cue detector 105 informs controller 112 if an upcoming advertisement break in a program channel stream is detected.
Ad cue detector 105 feeds the p program channel streams to the corresponding inputs of modulators in modulator bank 106. For example, in accordance with a quadrature amplitude modulation (QAM) scheme, the modulators modulate the respective streams onto different carriers corresponding to the modulators. The modulated carriers traverse transmission channels (also known as “in-band” channels) associated therewith, which may occupy a forward passband ranging from 50 MHz to 550 MHz of a coaxial cable.
Combiner 108 combines the p modulated carriers to form a combined signal, which is fed to optical transceiver 110. The latter generates an optical signal representing the combined signal. The optical signal traverses optical fiber 113 to fiber node 122. A transceiver (not shown) in fiber node 122 which performs the inverse function to transceiver 110 converts the optical signal back to the combined signal in electrical form. The combined signal traverses cable distribution network 124 to one or more service area nodes (e.g., 126, 127). At each service area node (e.g., 126), the combined signal is multicast to one or more STTs in a service area, e.g., STTs 128-1 through 128-L.
In this instance, each STT in the service area contains a service table which associates the set of program channels, aggregately selected by the subscribers in that area, with the carriers from which the respective program channel materials can be obtained. For example, in response to a change in the selected program channels, controller 112 sends control messages, e.g., via a forward data channel (FDC) described below, to revise the service table in the STTs to reflect the new assignment of carrier frequencies to the latest set of program channels. Thus, based on such a service table, an STT can extract a desired program channel stream from the aforementioned combined signal by tuning to the corresponding carrier frequency. The program material is then derived in a well known manner from the extracted stream for viewing.
In addition to the in-band channels, downstream data, e.g., the aforementioned control messages and other system messages, may be communicated from headend 100 to STTs 128 via one or more FDCs, sometimes referred to as “out-of-band” channels. Such downstream data may be modulated by modem 130, e.g., in accordance with a quaternary phase shift keying (QPSK.) scheme, onto the FDCs which may occupy the 70-130 MHz band of a coaxial cable.
Upstream data, communicated from STTs 128 to headend 100, may be modulated by a cable modem in an STT onto one or more reverse data channels (RDCs), which occupies a reverse passband, e.g., 5-40 MHz band, of a coaxial cable. The modulated upstream data is demodulated by modem 130 before the data is processed, e.g., by controller 112. Data carried in the RDCs may be modulated in accordance with a QPSK scheme.
In accordance with the switched broadcast technique, the STTs utilize the RDCs to inform controller 112 of a subscriber's program channel change event. For example, when a subscriber at an STT selects a different program channel to watch, a program channel change message is sent from the STT to controller 112. It should be noted at this point that each of set-top terminals 128-1 through 128-L is pre-assigned with an identifier for identifying the STT. In this instance, a media access control (MAC) address of the STT is used for such identification. Alternatively, an Internet protocol (IP) address of the STT may be used.
Thus, for example, if the subscriber changes the program channel selection from channel 8 to channel 2 (or in other words “deselects” channel 8 in favor of channel 2), the value of PCHNEW field 404 would be set to “8” and that of PCHOLD field 406 would be set to “2.” If the subscriber has just turned on the cable TV to watch program channel 9, the value of PCHNEW field 404 in that instance would be set to “9” and that of PCHOLD field 406 would be set to “0,” indicating an off state. Conversely, if the subscriber who has been watching program channel 9 chooses to turn off the cable TV, the value of PCHNEW field 404 would be set to “0” and that of PCHOLD field 406 would be set to “9.”
To keep track of the program channels currently selected by the STTs in a service area (e.g., STTs 128-1 through STT-L), controller 112 may maintain a table such as that shown in
In accordance with the switched broadcast technique, carriers are dynamically assigned to carry program materials of only those program channels selected by the STTs (or subscribers) in a service area. The number of program channels K that the cable TV system can provide, although not simultaneously, can exceed M, the maximum number of transmission channels that the forward passband can accommodate. That is, K can be greater than M in this instance.
Referring to
Thus, controller 112 directs switching unit 104 to switch to the selected inputs of detector 105 the p streams corresponding to the p program channels currently selected by the STTs in the service area. Controller 112 specifies to unit 104 the selected inputs of detector 105 to which the p program channel streams are switched. To direct switching unit 104 in an efficient manner, controller 112 may maintain a switching table associating each of the p program channel streams with a respective input port of ad cue detector 105. In one implementation, the input ports of ad cue detector 105 has a predetermined correspondence with the inputs of the modulators in modulator bank 106. For example, in accordance with this implementation, a program channel stream received by input port 1 of ad cue detector 105 is fed to the input of a first modulator in bank 106, which is associated with carrier C1; a program channel stream received by input port 2 of ad cue detector 105 is fed to the input of a second modulator in bank 106, which is associated with carrier C2; etc.
To facilitate its dynamic assignment of transmission channels, controller 112 may also maintain an assignment table in memory 206,
Also relying on assignment table 300, controller 112 may retire a carrier carrying program channel X stream when NPCHX changes from a non-zero value to zero. The retired carrier is subject to reassignment by controller 112.
As illustrated in
According to one aspect of the present invention, ad cue detector 105 monitors each of the program channel streams that are currently being transmitted, and detects that an advertisement break is imminent. When ad cue detector 105 detects an upcoming advertisement break in one of the p program channel streams currently being broadcast, it notifies controller 112. Based on table 432, controller 112 compiles a list of those STTs in the service area which are currently receiving the program channel stream in question. This group of STTs is referred to herein as the “targeted STTs.” Controller 112 informs ad server 103 how many transmission channels are available for conveying streams containing advertisements targeted at the subscribers of the targeted STTs. Ad server 103 then generates one or more targeted advertisement streams, conveyed by one or more of the available transmission channels, respectively.
Ad cue detector 105 in this instance monitors the program channel streams carried on transmission channels T-1 through T-7 for cues messages, indicating an upcoming advertisement break. Standards for the insertion of such cue messages are established by the American National Standard ANSI/SCTE 35 2001 (formerly DVS 253), Digital Program Insertion Cueing Messages for Cable (May 8, 2001) referred to herein as the DVS 253 Standard, which is incorporated by reference herein. Cable programming services generally provide time space during a broadcast program for use by cable operators. These time spaces are often sold by cable operators to local advertisers or used for channel self-promotion. Each of these time spaces is referred to as an “avail,” and is demarcated by “splice points” in the program channel stream. For example, splice information may be provided in a splice information table associated with a particular program and/or in a cue message in the program channel stream. The splice table and cue messages may be sent multiple times. For example, a cue message may be sent 8, 5, 4 and 2 seconds prior to the splice event. Messages that comply with the SCTE standards are referred to herein as digital program insertion (DPI) cues or DPI messages. In this instance, cue messages are inserted in a program channel stream to give advance notice of an avail, which may provide details as to the start and end times of the avail, the number of advertisements in the avail, etc.
Referring to
At step 510, ad cue detector 105 notifies controller 112 of the upcoming avail, and identifies to controller 112 the input port (e.g., input port 1 corresponding to transmission channel T-1) through which the cueing stream enters detector 105. At step 513, controller 112 compiles a list of targeted STTs. Specifically, controller 112 relies on table 377 to translate the identification of the input port (input port 1) of detector 105 to the identity of program channel X (X=4) with which the cueing stream is associated. In addition, controller 112 consults table 432 to identify the targeted STTs, i.e., those STTs (e.g., STT having STID=MAC 1) which are receiving program channel 4 stream, which is the cueing stream in this instance. Controller 112 generates a list of the targeted STTs identified by their STIDs, in a form that is receivable by ad server 103.
At step 516, controller 112 consults assignment table 300 to determine the number of unused transmission channels. This calculation may be performed by determining the difference between the number of transmission channels that are currently assigned, as indicated in column 308 of table 300, and the total number of transmission channels, M. In this instance controller 112 determines that seven transmission channels are unused (T-8 through T-14).
Controller 112 may reserve one or more unused transmission channels to ensure that capacity is available in the event a subscriber in the service area selects a new program channel for which no program channel stream is currently being provided to the service area. In this instance controller 112 reserves transmission channels T-8 and T-9 to provide capacity for the cable network in the event new program channel streams are requested by subscribers during avail 684. Accordingly, five transmission channels (T-10 through T-14) remain unused and are available for transmission of targeted advertisement streams.
At step 518, controller 112 communicates with ad server 103 and provides information including data identifying the cueing stream, data concerning the upcoming avail, a list of identifiers for targeted STTs, and the number of unused transmission channels for transmission targeted advertisement streams. Controller 112 directs ad server 103 to generate one or more streams containing targeted advertisement for the targeted STTs. Referring to
Ad server 103, among others, generates streams of targeted advertisements in response to the directives and data received from controller 112. Ad server 103 may be a server system comprising one or more software applications. As shown in
According to another aspect of the invention, ad server 103 obtains demographic data associated with the targeted STTs from one of the databases, analyzes the demographic data to identify one or more demographic groups, determines the number of unused transmission channels for carrying targeted advertisements to the targeted STTs and generates a stream of targeted advertisements for each transmission channel determined to be used.
It should be further noted that the structure of database 620 shown in
Returning to
The manner by which ad server 103 identifies demographic groups is determined by the particular implementation. For example, groups 675-678 may be: (1) single men aged 18-25, (2) men aged 35-50, (3) women aged 50-65 and (4) individuals with annual income in excess of $50,000. Ad server determines if any STT in set 673 qualifies for more than one group (such as (3) and (4)) and assigns such STTs to a single group based on predetermined criteria by the cable operator. It should be noted that the groups (1)-(4) defined above are for illustrative purposes only.
Returning to
However, in some cases, ad server 103 may identify a number of demographic groups that exceeds the number of unused transmission channels. In such case, ad server 103 assigns unused transmission channels based on priorities established by the cable operator. For example, if the number of groups is four, but the number of unused transmission channels is only two, ad server 103 may prioritize the groups according to parameters established by the cable operator. Ad server 103 may, for example, allocate one unused transmission channel to each of the two largest demographic groups. Ad server 103 may additionally allocate the program transmission channel carrying the cueing stream to the third largest demographic group to substitute the corresponding targeted advertisements for the regularly scheduled advertisements in the cueing stream.
Ad server 103 may additionally determine how many avails are expected to occur in other program channel streams during the upcoming avail on the cueing stream. Cable operators may receive information concerning the scheduling of avails in advance, especially in regularly scheduled programs; such information may be stored in a schedule of avails in memory 203 in ad server 103. Using such information, ad server 103 can in some cases predict with reasonable accuracy an expected number of avails for any given time period. Avails are relatively easy to predict at certain times, such as at the top and bottom of each hour. Accordingly, if a cue message indicates that an avail will begin on a particular cueing stream at, say, 8:59 p.m., and end at 9:03 p.m., ad server 103 may reserve a relatively large number of unused transmission channels for that period for other potential cueing streams.
Thus, if an avail is expected in another program channel stream, ad server 103 may reserve one or more of the unused transmission channels to carry targeted advertisements to the STTs that are receiving the other program channel stream. Referring to
Ad server 103 may, in some cases, identify two or more program channel streams in which an avail is expected, and identify one or more demographic groups associated with each program channel stream such that the total number of demographic groups exceeds the number of unused transmission channels. In such ease, ad server 103 allocates unused transmission channels in accordance with priorities established by the cable operator. For example, one avail may be expected in a first program channel stream showing a very popular TV show (with a large number of viewers), while another avail is expected to occur concurrently in a second program channel stream having a substantially smaller number of viewers. Ad server 103 may in such case assign all unused transmission channels to carry targeted advertisements to viewers of the popular TV show.
At step 531 in
At this point, ad server 103 communicates to controller 112 information indicating how many unused transmission channels server 103 has determined to carry targeted advertisements for the targeted STTs, which group of STTs for which each targeted advertisement streams is intended, and the input ports of switching unit 104 to which ad server 103 feeds the respective advertisement streams. Following the example provided above, ad server 103 informs controller 112 that advertisement stream 1-A at a first input port of unit 104 is intended for the STTs in group 675, advertisement stream 1-B at a second input port of unit 104 is intended for the STTs in group 676, etc. Ad server 103 transmits the various targeted advertisement streams to switching unit 104 to the respective ports through path 816. It should be noted that path 816 here represents multiple links for carrying multiple streams of targeted advertisements. In this instance, controller 112 dynamically assigns three unused transmission channels (T-10, T-11 and T-12), in addition to the program transmission channel (T-1) carrying the cueing stream, to carry the four targeted advertisement streams (i.e., 1-A, 1-B, 1-C and 1-D) provided at the respective input ports of switching unit 104. Controller 112 then causes unit 104 to switch at 9:40 p.m. the targeted advertisement streams to the respective input ports of ad cue detector 105 corresponding to the assigned transmission channels and the program transmission channel.
In accordance with yet another aspect of the invention, controller 112 directs the targeted STTs in groups 675, 676 and 677 to tune to the assigned transmission channels (T-9, T-10 and T-11) for the duration of avail 682 to receive the respective targeted advertisement streams transmitted through the channels. To that end, controller 112 transmits control messages receivable by the targeted STTs. Each control message may include an STID identifying each STT for which the message is intended, and, for each intended STT, an assigned transmission channel to which it should tune at a specified start time till a specified end time, where the start and end times correspond to those of the avail. The control messages are transmitted over one or more FDCs. In an alternative implementation, the control messages are transmitted over the program transmission channel carrying the cueing stream. In this example, the control messages may direct the targeted STTs in groups 675, 676 and 678 to tune to transmission channels T-10, T-11, and T-12, respectively. The control messages additionally indicate that avail 684 is scheduled to begin at 9:40 and end at 9:43 p.m.
Each of STTs 128-1 and 128-L in the service area determines whether one such control message is intended for the STT by checking for its STID in the control message, as indicated at step 720 in
Returning briefly to
The foregoing merely illustrates the principles of the invention. It will thus be appreciated that those skilled in the art will be able to devise numerous other arrangements which embody the principles of the invention and are thus within its spirit and scope.
For example, in the disclosed embodiment, the network transport is illustratively realized using cable distribution network 124. However, other networks such as digital subscriber line (DSL) networks, ethernet networks and satellite networks may be used, instead.
Finally, system 10 is disclosed herein in a form in which various functions are performed by discrete functional blocks. However, any one or more of these functions could equally well be embodied in an arrangement in which the functions of any one or more of those blocks or indeed, all of the functions thereof, are realized, for example, by one or more appropriately programmed processors.
This application is a continuation of and claims priority to co-owned and co-pending U.S. patent application Ser. No. 10/639,070 filed on Aug. 12, 2003 of the same title, and issuing as U.S. Pat. No. 9,247,288 on Jan. 26, 2016, which is incorporated herein by reference in its entirety.
Number | Name | Date | Kind |
---|---|---|---|
4546382 | McKenna et al. | Oct 1985 | A |
4602279 | Freeman | Jul 1986 | A |
4930120 | Baxter et al. | May 1990 | A |
5155591 | Wachob | Oct 1992 | A |
5313454 | Bustini et al. | May 1994 | A |
5600364 | Hendricks et al. | Feb 1997 | A |
5758257 | Herz et al. | May 1998 | A |
5774170 | Hite et al. | Jun 1998 | A |
5862312 | Mann et al. | Jan 1999 | A |
5878324 | Borth et al. | Mar 1999 | A |
5914945 | Abu-Amara et al. | Jun 1999 | A |
5926205 | Krause et al. | Jul 1999 | A |
5935206 | Dixon et al. | Aug 1999 | A |
6002393 | Hite et al. | Dec 1999 | A |
6047327 | Tso et al. | Apr 2000 | A |
6081830 | Schindler | Jun 2000 | A |
6092178 | Jindal et al. | Jul 2000 | A |
6128316 | Takeda et al. | Oct 2000 | A |
6134532 | Lazarus et al. | Oct 2000 | A |
6161142 | Wolfe et al. | Dec 2000 | A |
6169728 | Perreault et al. | Jan 2001 | B1 |
6182050 | Ballard | Jan 2001 | B1 |
6211901 | Imajima et al. | Apr 2001 | B1 |
6216129 | Eldering | Apr 2001 | B1 |
6219840 | Corrigan et al. | Apr 2001 | B1 |
6240553 | Son et al. | May 2001 | B1 |
6330609 | Garofalakis et al. | Dec 2001 | B1 |
6353626 | Sunay et al. | Mar 2002 | B1 |
6378130 | Adams | Apr 2002 | B1 |
6434141 | Oz et al. | Aug 2002 | B1 |
6446261 | Rosser | Sep 2002 | B1 |
6463585 | Hendricks | Oct 2002 | B1 |
6498783 | Lin | Dec 2002 | B1 |
6560578 | Eldering | May 2003 | B2 |
6571102 | Hogberg | May 2003 | B1 |
6590865 | Ibaraki et al. | Jul 2003 | B1 |
6604138 | Virine et al. | Aug 2003 | B1 |
6615039 | Eldering | Sep 2003 | B1 |
6615251 | Klug et al. | Sep 2003 | B1 |
6671736 | Virine et al. | Dec 2003 | B2 |
6687735 | Logston et al. | Feb 2004 | B1 |
6718551 | Swix et al. | Apr 2004 | B1 |
6738978 | Hendricks et al. | May 2004 | B1 |
6763391 | Ludtke | Jul 2004 | B1 |
6771290 | Hoyle | Aug 2004 | B1 |
6842783 | Boivie et al. | Jan 2005 | B1 |
6891841 | Leatherbury et al. | May 2005 | B2 |
6986156 | Rodriguez et al. | Jan 2006 | B1 |
7069573 | Brooks et al. | Jun 2006 | B1 |
7075945 | Arsenault et al. | Jul 2006 | B2 |
7086077 | Giammaressi | Aug 2006 | B2 |
7100183 | Kunkel et al. | Aug 2006 | B2 |
7143431 | Eager et al. | Nov 2006 | B1 |
7146627 | Ismail et al. | Dec 2006 | B1 |
7152237 | Flickinger et al. | Dec 2006 | B2 |
7155508 | Sankuratripati et al. | Dec 2006 | B2 |
7228555 | Schlack | Jun 2007 | B2 |
7237250 | Kanojia et al. | Jun 2007 | B2 |
7246150 | Donoho et al. | Jul 2007 | B1 |
7308415 | Kimbrel et al. | Dec 2007 | B2 |
7334044 | Allen | Feb 2008 | B1 |
7340759 | Rodriguez | Mar 2008 | B1 |
7346688 | Allen et al. | Mar 2008 | B2 |
7363371 | Kirby et al. | Apr 2008 | B2 |
7379494 | Raleigh et al. | May 2008 | B2 |
7464179 | Hodges et al. | Dec 2008 | B2 |
7567565 | La | Jul 2009 | B2 |
7577118 | Haumonte et al. | Aug 2009 | B2 |
7602820 | Helms et al. | Oct 2009 | B2 |
7930715 | Hendricks et al. | Apr 2011 | B2 |
20010030785 | Pangrac et al. | Oct 2001 | A1 |
20010050901 | Love et al. | Dec 2001 | A1 |
20020049902 | Rhodes | Apr 2002 | A1 |
20020054589 | Ethridge et al. | May 2002 | A1 |
20020059619 | Lebar | May 2002 | A1 |
20020063621 | Tseng et al. | May 2002 | A1 |
20020087975 | Schlack | Jul 2002 | A1 |
20020087976 | Kaplan et al. | Jul 2002 | A1 |
20020104083 | Hendricks et al. | Aug 2002 | A1 |
20020112240 | Bacso et al. | Aug 2002 | A1 |
20020120498 | Gordon et al. | Aug 2002 | A1 |
20020123928 | Eldering et al. | Sep 2002 | A1 |
20020124182 | Bacso et al. | Sep 2002 | A1 |
20020129378 | Cloonan et al. | Sep 2002 | A1 |
20020144263 | Eldering et al. | Oct 2002 | A1 |
20020162115 | Bruckner | Oct 2002 | A1 |
20020166119 | Cristofalo | Nov 2002 | A1 |
20020178447 | Plotnick et al. | Nov 2002 | A1 |
20030002862 | Rodriguez et al. | Jan 2003 | A1 |
20030004810 | Eldering | Jan 2003 | A1 |
20030005453 | Rodriguez et al. | Jan 2003 | A1 |
20030007516 | Abramov et al. | Jan 2003 | A1 |
20030033199 | Coleman | Feb 2003 | A1 |
20030046704 | Laksono et al. | Mar 2003 | A1 |
20030056217 | Brooks | Mar 2003 | A1 |
20030061619 | Giammaressi | Mar 2003 | A1 |
20030093311 | Knowlson | May 2003 | A1 |
20030093784 | Dimitrova et al. | May 2003 | A1 |
20030093792 | Labeeb et al. | May 2003 | A1 |
20030101449 | Bentolila et al. | May 2003 | A1 |
20030101451 | Bentolila et al. | May 2003 | A1 |
20030110499 | Knudson et al. | Jun 2003 | A1 |
20030139980 | Hamilton | Jul 2003 | A1 |
20030145323 | Hendricks et al. | Jul 2003 | A1 |
20030149975 | Eldering et al. | Aug 2003 | A1 |
20030179773 | Mocek et al. | Sep 2003 | A1 |
20030195927 | Virine et al. | Oct 2003 | A1 |
20030217365 | Caputo | Nov 2003 | A1 |
20040133907 | Rodriguez et al. | Jul 2004 | A1 |
20040133917 | Schilling | Jul 2004 | A1 |
20040146006 | Jackson | Jul 2004 | A1 |
20040187159 | Gaydos et al. | Sep 2004 | A1 |
20050039205 | Riedl | Feb 2005 | A1 |
20050060742 | Riedl et al. | Mar 2005 | A1 |
20050060745 | Riedl et al. | Mar 2005 | A1 |
20050086691 | Dudkiewicz et al. | Apr 2005 | A1 |
20050111844 | Compton et al. | May 2005 | A1 |
20050114900 | Ladd et al. | May 2005 | A1 |
20050125832 | Jost et al. | Jun 2005 | A1 |
20050168323 | Lenoir et al. | Aug 2005 | A1 |
20050223409 | Rautila et al. | Oct 2005 | A1 |
20050289618 | Hardin | Dec 2005 | A1 |
20050289619 | Melby | Dec 2005 | A1 |
20060036750 | Ladd et al. | Feb 2006 | A1 |
20060130107 | Gonder et al. | Jun 2006 | A1 |
20060130113 | Carlucci et al. | Jun 2006 | A1 |
20060171390 | La | Aug 2006 | A1 |
20060171423 | Helms et al. | Aug 2006 | A1 |
20060218604 | Riedl et al. | Sep 2006 | A1 |
20060248555 | Eldering | Nov 2006 | A1 |
20060253328 | Kohli et al. | Nov 2006 | A1 |
20060253864 | Easty | Nov 2006 | A1 |
20060277569 | Smith | Dec 2006 | A1 |
20070022459 | Gaebel, Jr. et al. | Jan 2007 | A1 |
20070033531 | Marsh | Feb 2007 | A1 |
20070076728 | Rieger et al. | Apr 2007 | A1 |
20070089127 | Flickinger et al. | Apr 2007 | A1 |
20070094691 | Gazdzinski | Apr 2007 | A1 |
20070113243 | Brey | May 2007 | A1 |
20070192794 | Curtis et al. | Aug 2007 | A1 |
20070204310 | Hua et al. | Aug 2007 | A1 |
20070217436 | Markley et al. | Sep 2007 | A1 |
20070233857 | Cheng et al. | Oct 2007 | A1 |
20070274400 | Murai et al. | Nov 2007 | A1 |
20070276926 | Lajoie et al. | Nov 2007 | A1 |
20080052157 | Kadambi et al. | Feb 2008 | A1 |
20080101460 | Rodriguez | May 2008 | A1 |
20080103903 | Flake et al. | May 2008 | A1 |
20080141317 | Radloff et al. | Jun 2008 | A1 |
20080192820 | Brooks et al. | Aug 2008 | A1 |
20080229354 | Morris et al. | Sep 2008 | A1 |
20080244667 | Osborne | Oct 2008 | A1 |
20080273591 | Brooks et al. | Nov 2008 | A1 |
20090025027 | Craner | Jan 2009 | A1 |
20090254971 | Herz et al. | Oct 2009 | A1 |
20120023522 | Anderson et al. | Jan 2012 | A1 |
20130227608 | Evans et al. | Aug 2013 | A1 |
Number | Date | Country |
---|---|---|
WO-0191474 | Nov 2001 | WO |
Entry |
---|
Cisco Intelligent Network Architecture for Digital Video—SCTE Cable-Tec Expo 2004 information page, Orange County Convention Center, Jun. 2004, 24 pages. |
Communications Technology: Next-Generation Bandwidth Management—The Evolution of the Anything-to-Anywhere Network by Yvette Kanouff, 8 pages, Apr. 1, 2004. |
Motorola DOCSIS Cable Module DCM 2000 specifications, 4 pages, no date. |
OpenVision Session Resource Manager—Open Standards-Based Solution Optimizes Network Resources by Dynamically Assigning Bandwidth in the Delivery of Digital Services article, 2 pages, (copyright 2006), http://www.imake.com/hopenvision). |
Resource Planning and Bandwidth Allocation in Hybrid Fiber-Coax Residential Networks by David Griffith, et al., National Institute of Standards and Technology (NIST), 10 pages, no date. |
Session Resource Manager features and information, 2 pages, no date http://www.imake.com/hopenvision). |
Number | Date | Country | |
---|---|---|---|
20160219322 A1 | Jul 2016 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 10639070 | Aug 2003 | US |
Child | 15006005 | US |