The present invention generally relates to cable transmission, and more specifically to methods and systems for dynamic bandwidth allocation for addressable content.
Cable operators and vendors, such as Big Band, Motorola, Cisco, and Imagine Communications, have developed and are further refining systems to measure bandwidth demand or “pull” by cable consumers and allocate capacity within a cable plant node on a real-time dynamic basis. These types of systems are referred to as “switched digital video” systems. Switched digital video (“SDV”) systems are being implemented to resolve growing consumer demand of cable bit/bandwidth. With hundreds of possible television channels and an increasing number of high-definition (“HD”) channels, cable service providers are being stretched to the limits of their network capacity in order to provide uninterrupted, quality service to their subscribers. In addition to audio and video data transmitted for television services, many providers also package Internet, Video-on-Demand and digital telephone services to subscribers—all within the same cable infrastructure.
To accommodate the increased demand for bandwidth, cable providers limit the transmission of a particular channel until it is requested by a subscriber. For example, a certain channel is not constantly broadcast to a home, or neighborhood. When a subscriber tunes to that channel on the digital set-top box, a signal is sent to the cable provider to “turn-on” the channel. The provider then transmits the stream of data containing that channel's video and audio through the cable to the set-top box and on to the subscriber's television. Should a second subscriber in the same service area call up that same channel, the stream is forwarded on to that set top box eliminating the need for a second stream of the same channel.
The transmission speeds of signals over the cable lines is fast enough that the subscriber is unaware that seconds before tuning to that station, the station was not being broadcast at all.
Current switched digital video systems are designed to alleviate and overcome bandwidth transmission limitations from the consumer on a “pull” basis (i.e., dynamically allocating bandwidth based upon subscriber usage and demand). For example, when a digital Cable TV subscriber starts a Video-On-Demand (“VOD”) session to watch a movie, a traditional sequence of events includes following steps: the subscriber selects a particular piece of On-Demand content from the menu on the Digital Cable Set-top Box (“DSTB”); the DSTB initiates a request to the back-end VOD server to start a session; the VOD server performs some authentication and/or billing functions; and then the VOD server allocates the content. The VOD server then will attempt to allocate bandwidth for this session. If no bandwidth can be allocated at the time of the request, the VOD server will notify the DSTB which will then inform the user of the failed VOD session with an “Error: Please try again later” message.
Once bandwidth is allocated, the VOD server will begin streaming the content (via the newly allocated bandwidth) to the DSTB, where it is rendered to the subscriber. After the session is over (either because the subscriber actively stopped the session, or because the session timed out), the bandwidth is de-allocated and returned to the network.
Another example of the traditional “pull-based” model of bandwidth allocation occurs when a digital Cable TV subscriber changes channels in a cable system that uses SDV technology to save bandwidth. The subscriber requests the DSTB to tune from channel X to channel Y, either through a Program Guide, or by pressing a Channel-Up/Channel-Down button on the remote control, or by entering the channel number directly on the remote control. The DSTB initiates a request to the back-end SDV server conveying that the DSTB will leave channel X and tune to channel Y. The SDV server will first check if this was the only viewer in the service area that was still watching channel X; if that is the case, the SDV server will remove channel X from the active channel line-up for this particular cable system service areas, and de-allocate the bandwidth that the channel data stream station was occupying.
The SDV server will then check to see if channel Y is already available in the active channel line-up for this particular cable system service area (signifying that at least one other subscriber's DSTB in the service area is tuned to this channel already); if it is not yet available, the SDV server will allocate bandwidth for it and add it to the active channel line-up. The SDV server will then send a message back to the DSTB to indicate the (new) position of channel Y in the active channel line-up, at a position ‘n’). Upon receipt of this message, the DSTB will tune to position n, and the viewer will start viewing channel Y.
There remains an untapped resource for cable and satellite service providers, as well as advertisers alike in adapting a dynamic bandwidth allocation protocol on a “push” basis to opportunistically exploit the gaps or holes in the available bandwidth efficiently and effectively. That is, dynamically allocating available bandwidth to certain channels for the inclusion of additional services, such as advanced advertising and content delivery, while minimizing bandwidth allocated to a channel but not which is being used.
Embodiments of the invention include systems and methods for dynamic bandwidth allocation to deliver addressable, advertising content in a digital network to users, using allocation techniques driven by asynchronous events related to the advertising content, instead of being requested by an end-user (in other words, it is based on a “push model” instead of on a “pull model”). Embodiments of the system are described herein in the context of addressable content in a multi-cast multimedia network (e.g. a digital cable TV system, or a Direct To Home satellite TV system), however one skilled on the art should recognize the invention is equally applicable to other content-initiated bandwidth allocation systems as well (for example it could be used to allocate bandwidth to send personalized news or sports sequences to TV viewers).
According to one embodiment, a method of allocating bandwidth on a push basis includes receiving a cue tone from a broadcast stream. The cue tone contains data indicating an addressable break. A portion of additional bandwidth is then allocated to an addressable content stream based on the data of the cue tone. The addressable content stream is then streamed to a receiver during the addressable break and the receiver is tuned from the broadcast stream to the addressable content stream for the duration of the addressable break. The additional bandwidth is de-allocated at the end of the addressable break.
Another embodiment of the invention includes a system for dynamically allocating bandwidth. The system includes a storage server containing addressable content and a splicer that is capable of receiving a broadcast stream inserting a stream of the addressable content from the storage server into the broadcast stream. An edge device is included which is capable of detecting a cue tone in the broadcast stream. The cue tone contains data indicating an addressable break. The edge device is further capable of allocating a portion of bandwidth to the stream of the addressable content based on the data of the cue tone for a duration. The edge device is also capable of de-allocating the portion of bandwidth at the end of the duration of the addressable break.
Another embodiment of the invention includes a system for dynamically allocating bandwidth having a splicer capable of receiving and transmitting a broadcast stream. The splicer detects a cue tone in the broadcast stream. The cue tone contains data indicating an addressable break. The system also includes a storage server containing addressable content. The storage server is capable of transmitting an addressable content stream and allocates a portion of bandwidth for a duration to the addressable content stream based on the data of the cue tone. The storage server de-allocates the portion of bandwidth at the end of the duration of the addressable break.
Another embodiment of the invention includes a system for dynamically allocating bandwidth including a splicer for receiving and transmitting a broadcast stream. The splicer detects a cue tone in the broadcast stream which contains data indicating an addressable break. A storage server contains addressable content and transmits an addressable content stream. A resource manager receives a request for additional bandwidth from the storage server. The resource manager defines a subnetwork of available subscribers and determines a portion of the available subscribers in the subnetwork selected to receive the addressable content. The resource manager allocates a portion of the bandwidth for a duration to the addressable content stream based on the data of the cue tone and the portion of available subscribers in the subnetwork selected to receive the addressable content. The resource manager then de-allocates the portion of bandwidth at the end of the duration of the addressable break.
In yet another embodiment of the invention, a system for dynamically allocating bandwidth includes components for receiving a cue tone from a broadcast stream. The cue tone includes data indicating at least the beginning of an addressable break in the broadcast stream. The system also includes components for allocating a portion of available bandwidth to an addressable content stream based on the data of the cue tone and components for streaming the addressable content stream to a receiver during the addressable break. Components for tuning the receiver from the broadcast stream to the addressable content stream for the duration of the addressable break are also included. Lastly, the system includes components for de-allocating the portion of bandwidth at the end of the addressable break.
These embodiments and other aspects of this invention will be readily apparent from the detailed description below and the appended drawings, which are meant to illustrate and not to limit the invention, and in which:
The invention will be more completely understood through the following detailed description, which should be read in conjunction with the attached drawings. Detailed embodiments of the invention are disclosed herein, however, it is to be understood that the disclosed embodiments are merely exemplary of the invention, which may be embodied in various forms. Therefore, specific functional details disclosed herein are not to be interpreted as limiting, but merely as a basis for the claims and as a representative basis for teaching one skilled in the field to variously employ the invention in virtually any appropriately detailed embodiment.
Embodiments of the invention include systems and methods for dynamic bandwidth allocation to deliver addressable, advertising content in a digital network to users, using allocation techniques driven by asynchronous events related to the content, instead of being requested by an end-user (in other words, it is based on a “push model” instead of on a “pull model”).
Turning now to
Traditional approaches to bandwidth allocation for such an addressable advertising systems have been based on either static bandwidth allocation (i.e., allocate the bandwidth at all times), or schedule-based bandwidth allocation (i.e., allocate the bandwidth when an addressable break is scheduled). Local advertising breaks follow a schedule that is unique per network. For example on ESPN's broadcast channel, advertising breaks occurring between 5:30 A.M. and 6:30 A.M. on a particular day may be scheduled as follows:
In practice, however, the scheduled time for an addressable break may be only indicative. That is, the actual time when the break occurs may differ slightly (or sometimes significantly) from the scheduled time. When broadcasting live events or alternative programming due to scheduling conflicts or blackout restrictions, for example, broadcast programmers cannot predict or ensure when programming breaks will occur. Holding the break time as an indicator offers flexibility to the network programmer to shift commercial breaks based on unpredictable programming schedules. To remedy the inaccuracy in predicted scheduling times, broadcast programmers and service providers use a window concept. A window provides a time interval for which a scheduled break is valid. A break may be scheduled for 5:10 A.M., with a window open-time of 5:00 A.M. and a window close time of 5:20 A.M., which means that the break is scheduled for 5:10 A.M., but could occur as early as 5:00 A.M. and as late as 5:20 A.M. Any break that occurs during that window is considered to be the 5:10 A.M. break, even if it did not actually occur at that precise time.
Bandwidth allocation for addressable breaks cannot be based on scheduled time, as described above, because it is inaccurate. Thus, bandwidth (and other resources) for addressable breaks is allocated based on the break window as described above. In traditional allocation systems, bandwidth is allocated for the full duration of the break window, because that is the defined time interval when the scheduled break might occur.
This schedule-based system or, more accurately, window-based system, of bandwidth allocation is functional, but is also inefficient. Bandwidth is a scarce resource in many digital broadcast systems, and the window-based allocation approach locks up bandwidth for the full duration of a window, while it is only effectively being used for the duration of the break, a fraction of the entire window. For example, if a window size of twenty minutes is selected for a sixty-second break, then the bandwidth is allocated for twenty minutes; however the bandwidth is only actually used for the sixty seconds, so the time-bandwidth allocation, in this example is twenty times higher than the actually needed time-bandwidth to broadcast the addressable content.
One embodiment of the invention, as depicted in
One embodiment of the invention uses these tones to create an efficient, real-time dynamic bandwidth allocation system for addressable advertising as illustrated in
The embodiment of the dynamic bandwidth allocation system described above is more efficient than the schedule-based allocation method. For the example of a twenty minute window with a sixty-second break, previously mentioned, the schedule based system would allocate twenty times more bandwidth for the same break than the dynamic system of the present embodiment (i.e., twenty minutes of costly allocated bandwidth versus sixty seconds), with the same effective bandwidth used. Alternatively, even in an embodiment of the invention in which bandwidth would be allocated immediately upon receipt of the cue tone (at Time T2) instead of at the exact break-start (T3), to provide a buffer, or safety period to ensure available bandwidth, significant efficiencies are still maintained using the dynamic allocation system of the embodiment.
One embodiment of the invention includes a method 500 for dynamically allocating bandwidth for addressable content, as depicted in
Turning now to
In an alternative embodiment, the functionality of the dynamic bandwidth allocation system derived from the edge device, may be built into digital ad servers and/or splicers. An exemplary embodiment 700 is depicted in
According to another embodiment of the invention, as depicted in
According to another embodiment of the invention, as depicted in
For example, Subnet #1 may include seven homes in its defined network. According to the resource manager's profile, those seven homes are targeted to receive commercials A, B and E (three home receiving commercial A, three home receiving commercial B and one home receiving commercial E). Accordingly, the resource manager may only allocate the additional bandwidth required to stream those three commercials to the homes of assigned to Subnet #1, instead of allocating the additional bandwidth for the full five addressable advertisements.
According to yet another embodiment of the invention, as depicted in
For example, Subnet #1 may include seven homes in its defined network. Of those seven homes, only three homes are currently active (i.e. currently tuned to a channel ready to receive addressable content). Of those three active homes, two are targeted to receive commercial A and one home is targeted to receive commercial B. Because only three homes are currently active, and of those three home, only two addressable commercials are targeted to those homes, bandwidth need only be allocated for two distinct addressable content streams.
While the certain embodiments described herein include a resource manager in system configurations like those shown in
While the embodiments described herein are depicted as modular systems with defined functionalities, one skilled in the art should recognize that the present invention is not limited to the exemplary embodiments and other system architectures using different combinations of functionality in digital ad servers, digital ad splicers, edge devices, and resource managers may be implemented without deviating from the scope of the invention.
While the invention has been described with reference to illustrative embodiments, it will be understood by those skilled in the art that various other changes, omissions and/or additions may be made and substantial equivalents may be substituted for elements thereof without departing from the spirit and scope of the invention. In addition, many modifications may be made to adapt a particular situation or material to the teachings of the invention without departing from the scope thereof. Therefore, it is intended that the invention not be limited to the particular embodiment disclosed for carrying out this invention, but that the invention will include all embodiments falling within the scope of the appended claims. Moreover, unless specifically stated, any use of the terms first, second, etc. do not denote any order or importance, but rather the terms first, second, etc. are used to distinguish one element from another.
This application is a continuation of U.S. patent application Ser. No. 16/871,756, filed May 11, 2020, which is a continuation of U.S. patent application Ser. No. 16/284,709 (now U.S. Pat. No. 10,694,232), filed Feb. 25, 2019, which is a continuation of U.S. patent application Ser. No. 15/844,680 (now U.S. Pat. No. 10,257,550), filed Dec. 18, 2017, which is a continuation of U.S. patent application Ser. No. 15/417,354 (now U.S. Pat. No. 9,866,880), filed Jan. 27, 2017, which is a continuation of U.S. patent application Ser. No. 14/792,041 (now U.S. Pat. No. 9,560,396), filed Jul. 6, 2015, which is a continuation of U.S. patent application Ser. No. 13/455,773 (now U.S. Pat. No. 9,077,757), filed Apr. 25, 2012, which is a continuation of U.S. patent application Ser. No. 12/512,769 (now U.S. Pat. No. 8,171,511), filed Jul. 30, 2009, which claims the benefit of U.S. Provisional Application No. 61/084,739, filed Jul. 30, 2008, the disclosures of which are hereby incorporated by reference herein in their entireties.
Number | Name | Date | Kind |
---|---|---|---|
5446919 | Wilkins | Aug 1995 | A |
6463585 | Hendricks | Oct 2002 | B1 |
6909726 | Sheeran | Jun 2005 | B1 |
7876259 | Schuchman | Jan 2011 | B2 |
8019162 | Zhang et al. | Sep 2011 | B2 |
8171511 | Haberman et al. | May 2012 | B2 |
8176520 | Mitchell | May 2012 | B1 |
9077757 | Haberman et al. | Jul 2015 | B2 |
9560396 | Haberman et al. | Jan 2017 | B2 |
9866880 | Haberman et al. | Jan 2018 | B2 |
10257550 | Haberman et al. | Apr 2019 | B2 |
10694232 | Haberman et al. | Jun 2020 | B2 |
11290759 | Haberman et al. | Mar 2022 | B2 |
20010001616 | Rakib | May 2001 | A1 |
20030009765 | Linden | Jan 2003 | A1 |
20030179769 | Shi et al. | Sep 2003 | A1 |
20030191851 | Edwards | Oct 2003 | A1 |
20050039205 | Riedl | Feb 2005 | A1 |
20060041921 | Hane | Feb 2006 | A1 |
20060106672 | Mo | May 2006 | A1 |
20060143675 | Willis et al. | Jun 2006 | A1 |
20060293954 | Anderson | Dec 2006 | A1 |
20070064739 | Krishnamachari | Mar 2007 | A1 |
20080034386 | Cherry | Feb 2008 | A1 |
20080229025 | Plamondon | Sep 2008 | A1 |
20080310301 | Wade, Jr. | Dec 2008 | A1 |
20090161688 | Park et al. | Jun 2009 | A1 |
20090217326 | Hasek | Aug 2009 | A1 |
20110296458 | Di Mattia | Dec 2011 | A1 |
20120023522 | Anderson et al. | Jan 2012 | A1 |
20120272285 | Brooks et al. | Oct 2012 | A1 |
20140344443 | Macinnis | Nov 2014 | A1 |
20200344502 | Haberman et al. | Oct 2020 | A1 |
Number | Date | Country |
---|---|---|
1873630 | Nov 2011 | EP |
2002164886 | Jun 2002 | JP |
2002325097 | Nov 2002 | JP |
2003051846 | Feb 2003 | JP |
2015130694 | Jul 2015 | JP |
6273857 | Jan 2018 | JP |
0184824 | Nov 2001 | WO |
2005057322 | Jun 2005 | WO |
2007088482 | Aug 2007 | WO |
2007149458 | Dec 2007 | WO |
Entry |
---|
Dureau, Vincent et al, “Addressable Advertising on Digital Television,” International Broadcasting Conference 2004, Sep. 10, 2004, Amsterdam, pp. 1-15. |
Extended European Search Report and European Search Opinion, Dec. 12, 2013, from corresponding European Patent Application No. 09803602.3. |
Number | Date | Country | |
---|---|---|---|
20240040172 A1 | Feb 2024 | US |
Number | Date | Country | |
---|---|---|---|
61084739 | Jul 2008 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 16871756 | May 2020 | US |
Child | 18233022 | US | |
Parent | 16284709 | Feb 2019 | US |
Child | 16871756 | US | |
Parent | 15844680 | Dec 2017 | US |
Child | 16284709 | US | |
Parent | 15417354 | Jan 2017 | US |
Child | 15844680 | US | |
Parent | 14792041 | Jul 2015 | US |
Child | 15417354 | US | |
Parent | 13455773 | Apr 2012 | US |
Child | 14792041 | US | |
Parent | 12512769 | Jul 2009 | US |
Child | 13455773 | US |