The invention relates to a communications system and method, and more particularly to a community access television (CATV) system and method for providing program material through a cable network having limited bandwidth.
Cable television is typically provided by delivering television programming through a community access television (CATV) system to subscribers. Specifically, in delivering the television programming, a headend in the CATV system distributes program data streams containing program materials through different channels of a distribution network, which occupy specified frequency bands. The program data stream for each channel is used to modulate a carrier associated with the channel. The resulting modulated carriers are combined and transmitted through the distribution network to a service area node, where the combined modulated carries are provided to a service area. A subscriber in the service area utilizes a set-top terminal to receive the combined modulated carriers and tune to a desired channel to obtain the program material from the associated modulated carrier.
In prior art, the combined modulated carriers provided to a service area contain program materials of all channels used in a CATV system. However, as a cable TV provider uses an increasing number of channels to deliver additional program materials to attain a larger subscription, the number of available channels will soon run out. Thus, an urgent need arises where an efficient utilization of the limited bandwidth of the distribution network is required to deliver the additional program materials.
A copending, commonly assigned U.S. application Ser. No. 09/956,688 (“the '688 application”) filed on Sep. 20, 2001 discloses a switched broadcast technique for redressing some of the prior art deficiencies. According to such a technique, selected program channels are made available to subscribers in the same service area on an as needed basis. As a result, the number of program channels furnished, although not simultaneously, by a system using the switched broadcast technique may exceed the maximum number of carriers allowed.
The present invention improves the switched broadcast technique by identifying “popular” program channels, which command generally strong viewership in a service area. In accordance with the invention, a popular program channel may be assigned a carrier on a long term basis, not subject to reassignment according to the switched broadcast technique as soon as no set-top terminals in the same service area are tuned to such a program channel. The invention, in part, is based upon a recognition that even though a program channel is popular, there may be brief moments in which all set-top terminals in the same service area are tuned away from such a program channel. Thus, the invention improves the switched broadcast technique by assigning a carrier to a popular program channel for a period despite intermittent viewership, thereby advantageously saving the system resources otherwise needed to frequently assigning and reassigning a carrier therefor during such a period.
In an illustrative embodiment, the popularity of a program channel is determined based on viewing statistics, which are generated based on data in requests issued from the set-top terminals in a service area. The requests may be issued in response to the subscribers at the set-top terminals selecting and deselecting the program channel. Based on the viewing statistics, at least one period in which the program channel is in a particular status (e.g., being popular) is identified. For example, a program channel is considered popular when the number of set-top terminals receiving programming content associated with the program channel exceeds a threshold. A selected carrier is assigned to deliver the programming content associated with the program channel for the identified period.
The invention is also based upon a recognition that popularity of a program channel may change by day or even time of day. Thus, in accordance with an aspect of the invention, a popular program channel may be assigned a particular carrier until the program channel becomes “unpopular.” At such time, the particular carrier may be assigned to another popular program channel, and the unpopular program channel is then subject to switched broadcast. Further, a carrier may be shared by complementary program channels, where one program channel is popular for times when the other program channel is unpopular, and vice versa.
Thus, in a second embodiment of the invention, viewing statistics are generated based on data in requests concerning at least first and second program channels, which are issued from the set-top terminals in a service area. Based on the statistics, a first period and a second period in which the first program channel and the second program channel are in a certain status are determined, respectively. The first and second periods are non-overlapping. A carrier is allocated to deliver program material associated with the first program channel to the service area for the first period. The same carrier is re-allocated to deliver program material associated with the second program channel to the service area for the second period. The carrier may be repeatedly allocated and re-allocated in a similar manner.
In addition, the viewing statistics may be used to identify popular or unpopular program elements including, e.g., TV shows; commercials; skits, monologues and chapters made part of TV shows; etc. The program elements associated with a program channel are provided in a sequence to a service area according to a predetermined schedule. Based on the viewing statistics, a period in which the program channel is in a particular status (being popular or unpopular) is determined. A subset of the popular or unpopular program elements provided in the period is identified based on the predetermined schedule. Further, by aggregating the viewing statistics concerning multiple service areas which comprise a region, e.g., the South, Midwest, Northeast, West Coast, etc., regional acceptance of a program element may be determined.
Further objects, features and advantages of the invention will become apparent from the following detailed description taken in conjunction with the accompanying drawing, in which:
The invention is an improvement on a switched broadcast technique disclosed, e.g., in copending, commonly assigned U.S. application Ser. No. 09/956,688 (“the '688 application”) filed on Sep. 20, 2001, issued as U.S. Pat. No. 8,713,623 on Apr. 29, 2014, which is incorporated herein by reference. In accordance with the switched broadcast technique, a communications system, e.g., a CATV system, makes available to subscribers in the same service area selected program channels on an as needed basis. In order to fully appreciate the invention, one needs to learn about the switched broadcast technique, an implementation of which will now be described.
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 data streams in a digital format, where K is an integer. Each program data stream contains program material, which requires a transmission channel having a specified frequency band for its distribution. It should be noted that the term “transmission channel” used here should not be confused with a “program channel.” A “transmission channel” signifies a designated frequency band through which a program data 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 2 to view program material provided by CBS, program channel 14 to view program material provided by ESPN; program channel 32 to view program material provided by MTV, etc. In this instance, there are K program channels corresponding to the K program data streams.
Under control of controller 112, switching unit 104 selects and switches a subset of the K program data streams, say, p program data streams to modulator bank 106, where p≤K. The program data streams in the subset are selected in a manner described below. Each selected program data stream is transmitted through a different transmission channel after it modulates a carrier associated with the transmission channel in a designated forward passband. As is well known, in the United States the designated forward passband for cable TV ranges from 50 MHz to 550 MHz. However, it will be appreciated that a person skilled in the art may utilize other forward passbands, instead.
In accordance with the switched broadcast technique, carriers are dynamically assigned to carry program materials of only those program channels selected by the set-top terminals (or subscribers) in a service area. The number of program channels that the CATV system can provide, although not simultaneously, can exceed M. That is, K can be greater than M in this instance.
Controller 112 communicates to switching unit 104 through link 116, causing unit 104 to switch, to modulator bank 106, the selected p program data streams which contain the program channel materials selected aggregately by the subscribers in the service area. As long as p≤M, controller 112 manages to assign p carriers to carry the respective data streams. To that end, controller 112 also specifies to unit 104 the selected inputs of modulator bank 106 to which the p data streams are switched.
In this instance, modulator bank 106 includes conventional modulators. Each input to modulator bank 106 is fed to a different modulator for modulating the input onto one of the M carriers. The p data streams are switched by unit 104 to the appropriate inputs of modulator bank 106 to be modulated onto the p assigned carriers, resulting in p data signals representing the modulated carriers, respectively. In addition, controller 112 transmits control messages described below, through link 114, to modulator bank 106 where a modulator modulates the control messages onto the aforementioned control carrier, resulting in a control signal representing the modulated control carrier.
Combiner 108 combines the p data signals and control signal 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, say, service area node 126, where the combined signal is multicast to set-top terminals 128-1 through 128-L. A set-top terminal may be tuned to the control carrier frequency CCF and extract the control signal from the received combined signal. The control signal may contain information identifying the carrier which is assigned to carry the program channel material selected by the set-top terminal. Based on any such information, the set-top terminal is tuned to the frequency of the identified carrier and extracts the corresponding data signal from the received combined signal. The selected program channel material is then derived in a well known manner from the extracted data signal for viewing.
Referring to
To manage the dynamic assignment of carriers for transmitting requested program channel materials to each service area, an assignment table is used in this instance which is stored in memory 206.
When a subscriber at a set-top terminal selects a different program channel to watch, a request for material of the newly-selected program channel is sent from the set-top terminal 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 set-top terminal.
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.”
Referring back to
Instructed by the first routine, processor 204 reads the received request, as indicated at step 502 in
In any event, the routine proceeds from step 518 to step 520 where processor 204 increments the value of NPCHX with X=f in assignment table 300 by one, reflecting the fact that an additional subscriber (or set-top terminal) in the service area has selected program channel X=f to view. Referring back to step 508, if processor 204 determines that the value of NPCHX with X=f does not equal 0, i.e., at least one set top terminal currently receiving program channel X material carried by a previously assigned carrier, the routine proceeds to step 514. Processor 204 at step 514 looks up, in assignment table 300, the identity of the carrier previously assigned for program channel X=f. The routine then proceeds to step 518 described before.
After the first routine is completed, a second routine is invoked to perform a garbage collection function for retiring any carrier carrying program material which is no longer selected by any set-top terminal in the service area. Instructed by this second routine, processor 204 at step 604 determines whether PCHOLD field 406 in the received request has a nonzero value g, 1≤g≤K. If not, i.e., the PCHOLD, field value equal to “0” indicating that the subscriber's cable TV has just been turned on, the second routine comes to an end. Otherwise, processor 204 at step 606 looks up, in assignment table 300, the value of NPCHX with X=g in this case. At step 608, processor 204 decrements the NPCHX value just looked up by one, reflecting the fact that one fewer subscriber (or set-top terminal) in the service area selected program channel X=g to view. Processor 204 at step 610 determines whether the resulting NPCHX value equals 0. If not, the second routine comes to an end. Otherwise, if NPCHX=0, i.e., program channel X=g no longer selected by any subscriber (or set-top terminal) in the service area, the second routine proceeds to step 612. Processor 204 at step 612 searches assignment table 300 for the identity of the carrier assigned for program channel X=g. Processor 204 at step 614 communicates to switching unit 104, causing unit 104 to stop switching the program data stream corresponding to program channel X=g to modulator bank 106, thereby terminating the transmission of the program data stream otherwise carried by the identified carrier. Processor 204 at step 616 places the identified carrier in reserve by substituting the carrier identity entry with “Null” in assignment table 300.
The invention improves the switched broadcast technique, described above, by not subjecting each program channel to switched broadcast indiscriminately. For example, in accordance with the inventive ISB technique, a “popular” program channel commanding generally strong viewership in a service area may be assigned a carrier on a long term basis, not subject to reassignment according to the switched broadcast technique as soon as no set-top terminals in the same service area are tuned to such a program channel. The invention, in part, is based upon a recognition that even though a program channel is popular, there may be brief moments in which all set-top terminals in the same service area are tuned away from such a program channel. Thus, the invention improves the switched broadcast technique by assigning a carrier to a popular program channel for a period despite intermittent viewership, thereby advantageously saving the system resources otherwise needed to frequently assigning and reassigning a carrier therefor during such a period.
The invention is also based upon a recognition that popularity of a program channel may change by day or even time of day. Thus, in accordance with an aspect of the invention, a popular program channel may be assigned a particular carrier until the program channel becomes “unpopular.” At such time, the particular carrier may be assigned to another popular program channel, and the unpopular program channel is then subject to switched broadcast. Further, a carrier may be shared by complementary program channels, where one program channel is popular for times when the other program channel is unpopular, and vice versa. For example, a cartoon channel, sports channel, talk show channel and movie channel may be complementary in that a cartoon channel is popular on weekend mornings, sports channel on weekend afternoons, talk show channel on weekday daytimes and movie channel on both weekday and weekend night times. Thus, in accordance with the invention, a carrier may be cycled through such complementary program channels such that the carrier is assigned to the cartoon channel for weekend mornings, to the sports channel for weekend afternoons, to the talk show channel for weekday daytimes and to a movie channel each night. While one of the complementary program channels is assigned the carrier, the other program channels are subject to switched broadcast.
In an illustrative embodiment, the determination of popularity of a program channel is conducted by data analyzer/controller (DA/C) 812 in
Based on the collected data, processor 804 may generate various statistics concerning different program channels and their viewership for different time frames, e.g., different times of day, days of week, seasons of year, etc., to determine popularity of the program channels and useful trends on a temporal basis. In addition, processor 804 may generate various statistics concerning different program channels and their viewership for different service areas which may comprise a geographic region, e.g., the South, Midwest, Northeast, West Coast, etc. to determine popularity of the program channels and useful trends on a regional basis. Without loss of generality,
In this example, because of the generally strong viewership of program channel 54, processor 804 determines that program channel 54 is a popular program channel at least for the given weekday. Processor 804 further analyzes and cross-references other daily statistics to obtain a pattern of viewership of program channel 54. If, for example, processor 804 determines that program channel 54 is popular each day, processor 804 may assign a carrier, on a permanent basis, to deliver programming content of program channel 54 to the given service area, in accordance with the invention. Similarly, if processor 804 determines that program channel 54 is only popular on a particular weekday each week, processor 804 may assign a carrier, on a weekly basis, to deliver its programming content to the given service area on that particular weekday, and for the other days of the week, program channel 54 is subject is switched broadcast.
Based on the viewing statistics in table 1000, processor 804 also determines viewing habits of the subscribers in the given service area. For example, based on the statistics in column 1003, processor 804 determines that the viewership of program channel 50, a talk show channel, is relatively strong in the daytime (e.g., 6:00 am through 6:30 pm) but relatively weak in the nighttime (e.g., 6:30 pm through 2:00 am). On the other hand, based on the statistics in column 1005, processor 804 determines that the viewership of program channel 51, a movie channel, is relatively weak in the daytime but relatively strong in the nighttime. As a result, program channel 50 and program channel 51 seem to be complementary, where channel 50 is popular while channel 51 becomes unpopular, and vice versa, at least for the given weekday. Processor 804 further analyzes and cross-references other daily statistics to obtain a viewership pattern for both program channels 50 and 51. If, for example, processor 804 determines that program channel 50 is popular during the daytime of each weekday, and program channel 51 is popular during the nighttime of each weekday, processor 804 may assign a specific carrier to alternately deliver channel 50 daytime programming content and channel 51 nighttime programming content to the given service area each weekday, according to the viewing habit of the subscribers in that service area. That is, program channel 50 (51) in this instance is assigned the specific carrier during the daytime (nighttime) of each weekday and is subject to switched broadcast for the rest of the time.
Other subscriber viewing habits may be uncovered by processor 804 analyzing weekday viewing statistics, e.g., table 1000, and weekend viewing statistics (not shown) aggregately. For example, processor 804 in this instance determines that although program channel 52, a cartoon channel, and program channel 53, a sports channel, are generally unpopular on weekdays, they are popular in certain periods on weekends. Specifically, the viewership of program channel 52 is particularly strong on weekend mornings while the viewership of program channel 53 is particularly strong on weekend afternoons. As such, processor 804 in this instance assigns a specific carrier to deliver channel 52 (53) programming content to the given service area during weekend mornings (afternoons), and for the rest of the time, channel 52 (53) is subject to switched broadcast. In addition, processor 804 in this instance determines that movie channel 51 is popular during weekend nights as well. As such, the same carrier may be assigned to deliver channel 51 programming content to the given service area during weekend nights. Indeed, in this instance the same carrier may be cycled through program channels 50, 51, 52 and 53 each week, which are complementary.
It should be noted that viewing statistics may be captured on a daily basis, e.g., table 1000. They may otherwise be captured on a larger or smaller scale to identify subscriber viewing habits in a time frame of particular interest. For example, by capturing viewing statistics on a monthly basis, processor 804 may identify any monthly or seasonal viewing habits with respect to a particular program channel. If, for example, based on the monthly statistics processor 804 determines that program channel 54 is generally popular for only one of the four seasons, say summer. Accordingly, processor 804 may assign a specific carrier to deliver channel 54 programming content to the given service area for summers only, and for other seasons, channel 54 is subject to switched broadcast.
In another embodiment, based on the viewing statistics such as those captured in table 1000, processor 804 also determines what programs, program lineups or even program channels are unpopular and not well received by the audience. For example, by correlating the start and end times of interval 1033 with a broadcast program schedule, processor 804 may identify those unentertaining music videos played during interval 1033. Processor 804 may further analyze and cross-reference other viewing statistics to determine any viewership pattern regarding such music videos in terms of time and geographic region. For example, (I) by cross-referencing other daily statistics associated with the service area, processor 804 may determine that the music videos in question are unpopular all the time or only during certain time of day, day of week, etc. in the service area; (II) by cross-referencing other daily statistics associated with other service areas, processor 804 may determine that the music videos in question may also be unpopular, at certain times or all the time, in other service areas comprising a region, e.g., the South, Midwest, Northeast, West Coast, etc. or the whole country. Thus, by similarly performing (I) and/or (II) on viewing statistics to determine popularity or unpopularity of a program, program lineup or even a program channel, processor 804 may furnish service providers, advertisement sales and research groups with valuable demographics concerning such a program, program lineup or program channel. Of course, (I) and (II) may be similarly performed to identify popular programs, program lineups or program channels, which are subject to renewal due to strong viewership. The same applies to commercials and elements of TV shows, e.g., skits, monologues, chapters, etc., made part of TV shows. For example, by adjusting the time granularity of viewing statistics from 10 minutes as in table 1000 to, say, 30 seconds (the length of a typical commercial) or less, processor 804 may determine based on the viewing statistics the popularity or unpopularity of a given commercial in terms of time and/or geographic regions. Such data by processor 804 is conducive to providing demographically targeted commercials.
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, modulator bank 106, combiner 108, optical transceiver 110 and demodulator 130 are illustratively co-located in headend 100. However, one or more of these components may be located outside headend 100.
In addition, 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 such as digital signal processors (DSPs). Thus, for example, switching unit 104 and modulator bank 106 in system 10 may be realized by one or more DSPs. A DSP typically comprises a combination of digital logic devices and other components, which may be a state machine or implemented with a dedicated microprocessor or micro-controller running a software program or having functions programmed in firmware.
This application is a continuation of and claims priority to U.S. patent application Ser. No. 14/563,950 filed on Dec. 8, 2014 of the same title, and issuing as U.S. Pat. No. 9,736,512 on Aug. 15, 2017, which is a continuation of and claims priority to U.S. patent application Ser. No. 10/429,998 filed on May 5, 2003 of the same title, and issued as U.S. Pat. No. 8,910,221 on Dec. 9, 2014, each of which is herein incorporated by reference in its entirety.
Number | Name | Date | Kind |
---|---|---|---|
4750213 | Novak | Jun 1988 | A |
4760442 | O'Connell et al. | Jul 1988 | A |
5528284 | Iwami et al. | Jun 1996 | A |
5594491 | Hodge et al. | Jan 1997 | A |
5606359 | Youden et al. | Feb 1997 | A |
5642151 | Nusbickel et al. | Jun 1997 | A |
5708664 | Budge et al. | Jan 1998 | A |
5708961 | Hylton et al. | Jan 1998 | A |
5745837 | Fuhrmann | Apr 1998 | A |
5818438 | Howe et al. | Oct 1998 | A |
5822530 | Brown | Oct 1998 | A |
5826166 | Brooks et al. | Oct 1998 | A |
5838921 | Speeter | Nov 1998 | A |
5872588 | Aras et al. | Feb 1999 | A |
5897635 | Torres et al. | Apr 1999 | A |
5940738 | Rao | Aug 1999 | A |
5983318 | Willson et al. | Nov 1999 | A |
6072982 | Haddad | Jun 2000 | A |
6118976 | Arias et al. | Sep 2000 | A |
6125397 | Yoshimura et al. | Sep 2000 | A |
6163530 | Kim | Dec 2000 | A |
6167432 | Jiang | Dec 2000 | A |
6181697 | Nurenberg et al. | Jan 2001 | B1 |
6198478 | Ota et al. | Mar 2001 | B1 |
6219358 | Pinder et al. | Apr 2001 | B1 |
6219710 | Gray et al. | Apr 2001 | B1 |
6259701 | Shur et al. | Jul 2001 | B1 |
6330609 | Garofalakis | Dec 2001 | B1 |
6345038 | Selinger | Feb 2002 | B1 |
6389538 | Gruse et al. | May 2002 | B1 |
6473793 | Dillon et al. | Oct 2002 | B1 |
6510556 | Kusaba et al. | Jan 2003 | B1 |
6519062 | Yoo | Feb 2003 | B1 |
6523696 | Saito et al. | Feb 2003 | B1 |
6543053 | Li et al. | Apr 2003 | B1 |
6564381 | Hodge et al. | May 2003 | B1 |
6583825 | Yuen et al. | Jun 2003 | B1 |
6591422 | Cesar et al. | Jul 2003 | B1 |
6640145 | Hoffberg et al. | Oct 2003 | B2 |
6643262 | Larsson et al. | Nov 2003 | B1 |
6651141 | Adrangi | Nov 2003 | B2 |
6675388 | Beckmann et al. | Jan 2004 | B1 |
6694145 | Riikonen et al. | Feb 2004 | B2 |
6718552 | Goode | Apr 2004 | B1 |
6754271 | Gordon et al. | Jun 2004 | B1 |
6788676 | Partanen et al. | Sep 2004 | B2 |
6886029 | Pecus et al. | Apr 2005 | B1 |
6889382 | Anderson | May 2005 | B1 |
6909726 | Sheeran | Jun 2005 | B1 |
6910078 | Raman et al. | Jun 2005 | B1 |
6925257 | Yoo | Aug 2005 | B2 |
6944150 | McConnell et al. | Sep 2005 | B1 |
6993353 | Desai et al. | Jan 2006 | B2 |
7003790 | Inoue et al. | Feb 2006 | B1 |
7006881 | Hoffberg et al. | Feb 2006 | B1 |
7009972 | Maher et al. | Mar 2006 | B2 |
7020893 | Connelly | Mar 2006 | B2 |
7027460 | Iyer et al. | Apr 2006 | B2 |
7039048 | Monta et al. | May 2006 | B1 |
7054902 | Toporek et al. | May 2006 | B2 |
7068639 | Varma et al. | Jun 2006 | B1 |
7069577 | Geile et al. | Jun 2006 | B2 |
7099308 | Merrill et al. | Aug 2006 | B2 |
7106382 | Shiotsu | Sep 2006 | B2 |
7149772 | Kalavade | Dec 2006 | B1 |
7174126 | McElhatten et al. | Feb 2007 | B2 |
7174127 | Otten et al. | Feb 2007 | B2 |
7174384 | Cheung et al. | Feb 2007 | B2 |
7174385 | Li | Feb 2007 | B2 |
7207055 | Hendricks et al. | Apr 2007 | B1 |
7209458 | Ahvonen et al. | Apr 2007 | B2 |
7213036 | Apparao et al. | May 2007 | B2 |
7228154 | Champion et al. | Jun 2007 | B2 |
7228555 | Schlack | Jun 2007 | B2 |
7242960 | Van Rooyen et al. | Jul 2007 | B2 |
7254608 | Yeager et al. | Aug 2007 | B2 |
7266133 | Wu et al. | Sep 2007 | B2 |
7272227 | Beran | Sep 2007 | B1 |
7325073 | Shao et al. | Jan 2008 | B2 |
7330483 | Peters, Jr. et al. | Feb 2008 | B1 |
7336787 | Unger et al. | Feb 2008 | B2 |
7359375 | Lipsanen et al. | Apr 2008 | B2 |
7363643 | Drake et al. | Apr 2008 | B2 |
7373650 | Rodriguez et al. | May 2008 | B1 |
7376386 | Phillips et al. | May 2008 | B2 |
7383564 | White et al. | Jun 2008 | B2 |
7389523 | Kikinis | Jun 2008 | B2 |
7457520 | Rossetti et al. | Nov 2008 | B2 |
7486869 | Alexander et al. | Feb 2009 | B2 |
7499462 | MacMullan et al. | Mar 2009 | B2 |
7567983 | Pickelsimer et al. | Jul 2009 | B2 |
7592912 | Hasek et al. | Sep 2009 | B2 |
7602820 | Helms et al. | Oct 2009 | B2 |
7609637 | Doshi et al. | Oct 2009 | B2 |
7690020 | Lebar | Mar 2010 | B2 |
7693171 | Gould | Apr 2010 | B2 |
7721314 | Sincaglia et al. | May 2010 | B2 |
7742074 | Minatogawa | Jun 2010 | B2 |
7770200 | Brooks et al. | Aug 2010 | B2 |
7809942 | Baran et al. | Oct 2010 | B2 |
7827227 | Iijima et al. | Nov 2010 | B2 |
7889765 | Brooks et al. | Feb 2011 | B2 |
7900052 | Jonas et al. | Mar 2011 | B2 |
7916755 | Hasek et al. | Mar 2011 | B2 |
7930716 | Liga et al. | Apr 2011 | B2 |
7936775 | Iwamura | May 2011 | B2 |
7954131 | Cholas et al. | May 2011 | B2 |
7971222 | Ellis | Jun 2011 | B2 |
7983272 | Carlson et al. | Jul 2011 | B2 |
8045628 | Lahtonen et al. | Oct 2011 | B2 |
8281352 | Brooks et al. | Oct 2012 | B2 |
8341242 | Dillon et al. | Dec 2012 | B2 |
8516529 | Lajoie et al. | Aug 2013 | B2 |
9215423 | Kimble et al. | Dec 2015 | B2 |
9906838 | Cronk et al. | Feb 2018 | B2 |
20010004768 | Hodge et al. | Jun 2001 | A1 |
20010050945 | Lindsey | Dec 2001 | A1 |
20010055305 | Oz et al. | Dec 2001 | A1 |
20010055336 | Krause et al. | Dec 2001 | A1 |
20020002708 | Arye | Jan 2002 | A1 |
20020024943 | Karaul et al. | Feb 2002 | A1 |
20020027883 | Belaiche | Mar 2002 | A1 |
20020032754 | Logston et al. | Mar 2002 | A1 |
20020037727 | McKenna et al. | Mar 2002 | A1 |
20020056098 | White | May 2002 | A1 |
20020056119 | Moynihan | May 2002 | A1 |
20020056125 | Hodge et al. | May 2002 | A1 |
20020059218 | August et al. | May 2002 | A1 |
20020059619 | Lebar | May 2002 | A1 |
20020059626 | Lemmons | May 2002 | A1 |
20020059638 | Oz et al. | May 2002 | A1 |
20020066033 | Dobbins et al. | May 2002 | A1 |
20020069420 | Russell et al. | Jun 2002 | A1 |
20020085584 | Itawaki et al. | Jul 2002 | A1 |
20020087967 | Conkwright et al. | Jul 2002 | A1 |
20020087995 | Pedlow et al. | Jul 2002 | A1 |
20020092026 | Janniello et al. | Jul 2002 | A1 |
20020129374 | Freeman et al. | Sep 2002 | A1 |
20020133618 | Desai et al. | Sep 2002 | A1 |
20020138831 | Wachtfogel et al. | Sep 2002 | A1 |
20020146023 | Myers | Oct 2002 | A1 |
20020147771 | Traversat et al. | Oct 2002 | A1 |
20020152299 | Traversat et al. | Oct 2002 | A1 |
20020166121 | Rovira | Nov 2002 | A1 |
20020188744 | Mani | Dec 2002 | A1 |
20020188869 | Patrick | Dec 2002 | A1 |
20020194372 | Elmaliach et al. | Dec 2002 | A1 |
20030002577 | Pinder | Jan 2003 | A1 |
20030028889 | McCoskey et al. | Feb 2003 | A1 |
20030037331 | Lee | Feb 2003 | A1 |
20030056217 | Brooks | Mar 2003 | A1 |
20030083054 | Francesca et al. | May 2003 | A1 |
20030097476 | Saxena et al. | May 2003 | A1 |
20030112372 | Weaver et al. | Jun 2003 | A1 |
20030115267 | Hinton et al. | Jun 2003 | A1 |
20030121047 | Watson et al. | Jun 2003 | A1 |
20030147655 | Shattil et al. | Aug 2003 | A1 |
20030156218 | Laksono | Aug 2003 | A1 |
20030163817 | Han | Aug 2003 | A1 |
20030165241 | Fransdonk | Sep 2003 | A1 |
20030166401 | Combes et al. | Sep 2003 | A1 |
20030208612 | Harris et al. | Nov 2003 | A1 |
20030208767 | Williamson et al. | Nov 2003 | A1 |
20030217137 | Roese et al. | Nov 2003 | A1 |
20030217362 | Summers et al. | Nov 2003 | A1 |
20030217365 | Caputo | Nov 2003 | A1 |
20030220072 | Coffin, III | Nov 2003 | A1 |
20040015551 | Thornton | Jan 2004 | A1 |
20040034877 | Nogues | Feb 2004 | A1 |
20040045032 | Cummings et al. | Mar 2004 | A1 |
20040045035 | Cummings et al. | Mar 2004 | A1 |
20040045037 | Cummings et al. | Mar 2004 | A1 |
20040060074 | Basawapatna et al. | Mar 2004 | A1 |
20040068751 | Basawapatna et al. | Apr 2004 | A1 |
20040090283 | Naito | May 2004 | A1 |
20040090996 | Wu et al. | May 2004 | A1 |
20040123324 | Sazzad et al. | Jun 2004 | A1 |
20040133923 | Watson et al. | Jul 2004 | A1 |
20040137918 | Varonen et al. | Jul 2004 | A1 |
20040163129 | Chapman et al. | Aug 2004 | A1 |
20040181800 | Rakib et al. | Sep 2004 | A1 |
20040230994 | Urdang et al. | Nov 2004 | A1 |
20040250273 | Swix et al. | Dec 2004 | A1 |
20050025039 | Hwang et al. | Feb 2005 | A1 |
20050034171 | Benya | Feb 2005 | A1 |
20050039212 | Baran et al. | Feb 2005 | A1 |
20050049886 | Grannan et al. | Mar 2005 | A1 |
20050055220 | Lee et al. | Mar 2005 | A1 |
20050071882 | Rodriguez et al. | Mar 2005 | A1 |
20050086334 | Aaltonen et al. | Apr 2005 | A1 |
20050086683 | Meyerson | Apr 2005 | A1 |
20050108763 | Baran et al. | May 2005 | A1 |
20050114900 | Ladd et al. | May 2005 | A1 |
20050114903 | Ahmed et al. | May 2005 | A1 |
20050177855 | Maynard et al. | Aug 2005 | A1 |
20050188415 | Riley | Aug 2005 | A1 |
20050190794 | Krause et al. | Sep 2005 | A1 |
20050195910 | Kim et al. | Sep 2005 | A1 |
20050198686 | Krause et al. | Sep 2005 | A1 |
20050289618 | Hardin | Dec 2005 | A1 |
20060020786 | Helms et al. | Jan 2006 | A1 |
20060021004 | Moran et al. | Jan 2006 | A1 |
20060047957 | Helms et al. | Mar 2006 | A1 |
20060085727 | Azenkot et al. | Apr 2006 | A1 |
20060093067 | Jalali et al. | May 2006 | A1 |
20060095940 | Yearwood | May 2006 | A1 |
20060127039 | Van Stam | Jun 2006 | A1 |
20060130099 | Rooyen | Jun 2006 | A1 |
20060130101 | Wessel | Jun 2006 | A1 |
20060130107 | Gonder et al. | Jun 2006 | A1 |
20060130113 | Carlucci et al. | Jun 2006 | A1 |
20060136964 | Diez et al. | Jun 2006 | A1 |
20060149850 | Bowman | Jul 2006 | A1 |
20060150216 | Herz et al. | Jul 2006 | A1 |
20060159093 | Joo et al. | Jul 2006 | A1 |
20060161635 | Lamkin et al. | Jul 2006 | A1 |
20060187900 | Akbar | Aug 2006 | A1 |
20060206712 | Dillaway et al. | Sep 2006 | A1 |
20060209745 | MacMullan et al. | Sep 2006 | A1 |
20060209799 | Gallagher et al. | Sep 2006 | A1 |
20060209890 | MacMullan et al. | Sep 2006 | A1 |
20060218604 | Riedl et al. | Sep 2006 | A1 |
20060248553 | Mikkelson et al. | Nov 2006 | A1 |
20060259927 | Acharya et al. | Nov 2006 | A1 |
20060291506 | Cain | Dec 2006 | A1 |
20070019645 | Menon | Jan 2007 | A1 |
20070022459 | Gaebel et al. | Jan 2007 | A1 |
20070022469 | Cooper et al. | Jan 2007 | A1 |
20070030918 | Kobayashi et al. | Feb 2007 | A1 |
20070033531 | Marsh | Feb 2007 | A1 |
20070049245 | Lipman | Mar 2007 | A1 |
20070067851 | Fernando et al. | Mar 2007 | A1 |
20070076728 | Rieger et al. | Apr 2007 | A1 |
20070083902 | Urdang et al. | Apr 2007 | A1 |
20070094691 | Gazdzinski | Apr 2007 | A1 |
20070121678 | Brooks et al. | May 2007 | A1 |
20070124488 | Baum et al. | May 2007 | A1 |
20070180230 | Cortez | Aug 2007 | A1 |
20070209059 | Moore et al. | Sep 2007 | A1 |
20070217436 | Markley et al. | Sep 2007 | A1 |
20070219910 | Martinez | Sep 2007 | A1 |
20070250880 | Hainline | Oct 2007 | A1 |
20070261116 | Prafullchandra et al. | Nov 2007 | A1 |
20070276926 | Lajoie et al. | Nov 2007 | A1 |
20070294717 | Hill et al. | Dec 2007 | A1 |
20080022012 | Wang | Jan 2008 | A1 |
20080059804 | Shah et al. | Mar 2008 | A1 |
20080066112 | Bailey et al. | Mar 2008 | A1 |
20080091805 | Malaby et al. | Apr 2008 | A1 |
20080091807 | Strub et al. | Apr 2008 | A1 |
20080098212 | Helms et al. | Apr 2008 | A1 |
20080133551 | Wensley et al. | Jun 2008 | A1 |
20080137541 | Agarwal et al. | Jun 2008 | A1 |
20080155059 | Hardin et al. | Jun 2008 | A1 |
20080162353 | Tom et al. | Jul 2008 | A1 |
20080192820 | Brooks et al. | Aug 2008 | A1 |
20080216115 | Kikinis | Sep 2008 | A1 |
20080222684 | Mukraj et al. | Sep 2008 | A1 |
20080235746 | Peters et al. | Sep 2008 | A1 |
20080273591 | Brooks et al. | Nov 2008 | A1 |
20080282299 | Koat et al. | Nov 2008 | A1 |
20080320540 | Brooks et al. | Dec 2008 | A1 |
20090031384 | Brooks et al. | Jan 2009 | A1 |
20090083813 | Dolce et al. | Mar 2009 | A1 |
20090098861 | Kalliola et al. | Apr 2009 | A1 |
20090100459 | Riedl et al. | Apr 2009 | A1 |
20090103651 | Lahtonen et al. | Apr 2009 | A1 |
20090116374 | Henriksson et al. | May 2009 | A1 |
20090133079 | Li et al. | May 2009 | A1 |
20090141696 | Chou et al. | Jun 2009 | A1 |
20090150917 | Huffman et al. | Jun 2009 | A1 |
20090163218 | Liu et al. | Jun 2009 | A1 |
20090172776 | Makagon et al. | Jul 2009 | A1 |
20090185576 | Kisel et al. | Jul 2009 | A1 |
20090187934 | Norman | Jul 2009 | A1 |
20090190677 | Jokela et al. | Jul 2009 | A1 |
20090193485 | Rieger et al. | Jul 2009 | A1 |
20090201917 | Maes et al. | Aug 2009 | A1 |
20090210912 | Cholas et al. | Aug 2009 | A1 |
20090217326 | Hasek | Aug 2009 | A1 |
20090225760 | Foti | Sep 2009 | A1 |
20090245090 | Budianu et al. | Oct 2009 | A1 |
20090282241 | Prafullchandra et al. | Nov 2009 | A1 |
20090293101 | Carter et al. | Nov 2009 | A1 |
20100020770 | Qin et al. | Jan 2010 | A1 |
20100023977 | Peterfreund | Jan 2010 | A1 |
20100027560 | Yang et al. | Feb 2010 | A1 |
20100030578 | Siddique et al. | Feb 2010 | A1 |
20100034219 | Stadelmeier et al. | Feb 2010 | A1 |
20100042478 | Reisman | Feb 2010 | A1 |
20100083329 | Joyce et al. | Apr 2010 | A1 |
20100106846 | Noldus et al. | Apr 2010 | A1 |
20100115091 | Park et al. | May 2010 | A1 |
20100125658 | Strasters | May 2010 | A1 |
20100131973 | Dillon et al. | May 2010 | A1 |
20100138900 | Peterka et al. | Jun 2010 | A1 |
20100158086 | Kim et al. | Jun 2010 | A1 |
20100169977 | Dasher et al. | Jul 2010 | A1 |
20100287609 | Gonzalez et al. | Nov 2010 | A1 |
20100313225 | Cholas et al. | Dec 2010 | A1 |
20110010733 | Godas | Jan 2011 | A1 |
20110044328 | Van Berkel | Feb 2011 | A1 |
20110051845 | Schmidl et al. | Mar 2011 | A1 |
20110071841 | Fomenko et al. | Mar 2011 | A1 |
20110093900 | Patel et al. | Apr 2011 | A1 |
20110103374 | Lajoie et al. | May 2011 | A1 |
20110107364 | Lajoie et al. | May 2011 | A1 |
20110138434 | Ulm | Jun 2011 | A1 |
20110213688 | Santos et al. | Sep 2011 | A1 |
20110219229 | Cholas et al. | Sep 2011 | A1 |
20110292785 | Hardin | Dec 2011 | A1 |
20120008786 | Cronk et al. | Jan 2012 | A1 |
20120011567 | Cronk et al. | Jan 2012 | A1 |
20130097647 | Brooks et al. | Apr 2013 | A1 |
20130295978 | Ruohonen | Nov 2013 | A1 |
Number | Date | Country |
---|---|---|
0531046 | Mar 1993 | EP |
0903941 | Mar 1999 | EP |
1030305 | Aug 2000 | EP |
1030305 | Sep 2002 | EP |
0903941 | Mar 2004 | EP |
H06326986 | Nov 1994 | JP |
H09205407 | Aug 1997 | JP |
H1041915 | Feb 1998 | JP |
H10507889 | Jul 1998 | JP |
H10336608 | Dec 1998 | JP |
H11220712 | Aug 1999 | JP |
2002320213 | Oct 2002 | JP |
2003502958 | Jan 2003 | JP |
2005519365 | Jun 2005 | JP |
2005519501 | Jun 2005 | JP |
2005339093 | Dec 2005 | JP |
2008015936 | Jan 2008 | JP |
2009211632 | Sep 2009 | JP |
2010502109 | Jan 2010 | JP |
2010079902 | Apr 2010 | JP |
2012505436 | Mar 2012 | JP |
2012523614 | Oct 2012 | JP |
5608136 | Oct 2014 | JP |
WO-9809438 | Mar 1998 | WO |
WO-9929108 | Jun 1999 | WO |
WO-0110125 | Feb 2001 | WO |
WO-2004047444 | Jun 2004 | WO |
WO-2004070582 | Aug 2004 | WO |
WO-2005015422 | Feb 2005 | WO |
WO-2012021245 | Feb 2012 | WO |
Entry |
---|
Aggrawal et al., “The Effectiveness of Intelligent Scheduling for Multicast Video-on-Demand”, ACM, 2009. |
Cantor, et al., Assertions and Protocols for the OASIS Security Assertion Markup Language (SAML) V2.0, OASIS Standard, Mar. 15, 2005. Document ID: saml-core-2.0-os (http://docs.oasis-open.org/security/saml/v2.0/saml-core-2.0-os.pdf). |
Cantor, et al., Bindings for the OASIS Security Assertion Markup Language (SAML) V2.0, OASIS Standard, Mar. 2005, Document ID saml-bindings-2.0-os ,(http://docs.oasis-open.org/security/saml/v2.0/saml-bindings-2.0-os.pdf). |
Siohan et al., “Analysis and Design of OFDM/OQAM Systems Based on Filterbank Theory”, IEEE Transactions on Signal Processing, May 2002. |
Sorrento Networks, “Solution Architectures for Cable Video-on-Demand”, 2002. |
UTF-32, IBM, retrieved from http://publib.boulder.ibm.com/infocenter/iseries/v5r3/index.jsp?topic=%2FnIs%2Frbagsutf32.htm on Aug. 28, 2013. |
Number | Date | Country | |
---|---|---|---|
20180048920 A1 | Feb 2018 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 14563950 | Dec 2014 | US |
Child | 15676797 | US | |
Parent | 10429998 | May 2003 | US |
Child | 14563950 | US |