Queue-based head-end advertisement scheduling method and apparatus

Information

  • Patent Grant
  • 10206012
  • Patent Number
    10,206,012
  • Date Filed
    Tuesday, January 10, 2017
    7 years ago
  • Date Issued
    Tuesday, February 12, 2019
    5 years ago
Abstract
In one embodiment, a method of transmitting streaming media and advertisements to viewers at a plurality of viewer nodes is disclosed in which a plurality of viewer groups are created. Each viewer node is assigned to one of the plurality of viewer groups, wherein the assigning includes creating an advertising group map disclosing an advertising group to which each viewer belongs and transmitting the advertising group map to each viewer node. At the head end, at least one media stream is received including media content. A plurality of presentation streams is formed, each presentation channel corresponding to one of the viewer groups, by replicating the at least one media stream, each presentation channel including the media content and advertisements, wherein the advertisements replace previously scheduled advertisements. Each of the presentation channels is transmitted to at least one viewer node in said viewer group corresponding to said presentation channel.
Description
FIELD OF THE INVENTION

The invention pertains to advertising. More particularly, the invention pertains to targeted advertising in television programming or other media delivery systems.


BACKGROUND OF THE INVENTION

As used herein, the term “television service delivery system” refers to any method and/or apparatus for delivering television programming to viewers, including, but not limited to, digital broadcast satellite (DBS), analog cable networks, digital cable networks, switched digital video (SDV) networks delivered via a telephone connection, and land-based radio frequency antenna broadcast.


The various modes of delivering television service, including those mentioned above, are herein termed “transport mechanisms” or “transport streams”. The term “television service provider” refers to an entity that provide television service delivery systems, e.g., a local cable television company in the case of analog or digital cable. The term “subscriber” refers to any individual, household or other entity that receives television service from a television service provider. In almost all television service delivery systems other than land-based antenna broadcasts, the subscriber actually enters into a service contract with the television service provider in order to subscribe to the television service. In land-based antenna television service, anyone with a television in the geographic area reached by the broadcaster can receive the television service without any contract with the broadcaster. Nevertheless, in this specification, the term “subscriber” is intended to include such entities. The term head-end refers to the node of the network or other television service delivery system from which television programming is transmitted to the receiving nodes, i.e., to the subscriber nodes.


Television service delivery systems typically deliver a plurality of channels of television programming to subscribers. The subscribers, through channel selection via a set-top box (STB) or through the tuner of the television itself, select one or more of those channels to view at any given time. Traditionally, television service providers transmit the same data on each channel to all of its subscribers. Specifically, each programming channel contains the exact same content, including advertisements, for all subscribers.


Many television service delivery systems, including analog cable, digital cable, DBS and SDV employ STBs that the subscriber must couple between the incoming signal (e.g., the cable, antenna or telephone line) and his or her television set(s). These STBs can provide substantially enhanced functionality to the television service provider as well as the subscriber. For instance, the STBs can be programmed to either allow or not allow the subscriber to view certain programming channels. As is well known to any cable television subscriber, certain channels are considered premium channels and cost extra to receive. Thus, if a person selects to receive certain premium channels, the subscriber's STB is programmed to de-scramble those channels (if transmitted in a scrambled format) or otherwise not block the subscriber's ability to view them.


Most television channels include both programming and advertisements interspersed throughout the programming. Typically, a particular advertiser will purchase a particular “spot”, i.e., an advertising opportunity in a particular channel at a particular time, based on the likelihood that members of that advertiser's target audience will be watching that particular channel at that particular time. For instance, advertisers typically have a particular demographic group of individuals that they wish to reach with their advertising. For example, the manufacturer of a low-cost beer probably has a primary target audience of males between the ages of 21 and 39, living in households with a household annual income of less than $75,000 per year. As another example, a manufacturer of laundry detergent may have a primary target audience of women between 19-59 years of age with no particular preference regarding household income. As another example, a manufacturer of expensive beer may wish to have a target audience similar to that of the manufacturer of low-cost beer in that it comprises males between the ages of 21 and 39. However, this manufacturer's target demographic audience may include a different economic profile, e.g., males between the ages of 21 and 39, living in households with annual household incomes of over $60,000 per year. Another advertiser that manufactures children's toys appropriate for children between 5 and 10 years of age might have a target audience of children between the ages of 5 and 10 and, depending upon the particular toys, a desired annual household income range.


Factors such as time of day and the particular program that is being broadcast on a particular channel can be used as predictors of the type of persons likely to be watching the television and particular channel when a particular advertisement is displayed. For instance, children are more likely to be viewing television during the daytime than adults. Further, men are more likely to be watching sporting events than women. However, time of day and type of program are not perfect indicators of the viewing audience. For instance, Monday Night Football traditionally would be considered a program/timeslot that would present advertisers with a large number of male viewers between the ages of 21 and 39. However, those viewers are likely to span the entire annual household income range. Accordingly, a large portion of the target audiences of both the low-cost beer manufacturer and the premium beer manufacturer can be expected to view Monday Night Football. However, by the same token, both beer manufacturers will pay a premium price to advertise during Monday Night Football, even though a large portion of the audience does not comprise their target audience. For instance, the premium beer manufacturer will be reaching many men living in households within a lower income range who are unlikely to purchase the premium beer because of its high cost. That manufacturer nevertheless pays the premium price for that advertising spot.


Accordingly, it is an object of the present invention to provide an improved method and apparatus for advertising in television and other media.


It is another object of the present invention to provide a method and apparatus for more narrowly reaching one's target audience in television advertising.


It is a further object of the present invention to provide a method and apparatus by which advertisements can be inserted into television programming channels in a more targeted fashion than traditional advertising mechanisms.


SUMMARY OF THE INVENTION

The invention is a method and apparatus for delivering targeted advertising to persons who receive a media stream such as television. While the invention is particularly suitable for use in connection with television service delivery systems, and particularly those utilizing STBs or the equivalent, it can be applied to other media streams such as the Internet, and audio-only streams that might be delivered via DBS, analog cable, digital cable or SDV.


In accordance with the invention, for each channel containing different television programming, a television service provider transmits multiple versions of that channel in which the programming is identical but the advertisements are different. This allows television service providers to offer advertisers more targeted advertising other than simply based on channel, time of day, and programming. For instance, a single programming channel, e.g., VH1, can be duplicated four times at the head end of a television service network to create four presentation channels. Different advertisements can be inserted into each of the four presentation channels with the different presentation channels delivered to different groups of subscribers. The subscriber groups may be grouped by nodes of a cable television network with the provider delivering the different presentation channels to different nodes.


Alternately, subscriber groups may be created by transmitting all presentation channels to all subscribers, but individually programming the set-top boxes of the individual subscribers to pick out a particular one of the multiple presentation channels corresponding to each programming channel. The set-top boxes can be programmed before being delivered to the subscribers or can be programmed by the provider via the communication network after they are coupled to the network by the subscriber.


In accordance with the invention, the television service provider inserts different advertisements into the different presentation channels at the head end using a queue-based method and apparatus. In accordance with the invention, a queue of advertisement resource locators (ARLs) is maintained for each transmitted presentation channel. In a simple embodiment, there is one queue for each presentation channel. The ARLs comprise information disclosing the location of a corresponding advertisement. The actual advertisements are stored elsewhere and preferably are stored in a digital format such as MPEG. They may be stored in a memory local to the head end of the television service delivery system or may be stored elsewhere accessible by the head end computer system via the television service delivery network or a separate communication network. At the simplest level, ARLs essentially comprise pointers to the actual advertisements.


ARLs are stacked in the queue in the order in which they are to be inserted into the corresponding programming channel. The avails in the programming channel within which the advertisements are to be inserted are determined by any reasonable means and the advertisements are inserted within those avails. For example, the television service provider may be given data in advance disclosing where the avails are in the programming channel. In other embodiments, the beginning of avails may be indicated by a predetermined signal in the vertical blanking interval of the video stream or by cue tones.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1A is an exemplary system-wide advertisement group map in accordance with the present invention that may be stored at the head end for transmission to the set-top boxes in order to enable the set-top boxes to formulate their own individual channel maps.



FIG. 1B is an exemplary system-wide channel map that may be stored at the head end for transmission to the set-top boxes for purposes of creating their individual channel maps.



FIG. 1C is an exemplary individual channel map for a particular STB in accordance with the present invention.



FIG. 2 is a logic diagram illustrating an advertisement resource locator queue stored in memory in accordance with the present invention.



FIG. 3 is a logical representation illustrating advertisement insertion into a plurality of presentation channels corresponding to one programming channel in accordance with the present invention.



FIG. 4 is a block diagram of a queue-based, head-end advertisement scheduling and insertion apparatus in accordance with one embodiment of the present invention.





DETAILED DESCRIPTION OF THE INVENTION

In accordance with the invention, a television service provider (TSP) receives a plurality of television programming channels (e.g., ABC, NBC, CBS, FOX, UPN) containing television programming as well as spaces interspersed within the programming for advertisements. Such advertisement intervals are herein termed “avails”. Some, all or none of the avails may be filled with advertisements as delivered to the television service provider, while some all or none of the avails may be empty with the intent that the TSP insert advertisements into them. The advertisement insertion scheme of the present invention may be used to insert advertisements either into only the empty avails in a programming channel or to replace some or all of the advertisements that are already in some of the avails as delivered to the TSP.


One or more of the incoming programming channels is replicated, for example, by an audio/video splitter circuit, to produce multiple identical output channels. The same process is repeated for any number of other programming channels.


In accordance with a preferred embodiment of the invention, the selection of the particular presentation channel when a viewer selects a particular programming channel is transparent to the subscriber/viewer. That is, the subscriber selects only a particular programming channel, e.g., ABC, and the set-top box picks a particular one of the multiple presentation channels corresponding to ABC, e.g., ABC_1, ABC_2, ABC_3 or ABC_4.


This can be accomplished in many ways depending on the available bandwidth for transmitting television channels to the subscribers, the particular transport mechanism and other factors. In one scheme, preferable for high bandwidth transport mechanisms such as analog cable, digital cable and DBS, all of the presentation channels are transmitted over a high bandwidth mechanism and each of the subscribers has a set-top box or other mechanism programmed to select one of the presentation channels corresponding to each programming channel.


A similar scheme can be employed in an SDV system with slight modification. As is well known, in SDV systems, in which bandwidth is much more limited than in cable systems, typically only one or a few channels can be transmitted to a subscriber at any given time. Accordingly, whenever a subscriber selects a programming channel to view, a signal is sent from the subscribers STB to the head-end or to a curb side node of the network asking for the selected channel to be transmitted to the subscriber. Accordingly, in SDV systems, the scheme may be essentially identical to that described above for cable networks, except that, instead of picking out the particular presentation channel corresponding to the selected programming channel for the advertising group to which that subscriber has been assigned, the STB is programmed to request the particular presentation channel from the head end. This SDV scheme can be implemented on commercially available SDV systems including the NLevel3 platform which is manufactured and sold by Next Level Communications.


In accordance with the invention, each subscriber is assigned to an advertising group wherein the assigned advertising group dictates which of the presentation channels corresponding to each programming channel that subscriber will receive when selecting that programming channel.


One preferred method is for each subscriber to have a set-top box which has stored in memory a tag identifying the advertising group to which it belongs. This tag may be programmed into the STB memory by the television service provider before it is delivered to the subscriber. Alternately, the STB may be programmed to accept data assigning it to a particular advertising group via the television service delivery system itself. In one embodiment, one channel in the transport mechanism (preferably a low bandwidth channel) can be reserved for sending advertising group assignments and other instructions to the set-top boxes.


Each set-top box can be assigned a unique identification code which can be used in conjunction with system-wide channel and advertising group maps received over the instruction channel to determine its advertising group. An advertising group map may be generated at the head end and transmitted over this instruction channel to all subscribers.



FIG. 1A illustrates an exemplary advertising group map 101 that may be stored at the head end and transmitted via the instruction channel to all of the subscribers in an SDV television service system. The map identifies an advertising group 103 for every STB on the system. Each individual STB receives the map 101 and matches its identification number to an identification number 105 in the map to determine to which advertising group it belongs. FIG. 1B illustrates a presentation channel map 111 which also may be broadcast from the head end to all STBs. As shown in FIG. 1B, the presentation channel map identifies which presentation channel 113 for each programming channel 115 corresponds to which advertising group. It also identifies the information 117 needed by the STBs to tune into the particular presentation streams.



FIGS. 1A and 1B illustrate a presentation channel map for an SDV system utilizing the telephone lines and very high speed digital subscriber lines (VDSL) modems. As well known in the SDV art, the unique STB identifiers are Media Access Control Identifications (MAC_IDs) and the presentation channel tuning information 117 comprises a virtual identifier/virtual channel identifiers (VPI/VCIs) 117. In other systems, such as analog cable, digital cable and DBS, the STB identifiers could take any reasonable form and the presentation channel information 117 could be the particular frequencies to which the individual presentation channels correspond, rather than VPI/VCI identifiers.


By correlating the data received in the advertising group map of FIG. 1A and the presentation channel map of FIG. 1B, each individual STB can create an individual channel map 121 for itself as illustrated in FIG. 1C.



FIG. 1C illustrates the map 121 which will be built by an STB assigned to advertising group C. The map indicates which particular VPI/VCI 123 (i.e., presentation channel 125) to select when the user selects a particular programming channel 127.


In systems which are not based on ATM but instead use analog video channels or digital video streams (e.g. MPEG) to transport video, the channel map will refer to a particular frequency (in the case of analog video) or a particular Program ID (PID) in the case of MPEG.


The particular advertising group to which each subscriber is assigned may be chosen by the television service provider based on available information about that subscriber that is relevant to the type of advertising most beneficial for that subscriber. Such information may include publicly available probabilistic demographic and/or psycho-graphic information based on the address of the subscriber. For instance, a handful of marketing firms in the United States provide information about fixed groups known as “clusters” for use by advertisers in identifying members of their target audiences. “Clusters”, well known in the field of advertising, are groups of neighborhoods in the United States having certain similar characteristics such as socio-economic, demographic and/or psycho-graphic characteristics. To form clusters, these marketing firms have examined the characteristics of all known neighborhoods in the country using census or other publicly available data, have selected certain grouping characteristics (e.g., average family income, average family age, etc.) and have combined some of the neighborhoods with similar grouping characteristics into clusters. Examples of marketing firms known to provide “cluster” services are Claritas Inc., with its PRIZM™ cluster system identifiable by zip+4 codes, CACI INC., with its Acorn™ system, and National Decision Systems, Inc., with its Vision™ system.


Alternately or additionally, subscribers may simply be asked to fill out questionnaires disclosing such information such as age and gender, ethnicity and income of the members of the household when they sign up as subscribers with the television service provider.


In one embodiment of the invention, each programming channel is split into the same number of presentation channels as there are advertising groups. However, there is no requirement that all of the programming channels be split into multiple presentation channels or that those that are split into multiple presentation channels be split into the same number of presentation channels. In fact, there may be more advertising groups than presentation channels corresponding to any single programming channel.


In accordance with the present invention, the schedule for inserting advertisements into each of the presentation channels is achieved by using a queue stored in memory. FIG. 2 is a pictorial representation of a queue in accordance with the present invention. The queue 200 is a stacked list of advertisement identifiers, hereinafter termed advertisement resource locators (ARLs) 202. At a minimum, the ARLs indicate the location of a particular advertisement, which may be a memory address in a large volume memory local to the head end of the system. Alternately, the ARLs may point to a remote server on a network to which the head end computer is coupled. For instance, the advertisement may be stored at a remote location on the advertisers server, to which the television service provider is coupled via a network. Such an embodiment is advantageous in that any changes that the advertiser wishes to make to the advertisements, including substituting an entirely new advertisement for an older one, can be made by the advertiser on the advertiser's server any time before the advertisement is accessed for display, without the need for the television service provider's attention.


Preferably, the ARLs also indicate other information about the advertisement, such as the duration of the advertisement, the identity of the advertiser and the identity of the particular advertisement, which information may be useful for purposes of billing advertisers for display of their advertisements.


In a preferred embodiment of the invention, the queue comprises a stack of ARLs in the order in which they are to be inserted into the corresponding presentation channel. However, it will be understood by those of skill in the related arts that the “order” of the ARLs need not necessarily correspond to the numerical addresses of the ARLs in the queue, but encompasses any ordering algorithm that may be used to retrieve ARLs from the queue. For instance, the ARLs may include a time tag indicating the time that the corresponding advertisement is to be inserted into the presentation channel. U.S. patent application Ser. No. 09/635,542, entitled “Grouping Subscribers Based On Demographic Data”, filed on Aug. 10, 2000, assigned to the same assignee as the present application and incorporated herein by reference, discloses a television service delivery method and apparatus into which the present invention can be incorporated.



FIG. 3 illustrates dynamic substitution and insertion of advertisements in one presentation channel in accordance with the present invention. As shown in FIG. 3, there exists a first programming channel 901 having programming segments 903, 905, 907 and a plurality of advertisement segments (i.e., avails) 909, 911, 913, 915, 917, 919, 921, 923. The start of each avail is determined by any available scheme such as detection of digital cue tones, detection of a blank picture for a predetermined duration (which usually indicates the beginning of a commercial break in television programming), or detection of a predetermined signal in the vertical blanking interval. The aforementioned provisional application as well as U.S. patent application Ser. No. 09/712,790, filed on or about Nov. 14, 2000, entitled “Queue Based Advertisement Scheduling and Sales”, incorporated herein by reference, discuss these and other ways of determining the location of avails in a programming channel. Alternately, the television service provider simply may have a schedule indicating the times of all upcoming avails in the programming channel.


When the beginning of an avail, e.g., avail 917, is detected or otherwise determined by the AIS in the data stream 901, the AIS retrieves the appropriate advertisement (as determined by consultation of the queue) from memory 803 and inserts it into the avail 917.



FIG. 4 is a block diagram of a head end advertisement insertion module in accordance with the present invention for an exemplary SDV system. FIG. 4 is merely exemplary of one particular potential embodiment of the invention and is not limiting. An advertisement insertion subsystem (AIS) 801 coupled to an advertisement management subsystem (AMS) 805 is provided. The AIS 801 receives one or more programming channels, e.g., ABC, NBC, CBS, FOX, UPN, and creates a plurality of presentation channels, e.g., ABC_1, ABC_2, . . . , ABC_n, . . . , NBC_1, NBC_2, . . . , NBC_n, . . . , UPN_1, UPN_2, . . . , UPN_n, based upon instructions received from the AMS 805. Each programming channel comprises entertainment programming and one or more advertising avails within which the television service provider is to insert advertisements. The AIS 801 splits each incoming programming channel into a plurality of presentation channels, such as by passing the incoming programming channels through audio/video splitters (not shown).


The AMS 805 is coupled to a demographic database 809 and a subscriber billing records database 807, wherein the demographic database 809 may be one of the aforementioned commercially available databases having demographic information about subscribers.


The AIS 801 and the AMS 805 both are connected to a distribution network 813. The AIS 801 provides the multiplicity of presentation channels to the distribution network 813 and the AMS 805 provides instructions about advertising group associations of STBs, e.g., the afore described advertising group maps and channel maps, via an AMS_STB interface 811.


The AMS 805 also is connected to a broadband interface 815 via a mapping subsystem 817, wherein the mapping subsystem 817 assists in mapping different channels to different programming, e.g., STB group mapping.


The broadband interface 815 is connected to one or more subscribers 825 via an access network 819. In one embodiment, each subscriber 825 has an STB for the reception of entertainment programming and advertising.


The AIS 801 is responsible for creating n presentation channels from each selected programming channel, each presentation channel containing targeted advertisements corresponding to the presentation channel's advertising group. The AIS 801 forms the presentation channels by “replicating” the programming channel into a plurality of presentation channels and inserting targeted advertisements into the advertisement avails in the presentation channels. In order to accomplish this targeted advertisement insertion, the AIS 801 receives from the AMS 805 instructions on which advertisements should go into which avails in each of the presentation channels. These instructions are derived from consultation with the queues as previously described. The AMS 805 also supplies instructions to the AIS 801, with reference to matching advertisements to avails, based on the prior sale and scheduling of those avail/advertisements combinations.


The AIS 801 must report to the AMS 805 exactly which advertisements were played in which avails and in which presentation channels such that the purchaser of the advertisement/avail combination can verify that the advertisement was successfully inserted and be billed for the completed transaction.


The AMS 805 has direct access to subscriber records, e.g., subscriber billing records. The subscriber billing records 807 provide the AMS 805 with the information regarding subscribers necessary for determining subscriber profiles and for the targeting of advertisements. For example, in order to optimally utilize the demographic data, a subscriber's ZIP+4 information is needed, and this information is derived from the actual physical address of the subscriber stored in the subscriber billing records 807.


To utilize the system of FIG. 4 in a switched digital video environment, a Media Access Control Identification (MAC_ID) of the STB (i.e., a unique identification of a particular STB) of each subscriber will also be needed. The unique MAC ID is used by the broadband interface 815 to identify which STB is sending or is receiving information. The MAC ID is needed so that the STB itself may be ‘informed’ about the relevant advertising group. As mentioned above, in one embodiment, a single and complete presentation channel map will be broadcast from a broadband terminal to many STBs. The individual STBs will compute their own individual channel maps based on the group to which they belong.


It is to be noted that increasing the number of presentation channels necessary to accomplish targeted advertising also results in an increased number of channels (i.e., VPI/VCIs) entering and switched by the broadband interface 815, and potentially received by the STB. The broadband interface 815 uses the presentation channel map such that it knows which actual presentation channel corresponds to each VPI/VCI. This map is also sent to the STBs so that the STBs can form their own individual channel maps according to their group, as previously described. The map between channels and VPI/VCIs is generally ‘synchronized’ between the broadband interface 815 and STB such that a channel change at the STB results in the correct switching of the presentation channel by the broadband interface 815.


As mentioned above, the presentation channel map is communicated to the broadband interface 815 via the mapping interface 817. The AMS 805, alternately, may contain the advertising grouping information about subscribers (and about their STBs).


As avails are determined in each presentation channel, the AMS 805 consults the queue corresponding to that presentation channel to determine which advertisement is to be inserted into that avail and informs the AIS 801. The AIS retrieves the advertisement from the large volume memory 803 and inserts it into the avail in the presentation channel.


There are numerous ways in which the advertisements can be inserted into the presentation channels that would be readily apparent to persons of skill in the related arts. For instance, a digitally controlled video switch may simply switch the source between the presentation channel and an advertising stream (from the large volume memory 803) at the beginnings and ends of avails. This insertion can also be accomplished using a number of commercially available units including those produced by the Sea Change Corporation and by nCube of Foster City, Calif., U.S.A.


The various blocks shown in FIG. 4 may be implemented by any reasonable circuitry, including, but not limited to, a programmed general purpose computer, a digital signal processor, an application specific integrated circuit, analog circuitry, a remote state machine or any combination of the above.


Countless alterations are possible in practicing the present invention. Depending upon a particular household, the individual advertising map created for the STB may be more complex than those illustrated in FIGS. 1A-1C, so that the STB selects presentation channels corresponding to different advertising groups depending on additional conditions such as time of day or the particular program. For instance, let us consider an example in which advertising group C is designed to probabilistically present advertisers with males between the ages of 21 and 39, while advertising group B is designed to probabilistically present advertisers with females between the ages of 21 and 39. If a household comprises a husband (who is most likely to be the viewer when the STB is tuned into a sports channel such as ESPN) and a wife (who is more likely to be the viewer when the STB is tuned into a programming channel like LIFETIME), the individual channel map for that subscriber should be different than for a household comprising two men rather than a husband and wife. Thus, the channel map for the former household may select the presentation channel corresponding to advertising group C (i.e., ESPN_C) for programming channel ESPN, and select the presentation channel corresponding to advertising group B (i.e., LIFETIME_B) for programming channel LIFETIME. The channel map for the latter household, on the other hand, may select the presentation channel corresponding to advertising group C for both ESPN and LIFETIME.


Alternately or additionally, the individual group map may be time-of-day dependent. For instance, if it is somehow probabilistically determined that, for a particular subscriber household, one or more viewers within a certain demographic category are likely to view the television during a certain time of day while individuals of a different demographic category view the television at a different time of day, the individual advertising map for that STB could include time dependent criteria.


Ordinarily, the advertising groups would comprise mutually exclusive sets of subscribers. However, it is possible for some overlap if additional criteria as discussed above are incorporated into the individual STB channel maps as long as the situation is avoided where one subscriber node belongs to two different advertising groups for the same time period and programming channel.


While the invention has hereinabove been described in connection with advertising in television service delivery systems, it can be applied in connection with the insertion of any data into any media stream regardless of sources as long as the information stream passes through a circuit that can perform the functions described above of the advertisement insertion module 801. Thus, for instance, the invention is equally applicable to analog cable, regular earth-based broadcast television, the Internet, or a data stream from any type of memory device, including compact disks, digital video disks, other optical media, magnetic disks, ROM, RAM, etc.


Having thus described a few particular embodiments of the invention, various alterations, modifications, and improvements will readily occur to those skilled in the art. Such alterations, modifications and improvements as are made obvious by this disclosure are intended to be part of this description though not expressly stated herein, and are intended to be within the spirit and scope of the invention. Accordingly, the foregoing description is by way of example only, and not limiting. The invention is limited only as defined in the following claims and equivalents thereto.

Claims
  • 1. A method of transmitting streaming media and advertisements from at least one server to viewers at a plurality of viewer nodes, the method comprising: creating a plurality of viewer groups, members of the viewer groups being based on at least one characteristic of the viewers, the at least one characteristic being relevant to advertising;assigning each viewer node to one of the plurality of viewer groups, wherein the assigning includes creating an advertising group map disclosing an advertising group to which each viewer belongs and transmitting the advertising group map to each viewer node;receiving at the at least one server at least one media stream including television programming;forming a plurality of presentation channels, each presentation channel corresponding to one of the viewer groups, by replicating the at least one media stream, each presentation channel including the television programming and advertisements, wherein the advertisements replace previously scheduled advertisements; andtransmitting each of the presentation channels to at least one viewer node in the viewer group corresponding to the respective presentation channel.
  • 2. The method of claim 1, wherein each viewer group comprises a set of viewers that is mutually exclusive of each other viewer group.
  • 3. The method of claim 1, wherein the advertisements included in one of the plurality of presentation channels is selected from a queue of advertisements corresponding to the assigned viewer group of the viewer node that requested the television programming.
  • 4. The method of claim 1, wherein the at least one viewer node includes a set top box through which the request for the television programming is made.
  • 5. The method of claim 1, wherein the at least one characteristic includes probabilistic demographic information of the viewers.
  • 6. The method of claim 1, wherein the at least one characteristic is based in part on the address of the viewers.
  • 7. The method of claim 1, wherein the at least one characteristic is based in part on socio-economic characteristics of the viewers.
CROSS REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No. 14/988,195 (now U.S. Pat. No. 9,544,631), entitled Queue-Based Head-End Advertisement Scheduling Method and Apparatus, filed Jan. 5, 2016, which is a continuation of U.S. patent application Ser. No. 11/412,750 (now U.S. Pat. No. 9,232,252), entitled Queue-Based Head-End Advertisement Scheduling Method and Apparatus, filed Apr. 27, 2006, which is a continuation of U.S. patent application Ser. No. 09/742,534 (now U.S. Pat. No. 7,039,932), entitled Queue-Based Head-End Advertisement Scheduling Method and Apparatus, filed Dec. 21, 2000, which claims the benefit of U.S. Provisional Patent Application No. 60/229,156, entitled Method and System for Addressable and Program Independent Advertising, filed Aug. 31, 2000, the disclosures of which are incorporated herein by reference in their entirety.

US Referenced Citations (156)
Number Name Date Kind
4602279 Freeman Jul 1986 A
4930011 Kiewit May 1990 A
5029014 Lindstrom Jul 1991 A
5099319 Esch et al. Mar 1992 A
5155591 Wachob Oct 1992 A
5231494 Wachob Jul 1993 A
5271626 Llenas et al. Dec 1993 A
5319455 Hoarty et al. Jun 1994 A
5400166 Huber Mar 1995 A
5410344 Graves et al. Apr 1995 A
5424770 Schmelzer et al. Jun 1995 A
5425100 Thomas et al. Jun 1995 A
5446919 Wilkins Aug 1995 A
5457562 Tremblay Oct 1995 A
5515098 Cartes May 1996 A
5532732 Yuen et al. Jul 1996 A
5534911 Levitan Jul 1996 A
5550578 Hoarty Aug 1996 A
5559549 Hendricks et al. Sep 1996 A
5565909 Thibadeau et al. Oct 1996 A
5574860 Perlman et al. Nov 1996 A
5579055 Hamilton et al. Nov 1996 A
5585858 Harper et al. Dec 1996 A
5592551 Lett et al. Jan 1997 A
5600364 Hendricks et al. Feb 1997 A
5600366 Schulman Feb 1997 A
5600573 Hendricks et al. Feb 1997 A
5604542 Dedrick Feb 1997 A
5612742 Krause et al. Mar 1997 A
5621728 Lightfoot et al. Apr 1997 A
5635978 Alten et al. Jun 1997 A
5636346 Saxe Jun 1997 A
5650994 Daley Jul 1997 A
5652615 Bryant et al. Jul 1997 A
5657072 Aristides et al. Aug 1997 A
5659367 Yuen Aug 1997 A
5661516 Carles Aug 1997 A
5687095 Haskell Nov 1997 A
5694176 Bruette et al. Dec 1997 A
5708664 Budge et al. Jan 1998 A
5724091 Freeman et al. Mar 1998 A
5724521 Dedrick Mar 1998 A
5740549 Reilly et al. Apr 1998 A
5752160 Dunn May 1998 A
5752238 Dedrick May 1998 A
5758257 Herz et al. May 1998 A
5758328 Giovannoli May 1998 A
5761601 Nemirofsky et al. Jun 1998 A
5774170 Hite et al. Jun 1998 A
5781226 Sheehan Jul 1998 A
5790426 Robinson Aug 1998 A
5790935 Payton Aug 1998 A
5801747 Bedard Sep 1998 A
5801753 Eyer et al. Sep 1998 A
5805974 Hite et al. Sep 1998 A
5808694 Usui et al. Sep 1998 A
5815671 Morrison Sep 1998 A
5848352 Dougherty et al. Dec 1998 A
5861919 Perkins et al. Jan 1999 A
5886731 Ebisawa Mar 1999 A
5892535 Allen et al. Apr 1999 A
5917830 Chen et al. Jun 1999 A
5918014 Robinson Jun 1999 A
5926205 Krause et al. Jul 1999 A
5931901 Wolfe et al. Aug 1999 A
5948061 Merriman et al. Sep 1999 A
5966120 Arazi et al. Oct 1999 A
5969715 Dougherty et al. Oct 1999 A
5978381 Perlman et al. Nov 1999 A
5990927 Hendricks et al. Nov 1999 A
6002393 Hite et al. Dec 1999 A
6002394 Schein et al. Dec 1999 A
6009409 Adler et al. Dec 1999 A
6009410 Lemole et al. Dec 1999 A
6020880 Naimpally Feb 2000 A
6020883 Herz et al. Feb 2000 A
6026368 Brown et al. Feb 2000 A
6026369 Capek Feb 2000 A
6029045 Picco et al. Feb 2000 A
6038256 Linzer et al. Mar 2000 A
6055510 Henrick et al. Apr 2000 A
6061097 Satterfield May 2000 A
6088722 Herz et al. Jul 2000 A
6119098 Guyot et al. Sep 2000 A
6141010 Hoyle Oct 2000 A
6144653 Persson et al. Nov 2000 A
6160570 Sitnik Dec 2000 A
6160989 Hendricks et al. Dec 2000 A
6177931 Alexander et al. Jan 2001 B1
6181334 Freeman et al. Jan 2001 B1
6252634 Yuen et al. Jun 2001 B1
6253238 Lauder et al. Jun 2001 B1
6263501 Schein et al. Jul 2001 B1
6284153 Miller et al. Sep 2001 B1
6314094 Boys Nov 2001 B1
6324519 Eldering Nov 2001 B1
6357042 Srinivasan et al. Mar 2002 B2
6378130 Adams Apr 2002 B1
6418122 Schoenblum et al. Jul 2002 B1
6425131 Crandall et al. Jul 2002 B2
6434747 Khoo et al. Aug 2002 B1
6446082 Arita Sep 2002 B1
6446261 Rosser Sep 2002 B1
6459427 Mao et al. Oct 2002 B1
6460179 Kretz et al. Oct 2002 B1
6463585 Hendricks et al. Oct 2002 B1
6493875 Eames et al. Oct 2002 B1
6487721 Safadi Nov 2002 B1
6505169 Bhagavath et al. Jan 2003 B1
6516002 Huang et al. Feb 2003 B1
6583825 Yuen et al. Jun 2003 B1
6584153 Gordon et al. Jun 2003 B1
6615039 Eldering Sep 2003 B1
6631523 Matthews, III et al. Oct 2003 B1
6675385 Wang Jan 2004 B1
6684194 Eldering et al. Jan 2004 B1
6698020 Zigmond et al. Feb 2004 B1
6704930 Eldering et al. Mar 2004 B1
6718551 Swix et al. Apr 2004 B1
6724974 Naruto et al. Apr 2004 B2
6738983 Rao et al. May 2004 B1
6754905 Gordon et al. Jun 2004 B2
6796555 Blahut Sep 2004 B1
6820277 Eldering et al. Nov 2004 B1
7017173 Armstrong Mar 2006 B1
7039932 Eldering May 2006 B2
7490053 Emerson et al. Feb 2009 B1
7756743 Lapcevic Jul 2010 B1
8418195 Page et al. Apr 2013 B1
RE44477 Emerson et al. Sep 2013 E
8631431 Berberet et al. Jan 2014 B2
9232252 Eldering Jan 2016 B2
9544631 Eldering Jan 2017 B2
20010013124 Klosterman et al. Aug 2001 A1
20010013131 Wang Aug 2001 A1
20010023436 Srinivasan et al. Sep 2001 A1
20010032333 Flickinger Oct 2001 A1
20010056577 Gordon et al. Dec 2001 A1
20020026645 Son et al. Feb 2002 A1
20020038455 Srinivasan et al. Mar 2002 A1
20020042924 Adams Apr 2002 A1
20020067730 Hinderks et al. Jun 2002 A1
20020083439 Eldering Jun 2002 A1
20020083443 Eldering et al. Jun 2002 A1
20020087975 Schlack Jul 2002 A1
20020087976 Kaplan et al. Jul 2002 A1
20020104083 Hendricks et al. Aug 2002 A1
20020129374 Freeman et al. Sep 2002 A1
20020152471 De Haas Oct 2002 A1
20030088872 Maissel et al. May 2003 A1
20030200128 Doherty Oct 2003 A1
20040163101 Swix et al. Aug 2004 A1
20040205829 Hane Oct 2004 A1
20070157231 Eldering et al. Jul 2007 A1
20120192224 Eldering et al. Jul 2012 A1
20140013354 Johnson et al. Jan 2014 A1
Foreign Referenced Citations (16)
Number Date Country
2264392 Jan 1999 CA
9712486 Apr 1997 WO
9717774 May 1997 WO
9827723 Jun 1998 WO
9926415 May 1999 WO
WO-9926415 May 1999 WO
9952285 Oct 1999 WO
9965237 Dec 1999 WO
9966719 Dec 1999 WO
0005888 Feb 2000 WO
0049801 Aug 2000 WO
0054504 Sep 2000 WO
0069163 Nov 2000 WO
0147279 Jun 2001 WO
0233973 Apr 2002 WO
0233975 Apr 2002 WO
Non-Patent Literature Citations (2)
Entry
NCTA Technical Papers “Compressed Digital Commercial Insertion: New Technology Architectures for the Cable Advertising Business” 1992 8 pages.
AdLink Engineering, Ad insertion wiring diagrams, 1999, 17 pages.
Related Publications (1)
Number Date Country
20170127149 A1 May 2017 US
Provisional Applications (1)
Number Date Country
60229156 Aug 2000 US
Continuations (3)
Number Date Country
Parent 14988195 Jan 2016 US
Child 15402798 US
Parent 11412750 Apr 2006 US
Child 14988195 US
Parent 09742534 Dec 2000 US
Child 11412750 US