Not applicable.
The present disclosure relates generally to digital multimedia streams.
Many consumers receive entertainment programming carried via digital signals. Programming (e.g., television programs, movies, sports events, music, etc.) is encoded at a head-end using a compression standard such as Motion Pictures Experts Group (MPEG) or H.264. The resulting stream of frames is transmitted to a media receiver, which may decode and display the stream, store the stream for later viewing, and/or further process the encoded stream.
The digitally encoded stream is carried over a core network (such as the Internet) downstream to the edge of the network, where the core network interfaces with a subscriber access network. The digitally encoded stream may be transformed or consumed by one or more intermediate processing functions located at the edge. Examples of such intermediate processing functions include network-based digital video recording, video on demand, fast channel change, video error repair, encryption/key generation, and digital program insertion. Some of these intermediate processing functions operate by locating key frames or other “points of interest” within the encoded stream. Conventional solutions place the functionality of locating points of interest within the intermediate processing function. However, locating points of interest is relatively compute-intensive, since this involves examining the structural information in each encoded elementary stream and in the multiplexed transport stream when transport streams are used. When such conventional solutions also encrypt the transport stream and/or the elementary stream, then locating points of interest also requires first decrypting the transport stream packets. Thus, a more flexible technique for locating points of interest, and for communicating this information to intermediate processing functions, is desired.
Many aspects of the disclosure can be better understood with reference to the following drawings. The components in the drawings are not necessarily to scale, emphasis instead being placed upon clearly illustrating the principles of the present disclosure.
Overview
In one embodiment, a method comprises receiving a stream of transport packets encapsulating media packets, and generating a reference to the point-of-interest media packet relative to the location of the point-of-interest within the transport packet stream. The reference is generated for each media packet that is identified as a point-of-interest.
In another embodiment, a system comprises memory with logic, and a processor. The processor is configured with the logic to receive a stream of transport packets encapsulating media packets, and to identify one or more of the media packets as a point-of-interest. The processor is further configured with the logic to generate a reference to the point-of-interest (POI) media packet relative to the location of the POI within the transport packet stream. The reference is generated for each media packet identified as a point-of-interest.
In another embodiment, a system comprises means for receiving a stream of transport packets encapsulating media packets, and identifying one or more of the media packets as a point-of-interest. The system further comprises means for generating a reference to the point-of-interest (POI) media packet relative to the location of the POI within the transport packet stream. The reference is generated for each media packet identified as a point-of-interest.
Media source 120 encodes, formats, and transmits a digital media stream. The encoded media stream is then communicated to a media stream receiver 130, which stores, decodes, and/or renders the media stream. Media stream receiver 130 may take the form of (for example) a digital set-top box, a digital video recorder, a home media server, a personal computer, a personal digital assistant, a mobile phone, etc. In this disclosure, the term “media stream” refers to a stream that includes video frames, audio frames, multimedia, or any combination thereof. Common encoding formats for digital media streams include MPEG-2, MPEG-4, H.264, and VC-1. In some environments, the encoded media stream represents a single program, and thus contains a video and an audio stream multiplexed together into a single program transport stream (SPTS).
System 100 also contains one or more components that are downstream of media source 120, and which perform intermediate processing of the encoded media stream.
These and other intermediate processing units operate by locating key frames or points of interest (POI) within the encoded stream. Key frames are video frames which can be decoded without reference to another frame. VOD server 140 provides some trick-mode functions by creating a trick mode stream which contains only key frames, or references to such frames. A fast channel change server uses key frames to resynchronize a decoder after a channel change. In addition to key frames, other points of interest in the encoded stream include program-specific information (PSI). Examples of PSI are program map tables (PMTs), program allocation tables (PATs), and entitlement control messages (ECM). PATs and PMTs both provide fundamental structural information about a stream, which a decoder uses to find and process the elements of that stream. ECMs contain keying information that is used to decrypt encrypted content appearing later in the stream. Having these elements explicitly identified as points of interest allows intermediate processing functions to determine which pieces to cache, without having to parse the stream. In addition to the two examples of intermediate processing discussed here (fast channel change and video-on-demand), a person of ordinary skill in the art will be aware of other intermediate processing functions which utilize points of interest, and the principles disclosed herein apply to these as well.
Using inventive features disclosed herein, point-of-interest producer 150 generates references to these points of interest within the media stream, and provides these references to an intermediate component (e.g., a consumer of the points of interest) such as VOD server 140. Point-of-interest consumer 160 uses the references to locate the points of interest within the media stream. An intermediate component associated with point-of-interest consumer 160 uses the points of interest to perform its intermediate function (e.g. produce a trick mode stream). In the example of
Point-of-interest producer 150 can use different mechanisms to provide point-of-interest references to point-of-interest consumer 160.
Point-of-interest producer 150′ examines media stream 210 to identify one or more media packets 220 that contain points-of-interest. In the example embodiment of
Point-of-interest consumer 160′ receives points-of-interest stream 240, and also receives the original media stream 210. Point-of-interest consumer 160′ uses points-of-interest stream 240 to locate individual points-of-interest (e.g., key frames, program-specific information) within media stream 210. In the example scenario of
In some embodiments, RTP is used as the transport layer protocol, and the point-of-interest information is conveyed in the RTP header using RTP header extensions. The RTP header extension is formed as a sequence of extension elements, with possible padding. Each extension element has a local identifier and a length. Further details on RTP header extensions can be found in Internet draft-ietf-avt-rtp-hdrext-12.txt (“A general mechanism for RTP Header Extensions”). Examples of local identifiers in this context include point-of-interest classifier, SMPTE time code information, or MPEG stream hints that can be used for decoder optimization, trick play state generation, etc.
The concept of a frame or PSI as being a “point-of-interest” should be familiar to a person of ordinary skill in the art, as will various mechanisms used to select “points of interest”. Commonly used selection criteria include selecting the start of all I-frames, all PSIs, all ECMs, or various combinations of these criteria. In one embodiment, selection criteria involves selecting anchor frames. In this disclosure, an anchor frame is an I-frame, instantaneous decoder refresh frame (IDR-frame), or a frame that depends only on a past single reference frame that is the most-recently decoded anchor frame.
As described above in connection with
As can be seen in
Media packets 220 are encapsulated within transport layer packets 230, where each transport layer packet 230 includes a transport layer header 230H and a transport layer payload 230P. Transport layer packets 230 are in turn encapsulated by additional protocol layers, shown here as an additional header 310. In the embodiments described herein, Internet Protocol (IP) is used as the network layer and Real-time Transport Protocol (RTP) in combination with User Datagram Protocol (UDP) is used as the transport layer, with the media packets multiplexed into an MPEG2 Transport Stream. A person of ordinary skill in the art should be familiar with MPEG2 transport, IP, UDP and RTP packet formats, so headers and payloads have been simplified in
As described earlier, point-of-interest producer 150 locates key frame media packets and program-specific information (PSI) media packets, and generates a reference to each of these points of interest. The first level reference to a particular media packet 220 identifies the containing transport layer packet 230. A particular transport layer packet 230 is identified by a flow identifier 320 and a flow-unique packet identifier 330. A person of ordinary skill in the art should be familiar with the concept of a packet flow, which consists of a series of packets between two endpoints, where the two endpoints are identified by information contained in each packet header. An RTP flow is defined by a destination address and a destination port (both part of IP/UDP header 310), and a synchronization source identifier (SSRC, part of transport layer header 230H). Thus, the combination of destination address, destination port, and SSRC serves as a flow identifier 320 for an RTP flow. In the case of RTP, the packet identifier 330 is a sequence number 330.
In the example scenario shown in
Since a transport layer packet can carry multiple media packets, the reference to media packet 220-A1 continues with a media packet reference 370-A1. In
Point-of-interest producer 150 then adds a second reference to points-of-interest stream 240, the reference to point-of-interest 220-A2. Since this point-of-interest is contained in the same transport layer packet (230-A), it is unnecessary to repeat the flow reference (350) and the transport reference (360-A). The second point-of-interest (220-A2) is simply identified as the last media packet (370-A2) in transport layer packet 230-A.
The embodiment of
In the example scenario shown in
The partial identification of transport layer packet 230-J is completed by transport packet reference 450. In the embodiment described above, RTP sequence numbers are used as transport packet references. However, UDP does not use sequence numbers, and there is nothing that is conveyed in the UDP packet itself which uniquely distinguishes one UDP packet from another. The embodiment of
The embodiment of
Processing continues at block 530, where each point-of-interest is identified with a reference to a containing transport packet, and media packet within the transport packet. As described above, in one embodiment the reference is a combination that identifies the flow, the particular transport packet within the flow, and the particular media packet within the transport packet. In some embodiments, the reference also includes a description of the point-of-interest, such as frame or PSI, type of frame (I, B, P, etc.) and type of PSI (PMT, PAT, etc.).
Next, at block 540, a packet or series of packets that contain the references to points-of-interest are generated. As described above (in connection with
Processing continues at block 550, where the stream of packets containing the references to points-of-interest is transmitted to a receiver containing point-of-interest consumer 160 (
Processing continues at block 640, where additional information within the current point-of-interest reference packet is used to locate the appropriate media packet within the already-identified (at block 630) transport packet. In this example embodiment, the media packet reference field within the reference packet is used to find the appropriate media packet within the series (e.g., the first, second, etc.).
Next, at block 650, the media packet found at block 640 is processed by some intermediate processing function, or is handed off by such an intermediate processing functions. The role of intermediate processing functions (such as trick mode stream generation in video-on-demand servers and locating key frames in fast channel change servers) is discussed above, and should be familiar to a person of ordinary skill in the art.
Block 660 determines whether any reference packets remain to be processed. If Yes, then processing starts for the next reference packet, at block 620. If No, process 600 is complete.
Several other flow variations (not shown) are contemplated. In one, each receiver receives the primary media stream and the points-of-interest stream on a single IP unicast address. The two streams are differentiated by UDP port number. In another variation, different IP multicast addresses are used to deliver points-of-interest stream 710 to different receivers. In yet another variation, the points-of-interest stream is delivered to multiple receivers using the same multicast IP address, but different UDP ports. In still another variation, the points-of-interest stream is delivered to different receivers on a single multicast IP address and a single UDP port, but distinguished by different PIDs.
Memory 840 contains instructions that are executed by processor 830 to control operations of consumer 160 or producer 150. Peripheral I/O interface 820 provides input and output signals, for example, user inputs from a remote control or front panel buttons or a keyboard, and outputs such as LEDs or LCD on the front panel. Network interface 810 transmits/receives points-of-interest stream 240, media stream 210, and/or combined stream 270 (depending on the configuration). In some embodiments, network interface 810 is for a local area network (LAN) or a wide area network (WAN) such as the Internet. In other embodiments, this interface is for a radio frequency (RF) network, and so may include a tuner/demodulator (not shown) which processes the digital signals received over the RF network.
Omitted from
Any process descriptions or blocks in flowcharts should be understood as representing modules, segments, or portions of code which include one or more executable instructions for implementing specific logical functions or steps in the process. As would be understood by those of ordinary skill in the art of the software development, alternate implementations are also included within the scope of the disclosure. In these alternate implementations, functions may be executed out of order from that shown or discussed, including substantially concurrently or in reverse order, depending on the functionality involved.
The systems and methods disclosed herein can be embodied in any computer-readable medium for use by or in connection with an instruction execution system, apparatus, or device. Such instruction execution systems include any computer-based system, processor-containing system, or other system that can fetch and execute the instructions from the instruction execution system. In the context of this disclosure, a “computer-readable medium” can be any mechanism that can contain, store, communicate, propagate, or transport the program for use by, or in connection with, the instruction execution system. The computer readable medium can be, for example but not limited to, a system or propagation medium that is based on electronic, magnetic, optical, electromagnetic, infrared, or semiconductor technology.
Specific examples of a computer-readable medium using electronic technology may include (but are not limited to) the following: an electrical connection (electronic) having one or more wires; a random access memory (RAM); a read-only memory (ROM); an erasable programmable read-only memory (EPROM or Flash memory). A specific example using magnetic technology includes (but is not limited to) a portable computer diskette. Specific examples using optical technology include (but are not limited to) an optical fiber and a portable compact disk read-only memory (CD-ROM).
The foregoing description has been presented for purposes of illustration and description. It is not intended to be exhaustive or to limit the disclosure to the precise forms disclosed. Obvious modifications or variations are possible in light of the above teachings. The implementations discussed, however, were chosen and described to illustrate the principles of the disclosure and its practical application to thereby enable a person of ordinary skill in the art to utilize the disclosure in various implementations and with various modifications as are suited to the particular use contemplated. All such modifications and variation are within the scope of the disclosure as determined by the appended claims when interpreted in accordance with the breadth to which they are fairly and legally entitled.
Number | Name | Date | Kind |
---|---|---|---|
4788656 | Sternberger | Nov 1988 | A |
4907277 | Callens | Mar 1990 | A |
4996663 | Nemes | Feb 1991 | A |
5414704 | Spinney | May 1995 | A |
5450449 | Kroon | Sep 1995 | A |
5594660 | Sung et al. | Jan 1997 | A |
5617421 | Chin | Apr 1997 | A |
5699478 | Nahumi | Dec 1997 | A |
5699485 | Shoham | Dec 1997 | A |
5726989 | Dokic | Mar 1998 | A |
5806086 | Kimmel | Sep 1998 | A |
5842040 | Hughes | Nov 1998 | A |
5859660 | Perkins et al. | Jan 1999 | A |
5884010 | Chen | Mar 1999 | A |
5898837 | Guttman | Apr 1999 | A |
5917830 | Chen et al. | Jun 1999 | A |
5943347 | Shepard | Aug 1999 | A |
5946302 | Waclawsky | Aug 1999 | A |
5956721 | Douceur et al. | Sep 1999 | A |
5995488 | Kalkunte | Nov 1999 | A |
5995971 | Douceur et al. | Nov 1999 | A |
6101193 | Ohba | Aug 2000 | A |
6104696 | Kadambi | Aug 2000 | A |
6185208 | Liao | Feb 2001 | B1 |
6275861 | Chaudri | Aug 2001 | B1 |
6314095 | Loa | Nov 2001 | B1 |
6341130 | Lakshman | Jan 2002 | B1 |
6356545 | Vargo | Mar 2002 | B1 |
6389006 | Bialik | May 2002 | B1 |
6421802 | Schildbach | Jul 2002 | B1 |
6434153 | Yazaki | Aug 2002 | B1 |
6438695 | Maufer | Aug 2002 | B1 |
6507562 | Kadansky | Jan 2003 | B1 |
6542508 | Lin | Apr 2003 | B1 |
6590894 | Kerr | Jul 2003 | B1 |
6611502 | Seaman | Aug 2003 | B1 |
6629141 | Elzur | Sep 2003 | B2 |
6658000 | Raciborski | Dec 2003 | B1 |
6665637 | Bruhn | Dec 2003 | B2 |
6671722 | Stachura | Dec 2003 | B1 |
6687360 | Kung | Feb 2004 | B2 |
6741600 | Weiss | May 2004 | B1 |
6757654 | Westerlund | Jun 2004 | B1 |
6760309 | Rochberger | Jul 2004 | B1 |
6771657 | Elstermann | Aug 2004 | B1 |
6801496 | Saleh | Oct 2004 | B1 |
6801525 | Bodnar | Oct 2004 | B1 |
6847928 | Naka | Jan 2005 | B1 |
6854117 | Roberts | Feb 2005 | B1 |
6868069 | Knobbe | Mar 2005 | B2 |
6909702 | Leung | Jun 2005 | B2 |
6928482 | Ben-Nun | Aug 2005 | B1 |
6971119 | Arsenault et al. | Nov 2005 | B1 |
7010611 | Wiryaman | Mar 2006 | B1 |
7013267 | Huart et al. | Mar 2006 | B1 |
7036049 | Ali | Apr 2006 | B2 |
7055174 | Cope | May 2006 | B1 |
7062689 | Slobodnik | Jun 2006 | B2 |
7096481 | Forecast et al. | Aug 2006 | B1 |
7096488 | Zhang et al. | Aug 2006 | B1 |
7106749 | Darshan et al. | Sep 2006 | B1 |
7139242 | Bays | Nov 2006 | B2 |
7154855 | Hardy | Dec 2006 | B2 |
7206385 | Ethier | Apr 2007 | B2 |
7248682 | Oran | Jul 2007 | B1 |
7269157 | Klinker | Sep 2007 | B2 |
7286467 | Sylvain | Oct 2007 | B1 |
7305464 | Philipi | Dec 2007 | B2 |
7324499 | Borella | Jan 2008 | B1 |
7430222 | Green et al. | Sep 2008 | B2 |
7432950 | Deleam et al. | Oct 2008 | B2 |
7436830 | Ben-Nun et al. | Oct 2008 | B2 |
7453829 | Pasha et al. | Nov 2008 | B2 |
7454494 | Hedayat | Nov 2008 | B1 |
7483400 | Kuusinen et al. | Jan 2009 | B2 |
7496044 | Wing | Feb 2009 | B1 |
7633879 | Ramalho | Dec 2009 | B2 |
7720432 | Colby et al. | May 2010 | B1 |
7817546 | Filsfils et al. | Oct 2010 | B2 |
7835406 | Oran et al. | Nov 2010 | B2 |
7848478 | Huffman | Dec 2010 | B1 |
7911946 | Poli et al. | Mar 2011 | B2 |
7936695 | Oran | May 2011 | B2 |
7940685 | Breslau et al. | May 2011 | B1 |
7962942 | Craner | Jun 2011 | B1 |
8023419 | Oran | Sep 2011 | B2 |
8352590 | Sankaran et al. | Jan 2013 | B2 |
8867385 | Oran | Oct 2014 | B2 |
20010013123 | Freeman et al. | Aug 2001 | A1 |
20020016856 | Tallegas | Feb 2002 | A1 |
20020064273 | Tomikawa | May 2002 | A1 |
20020075895 | Yamaguchi | Jun 2002 | A1 |
20020116501 | Ho | Aug 2002 | A1 |
20020122418 | Bernstein | Sep 2002 | A1 |
20020131425 | Shalom | Sep 2002 | A1 |
20020141392 | Tezuka | Oct 2002 | A1 |
20020150050 | Nathanson | Oct 2002 | A1 |
20020154694 | Birch | Oct 2002 | A1 |
20020194361 | Itoh | Dec 2002 | A1 |
20020194589 | Cristofalo et al. | Dec 2002 | A1 |
20020196850 | Liu et al. | Dec 2002 | A1 |
20030014705 | Suzuki | Jan 2003 | A1 |
20030023710 | Corlett | Jan 2003 | A1 |
20030026241 | Ono | Feb 2003 | A1 |
20030048786 | D'Annunzio | Mar 2003 | A1 |
20030086425 | Bearden | May 2003 | A1 |
20030117959 | Taranov | Jun 2003 | A1 |
20030120789 | Hepworth et al. | Jun 2003 | A1 |
20030123556 | Komori | Jul 2003 | A1 |
20030145077 | Khan | Jul 2003 | A1 |
20030145233 | Poletto et al. | Jul 2003 | A1 |
20030198249 | Klein | Oct 2003 | A1 |
20030204617 | Buchsbaum | Oct 2003 | A1 |
20030227917 | Maher | Dec 2003 | A1 |
20040037267 | Bennett | Feb 2004 | A1 |
20040037320 | Dickson | Feb 2004 | A1 |
20040042456 | Dittmann | Mar 2004 | A1 |
20040071135 | Jimmei | Apr 2004 | A1 |
20040073641 | Minhazuddin | Apr 2004 | A1 |
20040095894 | Eloranta | May 2004 | A1 |
20040141502 | Corson | Jul 2004 | A1 |
20040179513 | Smith | Sep 2004 | A1 |
20040181599 | Kreusch | Sep 2004 | A1 |
20040185836 | Pelaez | Sep 2004 | A1 |
20040203787 | Naghian | Oct 2004 | A1 |
20040208186 | Eichen et al. | Oct 2004 | A1 |
20040252694 | Adhikari | Dec 2004 | A1 |
20040264433 | Melpignano | Dec 2004 | A1 |
20050015816 | Christofalo et al. | Jan 2005 | A1 |
20050022253 | Chen et al. | Jan 2005 | A1 |
20050102423 | Pelavin | May 2005 | A1 |
20050138372 | Kajihara et al. | Jun 2005 | A1 |
20050169174 | Apostolopoulos et al. | Aug 2005 | A1 |
20050182850 | Kohno | Aug 2005 | A1 |
20050220035 | Ling | Oct 2005 | A1 |
20050229232 | Champel et al. | Oct 2005 | A1 |
20050232227 | Jorgenson | Oct 2005 | A1 |
20050243733 | Crawford | Nov 2005 | A1 |
20050246456 | Parry et al. | Nov 2005 | A1 |
20050268324 | An | Dec 2005 | A1 |
20050276276 | Davis | Dec 2005 | A1 |
20060002366 | Kawaguchi | Jan 2006 | A1 |
20060010243 | DuRee | Jan 2006 | A1 |
20060029065 | Fellman | Feb 2006 | A1 |
20060031445 | Rajan | Feb 2006 | A1 |
20060031510 | Beck | Feb 2006 | A1 |
20060059277 | Zito | Mar 2006 | A1 |
20060059411 | Dacosta | Mar 2006 | A1 |
20060075449 | Jagadeesan et al. | Apr 2006 | A1 |
20060106961 | Ebata | May 2006 | A1 |
20060107187 | Hannuksela | May 2006 | A1 |
20060114855 | Zheng | Jun 2006 | A1 |
20060126528 | Ramalho | Jun 2006 | A1 |
20060130118 | Damm | Jun 2006 | A1 |
20060143300 | See | Jun 2006 | A1 |
20060182034 | Klinker | Aug 2006 | A1 |
20060221837 | Gardner | Oct 2006 | A1 |
20060221930 | Sweeney | Oct 2006 | A1 |
20060280207 | Guarini et al. | Dec 2006 | A1 |
20070036087 | Kangru | Feb 2007 | A1 |
20070049307 | Mueckenheim | Mar 2007 | A1 |
20070061460 | Khan | Mar 2007 | A1 |
20070127391 | Goodman | Jun 2007 | A1 |
20070199052 | Sankaran | Aug 2007 | A1 |
20070230486 | Zafirov | Oct 2007 | A1 |
20080037425 | Pan et al. | Feb 2008 | A1 |
20080037864 | Zhang | Feb 2008 | A1 |
20080069002 | Savoor | Mar 2008 | A1 |
20080159279 | Younis | Jul 2008 | A1 |
20080170117 | Xiao | Jul 2008 | A1 |
20080189754 | Yoon et al. | Aug 2008 | A1 |
20080215704 | Curcio et al. | Sep 2008 | A1 |
20080220765 | Chu | Sep 2008 | A1 |
20080259924 | Gooch | Oct 2008 | A1 |
20080285452 | Oran | Nov 2008 | A1 |
20080285463 | Oran | Nov 2008 | A1 |
20080310316 | Oran | Dec 2008 | A1 |
20080317011 | Datta | Dec 2008 | A1 |
20090010158 | Filsfils | Jan 2009 | A1 |
20090013129 | Bondurant | Jan 2009 | A1 |
20090028142 | Schmidt et al. | Jan 2009 | A1 |
20090217318 | VeSteeg et al. | Aug 2009 | A1 |
20100039955 | Taylor et al. | Feb 2010 | A1 |
20110191469 | Oran | Aug 2011 | A1 |
20130198788 | Barger et al. | Aug 2013 | A1 |
Number | Date | Country |
---|---|---|
WO 03084134 | Oct 2003 | WO |
WO 2006096021 | Sep 2006 | WO |
WO 2007047479 | Apr 2007 | WO |
WO 2009058645 | May 2009 | WO |
Entry |
---|
D. Singer and H. Desineni, “A General Mechanism for RTP Header Extensions”, draft-ietf-avt-rtp-hdrext-12txt, Feb. 26, 2007. |
U.S. Appl. No. 11/744,343, filed Jul. 6, 2007 entitled “Quasi RTP Metrics for Non-RTP Media Flows,” inventors John Bettink, Stewart Bryant and David Oran. |
International Preliminary Report dated May 4, 2010 cited in Application No. PCT/US2008/080882. |
J. Brassil et al., “Structuring Internet Media Streams With Cueing Protocols,” IEEE/ACM Transactions on Networking, New York, NY, vol. 10, No. 4, Aug. 1, 2002, pp. 1-11. |
“MPEG-7 Overview,” (latest version: Version 10), Oct. 2004, International Organisation for Standardisation Organisation Internationale de Normalisation ISO/IEC JTC1/SC29/WG11 Coding of Moving Pictures and Audio, N6828, 93 pgs. |
H. Castro et al., “Monitoring Emerging IPV6 Wireless Access Networks,” IEEE Wireless Communications, vol. 12, No. 1, Feb. 2005, pp. 47-53. |
Chinese First Office Action dated Sep. 27, 2012 cited in Application No. 200880123531.2, 27 pgs. |
U.S. Final Office Action dated Feb. 28, 2012 cited in U.S. Appl. No. 12/434,480, 17 pgs. |
U.S. Office Action dated Jun. 7, 2011 cited in U.S. Appl. No. 12/434,480, 16 pgs. |
Marek Burza et al. Adaptive Streaming of MPEG-based Audio/Video Content over Wireless Networks, Apr. 2007, pp. 17-27, vol. 2, No. 2, Journal of Multimedia. |
Chinese Rejection Decision dated Jan. 27, 2014 cited in Application No. 200880123531.2, 28 pgs. |
U.S. Office Action dated Feb. 27, 2013 cited in U.S. Appl. No. 13/080,585, 30 pgs. |
U.S. Final Office Action dated Sep. 26, 2013 cited in U.S. Appl. No. 13/080,585, 27 pgs. |
U.S. Office Action dated Feb. 5, 2014 cited in U.S. Appl. No. 13/080,585, 25 pgs. |
T.V. Lakshman et al., “High-Speed Policy-Based Packet Forwarding Using Efficient Multi-Dimensional Range Matching,” 1998, ACM SIGCOMM Computer Communication Review, vol. 28, No. 4, 12 pgs. |
Pendleton et al., “Session Initiation Package for Voice Quality Reporting Event,” Sipping Working Group, 2006, pp. 1-24. |
J. Postel, “User Datagram Protocol,” retrieved from http://www.faqs.org/rfcs/rfc768.html on Jun. 13, 2009, originally published Aug. 28, 2980, pp. 1-3. |
Information Sciences Institute, University of Southern California; Internet Protocol, DARPA Internet Program Protocol Specification, Sep. 1981, pp. 1-46. |
Information Sciences Institute, University of Southern California; Transmission Control Protocol, DARPA Internet Program Protocol Specification, Sep. 1981, pp. 1-84. |
R. Braden, “Network Working Group,” Requirements for Internet Hosts-Communication Layers, Oct. 1989, p. 1-90. |
Degermark et al., “IP Header Compression,” Feb. 1999, RFC 2507, 42 pgs. |
K. Hamzeh et al., “Point-to-Point Tunneling Protocol (PPTP)”, RFC 2637, Jul. 1999, 57 pgs. |
Liao et al., “Adaptive recovery techniques for real-time audio streams,” IEEE INFOCOM 2001, Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies, Proceedings, Apr. 22-26, 2001, vol. 2, 9 pgs. |
Rosenburg, “An Offer/Answer Model with Session Description Protocol (SDP),” Jun. 2002, RFC 3264, 26 pgs. |
T. Friedman et al., “RTP Control Protocol Extended Reports (RTCP XR)”, RFC 3611, Nov. 2003, pp. 1-56. |
Kevin Song X., “The ABC's of Network Security,” The Certified Security Professional, Certification Magazine, Feb. 2004, 3 pgs. |
B. Thompson et al., Tunneling Multiplexed Compressed RPT (TCRTP), Nov. 2005, RFC 4170, 22 pgs. |
Jonsson et al., Robust Header Compression (ROHC): A Link-Layer Assisted Profile for IP/UDP/RTP, Jan. 2006, RFC 4362, 21 pgs. |
Welch et al., “A Proposed Media Delivery Index (MDI),” Apr. 2006, RFC 4445, 9 pgs. |
Schulzrinne et al., “RTP: A Transport Protocol for Real-Time Applications,” Network Working Group, RFC 3550, 2003, pp. 1-92. |
Chinese Second Office Action dated Jun. 5, 2013 cited in Application No. 200880123531.2, 27 pgs. |
U.S. Office Action dated Jun. 6, 2014 cited in U.S. Appl. No. 12/434,480, 32 pgs. |
European Office Action dated Nov. 10, 2014 cited in Application No. 08 845 733.8, 4 pgs. |
U.S. Final Office Action dated Dec. 3, 2014 cited in U.S. Appl. No. 12/434,480, 22 pgs. |
Number | Date | Country | |
---|---|---|---|
20090119722 A1 | May 2009 | US |