Carousel proxy

Abstract

A broadcaster generates programming content and a carousel containing chunks of data defining one or more interactive applications. The programming content and carousel are received by a local gateway which distributes the carousel and content to receivers at end-users via a distribution network. A carousel proxy in the local gateway receives the inbound carousel from the broadcaster and modifies it to produce an outbound carousel suited for the distribution network, receivers, and/or end-users. The modifications performed by the carousel proxy include filtering chunks and/or data within the chunks from the inbound carousel and transforming data within the chunks to customize the interactive applications for the distribution network, receivers, and/or end-users. The carousel proxy also caches chunks in a cache of a local data store. The carousel proxy uses the cached chunks to send the outbound carousel at a rate optimized for the bandwidth available on the distribution network.

Description

BACKGROUND OF THE INVENTION

[0002] 1. Field of the Invention

[0003] This invention pertains in general to interactive television systems, and more particularly, to management of carousel data in such systems.

[0004] 2. Description of the Related Art

[0005] Interactive television content is transmitted nationally by television networks. This content contains enhancements to existing television programming, usually consisting of graphical overlays on the screen, and dedicated channels consisting entirely of full-screen graphical interactive television services, referred to as “virtual channels.” Examples of enhancements to existing television programming are an interactive television service to display sports scores and statistics during sports programming and an interactive television service to display biographies and trivia regarding the host and guests of a talk or variety show. Examples of virtual channels are a full-screen compact disc (CD) purchasing interactive television service and a full-screen weather information interactive television service.

[0006] This interactive television content is typically broadcast nationally along with the video and audio transmission. The content is received and re-transmitted at certain sites including uplink facilities for satellite television providers, and cable head-ends. These receipt and re-transmission sites are referred to as “local gateways.”

[0007] The interactive television data that passes through a local gateway travels over a distribution network, such as a cable or satellite television network, to a television set-top box or other type of receiver. Different distribution networks often have different capabilities. E.g., a digital distribution system can support a higher data bandwidth than an analog system. Moreover, there are many different types of receivers, and each type typically supports a different set of interactive television functionalities. Due to these many potential variables, the nationally-distributed interactive television data is often not optimized for a given distribution system and/or set of receivers. In addition, the content is often not localized for a particular region.

[0008] Therefore, there is a need in the art for a way to tailor the interactive television data to the capabilities of given distribution networks and/or receivers, and for a way to localize the data.

BRIEF SUMMARY OF THE INVENTION

[0009] The above needs are met by a carousel proxy at the local gateway that modifies the carousel to tailor it to the distribution network, end-users, and/or receivers. In one embodiment, a broadcaster generates programming content and a carousel containing chunks of data defining one or more interactive applications. The broadcaster distributes the content and carousel to a local gateway. The local gateway distributes the programming content and a modified version of the carousel to end-users via a distribution network. The end-users use receivers to access the programming content and execute the interactive applications defined by the carousel.

[0010] A carousel proxy at the local gateway receives the inbound carousel from the broadcaster and modifies it to produce an outbound carousel suited to the distribution network, end-users, and or receivers. A filtering module within the carousel proxy filters chunks and/or data within the chunks from the inbound carousel in order to customize the interactive application. In addition, a transformation module selectively transforms chunks and/or content within the chunks. The transformations include, for example, inserting localized or customized information into the interactive application, formatting data within the applications for the receivers, etc. In one embodiment, a local data store in communication with the carousel proxy stores instructions and data utilized by the carousel proxy to perform filtering, transforming, and/or other functions.

[0011] The carousel proxy includes a cache management module that manages a cache in the local data store. The cache holds chunks from the carousel. The cache management module enforces a caching policy derived from data within the local data store and/or received from the chunks in the inbound carousel. An outbound carousel control module uses the cached chunks to send chunks in the outbound carousel at a rate (i.e., frequency and/or period) optimized for the distribution network, end-users, and/or receivers. Thus, the carousel proxy sends the end-users interactive applications tailored to their respective environments.

BRIEF DESCRIPTION OF THE DRAWINGS

[0012] FIG. 1 is a high-level block diagram illustrating an interactive application broadcasting environment according to an embodiment of the present invention;

[0013] FIG. 2 is a block diagram illustrating a carousel and a chunk within the carousel; and

[0014] FIG. 3 is a block diagram illustrating the carousel proxy and local data store.

[0015] The figures depict an embodiment of the present invention for purposes of illustration only. One skilled in the art will readily recognize from the following description that alternative embodiments of the structures and methods illustrated herein may be employed without departing from the principles of the invention described herein.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0016] FIG. 1 is a high-level block diagram illustrating an interactive application broadcasting environment 100 according to an embodiment of the present invention. A broadcaster 102 broadcasts programming content and interactive applications via a transmission medium, such as the illustrated satellite 104 uplink, to a local gateway 106. The local gateway 106 transmits the programming content and interactive applications via a distribution network 108 to one or more end-users 110, another local gateway, and/or other locations. Receivers 111 at the end-users 110 execute the interactive applications and provide the end-users with an interactive media experience.

[0017] The broadcaster 102 typically utilizes a production facility 112 to produce the programming content. As used herein, “programming content” refers to audio and/or video content, such as television programs, radio programs, and/or other types of multimedia or single media content. Depending upon the embodiment, the broadcaster 102 is a television station, television network, a radio station, or any other entity that provides programming content. For purposes of clarity, this description assumes that the broadcaster 102 is a television station (or network) and the programming content is a television program.

[0018] The broadcaster 102 also provides interactive applications. In one embodiment, the broadcaster 102 generates the interactive applications itself. In another embodiment, the interactive applications are provided by another entity operating in concert with the broadcaster 102. One or more interactive application are often associated with a particular piece of programming content. For example, a television game show can have an associated interactive application that allows a television viewer to “play along” with the show. Similarly, a music video can have an associated interactive application that allows the viewer to purchase the music featured in the video. However, the interactive applications are not necessarily associated with a particular program. For example, an interactive application can provide general information such as weather and traffic reports.

[0019] The interactive application typically appears as a graphical display overlaying a television program displayed on a normal television channel. In addition, an interactive application can define a virtual channel that displays graphical information to a television viewer when “tuned” to that channel. For example, in interactive application can provide a virtual channel that provides movie start times at cinemas near the end-users 110.

[0020] In one embodiment, the broadcaster 102 broadcasts the interactive applications in-band with the programming content. An interactive application is “in-band” if it is in the same data stream as the programming content. In an embodiment where the broadcaster 102 provides an analog television output signal, the broadcaster typically encodes in-band interactive applications within the vertical blanking interval (VBI). In an embodiment where the broadcaster 102 provides a digital output signal, the broadcaster typically multiplexes in-band interactive applications within an MPEG-format signal. In another embodiment, the broadcaster 102 broadcasts the interactive applications out-of-band from the programming content. An interactive application is “out-of-band” if it is in a data stream not associated with the stream carrying the programming content. Examples of out-of-band transmissions include those utilizing a separate channel in a satellite broadcast, a TCP/IP network connection between the broadcaster 102 and the local gateway 106, and a dedicated data channel between the local gateway 106 and the receiver 111.

[0021] An interactive application is formed from one or more “chunks” of data that collectively define the application. The broadcaster 112 utilizes a carousel generator 116 to associate the chunks with the programming content. In one embodiment, the carousel generator 116 is the Wink Broadcast Server available from Wink Communications of San Francisco, Calif. In another embodiment, the carousel generator 116 is the OpenTV Streamer available from OpenTV Corp. of San Francisco, Calif.

[0022] The broadcaster 102 provides the carousel generator 116 with the chunks for one or more interactive applications and meta-data describing the chunks, the applications defined by the chunks, information about how to distribute the chunks/applications with the programming content, etc. The carousel generator 116 encodes the chunks with the programming content as specified by the meta-data. The carousel generator 116 has its name because it usually sends the chunks in a repeating cycle, so that a television receiver tuned to a given channel will eventually receive all of the chunks in the application. The cycle of chunks is referred to as “carousel data” 200 or simply as the “carousel.” The carousel generator 116 may also include the meta-data provided by the broadcaster 102 in the carousel 200.

[0023] The broadcaster 102 sends the programming content and the carousel 200 to one or more local gateways 106. In the embodiment illustrated in FIG. 1, the broadcaster 102 uses a satellite uplink 118 to send the content and carousel 200 to a satellite 104 which then relays the data to a satellite downlink 120 at the local gateway 106. In one embodiment, the broadcaster 112 sends the carousel 200 to the local gateway 106 via an the out-of-band communication path 114. Other embodiments use different communication paths and associated hardware to transmit the content and carousel 200. Often, bandwidth over the communication path from the broadcaster 102 to the local gateway 106 is expensive and/or rare. Therefore, the broadcaster 102 often seeks to minimize the bandwidth required to transmit the carousel 200.

[0024] The local gateway 106 is a site that receives the programming content and carousel 200 and transmits both to one or more other locations, typically to end-users 110 coupled to the local gateway by a distribution network 108. In the illustrated embodiment, the local gateway 106 includes a cable television network head-end 122. The head-end is operated by a multiple system operator (“MSO,” e.g., a cable television service provider) that distributes the content and carousel 200 to the end-users 110 via a cable distribution network 108. In another embodiment, the local gateway 106 is operated by a satellite television service provider and the distribution network 108, in turn, is a satellite-based network. In other embodiments, the local gateway 106 and/or distribution networks 108 are different than the ones described herein.

[0025] The local gateway 106 provides the inbound carousel 200 (whether received in-band or out-of-band) to a carousel proxy 124. The carousel proxy 124 alters the inbound carousel 200 in order to tailor it for the distribution network 108, receivers 111, and/or end-users 110. In order to perform this function, the carousel proxy 124 may utilize local data held in a local data store 126.

[0026] The local gateway 106 distributes the programming content and the outbound carousel 200 (i.e., the carousel generated by the carousel proxy 124) on the distribution network 108. As described above, this network 108 is an analog cable network, a digital cable network, a satellite-based wireless network, or any other network capable of transmitting the content and carousel 200 to the end-users. In the cable television embodiment, the distribution network 108 typically distributes the content and carousel 200 to end-users 110 within a localized geographic region. However, other networks, such as satellite-based networks, might serve geographically-diverse end-users 110.

[0027] The bandwidth for carrying the carousel 200 on the distribution network 108 is likely to be different than, and often exceeds, the bandwidth required to deliver the carousel 200 produced by the carousel generator 116 at the broadcaster 102. An analog distribution network 108 that sends the carousel 200 in the VBI supports a bandwidth of approximately 15 kilobits/second. The available bandwidth for an interactive application on a digital distribution network depends on how the total bandwidth is allocated, and can vary from approximately 15 kilobits/second to one megabit/second.

[0028] The end-users 110 have receivers 111 that receive the programming content and carousel 200 and execute the interactive applications. In one embodiment, the receiver 111 is a device for tuning and/or decoding the signals on the distribution network 108, executing the interactive applications, and displaying the programming content and/or interactive applications on a suitable display device such as a television. Such devices are often referred to as “set-top boxes” (STBs) because they often reside on top of television sets. However, the term “receiver” includes any device capable of executing the interactive application, and includes STBs for receiving cable or satellite-based signals, television sets, home computers, digital video recorders, radio receivers, etc.

[0029] Different types of receivers 111 provide different interactive application functionality. For example, advanced receivers 111 provide more powerful processing capabilities than less advanced receivers. Likewise, certain receivers 111 generate more advanced (e.g., higher resolution) graphical displays than other receivers.

[0030] FIG. 2 is a block diagram illustrating a carousel 200 and a chunk 202 within the carousel. The carousel 200 includes multiple chunks 202 that define one or more interactive applications. In one embodiment, each application in the carousel 200 includes one chunk 204 referred to as the “directory chunk” that holds data describing the characteristics of the application. These data indicate the number of chunks in the application, the types of data held in the chunks, etc. The other chunks hold the application data for the chunk. Depending upon the embodiment, the size of a chunk in the carousel 200 can range from approximately 10 bytes to 65 kilobytes or larger.

[0031] FIG. 2 also illustrates an expanded view of a typical (non-directory) chunk 202 of an interactive application according to one embodiment. The chunk 202 includes a chunk identification (ID) 210 that uniquely identifies the chunk. The chunk 202 also includes an application ID 212 that uniquely identifies the interactive application to which the chunk belongs.

[0032] Meta-data 214 within the chunk 202 describes characteristics of the chunk, the application data 216 within the chunk, and/or the interactive application. The meta-data 214 also describes how the carousel proxy 124 should process the chunk 202. For example, the meta-data can describe whether the carousel proxy 124 should filter the chunk from the carousel 200. The meta-data 214 can also describe whether the carousel proxy 124 should transform the application data 216 within the chunk 202 before sending it on the distribution network 108. The meta-data 214 can further describe the rate at which the chunk 202 should be broadcast in the carousel 200 and whether and/or when the carousel proxy 124 should cache the chunk. Other embodiments of chunks hold meta-data described different and/or additional characteristics of the chunks.

[0033] The application data 216 include executable code and data for the interactive application. Depending upon the chunk, the data 216 might include computer-readable instructions, graphical images stored in compressed or uncompressed formats, text strings, etc. The chunk 202 can include additional and/or different data than described herein.

[0034] FIG. 3 is a block diagram illustrating a more detailed view of the carousel proxy 124 and local data store 126. The carousel proxy 124 has an input 310 for receiving the inbound carousel 200 from the broadcaster 102 and an output 312 for outputting the outbound carousel. The outbound carousel 200 is combined with the programming content and delivered to the end-users 110 via the distribution network 108. The carousel proxy 124 also has a bidirectional communications link 314 with the local data store 126.

[0035] In one embodiment, the carousel proxy 124 includes a conventional computer system having hardware and/or software for providing the functionality described herein. As is known in the art, a conventional computer system includes a processor, memory, storage device, etc. In one embodiment, the processor is a general-purpose processor such as an INTEL x86 compatible-CPU. The memory is, for example, firmware, read-only memory (ROM), non-volatile random access memory (NVRAM), and/or RAM, and holds instructions and data used by the processor. The storage device is a hard disk drive and/or another device capable of storing data, such as a compact disk (CD), DVD, or solid-state memory device. In one embodiment, the storage device holds the local data store 126. In another embodiment, the local data store 126 is external to the computer system and connected via a high-speed interface.

[0036] The computer system acting as the carousel proxy 124 is adapted to execute computer program modules. As used herein, the term “module” refers to computer program logic for providing the specified functionality. A module can be implemented in hardware, firmware, and/or software. In one embodiment, the modules are stored on the storage device. When utilized, the modules are loaded into the memory and executed by the processor.

[0037] In one embodiment, the carousel proxy 124 includes a filtering module 316 for filtering chunks 202 out of the inbound carousel 200 and/or application data 216 from the chunks. Some receivers 111 at the end-users 110 have limited memory. Similarly, some distribution networks 108 have limited bandwidth. If these constraints are present, one embodiment of the carousel proxy 124 utilizes the filtering module 316 to reduce the resources required to transmit and/or execute the interactive application.

[0038] In one embodiment, the filtering module 316 utilizes instructions and/or data stored within a local template module 318 in the local data store 126. The local template module 318 specifies which chunks 202 and/or application data 216 the filtering module 316 should remove from the inbound carousel 200 in order to optimize the outbound carousel for the distribution network 108 and/or receivers 111. The local template module 318 can specify specific filtering rules for specific interactive applications, and can also specify filtering rules that the filtering module 316 applies to all applications/chunks. In one example of the latter rules, the local template module 318 specifies that the filtering module 316 remove all images larger than 50 kilobytes from the chunks 202 in the inbound carousel 200.

[0039] In one embodiment, the filtering module 316 filters the inbound carousel 200 in response to instructions and/or data stored in a local profile module 320 in the local data store 126. The local profile module 320 stores one or more profiles describing the end-users 110 and/or the receivers 111 on the distribution network 108. For example, the local profile module 320 can store geographic, demographic, and/or psychographic data about the end-users. Such data describe the end-users' geographic location(s), relative wealth, political leanings, level of education, primary language(s), average age, etc. The local profile module 320 can also store data describing the television channels available to the end-users 110, the available bandwidth on the distribution network 108, the capabilities of the receivers 111 at the end-users, etc. In one embodiment, the local profile module 320 stores data indicating one or more groups to which the carousel proxy 124 belongs.

[0040] Meta-data 214 within the chunks 202 describes the one or more local profiles for which the chunks, interactive applications, and/or application data 216 are applicable. The filtering module 316 analyzes this meta-data 216 in view of the data in the local profile 320 and filters out chunks, interactive applications, and/or application data that are inapplicable to the local profile. In another embodiment, the filtering module 316 analyzes the application data 216, rather than the meta-data, to determine whether to filter the chunks 202, interactive applications, and/or application data out of the carousel 200. For example, assume there are three groups to which the carousel proxy 124 can potentially belong, and the local profile module 320 indicates that the carousel proxy belongs to the first group. The filtering module 316 analyzes the meta-data and/or application data 216 in the chunks to determine whether the chunks 202, interactive applications, and/or application data are applicable to group one and filters inapplicable data from the inbound carousel 200.

[0041] In one embodiment, the carousel proxy 124 includes a transformation module 322 for transforming application data 216 and meta-data 214 within the chunks 202. A chunk's meta-data 214 and/or application data 216 can contain instructions that the transformation module 124 executes to modify the incoming carousel application data 216. Similarly, a chunk's meta-data 214 and/or application data 216 can include special symbols or fields that the transformation module 322 “knows” how to modify. The modification can make use of data stored within the carousel proxy 124, chunks 202, local template 318, local profile 320, elsewhere within the local data store 126, and/or from a remote data store.

[0042] The transformation module 322 is data-driven, and can perform both simple and complex transformations of data 216 and meta-data 214. For example, the chunk 202 can utilize a syntax that identifies instructions and/or variable names with control characters and/or strings such as “%%.” The transformation module 322 identifies and executes instructions and/or replaces the variable names with the appropriate data. Thus, the transformation module 322 can transform the string “Call your nearest ACME dealer at %%print(ACME_NUMBER)%%” into “Call your nearest ACME dealer at 555-1234.” The transformation module 322 uses similar techniques to replace other data elements. For example, the module 322 can replace national news with local news, and/or replace national logos with local logos.

[0043] In one embodiment, the transformation module 322 transforms a partial application in the inbound carousel 200 into a complete application by adding chunks 202 and/or application data 216 to the carousel as it passes through the carousel proxy 124. For example, the broadcaster 102 can send chunks 202 containing only sports scores and meta-data. Upon receipt of these chunks 202, the transformation module 322 uses the meta-data to identify an interactive application for displaying the sports scores stored in the local data store 126 (or elsewhere). The transformation module 322 creates an outbound carousel 200 integrating the sports scores and interactive application so that the scores display at the end-users 110.

[0044] Moreover, the transformation module 322 also transforms representations of data within the chunks 202. One embodiment of the transformation module 322 converts images between different representations, such as between compressed formats (e.g., JPEG) and uncompressed formats (e.g., bitmap). In another example, the transformation module 322 converts among markup languages, such as converting an hypertext markup language (HTML) page into the H20 format utilized by the OpenTV Corp. interactive television system.

[0045] In one embodiment, the carousel proxy 124 includes a cache management module 324 for managing a chunk cache 326 in the local data store 126. The chunk cache 326 caches chunks 202 received in the inbound carousel 200 and enforces a caching policy that optimizes the operation of the cache 326 and carousel proxy 124. In one embodiment, the cache 326 caches data at the chunk 202, interactive application, and/or global levels. That is, the cache management module 324 can apply different caching policies to specific chunks 202 and/or specific applications, or the module can apply the same policy to all chunks and/or applications.

[0046] In one embodiment, meta-data 214 within the chunks 202 indicate whether the cache management module 324 should cache particular chunks and/or applications. For example, if a chunk 202 will be sent on the carousel 200 only a few times, it is usually not optimal to cache the chunk. Therefore, a tag in the chunk's meta-data 214 can designate the chunk as non-cacheable. The cache management module 324 recognizes the tag and does not cache the chunk. Similarly, meta-data 214 in the chunks 202 of an interactive application can specify optimal caching rules for the application. For example, if the interactive application displays sports scores, the application can specify that the cache management module 324 cache the chunks 202 comprising the application but not cache the chunks containing sports scores because the sports scores will be updated frequently by new chunks.

[0047] The cache management module 324 sets cache expiration policies at the chunk, application, and/or global levels based on data stored in the carousel proxy 124, local data store 126, and or meta-data 214 contained in the chunks 202. The expiration policies specify whether or when the cached chunks 202 and/or applications expire (i.e., are deleted from the cache 326). For example, the chunks 202 and/or applications can be set to never expire, expire upon the occurrence of an event (e.g., the arrival of an updated chunk in the inbound carousel 200), expire after a certain time period, etc.

[0048] An outbound carousel control module 328 within the carousel proxy 124 controls the rate (i.e., order and frequency of chunks 202) of the outbound carousel 200. As described above, the inbound carousel 200 often utilizes less than the full bandwidth available on the distribution network 108. The outbound carousel control module 328 uses the cached chunks 202 to decouple the inbound carousel rate from the outbound rate, thereby allowing the outbound carousel 200 to take advantage of the larger bandwidth available on the distribution network 108. The outbound carousel control module 328 inserts chunks 202 in the outbound carousel 200 at a rate that optimizes the carousel delivery to the end-users 110.

[0049] In one embodiment, a constraints module 330 in the local data store 126 specifies constraints that the outbound carousel control module 328 utilizes to generate the outbound carousel 200. For example, the constraints module 330 can specify that the outbound carousel control module 328 send out new chunks 202 (i.e., chunks in the inbound carousel 200 that have not been previously sent in the outbound carousel) as soon as possible and/or that it send chunks at the maximum rate that will not overload the receivers 111 at the end-users 110.

[0050] In one embodiment, the outbound carousel control module 328 utilizes meta-data 214 stored in the chunks 202 to determine the outbound carousel 200. The meta-data 214 can include constraints specifying how and/or when the outbound carousel control module 328 should send the chunks 202. The meta-data 214 can also include hints that specify non-mandatory recommendations about how and/or when the outbound carousel control module 328 should send the chunks 202. The constraints and hints can specify, for example, whether the frequency of the chunk 202 can or should be changed, the frequency at which the chunk should be sent, time constraints for sending two or more chunks (e.g., do not send two given chunks more than N seconds apart, send N given chunks together), the number of times that a chunk should be sent, specific orders in which the chunks should be sent, etc.

[0051] In one embodiment, the outbound carousel control module 328 sends chunks 202 in the outbound carousel 200 at rates that approximate the inbound rates of the chunks. The outbound carousel control module 328 measures the frequency of a particular chunk 202 in the inbound carousel 200 and assigns that chunk an equivalent frequency in the outbound carousel. For example, if the chunk 202 appears once every 10 seconds in the inbound carousel, and the bandwidth of the outbound carousel is twice the bandwidth of the inbound carousel, the outbound carousel control module 328 broadcasts the chunk in the outbound carousel once every five seconds.

[0052] The outbound carousel control module 328 can also send chunks 202 in the outbound carousel 200 at rates different than the inbound carousel rates. For example, assume that a first chunk (or interactive application) appears every two seconds in the inbound carousel 200 and a second chunk appears every 10 seconds. If the outbound carousel 200 bandwidth is twice that of the inbound carousel, the outbound carousel control module 328 can send the first chunk every second and the second chunk every five seconds. Assume for this example that it is desirable to reallocate the available bandwidth to give the second chunk a higher priority. The outbound carousel control module 328 fulfills this desire by keeping the frequency of the first chunk at once every two seconds and increasing the frequency of the second chunk to once every three seconds.

[0053] The above description is included to illustrate the operation of the preferred embodiments and is not meant to limit the scope of the invention. The scope of the invention is to be limited only by the following claims. From the above discussion, many variations will be apparent to one skilled in the relevant art that would yet be encompassed by the spirit and scope of the invention.

Claims

1. A gateway for receiving programming content and for receiving an inbound carousel defining an interactive application, the gateway comprising: a local data store storing data describing modifications to perform on the inbound carousel to optimize the inbound carousel for transmission on a distribution network; and a carousel proxy in communication with the local data store and receiving the inbound carousel, the carousel proxy adapted to modify the inbound carousel responsive to data stored in the local data store to produce an outbound carousel optimized for transmission on the distribution network.

2. The gateway of claim 1, wherein the inbound carousel comprises a plurality of chunks defining the interactive application, wherein: the local data store comprises a cache for caching ones of the chunks defining the interactive application; and the carousel proxy comprises a cache management module adapted to specify ones of the chunks for caching in the cache.

3. The gateway of claim 2, wherein the chunks defining the interactive application include meta-data describing a caching policy for the chunks and wherein the cache management module is adapted to determine the caching policy from the meta-data and apply the caching policy to cache selected ones of the chunks.

4. The gateway of claim 1, wherein the carousel proxy comprises: a filtering module adapted to selectively remove data from the inbound carousel to produce the outbound carousel.

5. The gateway of claim 4, wherein: the local data store comprises a module specifying filtering rules for the inbound carousel; and the filtering module is adapted to selectively remove data from the inbound carousel responsive to the filtering rules.

6. The gateway of claim 5, wherein the module specifying filtering rules specifies characteristics of receivers and/or end-users receiving the outbound carousel via the distribution network and wherein the filtering module is adapted to remove from the inbound carousel data not meeting the specified characteristics.

7. The gateway of claim 1, wherein the carousel proxy comprises: a transformation module adapted to selectively transform data in the inbound carousel to produce the outbound carousel.

8. The gateway of claim 1, wherein the inbound carousel comprises a plurality of chunks defining the interactive application and wherein the carousel proxy comprises: an outbound carousel control module adapted to optimize a rate of chunks in the outbound carousel.

9. The gateway of claim 1, wherein the inbound carousel comprises a plurality of chunks defining the interactive application and wherein the carousel proxy comprises: an outbound carousel control module adapted to optimize the rate of chunks in the outbound carousel in response to the bandwidth available on the distribution network.

10. The local gateway of claim 1, wherein the inbound carousel comprises a plurality of chunks defining the interactive application and meta-data specifying delivery information for the chunks and wherein the carousel proxy comprises: an outbound carousel control module adapted to place chunks in the outbound carousel responsive to the specified delivery information.

11. The local gateway of claim 8, wherein the inbound carousel comprises a plurality of chunks defining the interactive application and wherein the carousel proxy comprises: an outbound carousel control module adapted to place chunks in the outbound carousel at rates determined in response to the chunks' rates in the inbound carousel.

12. A method of producing an outbound carousel defining an interactive application, comprising: receiving an inbound carousel having a plurality of chunks defining the interactive application; modifying the chunks in the inbound carousel responsive to data stored in a local data store to produce the outbound carousel; and providing the outbound carousel to a distribution network for delivery to end-users.

13. The method of claim 12, further comprising: caching ones of the chunks in the inbound carousel.

14. The method of claim 13, wherein the chunks defining the interactive application include meta-data describing a caching policy for the chunks and wherein the caching comprises: determining the caching policy from the meta-data in the chunks; and caching ones of the chunks in the inbound carousel according to the determined caching policy.

15. The method of claim 12, wherein modifying the chunks in the inbound carousel comprises: filtering chunks from the inbound carousel to produce the outbound carousel.

16. The method of claim 12, wherein modifying the chunks in the inbound carousel comprises: filtering chunks responsive to filtering rules specifying characteristics of receivers and/or end-users receiving the outbound carousel via the distribution network.

17. The method of claim 12, wherein the chunks defining the interactive application contain data for the interactive application and wherein modifying the chunks in the inbound carousel comprises: transforming the data for the interactive application within the chunks of the inbound carousel to produce transformed data for the interactive application within the chunks of the outbound carousel.

18. The method of claim 12, wherein modifying the chunks in the inbound carousel comprises: optimizing a rate of chunks in the outbound carousel.

19. The method of claim 12, wherein modifying the chunks in the inbound carousel comprises: optimizing a rate of the chunks in the outbound carousel responsive to an amount of bandwidth available on the distribution network.

20. The method of claim 12, wherein the chunks in the inbound carousel comprise meta-data specifying delivery information for the chunks and modifying the chunks in the inbound carousel comprises: placing chunks in the outbound carousel at a rate determined responsive to the delivery information.

21. The method of claim 12, wherein modifying the chunks in the inbound carousel comprises: placing chunks in the outbound carousel at rates determined responsive to the chunks' rates in the inbound carousel.

22. A computer program product comprising: a computer-readable medium having computer program code modules embodied therein for producing an outbound carousel defining an interactive application, actions performed by the computer program code module comprising: receiving an inbound carousel having a plurality of chunks defining the interactive application; modifying the chunks in the inbound carousel responsive to data stored in a local data store to produce the outbound carousel; and providing the outbound carousel to a distribution network for delivery to end-users.

23. The computer program product of claim 22, the actions further comprising: caching ones of the chunks in the inbound carousel.

24. The computer program product of claim 23, wherein the chunks defining the interactive application include meta-data describing a caching policy for the chunks and wherein the caching comprises: determining the caching policy from the meta-data in the chunks; and caching ones of the chunks in the inbound carousel according to the determined caching policy.

25. The computer program product of claim 22, wherein the modifying comprises: selectively filtering chunks from the inbound carousel to produce the outbound carousel.

26. The computer program product of claim 25, wherein the selectively filtering comprises: filtering chunks responsive to filtering rules specifying characteristics of receivers and/or end-users receiving the outbound carousel via the distribution network.

27. The computer program product of claim 22, wherein the chunks defining the interactive application contain data for the interactive application and wherein the modifying comprises: selectively transforming the data for the interactive application within the chunks of the inbound carousel to produce transformed data for the interactive application within the chunks of the outbound carousel.

28. The computer program product of claim 22, wherein the modifying comprises: optimizing a rate of chunks in the outbound carousel.

29. The computer program product of claim 28, wherein the optimizing optimizes the rate of the chunks in the outbound carousel responsive to an amount of bandwidth available on the distribution network.

30. The computer program product of claim 28, wherein the chunks in the inbound carousel comprise meta-data specifying delivery information for the chunks and wherein the modifying comprises: placing chunks in the outbound carousel at a rate and/or in an order determined responsive to the delivery information.

31. The computer program product of claim 28, wherein the optimizing comprises: placing chunks in the outbound carousel at rates determined responsive to the chunks' rates in the inbound carousel.