System and method for live service content handling with content storing servers caching popular content therein

Information

  • Patent Grant
  • 10812837
  • Patent Number
    10,812,837
  • Date Filed
    Thursday, October 4, 2018
    6 years ago
  • Date Issued
    Tuesday, October 20, 2020
    4 years ago
Abstract
A method for providing live content from a service delivery apparatus (SDA) is presented. The method includes identifying by the SDA a live content, wherein the live content includes a content identification (CID) and is provided by a content source (CS); acquiring the live content designated by the CID to store in a fast access memory of the SDA, wherein the SDA includes the fast access memory and a slow access storage; providing the live content from the fast access memory to a user node (UN) in response to receiving a request for the live content, the request comprising at least the CID.
Description
TECHNICAL FIELD

The disclosure generally relates to streaming of live content, and particularly to effectively manage and control the delivery of live content for better load balancing.


BACKGROUND

Service providers worldwide are facing a mounting problem of flattening revenues coupled with increasing costs brought forth by increasing usage of bandwidth, growing switching clients, subscriber saturation and price competition. These mobile and broadband providers are facing challenges in delivering new revenue generating services while seeing their over the top (OTT) counterparts reaping rewards from content delivered over the networks they built and maintained over years.


The vast majority of these OTT services are delivered over hypertext transfer protocol (HTTP), the de-facto protocol for application development and delivery. Whether it is video, social networking, search, or advertising, or whether it is over fixed line or mobile applications, it is most likely running over HTTP. However, this protocol is also the most process intensive protocol for network devices. Hence practically any increase in usage results in increase the traffic on the service providers.


Certainly controlling traffic on the Internet requires various levels of understanding of the traffic that flows through the network which also increases in its level of sophistication. Various systems and solutions have been offered to enable deep-packet-inspection (DPI) to enable an ever sophisticated ability to shape the traffic on the network. This system allows the service providers to better manage the network and its related resources and provide a higher level of quality of service (QoS) to increase revenues and profits. However, the rapid increase in the delivery of heavy bandwidth consuming data, such as video, requires a new level of handling system that is not available today in related art solutions. A known problem is that an access of a user node to a content source and a subsequent access by another user node to the same content result in additional traffic load on the content provider and on the entire network. When, for example, a popular video clip is accessed by multiple user nodes, there is a significant and noticeable degradation of the network performance that may even lead to a network failure. Some related art solutions attempt to store all the data in caches. However, the huge amounts of data where each and every packet is needed to be inspected, regardless of its source, makes this a daunting and impractical task.


It would be advantageous to provide service providers a solution that will enable them to effectively manage and control the delivery of heavy bandwidth consuming data such that the overall bandwidth requirements are loaded and shared across the network in general, particularly within the network of a specific service provider.


It would be further advantageous to provide service providers a solution that will enable them to effectively manage and control the delivery of live video content such that the overall bandwidth requirements are loaded and shared across the network in general, particularly within the network of a specific service provider.


SUMMARY

To realize the some of the advantages noted above, there is provided a method for providing live content from a service delivery apparatus (SDA). The method comprises identifying by the SDA a live content, wherein the live content includes a content identification (CID) and is provided by a content source (CS); acquiring the live content designated by the CID to store in a fast access memory of the SDA, wherein the SDA includes the fast access memory and a slow access storage; providing the live content from the fast access memory to a user node (UN) in response to receiving a request for the live content, the request comprising at least the CID.


To realize the some of the advantages noted above, there is also provided a service delivery apparatus (SDA) for providing live content from a content source (CS) to at least a user node. The SDA comprises a first network interface to sniff traffic between at least a first portion of a network and at least a second portion of a network; a second network interface configured to communicate with the at least a first portion of a network and the at least a second portion of a network; a fast access memory; a slow access storage; a processing unit; and a memory containing instructions that when executed by the processing unit causes the SDA to: identify a live content, wherein the live content includes a content identification (CID) and is provided by a content source (CS); acquire the live content designated by the CID to store in the fast access memory of the SDA; provide the live content from the fast access memory to a user node (UN) in response to receiving a request for the live content, the request comprising at least the CID.





BRIEF DESCRIPTION OF THE DRAWINGS

The subject matter that is disclosed herein is particularly pointed out and distinctly claimed in the claims at the conclusion of the specification. The foregoing and other objects, features and advantages will be apparent from the following detailed description taken in conjunction with the accompanying drawings.



FIG. 1A—is a block diagram of a basic network system operating as a bump-in the wire according to an exemplary embodiment



FIG. 1B—is a block diagram of a basic network system operating as a sniffer according to an exemplary embodiment



FIG. 2—is a block diagram of an apparatus to identify content sources and provide content from the apparatus according to an exemplary embodiment



FIG. 3—is a flowchart depicting the identification of a content source according to an exemplary embodiment



FIG. 4—is a flowchart depicting the storage of content from identified content sources in the storage of the apparatus according to an exemplary embodiment.



FIG. 5—is a flowchart describing the providing of content to a requesting node according to an exemplary embodiment



FIG. 6—is a flowchart of a computerized method for providing live content from a service delivery apparatus (SDA) according to an exemplary embodiment



FIG. 7—is a network sequence diagram of a plurality of user nodes requesting content from a content source according to an exemplary embodiment



FIG. 8—is a network sequence diagram of a plurality of user nodes requesting content from a content source according to another exemplary embodiment.





DETAILED DESCRIPTION

It is important to note that the exemplary embodiments disclosed herein are only examples of the many advantageous uses of the innovative teachings herein. In general, statements made in the specification of the present application do not limit any of the various claims. Moreover, some statements may apply to some features but not to others. In general, unless otherwise indicated, singular elements may be a plural and vice versa with no loss of generality. In the drawings, like numerals refer to like parts through several views.


A service delivery apparatus (SDA) stores live content in a fast access memory and provides the content to a plurality of user nodes (UNs) by redirecting the content requests from the plurality of UNs to a content source through the SDA. In certain exemplary embodiments, a redirect instruction is sent to the UNs before the content is acquired by the SDA. By sending the redirect instruction before the content is acquired, the SDA is able to serve more UNs than where the content is first acquired and then redirect instructions are sent. Typically, it is efficient to store video on demand (VOD) content in a storage, and live broadcast in a fast access memory, from which content can be delivered faster than from storage.


Reference is now made to FIG. 1A where an exemplary and non-limiting block diagram 100A of a basic network system according to an exemplary embodiment is shown. The system depicted comprises of a global network 120 and a service provider network 130 that are coupled by a ‘bump-in-the-wire’ apparatus 110. While the network 120 and 130 are shown as detached from each other it should be noted that this is only an exemplary configuration and other configurations are possible without departing from the principles of the disclosure. A network may be a Local Area Network (LAN), Wide Area Network (WAN), Metro Area Network (MAN), World Wide Web (WWW), Internet, combinations thereof, or the like. There are one or more content sources (CSs) connected to the global network 120, shown as CS1 140-1 through CSn 140-n, commonly referred to as CS 140. The content sources provide content upon request, for example video clips, from the appropriate CS to the requestor. There are one or more user nodes (UNs) connected to the service provider network 130, shown as UN1 150-1 through UNm 150-m, commonly referred to as UN 150. When an UN 150 requests content from a CS 140, it is transferred, according to the embodiment through a service delivery apparatus (SDA) 110, the function of which is described in more detail herein below. Generally, the SDA 110 may provide the requested content from its storage, or when such content or portions thereof are not in the storage of the SDA 110, then the request is forwarded to the appropriate CS 140 for the delivery of the content, as further described below. FIG. 1B depicts an exemplary and non-limiting block diagram 100B of a basic network system operating as a sniffer according to an exemplary embodiment. Operating similarly to the system shown in FIG. 1A, the system 100B has a SDA 110 connected in a sniffer mode, i.e., the SDA merely observes the traffic moving between a global network 120 and a service provider network 130 without routing packets through it. When the SDA 110 is connected in sniffer mode, it will typically connect to the service provider network 130 through a separate communication port to provide content stored therein to a destination connected to the service provider network 130.



FIG. 2 provides an exemplary and non-limiting block diagram of a SDA 110 that identifies content sources and provides content from the apparatus in accordance with an exemplary embodiment. The SDA 110 comprises a deep-pocket-inspection (DPI) unit 210, a storage 220, a content delivery unit (CDU) 230 and an input/output interface 240. According to the embodiment, the DPI unit 210 performs two separate tasks. The first task is to identify sources of content that potentially contain data that may be worthwhile to store in the storage 220. For example, video servers may be located throughout the global network 120 and accessed randomly by UNs 150 through the service provider network 130. In order to improve the deficiencies of related art solutions, the apparatus 110 is implemented differently. The DPI unit 210 is provided with data types to look for in data packets that are transmitted through the apparatus 110. Instead of inspecting each and every packet, DPI unit 210 may inspect only one in a certain number of packets (for example, one-in-a-thousand packets) out of the entire traffic, thereby significantly lowering the processing load. It should be understood that the method for selecting the sampled packets is typically not performed by using a simple counter to process one out of every predetermined number of packets. Instead, the source and the destination addresses from each packet are fed into a hash function, the hash function result is compared to a configurable threshold, and the result of this comparison determines if the packet is inspected or not. In addition, it should be understood that the hash function is symmetric with respect to the source and the destination addresses, such that swapping the source address and the destination address does not change the hash result. In another exemplary embodiment, a source and a destination ports may also be used as part of the hash function operation. This guarantees that each flow comprising of multiple packets sent between a UN 150 and a CS 140 is either fully ignored or fully inspected. Upon determination that a specific CS 140 provides a desired data type, the identification of that CS 140 is stored. Any future packet received from or sent to the identified CS 140 is inspected by the DPI unit 210, and if the packet contains content that may be worthwhile to store, such content is stored in the storage 220. This inspection ensures that a demand for highly popular content from a popular CS 140 is likely to be quickly detected while infrequent access to a CS 140 would typically not impact the operation of the system. It should be noted that identification of a CS 140 does not have to be on the first detection of a data, and threshold levels may be used, as well as an aging mechanism so that relatively infrequently accessed CSs 140 would lose older access count so the CSs 140 does not hit the threshold value.


While DPI unit 210 operates on packets that arrive from CSs 140, the CDU 230 operates with respect to requests for content received from the UNs 150 through the service provider network 130. Upon receipt of such a request, the DPI 210 first determines if the content of the requested CS 140 actually is stored in the storage 220 by checking that the CS 140 identification is stored in to the apparatus 110. If the identification is found, then the storage 220 is checked for the possibility of delivery of the content or portions thereof. If the entire content or portions thereof are found, then they are delivered to the requesting UN 150. If the entire content or certain portions are missing, then the request is forwarded to the appropriate CS 140. Storage 220 may be semiconductor media, magnetic media, or any other type of storage media appropriate for the storage of content.


Reference is now made to FIG. 3 of an exemplary and non-limiting flowchart 300 depicting the identification of a content source in accordance with an exemplary embodiment. In S310, an apparatus receives and/or fetches parameters relating to the data of interest in the CSs. For example, it may contain parameters pertaining to video data type. In S320, packets are selected from the network traffic, for example, a global network 120. The ratio between the number of packets that pass through the network and the number inspected may be configured, so it could be one-in-a-thousand, one-in-ten-thousand, and so on. In S330, the data in the packet is checked to see if it corresponds to the data parameters, e.g., contain video data, and if so execution continues to S340; otherwise, execution continues to S370. In S340, the count of the CS 140 is updated, for example, by incrementing the value of a counter. In S350, it is checked if the count for that CS 140 has exceeded a threshold value, and if so, execution continues to S360; otherwise, execution continues to S370. In one exemplary embodiment, the count may also have an aging mechanism (not shown) as described above. Furthermore, different data types may have different thresholds, different count increases, and different count aging. In S360, the CS 140 is identified as a source of content eligible for the storage 220. In S370, it is checked if there are more data packets to be inspected, and if so, execution continues to S320; otherwise execution terminates.


Reference is now made to FIG. 4 of an exemplary and non-limiting flowchart 400 depicting the storage of content from identified CS 140 in the storage 220 of the apparatus 110 according to an exemplary embodiment. In S410, a packet is received by apparatus 110. In S420, it is checked whether the received packet is from an identified CS 140, and if so, execution continues to S430; otherwise execution continues to S460. In S430, the received packet is inspected by a DPI unit 210 to identify content of the packet. This step is performed to check if the packet actually contains the content of interest so waste of storage space in the storage 220 can be prevented from storing unnecessary content because it is from an identified CS 140. In S440, it is checked whether such content of interest was found, and if so, execution continues to S450; otherwise, execution continues to S460. In S450, the content of the received packet is stored in the storage 220. In S460, it is checked whether more packets are received, and if so, execution continues to S410; otherwise, execution terminates.


Reference is now made to FIG. 5 of an exemplary and non-limiting flowchart 500 describing the providing of content to a requesting UN 150 according to an exemplary embodiment. In S510, an apparatus 110 receives a request for content from a UN 150. In S520, it is checked if the requested content is in an identified CS 140, and if so, execution continues to S530; otherwise, execution continues to S560. In S530, it is checked whether the identified CS 140 is stored in the storage 220, and if so, execution continues to S540; otherwise, execution continues to S560. In S540, it is checked whether the requested content is in the storage 220, and if so, execution continues to S550; otherwise, execution continues to S560. In S550, the content is delivered to the requesting UN 150. In S560, it is checked whether additional content requests exist, and if so, execution continues to S510; otherwise, execution terminates.


In one exemplary embodiment, upon detecting that a portion of the requested content is in the storage 220 and deliverable to the requesting UN 150, such content is delivered immediately to the UN 150 while only the missing portions of the content is requested from the corresponding CS 140. Hence, a request from the CDU 230 may be for the portion of the requested content. In an exemplary embodiment, once a DPI unit 210 determines that a CS 140 may contain content that needs to be stored in storage 220, the packets from such CS 140 are consistently inspected for determination of popular content.



FIG. 6 is a non-limiting exemplary flowchart of a computerized method for providing live content from a service delivery apparatus (SDA) 110. In S610, a request is received from a user node (UN) for content, the request including a content identification (CID), and a live content source or host, from which to receive the content. The request may further include a content collection identification (CCID), wherein the CCID includes a plurality of CIDs. In certain exemplary embodiments, a CCID may be generated by a system, such as an SDA. In S620, it is determined if the content needs to be acquired in the SDA. Such determination may be performed, for example, by the methods disclosed herein. If it is determined to be acquired, execution continues to S630, otherwise execution continues to S610. In S630, the content of the CID is acquired in a fast access memory of the SDA. In certain exemplary embodiments where the request includes a CCID, or where one is generated, content of each CID in the CCID is acquired. In some exemplary embodiments, the CCID is continuously updated with at least a new CID. In some exemplary embodiments, an SDA may include a storage, such as storage 220, and a fast access memory. The storage 220 may store content which does not require fast access, and may be implemented as a magnetic storage device. The fast access memory may be implemented, for example, as a random-access memory (RAM) or a solid-state drive (SSD) which is able to provide content faster than storage 220. This is particularly advantageous for an SDA which provides, for example, both video-on-demand (VOD) and live broadcasts. Typically, it is efficient to store VOD content in a storage, and live broadcast in a fast access memory. The nature of live broadcasts is such that content is needed to a user node for a typically short window of time. Some content sources allow user nodes to access portions of content for a predefined period of time. For example, a sports game may be accessible up to two hours after the initial broadcast, allowing a user of a UN to access the content from the beginning. In S640, a redirect instruction is sent to the UN to redirect traffic from the host to the SDA. In S650, the content is sent to the UN from the SDA.


A CCID may contain CIDs which correspond to a time frame of the live broadcast. In such an exemplary embodiment, new CIDs may be added and older CIDs may be removed from the CCID as a function of time. A time frame may be determined by the SDA, after a content corresponds to an old CID, which was removed from the CCID, is removed from the fast access memory. In certain exemplary embodiments, the content may be stored in the storage 220 once it is removed from the fast access memory. In some exemplary embodiments, it may be further advantageous to distinguish a live event from live channels. A live channel may be, for example, a television channel with regular programming, which further broadcasts over internet protocol, and thus differs from regular content by not having a predefined content time length. A live event is a single event which is not a regular broadcast, such as election coverage, monarch's coronation, a finals game in sports, etc. Such events may or may not have a predefined content time length.


In certain example embodiments where a UN requests live content from a content source, a redirect request may be sent to the UN before the content is acquired by the SDA. By sending the redirect instruction before the content is acquired, the SDA is able to serve more UNs than were the content first acquired and then redirect instructions are sent.



FIG. 7 is a non-limiting exemplary network sequence diagram of a plurality of user nodes requesting content from a content source according to an exemplary embodiment. UNs 1 through 3 send a request to a CS for a content. A DPI unit of an SDA receives the requests, and the SDA determines to begin acquisition of the content. UNs 3 and 4 send a request for the content from the CS. The DPI unit receives the responses from UNs 1 through 5 after each UNs completes the acquisition of the content. Once the content is acquired and saved in the fast access memory of the SDA110, upon receiving requests from UNs 6 and 7, a redirect instruction is sent to UNs 6 and 7 to request the content from the SDA. In this configuration, the SDA is able to serve UNs 6 and 7.



FIG. 8 is a non-limiting exemplary network sequence diagram of a plurality of user nodes requesting content from a content source according to another exemplary embodiment. UNs 1 through 3 send a request to a CS for a content. A DPI unit of an SDA receives the requests, and the SDA determines to begin acquisition of the content. UNs 4 and 5 send a request for the content from the CS. A redirect instruction is sent from the SDA to UNs 4 and 5. The DPI unit receives the responses from UNs 1 through 3 after each UNs completes the acquisition of the content. While the content is acquired and stored in the fast access memory of the SDA 110, UNs 4 and 5 receive content from the SDA. Upon receiving requests from UNs 6 and 7, a redirect instruction is sent to UNs 6 and 7 to request the content from the SDA. In this configuration, the SDA is able to serve UNs 4 through 7, by redirecting UNs 4 and 5 before acquisition of the content is complete.


The principles disclosed may be implemented as hardware, firmware, software or any combination thereof. Moreover, the software is preferably implemented as an application program tangibly embodied in a program storage unit or computer readable medium. The application program may be uploaded to, and executed by a machine comprising any suitable architecture. Preferably, the machine is implemented on a computer platform having hardware such as one or more central processing units (“CPUs”), a memory, and input/output interfaces. The computer platform may also include an operating system and a microinstruction code. The various processes and functions described herein may be either part of the microinstruction code or part of the application program, or any combination thereof, which may be executed by a CPU, whether or not such computer or processor is explicitly shown. In addition, various other peripheral units may be connected to the computer platform such as an additional data storage unit, a printing unit, and/or display unit.


All examples and conditional languages recited herein are intended for pedagogical purposes to aid the reader in understanding the principles disclosed and the concepts contributed by the inventor to furthering the art, and are to be construed as being without limitation to such specifically recited examples and conditions. Moreover, all statements herein reciting principles, aspects, and embodiments, as well as specific examples thereof, are intended to encompass both structural and functional equivalents thereof. Additionally, it is intended that such equivalents include both currently known equivalents as well as equivalents developed in the future, i.e., any elements developed that perform the same function, regardless of structure.

Claims
  • 1. A method for providing live content from a service delivery apparatus (SDA), comprising: identifying by the SDA a live content, wherein the live content includes a content identification (CID) and is provided by a content source (CS);acquiring the live content designated by the CID to store in a fast access memory of the SDA, wherein the SDA includes the fast access memory and a slow access storage; andproviding the live content from the fast access memory to a user node (UN) in response to receiving a request for the live content, the request comprising at least the CID,wherein the CID corresponding to the live content is added to or removed from the fast access memory as a function of time.
  • 2. The method of claim 1, wherein providing the live content from the fast access memory of the SDA to the UN further comprises: sending a redirect instruction to the UN to redirect future requests from the CS to the SDA.
  • 3. The method of claim 1, wherein providing the live content to the UN in tandem to the content being acquired by the SDA reduces latency.
  • 4. The method of claim 1, wherein the fast access memory is one of a random-access memory (RAM) and a solid-state drive (SSD).
  • 5. The method of claim 1, wherein one or more video-on-demand (VOD) content is stored in the storage and one or more live content is stored in the fast access memory.
  • 6. The method of claim 1, further comprising: detecting a content collection identification (CCID), wherein the CCID includes at least the CID.
  • 7. The method of claim 6, wherein the CCID is generated by the CS.
  • 8. The method of claim 6, further comprising: acquiring each CID of the CCID from the CS to the SDA.
  • 9. The method of claim 6, further comprising: acquiring continuously CIDs to the SDA, wherein the CCID is continuously updated by the CS with at least a new CID, the new CID not present prior in the CCID.
  • 10. The method of claim 6, further comprising: detecting that an old CID was removed from the CCID;determining a time period during which the content of the old CID is stored in the SDA; anddeleting the content of the old CID from the SDA after the time period has elapsed.
  • 11. The method of claim 10, wherein the removed old CID is stored in the storage.
  • 12. A service delivery apparatus (SDA) for providing live content from a content source (CS) to at least a user node, comprising: a first network interface to sniff traffic between at least a first portion of a network and at least a second portion of a network;a second network interface configured to communicate with the at least a first portion of a network and the at least a second portion of a network;a fast access memory;a slow access storage;a processing unit; anda memory containing instructions that when executed by the processing unit causes the SDA to:identify a live content, wherein the live content includes a content identification (CID) and is provided by a content source (CS);acquire the live content designated by the CID to store in the fast access memory of the SDA; andprovide the live content from the fast access memory to a user node (UN) in response to receiving a request for the live content, the request comprising at least the CID,wherein the CID corresponding to the live content is added to or removed from the fast access memory as a function of time.
CROSS-REFERENCE TO RELATED PATENT APPLICATION

This application is a continuation of U.S. patent application Ser. No. 15/078,543 filed on Mar. 23, 2016, now allowed. The Ser. No. 15/078,543 is a continuation-in-part application co-pending with the U.S. patent application Ser. No. 13/006,785, filed on Jan. 14, 2011, now U.S. Pat. No. 9,723,073, which claims priority from U.S. provisional patent application 61/375,836 filed on Aug. 22, 2010, all assigned to common assignee and are incorporated herein in their entireties by reference. This application claims priority from U.S. provisional patent application 62/140,067 filed on Mar. 30, 2015 and U.S. provisional patent application 62/146,266 filed on Apr. 11, 2015, the contents of both applications are hereby incorporated by reference into this application.

US Referenced Citations (94)
Number Name Date Kind
5790176 Craig Aug 1998 A
5829046 Tzelnic et al. Oct 1998 A
5893140 Vahalia et al. Apr 1999 A
5933603 Vahalia et al. Aug 1999 A
5944789 Tzelnic et al. Aug 1999 A
5948062 Tzelnic et al. Sep 1999 A
6049530 Petersen et al. Apr 2000 A
6061504 Tzelnic et al. May 2000 A
6363413 Kidder Mar 2002 B2
6536037 Guheen et al. Mar 2003 B1
6615166 Guheen et al. Sep 2003 B1
6700889 Nun Mar 2004 B1
6772193 Igawa et al. Aug 2004 B1
6799248 Scherr Sep 2004 B2
6823401 Feather et al. Nov 2004 B2
6831893 Nun et al. Dec 2004 B1
6985956 Luke et al. Jan 2006 B2
6986018 O'Rourke et al. Jan 2006 B2
7149698 Guheen et al. Dec 2006 B2
7281260 Puente et al. Oct 2007 B2
7310480 Maciocco et al. Dec 2007 B2
7349979 Cieslak et al. Mar 2008 B1
7436830 Ben-Nun et al. Oct 2008 B2
7596664 Ishikawa et al. Sep 2009 B2
7606314 Coleman et al. Oct 2009 B2
7685254 Pandya Mar 2010 B2
7697557 Segel Apr 2010 B2
7719966 Luft et al. May 2010 B2
7818402 Zhang Oct 2010 B1
7912921 O'Rourke et al. Mar 2011 B2
7957396 Kohn et al. Jun 2011 B1
8065559 Kamath et al. Nov 2011 B2
8600830 Hoffberg Dec 2013 B2
8607166 Jalon et al. Dec 2013 B2
8621101 Starr et al. Dec 2013 B1
8706900 Carver et al. Apr 2014 B2
8937942 Li et al. Jan 2015 B1
8959299 Ngo Feb 2015 B2
20010049732 Raciborski et al. Dec 2001 A1
20010051980 Raciborski et al. Dec 2001 A1
20020006124 Jimenez et al. Jan 2002 A1
20020040366 Lahr Apr 2002 A1
20020040404 Lahr Apr 2002 A1
20020042817 Lahr Apr 2002 A1
20020048269 Hong et al. Apr 2002 A1
20020062372 Hong et al. May 2002 A1
20020136204 Chen et al. Sep 2002 A1
20030097443 Gillett et al. May 2003 A1
20030106064 Plourde, Jr. Jun 2003 A1
20030221127 Risan et al. Nov 2003 A1
20040128693 Weigand Jul 2004 A1
20040133776 Putzolu Jul 2004 A1
20040181579 Huck et al. Sep 2004 A1
20050015702 Shier et al. Jan 2005 A1
20050022237 Nomura Jan 2005 A1
20050213514 Su et al. Sep 2005 A1
20050289111 Tribble et al. Dec 2005 A1
20060129697 Vange et al. Jun 2006 A1
20060168318 Twiss Jul 2006 A1
20060224687 Popkin et al. Oct 2006 A1
20060271972 Pai et al. Nov 2006 A1
20070050686 Keeton et al. Mar 2007 A1
20070124781 Casey et al. May 2007 A1
20070192474 Decasper et al. Aug 2007 A1
20070244987 Pedersen et al. Oct 2007 A1
20080010381 Barraclough et al. Jan 2008 A1
20080307343 Robert et al. Dec 2008 A1
20090083279 Hasek Mar 2009 A1
20090119734 Deshpande et al. May 2009 A1
20090172565 Jackson et al. Jul 2009 A1
20090193129 Agarwal et al. Jul 2009 A1
20090307757 Groten Dec 2009 A1
20090313437 Sofman et al. Dec 2009 A1
20100054257 Dolganow et al. Mar 2010 A1
20100082774 Pitts Apr 2010 A1
20100115072 Payyappilly et al. May 2010 A1
20100287227 Goel et al. Nov 2010 A1
20110055386 Middleton et al. Mar 2011 A1
20110078343 Resch et al. Mar 2011 A1
20110107185 Grube et al. May 2011 A1
20110141887 Klein et al. Jun 2011 A1
20110153937 Annamalaisami et al. Jun 2011 A1
20120011271 Zhao et al. Jan 2012 A1
20120030212 Koopmans et al. Feb 2012 A1
20120047224 Shemesh et al. Feb 2012 A1
20120047252 Maor et al. Feb 2012 A1
20120057460 Hussain et al. Mar 2012 A1
20120084464 Cochinwala et al. Apr 2012 A1
20120117610 Pandya May 2012 A1
20120124618 Ruiz-Velasco et al. May 2012 A1
20120159329 Chow et al. Jun 2012 A1
20120159558 Whyte et al. Jun 2012 A1
20140108586 Zhao Apr 2014 A1
20160021057 Frost et al. Jan 2016 A1
Non-Patent Literature Citations (2)
Entry
Non-Final Office Action dated Sep. 25, 2012 for U.S. Appl. No. 13/006,785.
Non-Final Office Action dated Jul. 26, 2012 in U.S. Appl. No. 13/006,875.
Related Publications (1)
Number Date Country
20190045239 A1 Feb 2019 US
Provisional Applications (3)
Number Date Country
61375836 Aug 2010 US
62140067 Mar 2015 US
62146266 Apr 2015 US
Continuations (1)
Number Date Country
Parent 15078543 Mar 2016 US
Child 16151868 US
Continuation in Parts (1)
Number Date Country
Parent 13006785 Jan 2011 US
Child 15078543 US