Patent Grant
11496782
A portion of the disclosure of this patent document contains material that is subject to copyright protection. The copyright owner has no objection to the facsimile reproduction by anyone of the patent document or the patent disclosure, as it appears in the Patent and Trademark Office patent files or records, but otherwise reserves all copyright rights whatsoever.
The disclosure relates generally to the field of data and content distribution and delivery via a content distribution or other network. In one exemplary aspect, the disclosure relates to the selective delivery of supplemental or secondary content such as advertising or promotions.
“Nielsen Ratings” are a well-known system of evaluating the viewing habits of cross sections of the population. When collecting Nielsen ratings, companies use statistical techniques to develop a sample population which is a cross section of a larger national population. Theoretically, the viewing habits of the sample population will mirror the larger population. The company then measures the viewing habits of the population to identify, among other things, what programs the population is watching as well as the time and frequency at which those programs are watched. This information is then extrapolated to gain insight on the viewing habits of the larger population. Historically, the Nielsen system has been the primary source of audience measurement information in the television industry. The Nielsen system, therefore, affects various aspects of television including inter alia, advertising rates, schedules, viability of particular shows, etc., and has been also recently expanded from measuring an audience of program content to measuring an audience of advertising (i.e., Nielsen ratings may be provided for advertisements themselves).
The Nielsen system collects data regarding audiences either (i) by asking viewers of various demographics to keep a written record of the television shows they watch throughout the day and evening, or (ii) by using “meters,” which are small devices connected to televisions in selected homes or which listen for an audio tone (aka “watermark”) which electronically gathers the viewing habits of the home and transmits the information nightly to Nielsen or a proxy entity over a phone line or other connection. See the discussion regarding the NAVE (Nielsen Audio Video Encoding) system provided infra.
For media content providers such as cable and satellite companies and the like, a major issue is how to more accurately target population segments for advertising campaigns based on particular characteristics of an audience, opportunities for insertion (or replacement) of an advertisement, and other factors. It is most desirable for advertisers to have advertisements for products or services that are targeted to a particular demographic to be viewed by that demographic; such targeting can be accomplished at least in part based on data such as that provided by the aforementioned Nielsen system.
However, the foregoing needs and desires of the service providers and advertisers must be balanced against those of their customers (subscribers), in that it is ultimately subscriber satisfaction which keeps a given individual or household or business using that service provider. One facet of this subscriber satisfaction relates to not unnecessarily inundating the subscriber with advertisements or promotions. Subscriber frustration can readily result from, e.g.: (i) repetition of the same advertisement or promotion over and over, especially within a comparatively short period; (ii) advertisements or promotions which are unduly long (whether taken individually, or in combination with other advertisements or promotions), so as to keep a user away from the primary programming content (e.g., television show, movie, game, etc.); and/or (iii) advertising or promotional content which is not applicable or even inappropriate for viewing by a given user at, e.g., a specific time, or in general.
Aside from the foregoing “frustration” aspect, many television viewers today simply pay less attention to video commercials in broadcast channels, as they can merely change channels and switch to other programming on other channels during commercial breaks; the wider choice of programming currently offered by service providers gives the user more options to watch alternate content during advertisements. Users may also skip the commercials when a consumer watches a program previously recorded, such as on a DVR. Users may also simply walk away from the television and/or engage in some other activity. The proliferation of mobile computing devices such as laptops, smartphones, and tablets in consumer households has only exacerbated this problem, as such devices tend to draw consumers' attention away from the television during the commercial.
Hence, broadcast video commercials could become less engaging for the television audience over time, and less effective in getting the advertiser's message across to the viewers (and emphasizing their brand and products).
Network Content Storage
Network-based content recording and storage (such as e.g., the exemplary “Start Over” and “Look Back” network DVR services offered by the Assignee hereof) allow users of a network to obtain what would otherwise be “live” content (e.g., linear television broadcasts or the like) at some time subsequent to their actual airing, thereby enabling a user to view programming which otherwise would be missed. These systems typically receive instructions from the user as to which programming they want to view, and the network “cloud” streams the requested content to that user. Variants of these types of systems either receive prior instructions from a user before the broadcast of the live event (e.g., “record program XYZ airing on channel 123 at 8 pm on 1/1/12”), or alternatively store various content based on some other criteria (e.g., popularity), and then allow the user a period of time to watch it.
Such “network DVR” systems typically will disable trick mode functionality (i.e., fast forward), which would otherwise allow a viewer of the cloud-recorded content to skip over an advertisement or promotion. This is often a quid pro quo for the user having the ability to recapture via the network content that they otherwise would have missed; i.e., “you can watch the (live) program you want, but you'll have to watch the advertisements also.” Regardless of the motivation, such “must watch” features are often a source of annoyance or aggravation to viewers, and hence may significantly reduce subscriber satisfaction with the network DVR service (or the service provider, programmer, and advertiser individually or collectively).
Hence, there is a need for improved methods and apparatus which effectively balance the service provider's and advertiser's needs relating to secondary content exposure and penetration (and hence ultimately revenue derived therefrom), and the desire of many subscribers to avoid such secondary content whenever possible (or at least that which is either overly repetitive, too long, or inapplicable/inappropriate for their viewing needs).
These methods and apparatus would also ideally be provided using substantially extant network infrastructure and components, and would be compatible with a number of different client device and delivery systems including both wired and wireless technologies.
The foregoing needs are addressed herein by providing, inter alia, methods and apparatus adapted to selectively enforce viewing of advertising or promotional content to be delivered over a network to one or more network devices and associated users.
In a first aspect, a method of operating a content distribution network is disclosed. In one embodiment, the method includes selectively enabling one or more functional aspects of a user premises device based at least in part on a user's prior activity relating to secondary content.
In a second aspect, a content management apparatus for use within a content distribution network is disclosed.
In a third aspect, computer readable apparatus comprising media adapted to contain a computer program is disclosed. In one embodiment, the program has a plurality of instructions, which, when executed, selectively enable one or more functions of an associated media rendering device.
In a fourth aspect, a method of doing business in a content distribution network is disclosed. In one embodiment, the method includes crediting advertisers for advertising impressions that are missed by a user fast-forwarding or skipping over ads.
In a fifth aspect, CPE adapted to collect data useful in advertising or promotion delivery is disclosed. In one embodiment, the CPE comprises a cable or satellite digital set-top box having client software running thereon, the client software being configured to collect requisite data so as to selectively enforce advertising viewing. The data may also be transmitted to a network (e.g., headend) system via e.g., upstream/OOB (“out of band”) communications.
In a sixth aspect, a mobile wireless device is disclosed. In one embodiment, the device is a smartphone or tablet computer, and includes an application (e.g., “app”) running thereon which is configured to enforce one or more network operator or advertiser policies regarding secondary content.
In a seventh aspect, a method of managing user interaction with one or more advertisements is disclosed. In one embodiment, the method includes providing the user with a dynamic menu structure when encountering advertisements within a program stream (e.g., during fast forwarding in a network-based DVR context). The menu provides the user with options for interacting or dispensing of the advertisement, such as, e.g., skipping, saving for later, watching, etc.
In an eighth aspect, an apparatus configured to provide interactive functionality to a user thereof is disclosed. In one embodiment, the apparatus includes a processor and a storage device in data communication with the processor. The storage device comprises at least one computer program executable on the processor, the at least one computer program configured to, when executed: during trick mode operation, evaluate content being rendered for the user to identify at least one instance of secondary content. For the identified at least one instance, the program is configured to provide the user with the ability to select from a plurality of options for treatment of the secondary content; receive a user selection of at least one of the plurality of options; and implement the received user selection.
In a ninth aspect, premises apparatus configured to provide selective secondary content enforcement for a user thereof is disclosed. In one embodiment, the apparatus includes: a processor; a mass storage device in data communication with the processor; and a storage device in data communication with the processor, the storage device comprising at least one computer program executable on the processor. In one variant, the at least one computer program is configured to, when executed: evaluate content being rendered for the user and stored on the mass storage device to identify at least one instance of secondary content; for the identified at least one instance, determine a policy to apply to the rendering of the secondary content; and apply the determined policy to the rendering of the secondary content.
In a tenth aspect, a method of providing content to a user of a mobile device is disclosed. In one embodiment, the method includes: providing content to a recording device in communication with the mobile device, the content comprising primary and secondary content; recording the primary and secondary content on the recording device; streaming the recorded content to the mobile device from the recording device; and selectively enabling or disabling one or more secondary content control functions at the mobile device based at least in part on a criterion related to the user's interaction with the secondary content.
Other features and advantages of the present disclosure will immediately be recognized by persons of ordinary skill in the art with reference to the attached drawings and detailed description of exemplary embodiments as given below.
All Figures © Copyright 2012 Time Warner Cable, Inc. All rights reserved.
Reference is now made to the drawings wherein like numerals refer to like parts throughout.
As used herein, the term “application” refers generally and without limitation to a unit of executable software that implements a certain functionality or theme. The themes of applications vary broadly across any number of disciplines and functions (such as on-demand content management, e-commerce transactions, brokerage transactions, home entertainment, calculator etc.), and one application may have more than one theme. The unit of executable software generally runs in a predetermined environment; for example, the unit could comprise a downloadable Java Xlet™ that runs within the JavaTV™ environment.
As used herein, the terms “client device” and “end user device” include, but are not limited to, set-top boxes (e.g., DSTBs), gateways, modems, personal computers (PCs), and minicomputers, whether desktop, laptop, or otherwise, and mobile devices such as handheld computers, PDAs, personal media devices (PMDs), tablets, and smartphones.
As used herein, the term “codec” refers to a video, audio, or other data coding and/or decoding algorithm, process or apparatus including, without limitation, those of the MPEG (e.g., MPEG-1, MPEG-2, MPEG-4/H.264, etc.), Real (RealVideo, etc.), AC-3 (audio), DiVX, XViD/ViDX, Windows Media Video (e.g., WMV 7, 8, 9, 10, or 11), ATI Video codec, or VC-1 (SMPTE standard 421M) families.
As used herein, the term “computer program” or “software” is meant to include any sequence or human or machine cognizable steps which perform a function. Such program may be rendered in virtually any programming language or environment including, for example, C/C++, Fortran, COBOL, PASCAL, assembly language, markup languages (e.g., HTML, SGML, XML, VoXML), and the like, as well as object-oriented environments such as the Common Object Request Broker Architecture (CORBA), Java™ (including J2ME, Java Beans, etc.), Binary Runtime Environment (e.g., BREW), and the like.
As used herein, the term “consideration” refers without limitation to any payment, compensation, bargain, barter, release, option, or other arrangement wherein something of actual, perceived or potential future value (whether by an objective or subjective standard) is given, assigned, transferred or exchanged. For example, one form of consideration is a monetary payment. Another comprises an exchange of services. Yet another comprises release from an obligation or debt. Still another form comprises a subscription or installment plan. Yet a further form comprises providing a limited time option. Myriad other forms of consideration will be appreciated by those of ordinary skill given the present disclosure.
The terms “Consumer Premises Equipment (CPE)” and “host device” refer without limitation to any type of electronic equipment located within a consumer's or user's premises and connected to a network. The term “host device” includes terminal devices that have access to digital television content via a satellite, cable, or terrestrial network. The host device functionality may be integrated into a digital television (DTV) set. The term “consumer premises equipment” (CPE) includes such electronic equipment such as set-top boxes, televisions, Digital Video Recorders (DVR), gateway storage devices (Furnace), and ITV Personal Computers.
As used herein, the term “database” refers generally to one or more tangible or virtual data storage locations, which may or may not be physically co-located with each other or other system components.
As used herein, the term “display” means any type of device adapted to display information, including without limitation CRTs, LCDs, TFTs, plasma displays, LEDs, incandescent and fluorescent devices. Display devices may also include less dynamic devices such as, for example, printers, e-ink devices, and the like.
As used herein, the term “DVR” (digital video recorder) refers generally to any type or recording mechanism and/or software environment whereby content sent over a network can be recorded and selectively recalled. Such DVR may be dedicated in nature, or part of a non-dedicated or multi-function system.
As used herein, the terms “service”, “content”, and “stream” are sometimes used synonymously to refer to a sequence of packetized data that is provided in what a subscriber may perceive as a service. A “service” (or “content”, or “stream”) in the former, specialized sense may correspond to different types of services in the latter, non-technical sense. For example, a “service” in the specialized sense may correspond to, among others, video broadcast, audio-only broadcast, pay-per-view, or video-on-demand. The perceivable content provided on such a “service” may be live, pre-recorded, delimited in time, undelimited in time, or of other descriptions. In some cases, a “service” in the specialized sense may correspond to what a subscriber would perceive as a “channel” in traditional broadcast television.
As used herein, the term “DOCSIS” refers to any of the existing or planned variants of the Data Over Cable Services Interface Specification, including for example DOCSIS versions 1.0, 1.1, 2.0 and 3.0.
As used herein, the term gateway includes, without limitation, devices configured to interface with a network, and pass signals to or exchange signals with, another device in communication therewith. Various exemplary gateways are described in, inter alia, co-owned U.S. patent application Ser. No. 11/818,236 filed on Jun. 13, 2007, entitled “PREMISES GATEWAY APPARATUS AND METHODS FOR USE IN A CONTENT-BASED NETWORK”, and issued as U.S. Pat. No. 7,594,131 on Dec. 18, 2008; U.S. patent application Ser. No. 12/582,619 filed on Oct. 20, 2009, entitled “GATEWAY APPARATUS AND METHODS FOR DIGITAL CONTENT DELIVERY IN A NETWORK”, and issued as U.S. Pat. No. 9,027,062 on May 5, 2015; and U.S. patent application Ser. No. 12/480,597 filed on Jun. 8, 2009, entitled “MEDIA BRIDGE APPARATUS AND METHODS”, and issued as U.S. Pat. No. 9,602,864 on Mar. 21, 2017, each of the foregoing being incorporated herein by reference in its entirety.
As used herein, the term “headend” refers generally to a networked system controlled by an operator (e.g., an MSO or multiple systems operator) that distributes programming to MSO clientele using client devices. Such programming may include literally any information source/receiver including, inter alia, free-to-air TV channels, pay TV channels, interactive TV, and the Internet.
As used herein, the terms “Internet” and “internet” are used interchangeably to refer to inter-networks including, without limitation, the Internet.
As used herein, the terms “microprocessor” and “digital processor” are meant generally to include all types of digital processing devices including, without limitation, digital signal processors (DSPs), reduced instruction set computers (RISC), general-purpose (CISC) processors, microprocessors, gate arrays (e.g., FPGAs), PLDs, reconfigurable computer fabrics (RCFs), array processors, secure microprocessors, and application-specific integrated circuits (ASICs). Such digital processors may be contained on a single unitary IC die, or distributed across multiple components.
As used herein, the terms “MSO” or “multiple systems operator” refer without limitation to a cable, fiber to the home (FTTH), fiber to the curb (FTTC), satellite, Hybrid Fiber Copper (HFCu), or terrestrial network provider having infrastructure required to deliver services including programming and data over those mediums.
As used herein, the terms “network” and “bearer network” refer generally to any type of telecommunications or data network including, without limitation, hybrid fiber coax (HFC) networks, HFCu networks, satellite networks, telco networks, and data networks (including MANs, WANs, LANs, WLANs, internets, and intranets). Such networks or portions thereof may utilize any one or more different topologies (e.g., ring, bus, star, loop, etc.), transmission media (e.g., wired/RF cable, RF wireless, millimeter wave, optical, etc.) and/or communications or networking protocols.
As used herein, the term “interface” refers to any signal, data, or software interface with a component, network or process including, without limitation, those of the FireWire (e.g., FW400, FW800, etc.), USB (e.g., USB2), Ethernet (e.g., 10/100, 10/100/1000 (Gigabit Ethernet), 10-Gig-E, etc.), MoCA, Coaxsys (e.g., TVnet™), radio frequency tuner (e.g., in-band or OOB, cable modem, etc.), Wi-Fi (802.11), WiMAX (802.16), PAN (e.g., 802.15), cellular (e.g., 3G; LTE/LTE-A/TD-LTE, GSM, etc.) or IrDA families.
As used herein, the term “node” refers to any functional entity associated with a network, such as for example an OLT or ONU, whether physically discrete or distributed across multiple locations.
As used herein, the term “QAM” refers to modulation schemes used for sending signals over cable networks. Such modulation scheme might use any constellation level (e.g. QPSK, 16-QAM, 64-QAM, 256-QAM, etc.) depending on details of a cable network. A QAM may also refer to a physical channel modulated according to the schemes.
As used herein, the term “server” refers to any computerized component, system or entity regardless of form which is adapted to provide data, files, applications, content, or other services to one or more other devices or entities on a computer system or network.
As used herein, the term “service,” “content,” “program” and “stream” are sometimes used synonymously to refer to a sequence of packetized data that is provided in what a subscriber may perceive as a service. A “service” (or “content,” or “stream”) in the former, specialized sense may correspond to different types of services in the latter, non-technical sense. For example, a “service” in the specialized sense may correspond to, among others, video broadcast, audio-only broadcast, pay-per-view, or video-on-demand. The perceivable content provided on such a “service” may be live, pre-recorded, delimited in time, undelimited in time, or of other descriptions. In some cases, a “service” in the specialized sense may correspond to what a subscriber would perceive as a “channel” in traditional broadcast television.
As used herein, the term “service group” refers without limitation to either a group of service users (e.g., subscribers), or the resources shared by them in the form of, for example, entire cable RF signal, only the RF channels used to receive the service or otherwise treated as a single logical unit by the network for resource assignment.
As used herein, the term “user interface” refers to, without limitation, any visual, graphical, tactile, audible, sensory, or other means of providing information to and/or receiving information from a user or other entity.
As used herein, the term “Wi-Fi” refers to, without limitation, any of the variants of IEEE-Std. 802.11 or related standards including 802.11 a/b/g/n/s/v or 802.11-2012.
As used herein, the term “wireless” means any wireless signal, data, communication, or other interface including without limitation Wi-Fi, Bluetooth, 3G (3GPP/3GPP2), HSDPA/HSUPA, TDMA, CDMA (e.g., IS-95A, WCDMA, etc.), FHSS, DSSS, GSM, PAN/802.15, WiMAX (802.16), 802.20, narrowband/FDMA, OFDM, PCS/DCS, LTE/LTE-A/TD-LTE, analog cellular, CDPD, satellite systems, millimeter wave or microwave systems, acoustic, and infrared (i.e., IrDA).
Overview
In one salient aspect, the present disclosure discloses methods and apparatus for selectively enforcing one or more rules regarding secondary content insertion and user interaction therewith. In one embodiment, the user accessing “cloud” stored primary content such as a previously aired television program or movie is selectively given use of fast-forward (FF) or other functions with respect to secondary content (e.g., advertisements or promotions), such that the user can decide whether they wish to watch the secondary content, or rather fast-forward through, skip it, or save it for later (e.g., in “cloud” storage).
Subscriber viewing is determined in one variant using information contained in the program stream(s), such as, e.g., Nielsen Audio Video Encoder (NAVE) audio watermark data. The appropriate network entity, or a user's CPE in other variants, retains data relating to which advertisements have been viewed, and this information is used to selectively permit the user of the CPE to FF or skip the secondary content. This data can also be further used by a network entity (e.g., server) for demographic or advertisement targeting analysis or the like.
Subscriber privacy and anonymity is also optionally maintained in one embodiment via, e.g., hashing or encrypting data relating to the CPE and/or subscriber, thus ensuring that any data sent to the network is not traceable to a specific user account.
In another embodiment, users encountering an advertisement while traversing a program stream (e.g., while fast-forwarding) are presented with one or more choices regarding viewing and/or interaction with the advertisement, such as via an on-screen menu.
In yet another alternative, when a user selects to fast-forward an advertisement, the frame rate and/or speed of the playback of the advertisement is adjusted, and the audio content is provided to the user, thereby still creating an “impression” of the advertisement.
In yet another embodiment, users traversing content recorded on premises devices such as DVRs or even mobile devices are provided the foregoing skipping and/or menu functionality.
Exemplary network and client apparatus for implementing the various facets of the disclosure are also described, as are business methodologies and an operation business “rules” engine (e.g., computer program).
Exemplary embodiments of the secondary content selective enforcement apparatus and methods of the present disclosure are now described in detail. While these exemplary embodiments are described in the context of a hybrid fiber coax (HFC) cable architecture having a multiple systems operator (MSO), digital networking capability, and plurality of client devices/CPE, the general principles and advantages of the disclosure may be extended to other types of networks and architectures, whether broadband, narrowband, wired or wireless, content or data, or otherwise. Hence, the following description is merely exemplary in nature. For example, the disclosure may be practiced over a fiber-to-the-home (FTTH) or fiber-to-the-curb (FTTC) system, or over satellite or millimeter wave-based networks having two-way capabilities similar to today's digital cable HFC networks.
It will also be appreciated that while described generally in the context of a network providing service to a customer or consumer (i.e., residential) end user domain, the present disclosure may be readily adapted to other types of environments including, e.g., commercial/enterprise, and government/military applications. Myriad other applications are possible.
Also, while certain aspects are described primarily in the context of the well known IP or Internet Protocol (described in, inter alia, RFC 791 and 2460), it will be appreciated that the present disclosure may utilize other types of protocols (and in fact bearer networks to include other internets and intranets) to implement the described functionality.
Bearer Network Architecture
The data/application origination point 102 comprises any medium that allows data and/or applications (such as a VoD-based application, gaming application, or “Watch TV” application) to be transferred to a distribution server 104. This can include for example a third party data source, application vendor website, CD-ROM, external network interface, mass storage device (e.g., RAID system), etc. Such transference may be automatic, initiated upon the occurrence of one or more specified events (such as the receipt of a request packet or ACK), performed manually, or accomplished in any number of other modes readily recognized by those of ordinary skill.
The application distribution server 104 comprises a computer system where such applications can enter the network system. Distribution servers are well known in the networking arts, and accordingly not described further herein.
The VoD server 105 comprises a computer system where on-demand content can be received from one or more of the aforementioned data sources 102 and enter the network system. These servers may generate the content locally, or alternatively act as a gateway or intermediary from a distant source.
The CPE 106 includes any equipment in the “customers' premises” (or other locations, whether local or remote to the servers 104, 105) that can be accessed by a distribution server 104 or VOD server 105.
Referring now to
The architecture 150 of
Content (e.g., audio, video, data, applications, etc.) is provided in each downstream (in-band) channel associated with the relevant service group. To communicate with the headend or intermediary node (e.g., hub server), the CPE 106 may use the out-of-band (OOB) or DOCSIS channels and associated protocols. The OCAP 1.0, 2.0, 3.0 (and subsequent) specification provides for exemplary networking protocols both downstream and upstream, although the disclosure is in no way limited to these approaches.
As shown in
“Switched” Networks
In addition to “broadcast” content (e.g., video programming), the systems of
Referring again to
Packet-Optimized Architectures
Referring now to
It is also envisaged that the methods and apparatus described herein may be implemented in the context of unmanaged networks, such as, e.g., the Internet. For instance, a cloud-based media streaming server may selectively restrict or enable its “trick mode” functions with respect to the streamed content based on “cookies” passed back up to the streaming server regarding the user's viewing of certain secondary content.
In the foregoing delivery models, users are enabled to utilize one or more trick mode functions such as STOP, FF, REW, PAUSE, PLAY, etc. as part of the content delivery. In one typical implementation, the commands sent from the user (e.g., via their remote control) are transferred upstream to the network server delivering the content, the server then either implementing the desired function, or in the case of use restrictions, not implementing the function (e.g., FF for advertisements entrained within network DVR 210 or Look Back content). Hence, the illustrated architecture 200 of
To implement this capability, the content encoder 207 of the architecture 200 encodes the secondary content inserted from a content source or store 209 present in the program streams (which in one embodiment comprise multiplexed ATSC MPEG-2 transport streams, or MPTS) using, e.g., a digital watermark disposed in the audio track of the secondary content. Hence, the delivered multiplexed transport stream may carry several different secondary content elements, each of which may be encoded with a distinct watermark to uniquely identify the element (and/or one or more attributes associated with the element).
When a given requesting premises receives the MPTS, its CPE 206 uses a PID filter or other comparable mechanism to identify the individual program stream of interest, and extract the packets associated with that stream for reassembly of the stream by the CPE/rendering device. Associated with the secondary content elements are the watermarked audio tracks. An algorithm 215 running on the CPE (such as those used to detect the exemplary NMR watermarks discussed below) evaluate the audio track(s) of the extracted program stream (e.g., a cloud-stored version of a linear broadcast channel having advertisements) to find the watermarks and hence identify the advertisement(s).
In one implementation, all broadcast and MSO network linear programs and advertisements are encoded with NAVE audio watermarks. These audio watermarks are retained when a real time acquisition is performed by the MSO (as well as when the user records the content to a DVR). Audio watermarking is in one variant applied before the content is received at the MSO headend(s) for, inter alia, network advertisements; it is performed at the programmer's origination site. However, it will be recognized that the watermarking can be applied at other locations, including by the MSO.
Once the watermarks have been detected, information relating to them is transmitted upstream to the server device 202. As discussed subsequently herein with respect to
In one exemplary embodiment, the database 204 associated with the network device 202 is configured to store on the order of 1E07 to 1E08 viewing events at any given time, although this number is merely illustrative. For example, assuming an average of 250 hours of viewing per premises/household per month, and approximately 26 impressions per hour per premises, a maximum number of 6500 total impressions per premises per month is obtained. When multiplied by the number of premises served or monitored by a given network device 202 and database 204, which for example might be 100,000, a number of roughly 6.5E07 (65 million) events per month per server is obtained, which is well within extant data storage and processing capacity.
In one implementation, an approach akin to the well-known “cookie” is utilized for obtaining the desired viewing data from the various subscribers of the network. As a brief aside, a cookie (also known as an HTTP or HTTPS cookie, web cookie, or browser cookie) is an arbitrary piece of textual data used for instance for an origin website or server to send state information (i.e., information relating to previous events, akin to a memory) to a user's browser, and/or for that browser to return state information to the origin site/server. The state information can be used for any number of purposes including without limitation authentication, identification of a user/user session, user preferences, etc. Without cookies, each retrieval of a Web page or component of a Web page is an isolated event effectively unrelated to all other interactions with the pages of the same site. Cookies may also be set via other means, such as, e.g., via a script in a language (e.g., JavaScript).
Hence, in the exemplary implementation, the network side device 202 exchanges one or more cookies with each CPE 206, so as to inter alia obtain state information as to the viewed secondary content. The state information is generated in one embodiment by an application process running on each of the CPE which extracts the audio watermark data (discussed in greater detail below) and creates the necessary data structures for transmission back to the network device 202. This transmission may take on any number of forms/protocols (e.g., rendered in HTTP/HTTPS, Javascript, etc.), or may even use extant signaling messages or protocols within the network that have been “piggybacked” or repurposed for such transmissions. The operation and function of the foregoing architecture and components is merely one possible architecture for implementing the inventive functionality; see for instance the alternative architecture of
Watermarking
The Nielsen Audio Video Encoder (NAVE) is a system capable of inserting Nielsen Media Research proprietary NAVE source identification watermarking directly into the audio portion of compressed digital ATSC transport streams prior to broadcast. NAVE devices can simultaneously insert watermarking data on multiple independent digital television programs being broadcast whether they are standard definition (SDTV) or high definition (HDTV).
Encoding of television signals such as in the Nielsen system is used for audience measurement; e.g., to accurately identify television distributors (including broadcast stations or cable networks). The Nielsen Media approach installs meter devices at user premises being monitored to identify stations and networks by reading the aforementioned watermarks or other codes inserted into the television signal at the distribution source through the NAVE unit. By encoding content with a NAVE unit, ratings data for programming can be provided, whether it is received in a digital, analog, or combined viewing environment.
In one implementation, the installed meter device detects and extracts the codes (watermarks) contained in content signals that are delivered to the premises. These watermarks can be matched to a “library” to identify the content.
If any station's NAVE encoder is interrupted, the meter device installed in Nielsen sample premises collects and store passive signatures for all non-encoded programming viewed. These signatures are downloaded each night to Nielsen's operations center. To identify viewing, the passive signatures collected from the meter device in the premises are matched against the signatures in the library.
U.S. Pat. No. 6,901,606 to Wright, et al. entitled “Method and apparatus for detecting time-compressed broadcast content”, and U.S. Pat. No. 6,272,176 to Srinivasan entitled “Broadcast encoding system and method”, each of the foregoing incorporated herein by reference in its entirety, describe various aspects of the exemplary NAVE encoder and related techniques, which can be used in one embodiment to insert audio encodings or watermarking. Various extant commercial devices which can perform such encoding also exist, including for example the Wegener NAVE IIc™ device, or that manufactured by Ross Video (Norpak), which support the ability to code pre-compressed MPEG-2 transport streams. For example, the Wegener NAVE IIc™ encoder inserts NMR (Nielsen Media Research) audio watermarking data into MPEG-2 Multi-Program Transport Streams compliant with the ATSC standard(s).
While the exemplary embodiments described herein are discussed as utilizing audio watermarking or code insertion, it will be appreciated that the present disclosure is in no way so limited, and in fact other mechanisms for inserting codes or information which can be identified by a receiving or rendering device can be used consistent with the present disclosure, including without limitation: (i) video watermarking; (ii) out-of-band or side-band encoding; (iii) so called “hint tracks” such as those specified in the ISO base media file format set forth in ISO/IEC 14496-12 (MPEG-4 Part 12), which is incorporated herein by reference in its entirety, or (iv) audio content recognition, such as that used by services such as e.g., Shazam®.
In another embodiment, the commercially available Rentrak VoD-based tracking solutions (e.g., OnDemand Essentials) can be utilized consistent with the present disclosure to provide, inter alia, tracking of activity or content.
Premises-Centric Embodiments
Referring now to
The architecture 300 of
Moreover, the architecture 300 of
However, it also requires a “thicker” CPE, and may be prone to surreptitious manipulation by a user (e.g., to permanently enable all trick mode functions). Compilation of data for network-wide analysis or the like is also frustrated.
Notwithstanding, it will be appreciated that various hybridizations of the embodiments of
Methods
Referring now to
As shown, the method first includes receiving one or more program streams at a user premises per step 402. For example an MPTS is received via the HFC network of
Per step 404, the stream is examined, and any watermarking or other relevant coding associated with secondary content contained therein is identified. For instance, in one variant, the aforementioned exemplary NAVE watermarking is used within audio tracks associated with the received content.
Per step 406, the identified watermarks or codes are extracted.
Per step 408, the extracted watermarks or codes are optionally formatted (such as to include a CPE ID, such as a MAC or IP address, user account data, etc.) and transmitted upstream (e.g., via OOB channel or other bearer) to the network server 202.
Per step 410, the watermarks are processed as required by the server 202, and the database 204 accessed to identify any instances of prior viewing by the designated CPE of that content. In one variant, the server 202 uses the watermark to affirmatively identify the associated secondary content (e.g., by an advertisement ID or the like), and then search the database 204 based on that ID. Alternatively, a “brute force” search of the watermark bit-stream (e.g., for a bit-wise match) is performed. Many other variants of identifying the watermark within the database will be recognized by those of ordinary skill given the present disclosure.
Per step 412, based on the outcome of the search of step 410, the designated functionality (e.g., FF or skip) is either enabled (step 414), or disabled (step 416).
Referring now to
As shown, the method first includes receiving one or more program streams at a user premises per step 502. Again, an MPTS is received via the HFC network of
Per step 504, the stream is examined, and any watermarking or other relevant coding associated with secondary content contained therein is identified. For instance, in one variant, the aforementioned exemplary NAVE watermarking is used within audio tracks associated with the received content.
Per step 506, the identified watermarks or codes are extracted.
Per step 508, the extracted watermarks or codes are optionally processed (such as to facilitate their subsequent search within the local database 304), and the database 304 is accessed to identify any instances of prior viewing by the designated CPE of that content. As above, in one variant, the CPE 306 uses the watermark to affirmatively identify the associated secondary content (e.g., by an advertisement ID or the like), and then search the database 304 based on that ID. Alternatively, a “brute force” search of the watermark bit-stream (e.g., for a bit-wise match) is performed. Many other variants of identifying the watermark within the database will be recognized by those of ordinary skill given the present disclosure.
Per step 510, based on the outcome of the search of step 508, the designated functionality (e.g., FF or skip) is either enabled (step 512), or disabled (step 514). For instance, in one implementation, a state variable is maintained with the CPE 306, such that any subsequent trick mode commands initiated by the user check the state variable (e.g., “go/no-go”) as to whether the function will be allowed.
Other Variants
In another embodiment, information relating to the context of an advertisement or promotion is used to determine eligibility for selective enablement. For instance, in one variant, an advertisement having a context which is sufficiently related to that of one already viewed is made eligible for the FF or skip functions. Other variations of this general approach are recognized as well, including e.g., correlation of two advertisements from the same advertiser/entity, correlation of two advertisements for similar goods or services, etc.
In another embodiment, the temporal component of a user's activity is evaluated to identify activity of interest. For example, in one variant, the “freshness” of a viewer's previous view of an advertisement is evaluated, such as by calculating the time between when the advertisement was last viewed and the present time. If a prescribed criterion (e.g., within the last month) is met or exceeded, the aforementioned selective enablement is not conducted, and the user must view the advertisement.
In another embodiment, an advertiser may use a series of advertising spots to create a “story” (i.e., the advertisements build off one another to create a linked chain of events which spans the entirety of the advertisements). Using, e.g., cookies or other similar mechanism, a particular user's position within the story is tracked. In this manner, the system may automatically provide the advertisements in sequential order to the user. The user is thus more engaged and interested in the advertisement, as he is able to recollect and enjoy the overall story. Alternatively, the user may be required to indicate to the system to move from one “episode” to another within the advertisement series. The requirement that the user affirmatively select where he is within the advertisement series results in an ability of the system to obtain highly specific information regarding the user's past and current interaction with the advertisement series.
In an additional variant, the aforementioned advertisement series is tied across various networks. In other words, a user may pick up on a next “episode” in the advertisement series (either manually or automatically) despite the network or device on which the user accesses content. This may be accomplished via an identification or determination of the identity of the user, such as by authenticating the user (e.g., by a password and log-in information).
Another embodiment includes enabling a user to use a remote control or other mechanism to skip an advertisement if the user has at some previous time viewed the advertisement. A Nielsen view may then be assigned to the advertisement and one or more alternative advertisements may be provided. In one variant, different offers or “closers” may be provided to the user if it is noted that he has performed multiple advertisement skips. The advertisement skips may be identified or grouped based on, e.g., whether the user is consistently skipping the same advertisement, the same genre of advertisement, etc.
In another variant, the existence of changes to the advertisement in the intervening time period are evaluated. For example, if the previous advertisement that was viewed by a given subscriber relates to a given product or service, and that advertisement (or the product/service) has been updated in the interim, then even though the user had viewed the prior version of the ad, it must again be viewed. Varying approaches for calculating “proximity” of two advertisements will be recognized by those of ordinary skill given the present disclosure, including without limitation: (i) context-based; (ii) temporal; (iii) changes in version, etc.; (iv) common advertiser; (v) common product/service, and so forth.
It will also be recognized that the same advertisement may carry different watermarking when broadcast or transmitted at different times. Accordingly, the present disclosure contemplates variants where the relevant database of watermarks is cross-correlated or linked, such that searching on a first watermark associated with an advertisement will also retrieve or identify a second watermark, akin to a single person having two names.
In yet another embodiment, the user is provided the ability to swap or exchange an advertisement for another. For instance, in one variant, an advertisement of equal duration is swapped in (or is otherwise resident in the program stream) such that the user can skip the first advertisement in favor of the second one.
In another aspect of the disclosure, new “trick modes” are disclosed. One such trick mode is an “auto-skip” mode, which when enabled, automatically skips the program stream from the extant viewing point to the end of a secondary content element that has been enabled. In one variant, the auto-skip if from the extant viewing point to a point within the secondary content which has not been viewed (e.g., where a subscriber had only viewed a portion of an advertisement, the skip would take the user to the remaining portion not previously viewed).
Another trick mode disclosed herein is the “swap” mode, which as previously described, allows the user with one touch to exchange a given advertisement for another one.
In another aspect of the disclosure, the user activity related to use of the FF, skip, swap, or other such functions is evaluated and used as a basis for charging an advertiser for placement of an advertisement. For instance, in one embodiment, the user skipping over an advertisement previously viewed is counted as an “impression credit” for the advertiser, and hence the fee or other consideration charged the advertiser is adjusted based thereon. While it is often difficult to tell whether a given user actually watched a given advertisement (i.e., were they talking on the phone, away from the TV, mentally engaged, asleep, etc.), a user who affirmatively skips or swaps an advertisement is definitely known not to have viewed the advertisement (or at least the portion occurring after the skip/swap), and hence this information can be used by the network operator or advertiser.
In another embodiment, the skip or swap functions are invoked for an entire program stream or segment. For instance, in one variant, the user has requested playback of cloud-stored primary content such as a football game (which lasts several hours), and all the advertisements queued up for that entire duration are evaluated for prior viewing/enablement. If all the advertisements queued have been previously viewed by that user, they are removed from the stream such that the user receives effectively continuous primary content with no interruptions (although the programmer/operator may selectively insert other material if desired). Alternatively, the already viewed advertisements can each be replaced for other (unseen) advertisements or promotions.
In another embodiment, the user is given the opportunity to “fuse” data from multiple sources or devices together on their CPE (or another platform, such as their mobile wireless tablet computer) relating to secondary content they have viewed. For example, in one implementation, advertisements viewed by the user while watching television or content on their tablet are identified, and information relating thereto stored on the tablet. When the tablet comes in range of a wireless node in communication with the user's CPE (e.g., the user's Wi-Fi AP, or one indigenous to the CPE itself), the mobile device downloads the stored data to the CPE, the latter of which uses this data to populate/update its own internal database. Hence, the user will not be presented (or can skip or FF through) advertisements on their premises rendering device (e.g., TV) that they have previously viewed on another platform. In some implementations, the data can be pushed to the CPE (e.g., via WAP 2.0 push or the like), or alternatively to a network server, and the CPE can periodically or situationally download the pushed data from the server so as to maintain its database updated.
In another embodiment, a given advertisement is selectively replaced with a different (e.g., shorter) version thereof based on the viewer's prior history or activity. In one such variant, the shorter version is a “micro” or mini-ad, such as a 1-5 second spot which is intended to briefly get the user's attention, but which is completed so rapidly that the user need not take any action. For instance, if a viewer had previously watched a full-length advertisement for Coca Cola™ (e.g., 30-seconds long), the program stream would be amended to include a 3-second “Thirsty? Drink Coke!” spot, reminding the user of the product/service associated with the full-length ad. The spot version may conceivably be so short as to barely be perceptible to the user; e.g., flashing a picture of a can of Coke™, somewhat akin to prior art subliminal advertising, yet longer in duration.
The foregoing shorter advertisement version replacement may be further employed when a viewer selects a fast-forward or skip option. In other words, when the viewer enters a command to skip or fast-forward an advertisement, the original advertisement is replaced with a pre-recorded alternative (i.e., a short version advertisement). Prior to broadcast, the advertiser provides a plurality of advertisements in full length as well as in shortened form. In the above embodiment, the full-length advertisement is delivered to the user; then, upon selection of the fast-forward command, the full-length version is swapped for the shorter version. The previously referenced delivery mechanisms (discussed above with respect to
In one alternate implementation, both the full-length and spot advertisements are present in the program stream as delivered to the user (e.g., in sequence with one another); the logic in the user's CPE merely chooses which version to render (and hence skip the non-rendered version).
In yet another embodiment, a user is enabled to “thumbnail” advertisements or promotions that they have already seen, such as using a small window (e.g., akin to PIP) generated on the user's display. Hence, the user can watch the primary content in parallel with the ad, with little disruption of the advertisement running in the window.
In a further variant, the user can be enabled to “shuffle” the advertisement placement or order. For example, in the case of the foregoing exemplary football game, the user may want to view all of the previously unviewed advertisements in the program stream for the game at the beginning, or at half time, or after the first quarter, etc. This gives the user the ability to effectively avoid watching advertisements in some cases, such as where the game is boring or one-sided, and the user does not desire to watch the second half. By placing all of the advertisements at halftime of such a game, the user has not expended any time watching the advertisements they would have otherwise watched, since they all have been delayed until halftime.
In one such implementation, a user's mobile device (e.g., tablet computer) is used as the rendering device, and the touch-screen input is used to render thumbnails of the advertisements during the program stream. The user then merely drags the advertisements with their finger to the place they wish to view them within the program stream.
The network operator or advertiser(s) may obviously impose restrictions on the foregoing; e.g., so as to avoid users moving all advertisements to the very end of the program stream. However, such activity could be permitted for example in cases where the user had already viewed the advertisement.
In another embodiment, users traversing a program stream (such e.g., as a VoD or Start Over or Look Back stream) are presented with a menu or other logical construct (e.g., dynamically generated icons or other interactive mechanisms) when reaching an advertisement, and the traversal is suspended until the user chooses a logical branch for the given advertisement. For example, in one implementation, users fast-forwarding (FF) through Start Over content provided by a network operator are presented with an on-screen menu upon encountering an SCTE 35 cue or other embedded marker within the stream, the menu giving the user a plurality of options, such as, e.g.: a) watching the advertisement; b) affirmatively skipping all or a portion of the advertisement; c) saving the advertisement for later viewing; d) marking the advertisement as a “favorite” or otherwise denoting it as belonging to a particular category of relevance to the user (e.g., “most obnoxious ads”, “car ads” etc.); and/or e) seeing an expanded or related content segment (e.g., seeing a full trailer for an advertisement for a movie, or trailers for movies of similar genre, director, actors, etc.). Hence, each of the foregoing represent a different logical “branch” which the user must take in order to dispense with the advertisement and continue their traversal of the program stream.
It will accordingly be appreciated that the different logical branches may produce a different temporal aspects or timelines, and hence require adjustment by the network-based delivery mechanism. For example, a user affirmatively skipping an advertisement will in effect shorten the program stream by being allowed to skip over the advertisement. Similarly, a user requesting a full movie trailer will lengthen the stream. Saving an advertisement for later will require the advertisement to be inserted at some later time, whether within the same program stream or another (e.g., the disclosure contemplates that the “save for later” and in fact other options may transfer between program streams and in fact modalities, such as for instance where an advertisement saved for later in a Start Over session may be later viewed as part of a Look Back session). Accordingly, advertisement removal and insertion can in one embodiment be conducted “on the fly” using well known advertisement splicing techniques, such as for instance those described in commonly owned U.S. Pat. No. 8,099,757 issued on Jan. 17, 2012 and entitled “Methods and apparatus for Revenue-Optimized Delivery of Content In a Network”, which is incorporated herein by reference in its entirety.
The foregoing menu functionality may also be utilized consistent with a mechanism whereby the user need not provide input to the menu or respond. For example, in one variant, a user's lack of input or interaction with the menu can be used as a basis for further action, which may include for instance playing the advertisement that generated the menu, or swapping out the advertisement for another that may be more germane or of greater interest to the user, such as based on demographics, pyschographics, historical behavior, explicit user preferences, etc. In one implementation, the foregoing functionality is associated with a timeout period, which may be statically or dynamically imposed. As one example of the latter, a user's historical activity with respect to advertisements and the menu is evaluated for statistical parameters that can be used as a basis for speculation on the user's future behavior. For example, a user who has not interacted with the last five (5) advertisement menus while in FF mode can be speculated to have a low probability of interaction on the next instance. Likewise, a user who frequently interacts with certain functions can be speculated to have a higher likelihood of such interaction in the future. To this end, a histogram or other similar mechanism can be developed that can be used to guide functions such as population of the menu (seldom used functions can be speculatively eliminated from the menu), the functionality of the individual functions on the menu (e.g., timeouts can be specified or set at different values for functions that are used more or less frequently, or a broader scope of submenu options specified for more frequently used functions).
It will be appreciated that the various options on the aforementioned menu may be altered dynamically, such as, for example, based on: (i) the type of mechanism by which the user is obtaining the content (e.g., VoD, Start Over, etc.); (ii) the identity of the user/user household, including any particular demographic, psychographic, or historical contexts or considerations associated therewith; (iii) operational considerations or limitations of the delivery network (e.g., bandwidth limitations); (iv) advertising content attributes (e.g., ratings; a full move trailer or adult-themed advertisement may be precluded by a parental control function for children due to its rating for instance; or a longer run-time advertisement may have different menu options associated therewith as compared to a shorter one); (v) date and/or time of day (e.g., more or less options or flexibility might be provided to users during prime time versus late-night or early morning viewing); and/or (vi) the subscription level of the user (e.g., higher-level subscribers may be given more options or flexibility in use of the options). The foregoing dynamic menu logic may be implemented entirely on the network side, by way of a local application or logic running on the user's CPE, or some combination thereof. Accordingly, a given user may see their menu options change literally from advertisement to advertisement, and/or in a more progressive manner over time, depending on the granularity and metric(s) selected by the MSO or advertiser for the dynamic menu alteration function.
It will also be recognized that the various menu functions may not have equal stature. For instance, certain options may provide the network operator enhanced revenue as compared to others (i.e., a user affirmatively viewing an advertisement can be counted as an “impression” for purposes of billing an advertiser, whereas an affirmative skip by the user is a definite non-impression). A “save for later” might eventually mature into an impression, but is inchoate in this regard, since there is no guarantee that a user will ever watch it later (unless it is enforced, as described elsewhere herein). Hence, certain options are clearly more desirable for different entities in a particular circumstance than others. Accordingly, these various functions can be weighted or otherwise apportioned, such as among one or more users, one or more programs, one or more advertising campaigns, etc. For instance, in one such implementation, a “credit” system is used, whereby a user can accrue/deplete advertisement credits for various menu functions selected. For example, in the foregoing context, an affirmative “view” selected on the menu accrues n number of credits for that user (or CPE or household, depending on the particular model selected). These credits are saved in a “bank” for later use by the same user/CPE/household, such as in the case where the user inserts an affirmative “skip” command, in which case n credits are subtracted. A “save for later” selection by the user may accrue a lesser number of credits (e.g., n/2), since the impression is inchoate as discussed supra; in one variant, the user is given the remaining n/2 credit when they actually view the saved advertisement. Note that the credits may be tied to any basis the MSO or advertiser desires, including impressions (discussed above), duration (e.g., longer ads correlate with more credit), timing (prime time viewing of ads may accrue more credits than non-prime time). Moreover, the credits/debits may be applied across multiple different advertisers/campaigns, or restricted to one (e.g., such that each different campaign has its own user/CPE/household “bank account”). Credits/debits may be accrued on a user basis across multiple devices as well; e.g., credits accrued on a user's premises CPE (e.g., DSTB) may be added to those accrued on their mobile device for the same advertiser campaign. The disclosure also contemplates that users can trade credits or give them away; e.g., to another family member or friend.
As another example of weighting or apportionment, certain functions of the menu may only be available at certain times or certain frequencies with respect to others. For instance, the “affirmative watch” function might always be available irrespective of any other considerations or factors, whereas the “skip” function may only be available at a reduced frequency, or as a function of dynamic variables as discussed above (e.g., only during non-prime time).
Myriad other combinations and permutations of dynamic control and/or apportionment will be recognized by those of ordinary skill given the present disclosure, the foregoing being merely illustrative of the broader principles of the disclosure.
It will further be appreciated that the foregoing menu functions can in certain implementations be combined, or multiple ones selected. For instance, the menu or other construct discussed above may be configured such that the user can select multiple ones of the options, such as “watch now” and “save for later”. The menu may also be configured with submenus or other functional structures (e.g., icons, telescoping features, hyperlinks, etc.) so as to provide more detailed or complex functions/options. For example, in the exemplary “save for later” function, the user might be given options to save for one hour later, one day later, one week later, next time they view the given channel associated with the ad, etc.
In another embodiment, the skip or fast-forward command when employed during an advertisement may cause display of the advertisement with a reduced number of frames (for example half of the frames may be dropped). Alternatively, the frame rate may be increased, i.e., the rate at which each frame is displayed is increased or sped up. The frame-adjusted advertisement is displayed to the viewer in addition to the audio portion thereof. To ensure that the advertisement is understandable to the viewer, the audio portion may also be adjusted to account for the increased speed at which it is played. That is to say, the overall time needed to play a frame-adjusted advertisement is shortened as compared to a non-frame-adjusted advertisement. If the audio is to be played alongside the frame-adjusted advertisement, it must adjust its speed. It is well known, however, that audio played back at an increased speed causes the audio to be distorted and in some cases unintelligible to the listener. Therefore, mechanisms may be provided to adjust the audio to ensure that it is clear and understandable at the increased speed. In one example, the audio portion may be played at the increased speed, but may be dropped an octave (to make up for a so-called “chipmunk” effect). As another alternative, certain portions of the audio (e.g., non-essential portions that are pre-marked, such as using cues or metadata) may be selectively deleted.
The frame-adjusted advertisement may still be considered “viewed” by the viewer according to the previously discussed Nielsen standards. In particular, a custom version of the previously discussed NAVE audio watermark may be created and applied to the rate-adjusted advertisement. When the rate-adjusted advertisement is viewed, the watermark is identified and information relating thereto collected and/or transmitted such as to a headend entity and/or a NAVE unit. Alternatively, the watermark itself need not be altered; rather, the NAVE unit or other equipment may be configured to identify the watermark despite it being presented at an increased speed.
Information relating to whether the frame-adjusted advertisement has been viewed may be utilized as discussed above. For example, the information may be utilized, e.g., to determine eligibility for selective enablement of various features, to track a user's position within an advertisement story or series, to track a viewer's advertisement viewing history, to provide a mechanism for charging advertisers on a per-view basis, and/or to track “impression credits”. These and other example uses are discussed in greater detail above.
It is further recognized that the foregoing functionality, i.e., the ability to cause a frame-adjusted advertisement and adjusted audio to be presented upon selection of a skip or fast-forward command is associated to advertising (secondary) content, and not programming (primary) content. In other words, during non-advertising portions of the program, the fast-forward or skip buttons work as usual (e.g., 2×, 4×, 8×, etc. with audio being dropped out). Hence, the present embodiment is further configured to identify, at the time of the skip or fast-forward request, whether the content being currently viewed is primary or secondary content. In one embodiment, this is accomplished by searching the program stream for SCTE 35 cues. If it is determined that the button press follows an SCTE 35 cue tone indicating the start of an advertisement, the foregoing mechanisms for frame adjusting and adjusting the audio of the advertisement are employed. Alternatively, if the button press follows an SCTE 35 cue tone indicating the end of an advertisement, the foregoing mechanisms are not employed and traditional fast-forward and skip mechanism are utilized.
In another embodiment, advertising and program content are separated using time coding enabled by the programmer prior to, or by a third party after the airing of, program content.
Premises DVR-Based Embodiments
In addition to the foregoing network-based storage implementations (e.g., using nDVR), various aspects of the disclosure may be implemented at the user's premises using their own recording equipment (e.g., premises DVR). In one such implementation, content is streamed over the network to the user, the content including secondary content such as advertisements or promotions. The user selects their DVR to record the streamed content (and secondary content) generally as in the prior art. However, in this implementation, the advertisement skipping and/or menu functionality discussed supra, are enabled on the user's CPE (e.g., on the DVR itself) such that subsequent interaction with the recorded content is subject the advertisement skipping/menu functions.
For example, in one variant, the user records the primary and secondary content on his/her DVR (such as when they are away at work), and then later accesses the stored content (stream). As the user attempts to fast-forward through the secondary content, the logic resident on the CPE (e.g., DVR, gateway, DSTB, or other CPE in communication therewith) either accesses either local or remote data relating the user's (or that CPE's) prior interaction or viewing with that particular secondary content, or alternatively their advertisement “credit” status. The secondary content may be identified using the NAVE approach discussed above, or alternatively via other means (such as an identifier or code embedded in the audio or video portion of the secondary content which can then be used to access a database for that user/CPE). If the user has met the acceptance criteria (e.g., has watched a sufficient portion of that same advertisement previously), then the trick mode function on the user's DVR is enabled, and the user can FF or skip the ad.
In another variant, the user is presented a menu such as that described above, and the user can select which option they prefer (e.g., save for later, skip, etc.); the menu is generated locally by the DVR/CPE and rendered on the user's viewing device (e.g., TV).
In yet another variant, the foregoing functions are combined; e.g., upon encountering an advertisement during FF operation, the user is presented with a menu enabling them to skip the advertisement if the foregoing evaluation of prior interaction (or “credits” as discussed supra) indicates such policy is to be enabled.
In one implementation, the DVR comprises mass storage (e.g., a SATA hard drive, or NAND flash memory), and the primary and secondary content are stored thereon, with the inclusion of markers that have been inserted into the program stream marking, inter alia, the beginning and end of each advertisement. The DVR is also equipped with the NAVE functionality previously described, such that it can identify advertisements as they are encountered, and use that information to determine the user's eligibility for certain selected functions (e.g., skip or FF). When the user in enabled for a “skip”, the user selects this function on their DVR remote control (e.g., wireless remote), and the logic within the DVR (e.g., program stored in program memory or RAM of the DVR processing block) accesses that sector of the disk (or memory address) associated with the “end” cue or marker in the recorded content. In that accesses to HDDs or flash are rapid and may occur to any part of the storage in literally any order, advertisements that are recorded in a given lineal sequence relative to the primary content may accordingly be skipped, permuted in order, traded for one another etc. simply by accessing the different storage locations in a different sequence. Hence, numerous different temporal threads or branches can be created locally by the user based on his/her choices and/or prior interaction relative to each secondary content element (e.g., advertisement).
The foregoing functionality can, in one variant, be retrofitted onto extant premises DVRs simply through a software addition or download, and the transmission of the appropriate markers or cues in the content when transmitted by the network operator. On-screen displays of functions can also be used; e.g., instead of enabling the extant FF function on the user's DVR remote unit, an interactive on-screen menu can be used to provide the user functions for which there is no existing button (e.g., skip). This is especially true of touch-screen enabled devices such as tablet computers; e.g., a user streaming and recording content on their Wi-Fi enabled tablet (or viewing content recorded on their DVR and using the tablet to watch it while mobile); an application installed on the tablet in one embodiment provides the foregoing menu and/or advertisement enforcement functions, thereby relieving the network operator of providing this functionality at the headend as in some other embodiments described herein. Hence, a tablet user who is also an MSO subscriber can download the MSO's “app”, which implements the enforcement/menu functions in relation to, e.g., trick modes used with respect to the MSO-provided content. In one such implementation, the user interaction, credit, and/or NAVE databases are retained locally on the DVR (or even the tablet itself) such that all of the evaluation can be performed locally at the user's premises. In other implementations, one or more of the foregoing databases are retained at a network storage location (e.g., server at the hub or headend), and the premises CPE messages the server with identifying information for the user (and advertisement at issue) to obtain the necessary policy/enforcement/credit information.
In another embodiment, a user who has initiated fast forward functionality during a program may be presented with an alternative advertisement as a semi-transparent “overlay”, which may further be accompanied by alternative audio and/or interactive functionality related to such advertisement. For example, a “Drink Coca-Cola®” brand logo may appear during fast-forward, with audio “Drink Coca-Cola®. Press “A” to receive your coupon for a free Coke®.”
Individualized Content Channel Variants
In another aspect, client applications (e.g., those disposed on a subscriber's CPE and/or network servers) are utilized to compile the playlist based on user-imputed as well as pre-programmed user profiles. Various feedback mechanisms may also be utilized to enable the client application to “learn” from the user's activities in order to update the user profile and generate more finely-tuned and cogent recommendations. Client applications may also be utilized to manage the seamless presentation of content on the virtual channel, and locate/flag various scenes inside selected content for user viewing or editing.
Accordingly, in one variant, targeted advertising or promotions may be selectively inserted or enforced within the programming for the aforementioned virtual personalized channel. Specifically, by knowing the particular prior behavior of a particular user, more accurate “mapping” of advertisement or promotion enforcement to each individual user may be accomplished.
CPE
As shown in the simplified diagram of
Other components which may be utilized within the device (deleted from
The CPE of
The exemplary CPE further comprises a conventional “Watch TV” application or the like, which services those program or user channels available over the network. The Watch TV application, residing in memory, provides such functions as channel navigation control, channel selection in response to a channel change event, etc. In one embodiment, the Watch TV (or EPG) application further comprises all necessary functionality need to support the data collection client process.
In another embodiment, the CPE 206, 306 comprises a converged premises device, such as for example that described in co-owned U.S. patent application Ser. No. 11/378,129 filed Mar. 16, 2006, entitled “METHODS AND APPARATUS FOR CENTRALIZED CONTENT AND DATA DELIVERY”, and issued as U.S. Pat. No. 8,347,341 on Jan. 1, 2013, incorporated herein by reference in its entirety.
As previously noted, the CPE of
Alternatively, the client application/CPE may be configured with more innate intelligence, such as where the aforementioned content identification (if used) is performed at the CPE (such as via a locally stored database, lookup table, or other data structure); subsequently, data reflecting this identification is passed up to the headend for implementation of relevant enforcement policies based on the data.
As yet another configuration, the CPE/application may be configured to actually make selective enforcement decisions locally (such as via a locally stored advertisement identification database, and stored history of the user/CPE activities), and pass the decision to the server or other responsible network entity, or even implement the decision itself (as in
Moreover, it will be appreciated that while primary embodiments of the methods and network/client apparatus set forth herein are described, wherein the network side (e.g., headend) enforces policies relating to secondary content viewing with respect to “cloud” based storage and delivery paradigms (e.g., Start Over or Look Back functions), the various aspects of the disclosure may be applied to locally stored content; e.g., that stored on a premises DVR. While most DVR implementations generally do not enforce any sort of rules or restrictions regarding trick modes or playback of recorded secondary content, it is appreciated that substantial utility may nonetheless be derived from the application of the principles of the present disclosure in such cases. For example, a user of the premises DVR may not remember that they previously watched a given ad, and hence could in one implementation be alerted (e.g., via on-screen icon, message, audible tone, etc.) that the advertisement they are watching has already been viewed, at which point they could FF or skip the advertisement (or decide that they want to see it again).
Any data of interest may be directly transmitted from the CPE (“pushed”) to the upstream entity (e.g., server, or software portion, such as via an OOB message or other communication), or stored or logged in a file and sent when requested or “pulled” by the network entity (or according to other models, such as being sent periodically, on CPE startup, etc.).
The CPE 106 may also be in communication with, or may itself constitute, a mobile device, such as a wireless-enabled smartphone, tablet computer, laptop computer, etc. For example, in one variant of the CPE (not shown), the CPE is a tablet computer enabled for wireless (e.g., Wi-Fi) communication with a hotspot (802.11 AP), such that the user can receive MSO-originated nDVR, Look Back, Start Over, etc. services at the tablet device, and any trick mode functions (such as FF or skip) can be selectively enforced on the tablet (as if it was the user's premises CPE).
Business Methods and Rules Engine
Various exemplary business-related aspects of present disclosure are now described in greater detail, along with exemplary embodiments of a “rules engine”.
Specifically, in another aspect of the disclosure, the aforementioned selective enforcement architectures (e.g., including one or more computer programs) optionally include an entity having an operations and/or business rules “engine”. This engine comprises, in an exemplary embodiment, a series of software routines that are adapted to control the enforcement of functions (e.g., trick modes on stored secondary content). These rules may also be fully integrated within the aforementioned one or more computer programs and be controlled via the entity on which the program is run, which may be for instance the network server 202 of the architecture 200 of
The rules engine can be considered an overlay of sorts to the algorithms of the previously described computer applications. For example, the exemplary computer application may invoke certain operational protocols or decision processes based on data received (e.g., prior history of viewing of certain secondary content), as well as network operational or historical data, demographic data, geographic data, etc. However, these processes may not always be compatible with higher-level business or operational goals, such as maximizing profit on a network-wide basis (or after consideration of other factors not examined by the collecting entities such as advertising revenue, RTA/acquisition costs, “costs” of delivering streams based on required bandwidth, taxes, maintenance or repair costs, additional equipment leasing or use costs, etc.), or system reliability and/or flexibility. As but one example, a user may have already viewed a given ad, and hence qualifies to FF or skip it, but where the advertisement is flagged of one of importance or significance to the advertiser, or which has a dynamic temporal or demographic component (e.g., is varied as a function of time/date, or has a particular demographic relevance), the rules engine may override the selective enablement and force the user to watch it again. Similarly, where the user has affirmatively or passively indicated a preference for certain types of content, the rules engine may selectively override the selective enablement or disablement decisions.
Per user/CPE data may also be considered in the selective enforcement logic; e.g., if a given user or CPE historically does not FF or skip advertisements even when enabled to do so, it can be inferred that the associated user has a relatively high “threshold for advertising pain”, and hence all or a portion of the advertisements that would otherwise be selectively enabled are not.
It will be recognized that while certain aspects of the disclosure are described in terms of a specific sequence of steps of a method, these descriptions are only illustrative of the broader methods of the disclosure, and may be modified as required by the particular application. Certain steps may be rendered unnecessary or optional under certain circumstances. Additionally, certain steps or functionality may be added to the disclosed embodiments, or the order of performance of two or more steps permuted. All such variations are considered to be encompassed within the disclosure herein.
While the above detailed description has shown, described, and pointed out novel features of the disclosure as applied to various embodiments, it will be understood that various omissions, substitutions, and changes in the form and details of the device or process illustrated may be made by those skilled in the art. The foregoing description is of the best mode presently contemplated. This description is in no way meant to be limiting, but rather should be taken as illustrative of the general principles of the disclosure. The scope of the disclosure should be determined with reference to the claims.
This application is a divisional of and claims priority to co-owned U.S. patent application Ser. No. 15/853,468 filed Dec. 22, 2017 and entitled “APPARATUS AND METHODS FOR SELECTIVE ENFORCEMENT OF DIGITAL CONTENT VIEWING”, issuing as U.S. Pat. No. 10,721,504 on Jul. 21, 2020, which is a divisional of and claims priority to co-owned U.S. patent application Ser. No. 13/676,012 filed Nov. 13, 2012 and entitled “APPARATUS AND METHODS FOR SELECTIVE ENFORCEMENT OF SECONDARY CONTENT VIEWING”, and issued as U.S. Pat. No. 9,854,280 on Dec. 26, 2017, which claims priority to commonly owned U.S. Provisional Patent Application Ser. No. 61/670,082 of the same title filed on Jul. 10, 2012, each of the foregoing which is incorporated herein by reference in its entirety.
| Number | Name | Date | Kind |
|---|---|---|---|
| 4521881 | Stapleford et al. | Jun 1985 | A |
| 4546382 | McKenna et al. | Oct 1985 | A |
| 4602279 | Freeman | Jul 1986 | A |
| 4905080 | Watanabe et al. | Feb 1990 | A |
| 4930120 | Baxter et al. | May 1990 | A |
| 5155591 | Wachob | Oct 1992 | A |
| 5313454 | Bustini et al. | May 1994 | A |
| 5373315 | Dufresne et al. | Dec 1994 | A |
| 5481294 | Thomas et al. | Jan 1996 | A |
| 5497185 | Dufresne et al. | Mar 1996 | A |
| 5600364 | Hendricks et al. | Feb 1997 | A |
| 5673253 | Shaffer | Sep 1997 | A |
| 5675647 | Garneau et al. | Oct 1997 | A |
| RE35651 | Bradley et al. | Nov 1997 | E |
| 5734380 | Adams et al. | Mar 1998 | A |
| 5758257 | Herz et al. | May 1998 | A |
| 5774170 | Hite et al. | Jun 1998 | A |
| 5793409 | Tetsumura | Aug 1998 | A |
| 5793410 | Rao | Aug 1998 | A |
| 5812642 | Leroy | Sep 1998 | A |
| 5815662 | Ong | Sep 1998 | A |
| 5862312 | Mann et al. | Jan 1999 | A |
| 5878324 | Borth et al. | Mar 1999 | A |
| 5884037 | Aras et al. | Mar 1999 | A |
| 5914945 | Abu-Amara et al. | Jun 1999 | A |
| 5926205 | Krause et al. | Jul 1999 | A |
| 5929849 | Kikinis | Jul 1999 | A |
| 5935206 | Dixon et al. | Aug 1999 | A |
| 5956037 | Osawa et al. | Sep 1999 | A |
| 5963844 | Dail | Oct 1999 | A |
| 5974299 | Massetti | Oct 1999 | A |
| 6002393 | Hite et al. | Dec 1999 | A |
| 6029045 | Picco et al. | Feb 2000 | A |
| 6047327 | Tso et al. | Apr 2000 | A |
| 6081830 | Schindler | Jun 2000 | A |
| 6088722 | Herz et al. | Jul 2000 | A |
| 6092178 | Jindal et al. | Jul 2000 | A |
| 6105134 | Pinder et al. | Aug 2000 | A |
| 6124878 | Adams et al. | Sep 2000 | A |
| 6128316 | Takeda et al. | Oct 2000 | A |
| 6134532 | Lazarus et al. | Oct 2000 | A |
| 6157377 | Shah-Nazaroff et al. | Dec 2000 | A |
| 6161142 | Wolfe et al. | Dec 2000 | A |
| 6167432 | Jiang | Dec 2000 | A |
| 6169728 | Perreault et al. | Jan 2001 | B1 |
| 6175856 | Riddle | Jan 2001 | B1 |
| 6177931 | Alexander et al. | Jan 2001 | B1 |
| 6182050 | Ballard | Jan 2001 | B1 |
| 6202210 | Ludtke | Mar 2001 | B1 |
| 6211869 | Loveman et al. | Apr 2001 | B1 |
| 6211901 | Imajima et al. | Apr 2001 | B1 |
| 6216129 | Eldering | Apr 2001 | B1 |
| 6216152 | Wong et al. | Apr 2001 | B1 |
| 6219710 | Gray et al. | Apr 2001 | B1 |
| 6219840 | Corrigan et al. | Apr 2001 | B1 |
| 6240243 | Chen et al. | May 2001 | B1 |
| 6240553 | Son et al. | May 2001 | B1 |
| 6252964 | Wasilewski et al. | Jun 2001 | B1 |
| 6256393 | Safadi et al. | Jul 2001 | B1 |
| 6272176 | Srinivasan | Aug 2001 | B1 |
| 6282713 | Kitsukawa et al. | Aug 2001 | B1 |
| 6330609 | Garofalakis et al. | Dec 2001 | B1 |
| 6337715 | Inagaki et al. | Jan 2002 | B1 |
| 6353626 | Sunay et al. | Mar 2002 | B1 |
| 6378130 | Adams | Apr 2002 | B1 |
| 6434141 | Oz et al. | Aug 2002 | B1 |
| 6446261 | Rosser | Sep 2002 | B1 |
| 6463508 | Wolf et al. | Oct 2002 | B1 |
| 6463585 | Hendricks et al. | Oct 2002 | B1 |
| 6467089 | Aust et al. | Oct 2002 | B1 |
| 6498783 | Lin | Dec 2002 | B1 |
| 6502076 | Smith | Dec 2002 | B1 |
| 6502139 | Birk et al. | Dec 2002 | B1 |
| 6516412 | Wasilewski et al. | Feb 2003 | B2 |
| 6549718 | Grooters et al. | Apr 2003 | B1 |
| 6560578 | Eldering | May 2003 | B2 |
| 6571102 | Hogberg et al. | May 2003 | B1 |
| 6590865 | Ibaraki et al. | Jul 2003 | B1 |
| 6594699 | Sahai et al. | Jul 2003 | B1 |
| 6601237 | Ten et al. | Jul 2003 | B1 |
| 6604138 | Virine et al. | Aug 2003 | B1 |
| 6615039 | Eldering | Sep 2003 | B1 |
| 6615251 | Klug et al. | Sep 2003 | B1 |
| 6647548 | Lu et al. | Nov 2003 | B1 |
| 6651103 | Markowitz et al. | Nov 2003 | B1 |
| 6671736 | Virine et al. | Dec 2003 | B2 |
| 6681393 | Bauminger et al. | Jan 2004 | B1 |
| 6687735 | Logston et al. | Feb 2004 | B1 |
| 6700624 | Yun | Mar 2004 | B2 |
| 6704930 | Eldering et al. | Mar 2004 | B1 |
| 6718551 | Swix et al. | Apr 2004 | B1 |
| 6725459 | Bacon | Apr 2004 | B2 |
| 6728269 | Godwin et al. | Apr 2004 | B1 |
| 6728840 | Shatil et al. | Apr 2004 | B1 |
| 6738978 | Hendricks et al. | May 2004 | B1 |
| 6742187 | Vogel | May 2004 | B1 |
| 6745245 | Carpenter | Jun 2004 | B1 |
| 6763391 | Ludtke | Jul 2004 | B1 |
| 6771290 | Hoyle | Aug 2004 | B1 |
| 6772435 | Thexton et al. | Aug 2004 | B1 |
| 6775843 | McDermott | Aug 2004 | B1 |
| 6799196 | Smith | Sep 2004 | B1 |
| 6813776 | Chernock et al. | Nov 2004 | B2 |
| 6842783 | Boivie et al. | Jan 2005 | B1 |
| 6859845 | Mate | Feb 2005 | B2 |
| 6868439 | Basu et al. | Mar 2005 | B2 |
| 6891841 | Leatherbury et al. | May 2005 | B2 |
| 6898762 | Ellis et al. | May 2005 | B2 |
| 6901606 | Wright et al. | May 2005 | B2 |
| 6909837 | Unger | Jun 2005 | B1 |
| 6915528 | McKenna | Jul 2005 | B1 |
| 6917628 | McKinnin et al. | Jul 2005 | B2 |
| 6944166 | Perinpanathan et al. | Sep 2005 | B1 |
| 6948183 | Peterka | Sep 2005 | B1 |
| 6961430 | Gaske et al. | Nov 2005 | B1 |
| 6981045 | Brooks | Dec 2005 | B1 |
| 6985934 | Armstrong et al. | Jan 2006 | B1 |
| 6986156 | Rodriguez et al. | Jan 2006 | B1 |
| 6990680 | Wugofski | Jan 2006 | B1 |
| 7010801 | Jerding et al. | Mar 2006 | B1 |
| 7012891 | Chandran et al. | Mar 2006 | B1 |
| 7017179 | Asamoto et al. | Mar 2006 | B1 |
| 7024461 | Janning et al. | Apr 2006 | B1 |
| 7024676 | Klopfenstein | Apr 2006 | B1 |
| 7027460 | Iyer et al. | Apr 2006 | B2 |
| 7039116 | Zhang et al. | May 2006 | B1 |
| 7039169 | Jones | May 2006 | B2 |
| 7039614 | Candelore | May 2006 | B1 |
| 7039928 | Kamada et al. | May 2006 | B2 |
| 7039938 | Candelore | May 2006 | B2 |
| 7047309 | Baumann et al. | May 2006 | B2 |
| 7058387 | Kumar et al. | Jun 2006 | B2 |
| 7069573 | Brooks et al. | Jun 2006 | B1 |
| 7075945 | Arsenault et al. | Jul 2006 | B2 |
| 7086077 | Giammaressi | Aug 2006 | B2 |
| 7089577 | Rakib et al. | Aug 2006 | B1 |
| 7093272 | Shah-Nazaroff et al. | Aug 2006 | B1 |
| 7100183 | Kunkel et al. | Aug 2006 | B2 |
| 7103906 | Katz et al. | Sep 2006 | B1 |
| 7107462 | Fransdonk | Sep 2006 | B2 |
| 7109848 | Schybergson | Sep 2006 | B2 |
| 7127619 | Unger et al. | Oct 2006 | B2 |
| 7133837 | Barnes, Jr. | Nov 2006 | B1 |
| 7143431 | Eager et al. | Nov 2006 | B1 |
| 7146627 | Ismail et al. | Dec 2006 | B1 |
| 7150017 | Vogl et al. | Dec 2006 | B1 |
| 7152237 | Flickinger et al. | Dec 2006 | B2 |
| 7155508 | Sankuratripati et al. | Dec 2006 | B2 |
| 7174126 | McElhatten et al. | Feb 2007 | B2 |
| 7174385 | Li | Feb 2007 | B2 |
| 7178161 | Fristoe et al. | Feb 2007 | B1 |
| 7181010 | Russ et al. | Feb 2007 | B2 |
| 7191461 | Arsenault et al. | Mar 2007 | B1 |
| 7194756 | Addington et al. | Mar 2007 | B2 |
| 7197472 | Conkwright et al. | Mar 2007 | B2 |
| 7200788 | Hiraki et al. | Apr 2007 | B2 |
| 7203940 | Barmettler et al. | Apr 2007 | B2 |
| 7207055 | Hendricks et al. | Apr 2007 | B1 |
| 7216265 | Hughes et al. | May 2007 | B2 |
| 7222078 | Abelow | May 2007 | B2 |
| 7225164 | Candelore et al. | May 2007 | B1 |
| 7225458 | Klauss et al. | May 2007 | B2 |
| 7228555 | Schlack | Jun 2007 | B2 |
| 7237250 | Kanojia et al. | Jun 2007 | B2 |
| 7246150 | Donoho et al. | Jul 2007 | B1 |
| 7246172 | Yoshiba et al. | Jul 2007 | B2 |
| 7246366 | Addington et al. | Jul 2007 | B1 |
| 7254608 | Yeager et al. | Aug 2007 | B2 |
| 7257650 | Maciesowicz | Aug 2007 | B2 |
| 7266198 | Medvinsky | Sep 2007 | B2 |
| 7266611 | Jabri et al. | Sep 2007 | B2 |
| 7266726 | Ladd et al. | Sep 2007 | B1 |
| 7266836 | Anttila et al. | Sep 2007 | B2 |
| 7274661 | Harrell et al. | Sep 2007 | B2 |
| 7280737 | Smith | Oct 2007 | B2 |
| 7281261 | Jaff et al. | Oct 2007 | B2 |
| 7283803 | Karaoguz et al. | Oct 2007 | B2 |
| 7305691 | Cristofalo | Dec 2007 | B2 |
| 7308415 | Kimbrel et al. | Dec 2007 | B2 |
| 7317728 | Acharya et al. | Jan 2008 | B2 |
| 7324523 | Dacosta | Jan 2008 | B2 |
| 7325073 | Shao et al. | Jan 2008 | B2 |
| 7327692 | Ain et al. | Feb 2008 | B2 |
| 7334044 | Allen | Feb 2008 | B1 |
| 7340759 | Rodriguez | Mar 2008 | B1 |
| 7346688 | Allen et al. | Mar 2008 | B2 |
| 7352775 | Powell | Apr 2008 | B2 |
| 7355980 | Bauer et al. | Apr 2008 | B2 |
| 7356751 | Levitan | Apr 2008 | B1 |
| 7363371 | Kirby et al. | Apr 2008 | B2 |
| 7363643 | Drake et al. | Apr 2008 | B2 |
| 7367043 | Dudkiewicz et al. | Apr 2008 | B2 |
| 7369750 | Cheng et al. | May 2008 | B2 |
| 7370120 | Kirsch et al. | May 2008 | B2 |
| 7376386 | Phillips et al. | May 2008 | B2 |
| 7379494 | Raleigh et al. | May 2008 | B2 |
| 7403618 | Van et al. | Jul 2008 | B2 |
| 7434245 | Shiga et al. | Oct 2008 | B1 |
| 7457520 | Rosetti et al. | Nov 2008 | B2 |
| 7464179 | Hodges et al. | Dec 2008 | B2 |
| 7567565 | La | Jul 2009 | B2 |
| 7574726 | Zhang et al. | Aug 2009 | B2 |
| 7577118 | Haumonte et al. | Aug 2009 | B2 |
| 7602820 | Helms et al. | Oct 2009 | B2 |
| 7603529 | Machardy et al. | Oct 2009 | B1 |
| 7617516 | Huslak et al. | Nov 2009 | B2 |
| 7690020 | Lebar | Mar 2010 | B2 |
| 7712125 | Herigstad et al. | May 2010 | B2 |
| 7720432 | Colby et al. | May 2010 | B1 |
| 7729940 | Harvey et al. | Jun 2010 | B2 |
| 7730509 | Boulet et al. | Jun 2010 | B2 |
| 7757251 | Gonder et al. | Jul 2010 | B2 |
| 7783316 | Mitchell | Aug 2010 | B1 |
| 7801803 | Forlai | Sep 2010 | B2 |
| 7836178 | Bedell et al. | Nov 2010 | B1 |
| 7900229 | Dureau | Mar 2011 | B2 |
| 7930715 | Hendricks et al. | Apr 2011 | B2 |
| 7954131 | Cholas et al. | May 2011 | B2 |
| 8028322 | Riedl et al. | Sep 2011 | B2 |
| 8042131 | Flickinger | Oct 2011 | B2 |
| 8065703 | Wilson et al. | Nov 2011 | B2 |
| 8099757 | Riedl et al. | Jan 2012 | B2 |
| 8156520 | Casagrande et al. | Apr 2012 | B2 |
| 8170065 | Hasek et al. | May 2012 | B2 |
| 8205226 | Ko et al. | Jun 2012 | B2 |
| 8214256 | Riedl et al. | Jul 2012 | B2 |
| 8296185 | Isaac | Oct 2012 | B2 |
| 8347341 | Markley et al. | Jan 2013 | B2 |
| 8365212 | Orlowski | Jan 2013 | B1 |
| 8365213 | Orlowski | Jan 2013 | B1 |
| 8396055 | Patel et al. | Mar 2013 | B2 |
| 8458125 | Chong, Jr. et al. | Jun 2013 | B1 |
| 8468099 | Headings et al. | Jun 2013 | B2 |
| 8516529 | Lajoie et al. | Aug 2013 | B2 |
| 8561113 | Cansler et al. | Oct 2013 | B2 |
| 8571931 | Riedl et al. | Oct 2013 | B2 |
| 8621501 | Matheny et al. | Dec 2013 | B2 |
| 8701138 | Stern et al. | Apr 2014 | B2 |
| 8713623 | Brooks | Apr 2014 | B2 |
| 8726303 | Ellis, III | May 2014 | B2 |
| 8769559 | Moon et al. | Jul 2014 | B2 |
| 8856825 | Mick, Jr. et al. | Oct 2014 | B1 |
| 8881190 | Rothschild | Nov 2014 | B1 |
| 8997136 | Brooks et al. | Mar 2015 | B2 |
| 9027062 | Patel et al. | May 2015 | B2 |
| 9215423 | Kimble et al. | Dec 2015 | B2 |
| 9479807 | Bugajski et al. | Oct 2016 | B1 |
| 20010013123 | Freeman et al. | Aug 2001 | A1 |
| 20010030785 | Pangrac et al. | Oct 2001 | A1 |
| 20010050901 | Love et al. | Dec 2001 | A1 |
| 20020004912 | Fung | Jan 2002 | A1 |
| 20020019984 | Rakib | Feb 2002 | A1 |
| 20020026496 | Boyer et al. | Feb 2002 | A1 |
| 20020032754 | Logston et al. | Mar 2002 | A1 |
| 20020046404 | Mizutani | Apr 2002 | A1 |
| 20020049902 | Rhodes | Apr 2002 | A1 |
| 20020049980 | Hoang | Apr 2002 | A1 |
| 20020053082 | Weaver, III et al. | May 2002 | A1 |
| 20020054589 | Ethridge et al. | May 2002 | A1 |
| 20020059577 | Lu et al. | May 2002 | A1 |
| 20020059619 | Lebar | May 2002 | A1 |
| 20020063621 | Tseng et al. | May 2002 | A1 |
| 20020069404 | Copeman et al. | Jun 2002 | A1 |
| 20020073419 | Yen et al. | Jun 2002 | A1 |
| 20020078441 | Drake et al. | Jun 2002 | A1 |
| 20020078444 | Krewin et al. | Jun 2002 | A1 |
| 20020087975 | Schlack | Jul 2002 | A1 |
| 20020087976 | Kaplan et al. | Jul 2002 | A1 |
| 20020095684 | St. John et al. | Jul 2002 | A1 |
| 20020100059 | Buehl et al. | Jul 2002 | A1 |
| 20020100063 | Herigstad et al. | Jul 2002 | A1 |
| 20020104083 | Hendricks et al. | Aug 2002 | A1 |
| 20020112240 | Bacso et al. | Aug 2002 | A1 |
| 20020120498 | Gordon et al. | Aug 2002 | A1 |
| 20020123928 | Eldering et al. | Sep 2002 | A1 |
| 20020124182 | Bacso et al. | Sep 2002 | A1 |
| 20020129378 | Cloonan et al. | Sep 2002 | A1 |
| 20020144262 | Plotnick et al. | Oct 2002 | A1 |
| 20020144263 | Eldering et al. | Oct 2002 | A1 |
| 20020147771 | Traversat et al. | Oct 2002 | A1 |
| 20020147984 | Tomsen et al. | Oct 2002 | A1 |
| 20020152299 | Traversat et al. | Oct 2002 | A1 |
| 20020154655 | Gummalla et al. | Oct 2002 | A1 |
| 20020162109 | Shteyn | Oct 2002 | A1 |
| 20020162115 | Bruckner et al. | Oct 2002 | A1 |
| 20020163928 | Rudnick et al. | Nov 2002 | A1 |
| 20020166119 | Cristofalo | Nov 2002 | A1 |
| 20020170057 | Barrett et al. | Nov 2002 | A1 |
| 20020174430 | Ellis et al. | Nov 2002 | A1 |
| 20020178445 | Eldering et al. | Nov 2002 | A1 |
| 20020178447 | Plotnick et al. | Nov 2002 | A1 |
| 20020184629 | Sie et al. | Dec 2002 | A1 |
| 20020184634 | Cooper | Dec 2002 | A1 |
| 20020184635 | Istvan | Dec 2002 | A1 |
| 20020194607 | Connelly | Dec 2002 | A1 |
| 20020196939 | Unger et al. | Dec 2002 | A1 |
| 20030002862 | Rodriguez et al. | Jan 2003 | A1 |
| 20030004810 | Eldering | Jan 2003 | A1 |
| 20030005056 | Yamamoto et al. | Jan 2003 | A1 |
| 20030005446 | Jaff et al. | Jan 2003 | A1 |
| 20030005453 | Rodriguez et al. | Jan 2003 | A1 |
| 20030005454 | Rodriguez et al. | Jan 2003 | A1 |
| 20030007516 | Abramov et al. | Jan 2003 | A1 |
| 20030018977 | McKenna | Jan 2003 | A1 |
| 20030020744 | Ellis et al. | Jan 2003 | A1 |
| 20030021412 | Candelore et al. | Jan 2003 | A1 |
| 20030025832 | Swart et al. | Feb 2003 | A1 |
| 20030028884 | Swart et al. | Feb 2003 | A1 |
| 20030030751 | Lupulescu et al. | Feb 2003 | A1 |
| 20030033199 | Coleman | Feb 2003 | A1 |
| 20030037068 | Thomas et al. | Feb 2003 | A1 |
| 20030046704 | Laksono et al. | Mar 2003 | A1 |
| 20030056217 | Brooks | Mar 2003 | A1 |
| 20030061619 | Giammaressi | Mar 2003 | A1 |
| 20030074565 | Wasilewski et al. | Apr 2003 | A1 |
| 20030077067 | Wu et al. | Apr 2003 | A1 |
| 20030088876 | Mao et al. | May 2003 | A1 |
| 20030093311 | Knowlson | May 2003 | A1 |
| 20030093784 | Dimitrova et al. | May 2003 | A1 |
| 20030093790 | Logan et al. | May 2003 | A1 |
| 20030093792 | Labeeb et al. | May 2003 | A1 |
| 20030095791 | Barton et al. | May 2003 | A1 |
| 20030101449 | Bentolila et al. | May 2003 | A1 |
| 20030101451 | Bentolila et al. | May 2003 | A1 |
| 20030101454 | Ozer et al. | May 2003 | A1 |
| 20030110499 | Knudson et al. | Jun 2003 | A1 |
| 20030110503 | Perkes | Jun 2003 | A1 |
| 20030115601 | Palazzo et al. | Jun 2003 | A1 |
| 20030115612 | Mao et al. | Jun 2003 | A1 |
| 20030118014 | Iyer et al. | Jun 2003 | A1 |
| 20030135513 | Quinn et al. | Jul 2003 | A1 |
| 20030135860 | Dureau | Jul 2003 | A1 |
| 20030139980 | Hamilton | Jul 2003 | A1 |
| 20030140351 | Hoarty et al. | Jul 2003 | A1 |
| 20030145323 | Hendricks et al. | Jul 2003 | A1 |
| 20030149975 | Eldering et al. | Aug 2003 | A1 |
| 20030149990 | Anttila et al. | Aug 2003 | A1 |
| 20030149993 | Son et al. | Aug 2003 | A1 |
| 20030161473 | Fransdonk | Aug 2003 | A1 |
| 20030172376 | Coffin | Sep 2003 | A1 |
| 20030179773 | Mocek et al. | Sep 2003 | A1 |
| 20030182261 | Patterson | Sep 2003 | A1 |
| 20030192060 | Levy | Oct 2003 | A1 |
| 20030195927 | Virine et al. | Oct 2003 | A1 |
| 20030214962 | Allaye-Chan et al. | Nov 2003 | A1 |
| 20030217365 | Caputo | Nov 2003 | A1 |
| 20030229681 | Levitan | Dec 2003 | A1 |
| 20030237090 | Boston et al. | Dec 2003 | A1 |
| 20040006625 | Saha et al. | Jan 2004 | A1 |
| 20040013136 | Mailhot et al. | Jan 2004 | A1 |
| 20040031053 | Lim et al. | Feb 2004 | A1 |
| 20040034873 | Zenoni | Feb 2004 | A1 |
| 20040045030 | Reynolds et al. | Mar 2004 | A1 |
| 20040047599 | Grzeczkowski | Mar 2004 | A1 |
| 20040060076 | Song | Mar 2004 | A1 |
| 20040073915 | Dureau | Apr 2004 | A1 |
| 20040078809 | Drazin | Apr 2004 | A1 |
| 20040103437 | Allegrezza et al. | May 2004 | A1 |
| 20040109672 | Kim et al. | Jun 2004 | A1 |
| 20040117817 | Kwon et al. | Jun 2004 | A1 |
| 20040123313 | Koo et al. | Jun 2004 | A1 |
| 20040133467 | Siler | Jul 2004 | A1 |
| 20040133907 | Rodriguez et al. | Jul 2004 | A1 |
| 20040133917 | Schilling | Jul 2004 | A1 |
| 20040138909 | Mayer | Jul 2004 | A1 |
| 20040146006 | Jackson | Jul 2004 | A1 |
| 20040148625 | Eldering et al. | Jul 2004 | A1 |
| 20040163109 | Kang et al. | Aug 2004 | A1 |
| 20040163111 | Palazzo et al. | Aug 2004 | A1 |
| 20040177383 | Martinolich et al. | Sep 2004 | A1 |
| 20040179605 | Lane | Sep 2004 | A1 |
| 20040181800 | Rakib et al. | Sep 2004 | A1 |
| 20040181811 | Rakib | Sep 2004 | A1 |
| 20040186774 | Lee | Sep 2004 | A1 |
| 20040187150 | Gonder et al. | Sep 2004 | A1 |
| 20040187159 | Gaydos et al. | Sep 2004 | A1 |
| 20040193648 | Lai et al. | Sep 2004 | A1 |
| 20040193704 | Smith | Sep 2004 | A1 |
| 20040194134 | Gunatilake et al. | Sep 2004 | A1 |
| 20040199789 | Shaw et al. | Oct 2004 | A1 |
| 20040210936 | Rao et al. | Oct 2004 | A1 |
| 20040261114 | Addington et al. | Dec 2004 | A1 |
| 20040261116 | McKeown et al. | Dec 2004 | A1 |
| 20040267965 | Vasudevan et al. | Dec 2004 | A1 |
| 20050022237 | Nomura | Jan 2005 | A1 |
| 20050027696 | Swaminathan et al. | Feb 2005 | A1 |
| 20050028208 | Ellis et al. | Feb 2005 | A1 |
| 20050034171 | Benya | Feb 2005 | A1 |
| 20050034173 | Hatanaka | Feb 2005 | A1 |
| 20050039205 | Riedl | Feb 2005 | A1 |
| 20050039206 | Opdycke | Feb 2005 | A1 |
| 20050041679 | Weinstein et al. | Feb 2005 | A1 |
| 20050047596 | Suzuki | Mar 2005 | A1 |
| 20050050070 | Sheldon | Mar 2005 | A1 |
| 20050050160 | Upendran et al. | Mar 2005 | A1 |
| 20050055685 | Maynard et al. | Mar 2005 | A1 |
| 20050058115 | Levin et al. | Mar 2005 | A1 |
| 20050060742 | Riedl et al. | Mar 2005 | A1 |
| 20050060745 | Riedl et al. | Mar 2005 | A1 |
| 20050060758 | Park | Mar 2005 | A1 |
| 20050071669 | Medvinsky | Mar 2005 | A1 |
| 20050071882 | Rodriguez et al. | Mar 2005 | A1 |
| 20050086691 | Dudkiewicz et al. | Apr 2005 | A1 |
| 20050097598 | Pedlow et al. | May 2005 | A1 |
| 20050105396 | Schybergson | May 2005 | A1 |
| 20050108529 | Juneau | May 2005 | A1 |
| 20050111844 | Compton et al. | May 2005 | A1 |
| 20050114141 | Grody | May 2005 | A1 |
| 20050114900 | Ladd et al. | May 2005 | A1 |
| 20050123001 | Craven et al. | Jun 2005 | A1 |
| 20050125528 | Burke et al. | Jun 2005 | A1 |
| 20050125832 | Jost et al. | Jun 2005 | A1 |
| 20050135476 | Gentric et al. | Jun 2005 | A1 |
| 20050144632 | Mears | Jun 2005 | A1 |
| 20050144635 | Boortz et al. | Jun 2005 | A1 |
| 20050160470 | Strauss | Jul 2005 | A1 |
| 20050168323 | Lenoir et al. | Aug 2005 | A1 |
| 20050198686 | Krause et al. | Sep 2005 | A1 |
| 20050210502 | Flickinger et al. | Sep 2005 | A1 |
| 20050223409 | Rautila et al. | Oct 2005 | A1 |
| 20050229209 | Hildebolt et al. | Oct 2005 | A1 |
| 20050234998 | Lesandrini et al. | Oct 2005 | A1 |
| 20050235318 | Grauch et al. | Oct 2005 | A1 |
| 20050262542 | Deweese et al. | Nov 2005 | A1 |
| 20050273819 | Knudson et al. | Dec 2005 | A1 |
| 20050276284 | Krause et al. | Dec 2005 | A1 |
| 20050289588 | Kinnear | Dec 2005 | A1 |
| 20050289618 | Hardin | Dec 2005 | A1 |
| 20050289619 | Melby | Dec 2005 | A1 |
| 20060010075 | Wolf | Jan 2006 | A1 |
| 20060019702 | Anttila et al. | Jan 2006 | A1 |
| 20060020984 | Ban et al. | Jan 2006 | A1 |
| 20060031883 | Ellis et al. | Feb 2006 | A1 |
| 20060036750 | Ladd et al. | Feb 2006 | A1 |
| 20060037060 | Simms et al. | Feb 2006 | A1 |
| 20060047957 | Helms et al. | Mar 2006 | A1 |
| 20060050784 | Lappalainen et al. | Mar 2006 | A1 |
| 20060059098 | Major et al. | Mar 2006 | A1 |
| 20060059342 | Medvinsky et al. | Mar 2006 | A1 |
| 20060062059 | Smith et al. | Mar 2006 | A1 |
| 20060064728 | Son et al. | Mar 2006 | A1 |
| 20060073843 | Aerrabotu et al. | Apr 2006 | A1 |
| 20060080408 | Istvan et al. | Apr 2006 | A1 |
| 20060084417 | Melpignano et al. | Apr 2006 | A1 |
| 20060085824 | Bruck et al. | Apr 2006 | A1 |
| 20060088063 | Hartung et al. | Apr 2006 | A1 |
| 20060130107 | Gonder et al. | Jun 2006 | A1 |
| 20060130113 | Carlucci et al. | Jun 2006 | A1 |
| 20060133398 | Choi et al. | Jun 2006 | A1 |
| 20060133644 | Wells et al. | Jun 2006 | A1 |
| 20060171390 | La | Aug 2006 | A1 |
| 20060171423 | Helms et al. | Aug 2006 | A1 |
| 20060190336 | Pisaris-Henderson et al. | Aug 2006 | A1 |
| 20060197828 | Zeng et al. | Sep 2006 | A1 |
| 20060218601 | Michel | Sep 2006 | A1 |
| 20060218604 | Riedl et al. | Sep 2006 | A1 |
| 20060236353 | Cheng et al. | Oct 2006 | A1 |
| 20060248553 | Mikkelson et al. | Nov 2006 | A1 |
| 20060248555 | Eldering | Nov 2006 | A1 |
| 20060253328 | Kohli et al. | Nov 2006 | A1 |
| 20060253584 | Dixon et al. | Nov 2006 | A1 |
| 20060253864 | Easty | Nov 2006 | A1 |
| 20060256376 | Hirooka | Nov 2006 | A1 |
| 20060259924 | Boortz et al. | Nov 2006 | A1 |
| 20060271946 | Woundy et al. | Nov 2006 | A1 |
| 20060277569 | Smith | Dec 2006 | A1 |
| 20060288374 | Ferris et al. | Dec 2006 | A1 |
| 20060291506 | Cain | Dec 2006 | A1 |
| 20060294259 | Matefi et al. | Dec 2006 | A1 |
| 20070022459 | Gaebel et al. | Jan 2007 | A1 |
| 20070028260 | Williams et al. | Feb 2007 | A1 |
| 20070029379 | Peyer | Feb 2007 | A1 |
| 20070033531 | Marsh | Feb 2007 | A1 |
| 20070047449 | Berger et al. | Mar 2007 | A1 |
| 20070053293 | McDonald et al. | Mar 2007 | A1 |
| 20070055985 | Schiller et al. | Mar 2007 | A1 |
| 20070061818 | Williams et al. | Mar 2007 | A1 |
| 20070074258 | Wood et al. | Mar 2007 | A1 |
| 20070076728 | Rieger et al. | Apr 2007 | A1 |
| 20070089127 | Flickinger et al. | Apr 2007 | A1 |
| 20070094691 | Gazdzinski | Apr 2007 | A1 |
| 20070094692 | De | Apr 2007 | A1 |
| 20070101157 | Faria | May 2007 | A1 |
| 20070101370 | Calderwood | May 2007 | A1 |
| 20070113243 | Brey | May 2007 | A1 |
| 20070115389 | McCarthy et al. | May 2007 | A1 |
| 20070118852 | Calderwood | May 2007 | A1 |
| 20070121569 | Fukui et al. | May 2007 | A1 |
| 20070121678 | Brooks et al. | May 2007 | A1 |
| 20070124781 | Casey et al. | May 2007 | A1 |
| 20070130581 | Del et al. | Jun 2007 | A1 |
| 20070150919 | Morishita | Jun 2007 | A1 |
| 20070153820 | Gould | Jul 2007 | A1 |
| 20070156539 | Yates | Jul 2007 | A1 |
| 20070157234 | Walker | Jul 2007 | A1 |
| 20070157242 | Cordray et al. | Jul 2007 | A1 |
| 20070162927 | Ramaswamy et al. | Jul 2007 | A1 |
| 20070192794 | Curtis et al. | Aug 2007 | A1 |
| 20070204300 | Markley et al. | Aug 2007 | A1 |
| 20070204310 | Hua et al. | Aug 2007 | A1 |
| 20070204311 | Hasek et al. | Aug 2007 | A1 |
| 20070204314 | Hasek et al. | Aug 2007 | A1 |
| 20070217436 | Markley et al. | Sep 2007 | A1 |
| 20070233857 | Cheng et al. | Oct 2007 | A1 |
| 20070241176 | Epstein et al. | Oct 2007 | A1 |
| 20070244760 | Bodnar et al. | Oct 2007 | A1 |
| 20070250872 | Dua | Oct 2007 | A1 |
| 20070250880 | Hainline | Oct 2007 | A1 |
| 20070263653 | Hassan et al. | Nov 2007 | A1 |
| 20070271386 | Kurihara et al. | Nov 2007 | A1 |
| 20070274400 | Murai et al. | Nov 2007 | A1 |
| 20070274537 | Srinivasan | Nov 2007 | A1 |
| 20070276925 | La et al. | Nov 2007 | A1 |
| 20070276926 | Lajoie et al. | Nov 2007 | A1 |
| 20080016526 | Asmussen | Jan 2008 | A1 |
| 20080022012 | Wang | Jan 2008 | A1 |
| 20080052157 | Kadambi et al. | Feb 2008 | A1 |
| 20080066112 | Bailey et al. | Mar 2008 | A1 |
| 20080092181 | Britt | Apr 2008 | A1 |
| 20080098212 | Helms et al. | Apr 2008 | A1 |
| 20080098446 | Seckin et al. | Apr 2008 | A1 |
| 20080101460 | Rodriguez | May 2008 | A1 |
| 20080103903 | Flake et al. | May 2008 | A1 |
| 20080109823 | Whitfield et al. | May 2008 | A1 |
| 20080109857 | Goodwill et al. | May 2008 | A1 |
| 20080115166 | Bhogal et al. | May 2008 | A1 |
| 20080115169 | Ellis et al. | May 2008 | A1 |
| 20080124056 | Concotelli et al. | May 2008 | A1 |
| 20080134156 | Osminer et al. | Jun 2008 | A1 |
| 20080134165 | Anderson et al. | Jun 2008 | A1 |
| 20080141317 | Radloff et al. | Jun 2008 | A1 |
| 20080147497 | Tischer | Jun 2008 | A1 |
| 20080152116 | Sylvain | Jun 2008 | A1 |
| 20080152316 | Sylvain | Jun 2008 | A1 |
| 20080155059 | Hardin et al. | Jun 2008 | A1 |
| 20080155588 | Roberts et al. | Jun 2008 | A1 |
| 20080163305 | Johnson et al. | Jul 2008 | A1 |
| 20080177998 | Apsangi et al. | Jul 2008 | A1 |
| 20080192820 | Brooks et al. | Aug 2008 | A1 |
| 20080201748 | Hasek et al. | Aug 2008 | A1 |
| 20080229354 | Morris et al. | Sep 2008 | A1 |
| 20080235746 | Peters et al. | Sep 2008 | A1 |
| 20080244667 | Osborne | Oct 2008 | A1 |
| 20080263578 | Bayer et al. | Oct 2008 | A1 |
| 20080271068 | Ou et al. | Oct 2008 | A1 |
| 20080273591 | Brooks et al. | Nov 2008 | A1 |
| 20080313671 | Batrouny et al. | Dec 2008 | A1 |
| 20080313691 | Cholas et al. | Dec 2008 | A1 |
| 20090025027 | Craner | Jan 2009 | A1 |
| 20090028182 | Brooks et al. | Jan 2009 | A1 |
| 20090030802 | Plotnick et al. | Jan 2009 | A1 |
| 20090132346 | Duggal et al. | May 2009 | A1 |
| 20090187939 | Lajoie | Jul 2009 | A1 |
| 20090210899 | Lawrence-Apfelbaum et al. | Aug 2009 | A1 |
| 20090210912 | Cholas et al. | Aug 2009 | A1 |
| 20090216761 | Raichelgauz, II et al. | Aug 2009 | A1 |
| 20090254971 | Herz et al. | Oct 2009 | A1 |
| 20090319379 | Joao | Dec 2009 | A1 |
| 20090320059 | Bolyukh | Dec 2009 | A1 |
| 20100057560 | Skudlark et al. | Mar 2010 | A1 |
| 20100058406 | Xu et al. | Mar 2010 | A1 |
| 20100157928 | Spinar et al. | Jun 2010 | A1 |
| 20100161492 | Harvey et al. | Jun 2010 | A1 |
| 20100175084 | Ellis et al. | Jul 2010 | A1 |
| 20100223491 | Ladd et al. | Sep 2010 | A1 |
| 20100251304 | Donoghue et al. | Sep 2010 | A1 |
| 20100251305 | Kimble et al. | Sep 2010 | A1 |
| 20100262488 | Harrison et al. | Oct 2010 | A1 |
| 20100269131 | Newberry et al. | Oct 2010 | A1 |
| 20100313225 | Cholas et al. | Dec 2010 | A1 |
| 20110015989 | Tidwell et al. | Jan 2011 | A1 |
| 20110016479 | Tidwell et al. | Jan 2011 | A1 |
| 20110016482 | Tidwell et al. | Jan 2011 | A1 |
| 20110093900 | Patel et al. | Apr 2011 | A1 |
| 20110103374 | Lajoie et al. | May 2011 | A1 |
| 20110107364 | Lajoie et al. | May 2011 | A1 |
| 20110107379 | Lajoie et al. | May 2011 | A1 |
| 20110119703 | Schlack et al. | May 2011 | A1 |
| 20110178880 | Karaoguz et al. | Jul 2011 | A1 |
| 20110197224 | Meijer | Aug 2011 | A1 |
| 20110231265 | Brown et al. | Sep 2011 | A1 |
| 20110307339 | Russell et al. | Dec 2011 | A1 |
| 20110317977 | Harris | Dec 2011 | A1 |
| 20120011269 | Krikorian | Jan 2012 | A1 |
| 20120023522 | Anderson et al. | Jan 2012 | A1 |
| 20120042331 | Wolf, Sr. | Feb 2012 | A1 |
| 20120084813 | Dmitriev et al. | Apr 2012 | A1 |
| 20120110620 | Kilar et al. | May 2012 | A1 |
| 20120159539 | Berberet et al. | Jun 2012 | A1 |
| 20120224834 | Chen et al. | Sep 2012 | A1 |
| 20120278841 | Hasek et al. | Nov 2012 | A1 |
| 20120310762 | Robbin | Dec 2012 | A1 |
| 20130133009 | Bhogal et al. | May 2013 | A1 |
| 20130227608 | Evans et al. | Aug 2013 | A1 |
| 20130290556 | Giladi | Oct 2013 | A1 |
| 20130325870 | Rouse et al. | Dec 2013 | A1 |
| 20130330063 | Bonovich et al. | Dec 2013 | A1 |
| 20140020017 | Stern et al. | Jan 2014 | A1 |
| 20140129352 | Ringdahl | May 2014 | A1 |
| 20140157313 | Shartzer et al. | Jun 2014 | A1 |
| 20140164760 | Hybertson et al. | Jun 2014 | A1 |
| 20140208349 | Nair et al. | Jul 2014 | A1 |
| 20140282777 | Gonder et al. | Sep 2014 | A1 |
| 20160127440 | Gordon | May 2016 | A1 |
| 20170164378 | Gunasekara et al. | Jun 2017 | A1 |
| 20170164416 | Yeddala et al. | Jun 2017 | A1 |
| 20180014041 | Chen et al. | Jan 2018 | A1 |
| Number | Date | Country |
|---|---|---|
| 2643806 | Jun 2013 | CA |
| WO-0110125 | Feb 2001 | WO |
| WO-0191474 | Nov 2001 | WO |
| WO-2004008693 | Jan 2004 | WO |
| WO-2007136399 | Nov 2007 | WO |
| WO-2008016786 | Feb 2008 | WO |
| Entry |
|---|
| Cisco Intelligent Network Architecture for Digital Video-SCTE Cable-Tec Expo 2004 information page, Orange County Convention Center, Jun. 2004, 24 pages. |
| Deering S., et al., “Internet Protocol, Version 6 (IPv6) Specification”, Internet Engineering Task Force (IETF), Dec. 1998, 39 pages. |
| “DOCSIS 3.0 Management Features Differences Technical Report” CM-TR-MGMT V3.0-DIFF-V01-071228. |
| “DOCSIS 3.0 OSSI Configuration Management Technical Report” CM-TR-OSSIv3.0-CM-VO1-080926. |
| Griffith D.W., et al., “Resource Planning and Bandwidth Allocation in Hybrid Fiber-Coax Residential Networks,” National Institute of Standards and Technology (NIST), Oct. 1, 2005,10 pages. |
| “Internet Protocol, DARPA Internet Program, Protocol Specification”, IETF RCF 791, Sep. 1981. |
| Kanouff, Communications Technology: Next-Generation Bandwidth Management—The Evolution of the Anything-to-Anywhere Network, 8 pages, Apr. 1, 2004. |
| Motorola DOCSIS Cable Module DCM 2000 specifications, 4 pages, copyright 2001. |
| Open Cable Specification entitled “Enhanced TV Binary Interchange Format 1 0” OC-SP-ETV-131F1.0-106-110128 dated Jan. 28, 2011, 408 pages. |
| OpenVision Session Resource Manager—Open Standards-Based Solution Optimizes Network Resources by Dynamically Assigning Bandwidth in the Delivery of Digital Services article, 2 pages, (copyright 2006), (http://www.imake.com/hopenvision). |
| OpenVision Session Resource Manager features and information, 2 pages, (http://www.imake.com/hopenvision). |
| Tandberg Television specification entitled “AdPoint.RTM. Advanced Advertising Platform” dated Mar. 2008, 2 pages. |
| Number | Date | Country | |
|---|---|---|---|
| 20210006849 A1 | Jan 2021 | US |
| Number | Date | Country | |
|---|---|---|---|
| 61670082 | Jul 2012 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 15853468 | Dec 2017 | US |
| Child | 16933701 | US | |
| Parent | 13676012 | Nov 2012 | US |
| Child | 15853468 | US |
