Mobile device equipped with mobile network congestion recognition to make intelligent decisions regarding connecting to an operator network

Abstract
Systems and methods for recognizing congestion in a mobile network to make intelligent decisions regarding connecting to an operator network is disclosed. A mobile device having a local proxy equipped with congestion recognition capabilities can use time elapsed to establish connection with a mobile base station in the mobile network to recognize congestion at the mobile base station. Further, in response to recognizing congestion at the mobile base station, the local proxy can selectively block traffic from the mobile device from traversing the mobile network to reduce signaling overload on the mobile network.
Description
CROSS-REFERENCE TO RELATED APPLICATIONS

The present application claims priority to and benefit from: U.S. Provisional Patent Application No. 61/776,573 titled “MOBILE DEVICE EQUIPPED WITH MOBILE NETWORK CONGESTION RECOGNITION TO MAKE INTELLIGENT DECISIONS REGARDING CONNECTING TO AN OPERATOR NETWORK”, filed on Mar. 11, 2013; U.S. Provisional Patent Application No. 61/818,801 titled “MOBILE DEVICE EQUIPPED WITH MOBILE NETWORK CONGESTION RECOGNITION TO MAKE INTELLIGENT DECISIONS REGARDING CONNECTING TO AN OPERATOR NETWORK”, filed on May 2, 2013; U.S. Provisional Patent Application No. 61/829,965, entitled “MOBILE DEVICE EQUIPPED WITH MOBILE NETWORK CONGESTION RECOGNITION TO MAKE INTELLIGENT DECISIONS REGARDING CONNECTING TO AN OPERATOR NETWORK,” filed on May 31, 2013; and, U.S. Provisional Patent Application No. 61/776,584 entitled “SYSTEMS AND METHODS OF FACILITATING AN OPERATOR TO PROACTIVELY IDENTIFY WEAKNESS AREAS AND POOR PACKET ACCESS IN A WIRELESS NETWORK,” filed Mar. 11, 2013. The aforementioned applications are hereby incorporated by reference in entirety.


This application is related to U.S. patent application Ser. No. 13/956,174 entitled “MOBILE NETWORK CONGESTION RECOGNITION FOR OPTIMIZATION OF MOBILE TRAFFIC,” filed concurrently herewith, and is hereby incorporated by reference in its entirety.


BACKGROUND

Applications on smartphones, tablets and other always on devices constantly signal the mobile network for updates and other data requests. The constant polling from mobile devices puts a burden on the mobile network, causing mobile network congestion. Solutions that involve upgrading operator hardware to Long Term Evolution (LTE) and other technologies has only limited effect on reducing mobile network congestion because of the exponential increase in data traffic from mobile devices.





BRIEF DESCRIPTION OF THE DRAWINGS


FIGS. 1A-1, 1A-2 and 1A-3 depict example signaling for data connection establishment between a mobile device and a base station under different traffic conditions.



FIG. 1B illustrates an example diagram of a system where a host server facilitates management of traffic, content caching, and/or resource conservation between mobile devices (e.g., wireless devices), an application server or content provider, or other servers such as an ad server, promotional content server, or an e-Coupon server in a wireless network (or broadband network) for resource conservation. The host server can further aggregate mobile network congestion reports from multiple mobile devices, perform processing and/or analysis on data from the aggregated congestion reports, and provide a report to mobile network operators to help them understand their mobile network from the mobile device perspective.



FIG. 1C illustrates an example diagram of a proxy and cache system distributed between the host server and a mobile device which facilitates network traffic management between the mobile device, an application server or content provider, or other servers such as an ad server, promotional content server, or an e-Coupon server for resource conservation and content caching. The proxy system distributed among the host server and the mobile device can further detect, generate, and aggregate mobile network congestion reports from multiple mobile devices, process and/or analyze the aggregated congestion reports and provide, on a near real time basis, a report on distribution and occurrence of congestion to mobile network operators.



FIG. 1D illustrates an example diagram of the logical architecture of a distributed proxy and cache system, including a log storage and processing service.



FIG. 1E illustrates an example diagram showing the architecture of client side components in a distributed proxy and cache system, including a congestion detector or recognizer.



FIG. 1F illustrates a diagram of the example components on the server side of the distributed proxy and cache system, including a packet call quality agent.



FIG. 2A illustrates a block diagram depicting an example of client-side components in a distributed proxy and cache system, further including a congestion detector or recognizer



FIG. 2B illustrates a block diagram illustrating additional components in the congestion detector or recognizer shown in the example of FIG. 2A.



FIG. 2C illustrates a block diagram depicting additional components in the user activity module, the application behavior detector and the blocking policy manager shown in the example of FIG. 2A.



FIG. 2D illustrates a block diagram depicting components of a log storage and processing service shown in FIG. 1F.



FIG. 3A illustrates a logic flow diagram of an example method for activating or triggering congestion recognition logic.



FIGS. 3B-3C illustrate logic flow diagrams of an example method for detecting and verifying congestion in the mobile network.



FIG. 4 illustrates a logic flow diagram of an example method for determining and confirming congestion in a mobile network using increase in setup times for establishing connection to the mobile network, reception quality of the connections, and distribution patterns of the connections.



FIG. 5 illustrates a logic flow diagram of an example method for anticipating network congestion by a mobile device.



FIG. 6 illustrates a logic flow diagram of an example method for managing data traffic on a mobile device to reduce network signaling.



FIG. 7 illustrates a logic flow diagram of an example method for optimizing data traffic to reduce network signaling.



FIG. 8 illustrates examples of data sampled and analyzed by the congestion detector or recognizer in detecting and verifying congestion in the mobile network.



FIG. 9 illustrates an example map generated using data from congestion reports aggregated from multiple mobile devices.



FIG. 10 shows a diagrammatic representation of a machine in the example form of a computer system within which a set of instructions, for causing the machine to perform any one or more of the methodologies discussed herein, may be executed.





DETAILED DESCRIPTION

The following description and drawings are illustrative and are not to be construed as limiting. Numerous specific details are described to provide a thorough understanding of the disclosure. However, in certain instances, well-known or conventional details are not described in order to avoid obscuring the description. References to one or an embodiment in the present disclosure can be, but not necessarily are, references to the same embodiment; and, such references mean at least one of the embodiments.


Reference in this specification to “one embodiment” or “an embodiment” means that a particular feature, structure, or characteristic described in connection with the embodiment is included in at least one embodiment of the disclosure. The appearances of the phrase “in one embodiment” in various places in the specification are not necessarily all referring to the same embodiment, nor are separate or alternative embodiments mutually exclusive of other embodiments. Moreover, various features are described which may be exhibited by some embodiments and not by others. Similarly, various requirements are described which may be requirements for some embodiments but not other embodiments.


The terms used in this specification generally have their ordinary meanings in the art, within the context of the disclosure, and in the specific context where each term is used. Certain terms that are used to describe the disclosure are discussed below, or elsewhere in the specification, to provide additional guidance to the practitioner regarding the description of the disclosure. For convenience, certain terms may be highlighted, for example using italics and/or quotation marks. The use of highlighting has no influence on the scope and meaning of a term; the scope and meaning of a term is the same, in the same context, whether or not it is highlighted. It will be appreciated that same thing can be said in more than one way.


Consequently, alternative language and synonyms may be used for any one or more of the terms discussed herein. No special significance is to be placed upon whether or not a term is elaborated or discussed herein. Synonyms for certain terms are provided. A recital of one or more synonyms does not exclude the use of other synonyms. The use of examples anywhere in this specification including examples of any terms discussed herein is illustrative only, and is not intended to further limit the scope and meaning of the disclosure or of any exemplified term. Likewise, the disclosure is not limited to various embodiments given in this specification.


Without intent to limit the scope of the disclosure, examples of instruments, apparatus, methods, and their related results according to the embodiments of the present disclosure are given below. Note that titles or subtitles may be used in the examples for convenience of a reader, which in no way should limit the scope of the disclosure. Unless otherwise defined, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this disclosure pertains. In the case of conflict, the present document, including definitions, will control.


In many instances, mobile network operators are not prepared to handle a signaling storm. As a result, the mobile network operators blindly block user devices (e.g., mobile device) from accessing the network. However, the user device keeps querying the network for access, which requires signaling processing from the already overloaded network. The disclosed technology provides a solution that equips a user device with congestion recognition, which, in case of mobile network congestion, informs a client or local proxy to prevent or block most of the traffic leaving from the user device, and allows only critically important ones to reach the network. Using the disclosed technology, the user device is prevented from querying the congestion network for access, which can worsen the congestion situation.


The disclosed technology provides several advantages. A user device equipped with congestion recognition can detect network congestion independent of other devices. Furthermore, the user device requires no communication with any other network components to avoid adding extra signaling load. The user device having congestion recognition capability is smart enough to anticipate the congestion, without requiring any network infrastructure support and without relying on a specific mobile device chipset or baseband, among others.


Embodiments of the present disclosure include systems and methods of mobile network congestion recognition by a mobile device in a mobile network. Embodiments of the present disclosure further include systems and methods of generating and reporting mobile network congestion reports by a mobile device in a mobile network to a server. Embodiments of the present disclosure also include systems and methods of aggregating mobile network congestion information from mobile devices, and providing the network congestion information to mobile network operators.


In one embodiment, a mobile device equipped with congestion recognition can make a decision about a congestion happening in the operator network. A single mobile device is able to detect the congestion independently from any other mobile devices and without any form of communication with a server side component. The ability to make the determination regarding congestion in the network, independently, is an important feature because under congestion conditions, communication with the device is not guaranteed and any form of communication causes additional load on the already congested network. Each congestion recognition instance on a mobile device decides on its own by studying measurements collected naturally by a local proxy on the mobile device. Once a congestion is recognized in the given operator network by the congestion recognition component, the local proxy in the proxy system (e.g., the distributed proxy system shown in FIG. 1A-1E) applies a blocking policy to minimize the traffic outgoing from the mobile device to ease the congestion.


In one embodiment, congestion can be recognized, determined and/or estimated using one or more indicators of congestion in a network known to or likely known to at the mobile device (e.g., by the local proxy). For example, one of these indicators can include an amount of time it takes the mobile device to turn on a radio after a request to turn on a radio is received. This request to turn on the radio can be from a request to place a call, a request made by an application, a user's request to access email, or the like. This delay can range from a few hundred milliseconds, 1.5 seconds, up to a few more seconds. Depending on the delay after which the radio turns on, and/or in combination with one or more other indicators known to the mobile device, the mobile device can make a decision with respect to the given mobile network regarding whether to attempt to connect to the mobile network or to wait to connect to the mobile network for a given amount of time, or to apply an intelligent algorithm based on a computed level of congestion to determine an optimal amount of time to wait before re-attempting to reconnect.


In a further embodiment, false positives in identifying or detecting congestion is reduced or eliminated based on other indications such as whether the mobile device is stationary or in motion, the number of base stations the mobile device connects to in a given amount of time, geographical locale, signal quality, network equipment characteristics, or the like.



FIGS. 1A-1, 1A-2 and 1A-3 depict example signaling for radio resource control (RRC) connection establishment between a mobile device and a base station under different traffic conditions.


The RRC protocol on the radio interface between a user device 150 and a radio access network (RAN) that includes a base station 112 is used for handling the control plane signaling. The RRC protocol allows for connection establishment and release and radio bearer establishment/reconfiguration and release, among others. The RRC exists in two modes, the idle mode and the connected mode. Referring to FIG. 1A-1, when the user device 150 is in the low or idle state 170a, the user device has no radio connection with the base station 112 in the radio access network, and is not involved in a voice call, data transfer, etc. In order to transition from the idle state 170a to connected (or high) state 184a, the mobile device 150 initiates an RRC connection request 176a towards the base station 112. The RRC connection request 176a can be initiated in response to a trigger from the mobile device (e.g., sending an email, making a call, or the like), or from the network (e.g., an incoming SMS message, a voice call, or the like). For example, the RRC connection request 176a can be in response to detecting or intercepting a data request 172a. Following a three-way handshake (176a, 180a and 182a, for example) between the user device 150 and the base station 112, the RRC state of the user equipment changes from idle to connected (e.g., DCH state). In an instance where the base station 112 is not congested, the setup time for establishing the connection between the mobile device 150 and the base station 112 is measured as the time difference T1 between detecting or intercepting of the data request 172a and transition to connected state 184a from idle state.


Referring to FIG. 1A-2, when the base station 112 is congested, the time to transition from idle RRC state 170b to connected RRC state 184b is longer than T1. As a large number of mobile devices attempt to establish a connection with the base station 112, it takes longer for the base station 112 to complete the three-way handshake (176b, 180b and 182b, for example). This results in an increase in the setup time to T2 from T1. Referring to FIG. 1A-3, as before, on detecting or intercepting a data request 172c while the user device 150 is in idle state 170c, the user device 150 sends an RRC connection request 176c towards the base station 112. However, when the base station 112 reaches a critical level of congestion, the base station 112 (i.e., the operator) has its own mechanism to deal with the congestion by rejecting the connection requests 176c from the user device 150 attempting to establish a radio connection. However, the network operator's mechanism for sending an RRC connection reject message 186c is triggered only when the congestion reaches a critical level. Further, some operators may only indicate the cause of the rejection (i.e., congestion) in the rejection message, while others may indicate a wait time. The user device 150 then either continues to send connection requests to the network to check for access, or waits until the wait time is over, before sending connection requests to check for access. In either situation, signaling continues, and can further exacerbate congestion at the network.


User devices equipped with congestion recognition can recognize the increase in time to transition to a connected state when a radio connection request is received, and can implement a blocking policy on the traffic from the mobile device to the base station to reduce or prevent further signaling to the base station which can worsen congestion.



FIG. 1B illustrates an example diagram of a system where a host server 100 facilitates management of traffic, content caching, and/or resource conservation between mobile devices 150 (e.g., wireless devices), an application server 110 or content provider, or other servers such as an ad server 120a, promotional content server 120b, or an e-Coupon server 120c in a wireless network (or broadband network) for resource conservation. The host server can further aggregate mobile network congestion reports from multiple mobile devices, perform processing and/or analysis on data from the aggregated congestion reports, and provide a report to mobile network operators to help them understand their mobile network from the mobile device perspective.


The client devices 150 can be any system and/or device, and/or any combination of devices/systems that is able to establish a connection, including wired, wireless, cellular connections with another device, a base station 112, a server and/or other systems such as host server 100 and/or application server/content provider 110. Client devices 150 will typically include a display and/or other output functionalities to present information and data exchanged between among the devices 150 and/or the host server 100 and/or application server/content provider 110. The application server/content provider 110 can by any server including third party servers or service/content providers further including advertisement, promotional content, publication, or electronic coupon servers or services. Similarly, separate advertisement servers 120a, promotional content servers 120b, and/or e-Coupon servers 120c as application servers or content providers are illustrated by way of example.


For example, the client/mobile devices 150 can include mobile, hand held or portable devices, wireless devices, or non-portable devices and can be any of, but not limited to, a server desktop, a desktop computer, a computer cluster, or portable devices, including a notebook, a laptop computer, a handheld computer, a palmtop computer, a mobile phone, a cell phone, a smartphone, a PDA, a Blackberry device, a Palm device, any tablet, a phablet (a class of smartphones with larger screen sizes between a typical smartphone and a tablet), a handheld tablet (e.g., an iPad, the Galaxy series, the Nexus, the Kindles, Kindle Fires, any Android-based tablets, Windows-based tablets, or any other tablet), any portable readers/reading devices, a hand held console, a hand held gaming device or console, a head mounted device, a head mounted display, a thin client or any superphone such as the iPhone, and/or any other portable, mobile, hand held devices, or fixed wireless interface such as a M2M device, etc. In one embodiment, the client devices 150 (or mobile devices 150), host server 100, and application server 110 are coupled via a network 106 and/or a network 108. In some embodiments, the devices 150 and host server 100 may be directly connected to one another.


The input mechanism on client devices 150 can include touch screen keypad (including single touch, multi-touch, gesture sensing in 2D or 3D, etc.), a physical keypad, a mouse, a pointer, a track pad, a stylus, a stylus detector/sensor/receptor, motion detector/sensor (e.g., including 1-axis, 2-axis, 3-axis accelerometer, etc.), a face detector/recognizer, a retinal detector/scanner, a light sensor, capacitance sensor, resistance sensor, temperature sensor, proximity sensor, a piezoelectric device, device orientation detector (e.g., electronic compass, tilt sensor, rotation sensor, gyroscope, accelerometer), or any combination of the above.


Signals received or detected indicating user activity at client devices 150 through one or more of the above input mechanism, or others, can be used in the disclosed technology in acquiring context awareness at the client device 150. Context awareness at client devices 150 generally includes, by way of example but not limitation, client device 150 operation or state acknowledgement, management, user activity/behavior/interaction awareness, detection, sensing, tracking, trending, and/or application (e.g., mobile applications) type, behavior, activity, operating state, etc.


Context awareness in the present disclosure also includes knowledge and detection of network side contextual data and can include network information such as network capacity, bandwidth, traffic, type of network/connectivity, and/or any other operational state data. Network side contextual data can be received from and/or queried from network service providers (e.g., cell provider 112 and/or Internet service providers) of the network 106 and/or network 108 (e.g., by the host server and/or devices 150). In addition to application context awareness as determined from the client 150 side, the application context awareness may also be received from or obtained/queried from the respective application/service providers 110 (by the host 100 and/or client devices 150).


The host server 100 can use, for example, contextual information obtained for client devices 150, networks 106/108, applications (e.g., mobile applications), application server/provider 110, or any combination of the above, to manage the traffic in the system to satisfy data needs of the client devices 150 (e.g., to satisfy application or any other request including HTTP request). In one embodiment, the traffic is managed by the host server 100 to satisfy data requests made in response to explicit or non-explicit user 103 requests and/or device/application maintenance tasks. The traffic can be managed such that network consumption, for example, use of the cellular network is conserved for effective and efficient bandwidth utilization. In addition, the host server 100 can manage and coordinate such traffic in the system such that use of device 150 side resources (e.g., including but not limited to battery power consumption, radio use, processor/memory use) are optimized with a general philosophy for resource conservation while still optimizing performance and user experience. The host server 100 may also indirectly manage traffic via creation, selection and/or deployment of traffic blocking policy for implementation on the mobile device in some embodiments.


For example, in context of battery conservation, the device 150 can observe user activity (for example, by observing user keystrokes, backlight status, or other signals via one or more input mechanisms, etc.) and alters device 150 behaviors. The device 150 can also request the host server 100 to alter the behavior for network resource consumption based on user activity or behavior.


In one embodiment, the traffic management for resource conservation is performed using a distributed system between the host server 100 and client device 150. The distributed system can include proxy server and cache components on the server side 100 and on the device/client side, for example, as shown by the server cache 135 on the server 100 side and the local cache 185 on the client 150 side. In one embodiment, the traffic management for reducing signaling in the network and reducing or alleviating network congestion can be implemented on the mobile device 150 without any support from the server-side proxy or other network-side components.


In yet another embodiment, the traffic management can be triggered upon detection of congestion at the base stations 112 to which the client devices 150 is connected to or is attempting to connect to. The traffic management includes selection and/or application of a blocking policy to, for example, selectively or completely block traffic from the client devices so that signaling towards the base station 112 is reduced or eliminated. For example, a blocking policy that allows only high priority traffic towards the base station can be implemented when congestion is detected at the base station. By way of another example, a blocking policy that allows traffic from certain applications towards the base station can be implemented to manage congestion at the base station.


Functions and techniques disclosed for context aware traffic management for resource conservation in networks (e.g., network 106 and/or 108) and devices 150, reside in a distributed proxy and cache system. The proxy and cache system can be distributed between, and reside on, a given client device 150 in part or in whole and/or host server 100 in part or in whole. The distributed proxy and cache system are illustrated with further reference to the example diagram shown in FIG. 1C. Functions and techniques performed by the proxy and cache components in the client device 150 and the related components therein are described, respectively, in detail with further reference to the examples of FIG. 2A.


In one embodiment, client devices 150 communicate with the host server 100 and/or the application server 110 over network 106, which can be a cellular network and/or a broadband network. To facilitate overall traffic management between devices 150 and various application servers/content providers 110 to implement network (bandwidth utilization) and device resource (e.g., battery consumption), the host server 100 can communicate with the application server/providers 110 over the network 108, which can include the Internet (e.g., a broadband network).


In general, the networks 106 and/or 108, over which the client devices 150, the host server 100, and/or application server 110 communicate, may be a cellular network, a broadband network, a telephonic network, an open network, such as the Internet, or a private network, such as an intranet and/or the extranet, or any combination thereof. For example, the Internet can provide file transfer, remote log in, email, news, RSS, cloud-based services, instant messaging, visual voicemail, push mail, VoIP, and other services through any known or convenient protocol, such as, but is not limited to the TCP/IP protocol, UDP, HTTP, DNS, FTP, UPnP, NSF, ISDN, PDH, RS-232, SDH, SONET, etc.


The networks 106 and/or 108 include any collection of distinct networks operating wholly or partially in conjunction to provide connectivity to the client devices 150 and the host server 100 and may appear as one or more networks to the serviced systems and devices. In one embodiment, communications to and from the client devices 150 can be achieved by, an open network, such as the Internet, or a private network, broadband network, such as an intranet and/or the extranet. In one embodiment, communications can be achieved by a secure communications protocol, such as secure sockets layer (SSL), or transport layer security (TLS).


In addition, communications can be achieved via one or more networks, such as, but are not limited to, one or more of WiMax, a Local Area Network (LAN), Wireless Local Area Network (WLAN), a Personal area network (PAN), a Campus area network (CAN), a Metropolitan area network (MAN), a Wide area network (WAN), a Wireless wide area network (WWAN), or any broadband network, and further enabled with technologies such as, by way of example, Global System for Mobile Communications (GSM), Personal Communications Service (PCS), Bluetooth, WiFi, Fixed Wireless Data, 2G, 2.5G, 3G (e.g., WCDMA/UMTS based 3G networks), 4G, IMT-Advanced, pre-4G, LTE Advanced, mobile WiMax, WiMax 2, WirelessMAN-Advanced networks, enhanced data rates for GSM evolution (EDGE), General packet radio service (GPRS), enhanced GPRS, iBurst, UMTS, HSPDA, HSUPA, HSPA, HSPA+, UMTS-TDD, 1xRTT, EV-DO, messaging protocols such as, TCP/IP, SMS, MMS, extensible messaging and presence protocol (XMPP), real time messaging protocol (RTMP), instant messaging and presence protocol (IMPP), instant messaging, USSD, IRC, or any other wireless data networks, broadband networks, or messaging protocols.



FIG. 1C illustrates an example diagram of a proxy and cache system distributed between the host server and a mobile device which facilitates network traffic management between the mobile device, an application server or content provider, or other servers such as an ad server, promotional content server, or an e-Coupon server for resource conservation and content caching. The proxy system distributed among the host server and the mobile device can further detect, generate and aggregate mobile network congestion reports from multiple mobile devices, process and/or analyze the aggregated congestion reports and provide, on a near real time basis, a report on distribution and occurrence of congestion to mobile network operators.


The distributed proxy and cache system can include, for example, the proxy server 125 (e.g., remote proxy) and the server cache 135 components on the server side. The server-side proxy 125 and cache 135 can, as illustrated, reside internal to the host server 100. In addition, the proxy server 125 and cache 135 on the server-side can be partially or wholly external to the host server 100 and in communication via one or more of the networks 106 and 108. For example, the proxy server 125 may be external to the host server and the server cache 135 may be maintained at the host server 100. Alternatively, the proxy server 125 may be within the host server 100 while the server cache is external to the host server 100. In addition, each of the proxy server 125 and the cache 135 may be partially internal to the host server 100 and partially external to the host server 100. The application server/content provider 110 can by any server including third party servers or service/content providers further including advertisement, promotional content, publication, or electronic coupon servers or services. Similarly, separate advertisement servers 120a, promotional content servers 120b, and/or e-Coupon servers 120c as application servers or content providers are illustrated by way of example.


The distributed system can also include, in one embodiment, client-side components, including by way of example but not limitation, a local proxy 175 (e.g., a mobile client on a mobile device) and/or a local cache 185, which can, as illustrated, reside internal to the device 150 (e.g., a mobile device).


In addition, the client-side proxy 175 and local cache 185 can be partially or wholly external to the device 150 and in communication via one or more of the networks 106 and 108. For example, the local proxy 175 may be external to the device 150 and the local cache 185 may be maintained at the device 150. Alternatively, the local proxy 175 may be within the device 150 while the local cache 185 is external to the device 150. In addition, each of the proxy 175 and the cache 185 may be partially internal to the host server 100 and partially external to the host server 100.


In one embodiment, the distributed system can include an optional caching proxy server 199. The caching proxy server 199 can be a component which is operated by the application server/content provider 110, the host server 100, or a network service provider 112, and or any combination of the above to facilitate network traffic management for network and device resource conservation. Proxy server 199 can be used, for example, for caching content to be provided to the device 150, for example, from one or more of, the application server/provider 110, host server 100, and/or a network service provider 112. Content caching can also be entirely or partially performed by the remote proxy 125 to satisfy application requests or other data requests at the device 150.


In context aware traffic management and optimization for resource conservation and/or congestion alleviation in a network (e.g., cellular or other wireless networks), characteristics of user activity/behavior and/or application behavior at a mobile device (e.g., any wireless device) 150 can be tracked by the local proxy 175 and communicated, over the network 106 to the proxy server 125 component in the host server 100, for example, as connection metadata. The proxy server 125 which in turn is coupled to the application server/provider 110 provides content and data to satisfy requests made at the device 150. The local proxy 175 can further detect congestion at the network, implement traffic management strategies to ease the congestion at the network, and regularly report on detection of congestion to the proxy server 125 or the host server 100.


In addition, the local proxy 175 can identify and retrieve mobile device properties, including one or more of, battery level, network that the device is registered on, radio state, signal strength, cell identifier (i.e., cell ID), location area code, or whether the mobile device is being used (e.g., interacted with by a user). In some instances, the local proxy 175 can delay, expedite (prefetch), and/or modify data prior to transmission to the proxy server 125, when appropriate, as will be further detailed with references to the description associated with the examples of FIG. 2A.


The local database 185 can be included in the local proxy 175 or coupled to the local proxy 175 and can be queried for a locally stored response to the data request prior to the data request being forwarded on to the proxy server 125. Locally cached responses can be used by the local proxy 175 to satisfy certain application requests of the mobile device 150, by retrieving cached content stored in the cache storage 185, when the cached content is still valid.


Similarly, the proxy server 125 of the host server 100 can also delay, expedite, or modify data from the local proxy prior to transmission to the content sources (e.g., the application server/content provider 110). In addition, the proxy server 125 uses device properties and connection metadata to generate rules for satisfying request of applications on the mobile device 150. The proxy server 125 can gather real time traffic information about requests of applications for later use in optimizing similar connections with the mobile device 150 or other mobile devices. The proxy server 125 can further aggregate reports on detection of congestion from multiple mobile devices to provide reports on congestion distribution and timing patterns and other information to operators of the networks.


In general, the local proxy 175 and the proxy server 125 are transparent to the multiple applications executing on the mobile device. The local proxy 175 is generally transparent to the operating system or platform of the mobile device and may or may not be specific to device manufacturers. In some instances, the local proxy 175 is optionally customizable in part or in whole to be device specific. In some embodiments, the local proxy 175 may be bundled into a wireless model, a firewall, and/or a router.


In one embodiment, the host server 100 can in some instances, utilize the store and forward functions of a short message service center (SMSC) 112, such as that provided by the network service provider, in communicating with the device 150 in achieving network traffic management. Note that SMSC 112 can also utilize any other type of alternative channel including USSD or other network control mechanisms. The host server 100 can forward content or HTTP responses to the SMSC 112 such that it is automatically forwarded to the device 150 if available and for subsequent forwarding if the device 150 is not currently available.


In general, the disclosed distributed proxy and cache system allows optimization of network usage, for example, by serving requests from the local cache 185, the local proxy 175 reduces the number of requests that need to be satisfied over the network 106. Further, the local proxy 175 and the proxy server 125 may filter irrelevant data from the communicated data. In addition, the local proxy 175 and the proxy server 125 can also accumulate low priority data and send it in batches to avoid the protocol overhead of sending individual data fragments. The local proxy 175 and the proxy server 125 can also compress or transcode the traffic, reducing the amount of data sent over the network 106 and/or 108. The signaling traffic in the network 106 and/or 108 can be reduced, as the networks are now used less often and the network traffic can be synchronized among individual applications. Further, by recognizing signs or indications of congestion at the network earlier, the local proxy 175 can proactively manage signaling from the mobile device towards the network to mitigate or ease congestion at the network, and prevent the congestion at the network from reaching a critical level whereby the network operator is forced to blindly reject mobile devices attempting to connect to the network.


With respect to the battery life of the mobile device 150, by serving application or content requests from the local cache 185, the local proxy 175 can reduce the number of times the radio module is powered up. The local proxy 175 and the proxy server 125 can work in conjunction to accumulate low priority data and send it in batches to reduce the number of times and/or amount of time when the radio is powered up. The local proxy 175 can synchronize the network use by performing the batched data transfer for all connections simultaneously. Furthermore, by preventing the mobile device from constantly attempting to signal the network that is congested, and/or allowing selective (e.g., high priority traffic) towards the network, the local proxy 175 can conserve battery resources of the mobile device.



FIG. 1D illustrates an example diagram of the logical architecture of a distributed proxy and cache system. The distributed system can include, for example the following components:


Client Side Proxy 175: a component installed in a smartphone, mobile device or wireless device 150 that interfaces with device's operating system, as well as with data services and applications installed in the device. The client side proxy 175 is typically compliant with and able to operate with standard or state of the art networking protocols. Additional components and features of the client-side proxy 175 are illustrated with further references to the examples of FIG. 2A.


The server side proxy 125 can include one or more servers that can interface with third party application servers (e.g., 199), mobile operator's network (which can be proxy 199 or an additional server that is not illustrated) and/or the client side proxy 175. In general, the server side proxy 125 can be compliant with and is generally able to operate with standard or state of the art networking protocols and/or specifications for interacting with mobile network elements and/or third party servers. Some components and features of the server-side proxy 125 are illustrated with further references to the examples of FIG. 1F and FIG. 2D.


Log Storage and Processing Service (LSPS) 174: The log storage and processing service, server, system or component 174 can provide reporting and usage analytics services. The LSPS 174 can collect information (e.g., logs) from the client side 175 and/or the server side 125 and provide the necessary tools for producing reports and usage analytics can be used for analyzing traffic and signaling data. The client logs (e.g., logs on the client device 150 aggregated by the local proxy 175) are stored in the device until a data channel is activated, and then are transferred in binary format to the LSPS 174. In one embodiment, the logs are processed using log processing tools provided by the LSPS 174. The processed logs are subsequently stored in a distributed database. The logs may be used for reporting as well as for troubleshooting issues. For example, analytics from the logs can be used by the proxy system in managing, reducing or optimizing network traffic or by the network operator in monitoring their networks for possible improvements and enhancements. Note that LSPS 174 as illustrated, may be a server separate from the server-side proxy 125, or it may be a component of the server-side proxy 125, residing partially or wholly therein.


In one implementation, the level of logging (e.g., types of data to be logged, and the like) can be specified using configuration settings in the client-side proxy 175 and/or the server-side proxy 125. Various data relating to bytes and transactions, network connectivity, power, subscriber count, and the like may be logged, and/or processed using default (or another) settings on a periodic (e.g., hourly, daily, and the like) basis.


Bytes and Transactions data may include a number of bytes transacted (both to and from), total number of transactions between the client-side proxy 175 and each application, the client-side proxy 175 and the network (e.g., radio access network 112), the client-side proxy 175 and its cache, and the like. Network Connectivity data may include, for example, total time the device spends in “data connected” state (based on a two-state connectivity model), total number of transitions into the data connected state, the number of times the radio transitions into the data connected state due to a network request that was proxied through the client-side proxy 175, total time spent in the data connected state due to a network request that was proxied through the client-side proxy 175 the number of transitions into data connected mode saved by the client-side and/or server-side proxy system, the amount of time in data connected state saved by the client-side and/or server-side proxy system, simulated values for the previous four items, as if traffic proxied via client-side and/or server-side proxy system were the only traffic on the device. Network connectivity data can also include the amount of time taken to transition from an idle state to connected state (i.e., setup time), a baseline or a reference determined from a sample of setup times, and the like. Power related data may include, for example, each one-percent (or any other percentage value) change in the battery level, the total time the device is powered on but not connected to a power source, and the like. Subscriber count data may include, for example, the number of new subscribers observed in a period and the number of active subscribers in the period. This data may be aggregated by the host server, for example. Reporting of the above data can be done based on variables such as network bearer type (e.g., all, mobile or Wi-Fi), category (e.g., all, device model or application name), time (e.g., hour, day or month), and the like, or combinations thereof.



FIG. 1E illustrates an example diagram showing the architecture of client-side components in a distributed proxy and cache system, including a congestion detector or recognizer.


The client side proxy components 175 can include software components or agents installed on the mobile device that enables traffic optimization and performs the related functionalities on the client side. Components of the client side proxy 175 can operate transparently for end users and applications 163, and interface with the device's operating system (OS) 162. The client side proxy 175 can be installed on mobile devices for optimization to take place, and it can effectuate changes on the data routes and/or timing. Once data routing is modified, the client side proxy 175 can respond to application requests to service providers or host servers, in addition to or instead of letting those applications 163 access data network directly. In general, applications 163 on the mobile device will not notice that the client side proxy 175 is responding to their requests.


Some example components of the client side proxy 175 are described as follows:


Device State Monitor 121: The device state monitor 121 can be responsible for identifying several states and metrics in the device, such as network status, display status, battery level (e.g., via the radio/battery information 161), etc., such that the remaining components in the client side proxy 175 can operate and make decisions according to device state, acting in an optimal way in each state.


Traffic Recognizer 122: The traffic recognizer 122 analyzes all traffic between the wireless device applications 163 and their respective host servers in order to identify recurrent patterns. Supported transport protocols include, for example, DNS, HTTP and HTTPS, such that traffic through those ports is directed to the client side proxy 175. While analyzing traffic, the client side proxy 175 can identify recurring polling patterns which can be candidates to be performed remotely by the server side proxy 125, and send to the protocol optimizer 123.


Protocol Optimizer 123: The protocol optimizer 123 can implement the logic of serving recurrent request from the local cache 185 instead of allowing those request go over the network to the service provider/application host server. One of its tasks is to eliminate or minimize the need to send requests to the network, positively affecting network congestion and device battery life.


Local Cache 185: The local cache 185 can store responses to recurrent requests, and can be used by the Protocol Optimizer 123 to send responses to the applications 163.


Traffic Scheduler 124: The traffic scheduler 124 can temporally move communications to optimize usage of device resources by unifying keep-alive signaling so that some or all of the different applications 163 can send keep-alive messages at the same time (traffic pipelining). Traffic scheduler 124 may also decide to delay transmission of data that is not relevant at a given time (for example, when the device is not actively used).


Policy Manager 125: The policy manager 125 can store and enforce traffic optimization and reporting policies provisioned by a Policy Management Server (PMS) 143. At the client side proxy 175 first start, traffic optimization and reporting policies (policy profiles) that is to be enforced in a particular device can be provisioned by the Policy Management Server. Enforcing traffic management policies at the device's IP later lets an operator manage traffic before it uses radio accessed network resources. Policy usage can range from creating highly targeted subscriber plans to proactively and/or reactively managing network congestion. In one implementation, the conditions for selecting a policy for enforcement, and/or conditions for dropping an implemented policy may be managed or coordinated by the policy manager 125.


Watch Dog 127: The watch dog 127 can monitor the client side proxy 175 operating availability. In case the client side proxy 175 is not working due to a failure or because it has been disabled, the watchdog 127 can reset DNS routing rules information and can restore original DNS settings for the device to continue working until the client side proxy 175 service is restored.


Reporting Agent 126: The reporting agent 126 can gather information (e.g., logs) about the events taking place in the device and sends the information to the log storage and processing service 174, which collects and stores client-side and/or server-side proxy system logs. Event details are stored temporarily in the device and transferred to log storage and processing service 174 only when the data channel state is active. If the client side proxy 175 does not send records within a period of time (e.g., twenty-four hours), the reporting agent 126 may, in one embodiment, attempt to open the connection and send recorded entries or, in case there are no entries in storage, an empty reporting packet. All reporting settings may be configured in the policy management server. The information in the logs may be used for reporting and/or troubleshooting, for example.


Push Client 128: The push client 128 can be responsible for the traffic to between the server side proxy 125 and the client side proxy 175. The push client 128 can send out service requests like content update requests and policy update requests, and receives updates to those requests from the server side proxy 125. In addition, push client 128 can send data to a log storage and processing service 174, which may be internal to or external to the server side proxy 125.


The proxy server 199 has a wide variety of uses, from speeding up a web server by caching repeated requests, to caching web, DNS and other network lookups for a group of clients sharing network resources. The proxy server 199 is optional. The distributed proxy and cache system (125 and/or 175) allows for a flexible proxy configuration using either the proxy 199, additional proxy(s) in operator's network, or integrating both proxies 199 and an operator's or other third-party's proxy.



FIG. 1F illustrates a diagram of the example components on the server side of the distributed proxy and cache system.


The server side 125 of the distributed system can include, for example a relay server 142, which interacts with a traffic harmonizer 144, a polling server 145 and/or a policy management server 143. Each of the various components can communicate with the client side proxy 175, or other third party (e.g., application server/service provider 110 and/or other proxy 199) and/or a reporting and usage analytics system. Some example components of the server side proxy 125 is described as follows:


Relay Server 142: The relay server 142 is the routing agent in the distributed proxy architecture. The relay server 142 manages connections and communications with components on the client-side proxy 175 installed on devices and provides an administrative interface for reports (e.g., congestion reports), provisioning, platform setup, and so on.


Notification Server 141: The notification server 141 is a module able to connect to an operator's SMSC gateways and deliver SMS notifications to the client-side proxy 175. SMS notifications can be used when an IP link is not currently active, in order to avoid the client-side proxy 175 from activating a connection over the wireless data channel, thus avoiding additional signaling traffic. However, if the IP connection happens to be open for some other traffic, the notification server 141 can use it for sending the notifications to the client-side proxy 175. The user database can store operational data including endpoint (MSISDN), organization and Notification server 141 gateway for each resource (URIs or URLs).


Traffic Harmonizer 144: The traffic harmonizer 144 can be responsible for communication between the client-side proxy 175 and the polling server 145. The traffic harmonizer 144 connects to the polling server 145 directly or through the data storage 130, and to the client over any open or proprietary protocol such as the 7TP, implemented for traffic optimization. The traffic harmonizer 144 can be also responsible for traffic pipelining on the server side: if there's cached content in the database for the same client, this can be sent over to the client in one message.


Polling Server 145: The polling server 145 can poll third party application servers on behalf of applications that are being optimized. If a change occurs (i.e. new data available) for an application, the polling server 145 can report to the traffic harmonizer 144 which in turn sends a notification message to the client-side proxy 175 for it to clear the cache and allow application to poll application server directly.


Packet Call Quality Agent 133: The Packet call quality agent 133 can proactively identify weakness areas and poor packet access in a wireless network. Packet call quality agent 133 can utilize the reports generated by the congestion recognizer 164 on the mobile device (e.g., via a local proxy) as illustrated in FIG. 2A to facilitate an operator to proactively identify weakness areas and poor packet access in a wireless network, then translate and map them into operator's cell identifiers and location area codes. This can allow operator to plan their network maintenance and upgrades according to near real time feedback from real subscriber devices. This can then make troubleshooting issues for an operator faster and cheaper.


Policy Management Server 143: The policy management server (PMS) 143 allows administrators to configure and store policies for the client-side proxies 175 (device clients). It also allows administrators to notify the client-side proxies 175 about policy changes. Using the policy management server 143, each operator can configure the policies to work in the most efficient way for the unique characteristics of each particular mobile operator's network.


Log Storage and Processing Service 174: The log storage and processing service 174 collects information (e.g., logs) from the client side 175 and/or from the server side 125, and provides the tools for analyzing and producing reports and usage analytics that operators can use for analyzing application signaling, data consumption, congestion, and the like.



FIG. 2A illustrates a block diagram depicting an example of client-side components in a distributed proxy and cache system, further including a congestion detector or recognizer 164.


A device 250, which can be a portable or mobile device (e.g., any wireless device), such as a portable phone, generally includes, for example, a network interface 208, an operating system 204, a context API 206, and mobile applications which may be proxy-unaware 210 or proxy-aware 220. Note that the device 250 is specifically illustrated in the example of FIG. 2A as a mobile device, such is not a limitation and that device 250 may be any wireless, broadband, portable/mobile or non-portable device able to receive, transmit signals to satisfy data requests over a network including wired or wireless networks (e.g., WiFi, cellular, Bluetooth, LAN, WAN, and the like).


The network interface 208 can be a networking module that enables the device 250 to mediate data in a network with an entity that is external to the host server 250, through any known and/or convenient communications protocol supported by the host and the external entity. The network interface 208 can include one or more of a network adaptor card, a wireless network interface card (e.g., SMS interface, WiFi interface, interfaces for various generations of mobile communication standards including but not limited to 2G, 3G, 3.5G, 4G, LTE, and the like), Bluetooth, or whether or not the connection is via a router, an access point, a wireless router, a switch, a multilayer switch, a protocol converter, a gateway, a bridge, a bridge router, a hub, a digital media receiver, and/or a repeater.


Device 250 can further include, client-side components of the distributed proxy and cache system which can include, a local proxy 275 (e.g., a mobile client of a mobile device) and a cache 285. In one embodiment, the local proxy 275 includes a user activity module 215, a proxy API 225, a request/transaction manager 235, a caching policy manager 245 having an application protocol module 248, a traffic shaping engine 255, and/or a connection manager 265. The traffic shaping engine 255 may further include an alignment module 256 and/or a batching module 257, the connection manager 265 may further include a radio controller 266 and a heartbeat manager 267. The request/transaction manager 235 can further include an application behavior detector 236 and/or a prioritization engine 241, the application behavior detector 236 may further include a pattern detector 237 and/or and application profile generator 239. Device 250 can also include a congestion detector/recognizer 164 and a blocking policy enforcer 178. Additional or less components/modules/engines can be included in the local proxy 275 and each illustrated component.


As used herein, a “module,” “a manager,” a “handler,” a “detector,” an “interface,” a “controller,” a “normalizer,” a “generator,” an “invalidator,” or an “engine” includes a general purpose, dedicated or shared processor and, typically, firmware or software modules that are executed by the processor. Depending upon implementation-specific or other considerations, the module, manager, handler, detector, interface, controller, normalizer, generator, invalidator, or engine can be centralized or its functionality distributed. The module, manager, handler, detector, interface, controller, normalizer, generator, invalidator, or engine can include general or special purpose hardware, firmware, or software embodied in a computer-readable (storage) medium for execution by the processor.


As used herein, a computer-readable medium or computer-readable storage medium is intended to include all mediums that are statutory (e.g., in the United States, under 35 U.S.C. 101), and to specifically exclude all mediums that are non-statutory in nature to the extent that the exclusion is necessary for a claim that includes the computer-readable (storage) medium to be valid. Known statutory computer-readable mediums include hardware (e.g., registers, random access memory (RAM), non-volatile (NV) storage, to name a few), but may or may not be limited to hardware.


In one embodiment, a portion of the distributed proxy and cache system for network traffic management resides in or is in communication with device 250, including local proxy 275 (mobile client) and/or cache 285. The local proxy 275 can provide an interface on the device 250 for users to access device applications and services including email, IM, voicemail, visual voicemail, feeds, Internet, games, productivity tools, or other applications, etc.


The proxy 275 is generally application independent and can be used by applications (e.g., both proxy-unaware and proxy-aware mobile applications 210 and 220 and other mobile applications) to open TCP connections to a remote server (e.g., the server 100 in the examples of FIG. 1B-1C and/or server proxy 125 shown in the examples of FIG. 1B. In some instances, the local proxy 275 includes a proxy API 225 which can be optionally used to interface with proxy-aware applications 220 (or applications (e.g., mobile applications) on a mobile device (e.g., any wireless device)).


The applications 210 and 220 can generally include any user application, widgets, software, HTTP-based application, web browsers, video or other multimedia streaming or downloading application, video games, social network applications, email clients, RSS management applications, application stores, document management applications, productivity enhancement applications, and the like. The applications can be provided with the device OS, by the device manufacturer, by the network service provider, downloaded by the user, or provided by others.


One embodiment of the local proxy 275 includes or is coupled to a context API 206, as shown. The context API 206 may be a part of the operating system 204 or device platform or independent of the operating system 204, as illustrated. The operating system 204 can include any operating system including but not limited to, any previous, current, and/or future versions/releases of, Windows Mobile, iOS, Android, Symbian, Palm OS, Brew MP, Java 2 Micro Edition (J2ME), Blackberry, etc.


The context API 206 may be a plug-in to the operating system 204 or a particular client/application on the device 250. The context API 206 can detect signals indicative of user or device activity, for example, sensing motion, gesture, device location, changes in device location, device backlight, keystrokes, clicks, activated touch screen, mouse click or detection of other pointer devices. The context API 206 can be coupled to input devices or sensors on the device 250 to identify these signals. Such signals can generally include input received in response to explicit user input at an input device/mechanism at the device 250 and/or collected from ambient signals/contextual cues detected at or in the vicinity of the device 250 (e.g., light, motion, piezoelectric, etc.).


In one embodiment, the user activity module 215 interacts with the context API 206 to identify, determine, infer, detect, compute, predict, and/or anticipate, characteristics of user activity on the device 250. Various inputs collected by the context API 206 can be aggregated by the user activity module 215 to generate a profile for characteristics of user activity. Such a profile can be generated by the user activity module 215 with various temporal characteristics. For instance, user activity profile can be generated in real-time for a given instant to provide a view of what the user is doing or not doing at a given time (e.g., defined by a time window, in the last minute, in the last 30 seconds, etc.), a user activity profile can also be generated for a ‘session’ defined by an application or web page that describes the characteristics of user behavior with respect to a specific task they are engaged in on the device 250, or for a specific time period (e.g., for the last 2 hours, for the last 5 hours).


Additionally, characteristic profiles can be generated by the user activity module 215 to depict a historical trend for user activity and behavior (e.g., 1 week, 1 mo., 2 mo., etc.). Such historical profiles can also be used to deduce trends of user behavior, for example, access frequency at different times of day, trends for certain days of the week (weekends or week days), user activity trends based on location data (e.g., IP address, GPS, or cell tower coordinate data) or changes in location data (e.g., user activity based on user location, or user activity based on whether the user is on the go, or traveling outside a home region, etc.) to obtain user activity characteristics.


In one embodiment, user activity module 215 can detect and track user activity with respect to applications, documents, files, windows, icons, and folders on the device 250. For example, the user activity module 215 can detect when an application or window (e.g., a web browser or any other type of application) has been exited, closed, minimized, maximized, opened, moved into the foreground, or into the background, multimedia content playback, etc.


In one embodiment, characteristics of the user activity on the device 250 can be used to locally adjust behavior of the device (e.g., mobile device or any wireless device) to optimize its resource consumption such as battery/power consumption and more generally, consumption of other device resources including memory, storage, and processing power, and/or further optimize signaling in the network. In one embodiment, the use of a radio on a device can be adjusted based on characteristics of user behavior (e.g., by the radio controller 266 of the connection manager 265) coupled to the user activity module 215. For example, the radio controller 266 can turn the radio on or off, based on characteristics of the user activity on the device 250. In addition, the radio controller 266 can adjust the power mode of the radio (e.g., to be in a higher power mode or lower power mode) depending on characteristics of user activity.


In one embodiment, characteristics of the user activity on device 250 can also be used to cause another device (e.g., other computers, a mobile device, a wireless device, or a non-portable device) or server (e.g., host server 100 in the examples of FIGS. 1B-1C) which can communicate (e.g., via a cellular or other network) with the device 250 to modify its communication frequency with the device 250. The local proxy 275 can use the characteristics information of user behavior determined by the user activity module 215 to instruct the remote device as to how to modulate its communication frequency (e.g., decreasing communication frequency, such as data push frequency if the user is idle, requesting that the remote device notify the device 250 if new data, changed, data, or data of a certain level of importance becomes available, etc.).


In one embodiment, the user activity module 215 can, in response to determining that user activity characteristics indicate that a user is active after a period of inactivity, request that a remote device (e.g., server host server 100 in the examples of FIGS. 1B-1C) send the data that was buffered as a result of the previously decreased communication frequency.


In addition, or in alternative, the local proxy 275 can communicate the characteristics of user activity at the device 250 to the remote device (e.g., host server 100 in the examples of FIGS. 1B-1C) and the remote device determines how to alter its own communication frequency with the device 250 for network resource conservation and conservation of device 250 resources.


One embodiment of the local proxy 275 further includes a request/transaction manager 235, which can detect, identify, intercept, process, manage, data requests initiated on the device 250, for example, by applications 210 and/or 220, and/or directly/indirectly by a user request. The request/transaction manager 235 can determine how and when to process a given request or transaction, or a set of requests/transactions, based on transaction characteristics.


The request/transaction manager 235 can prioritize requests or transactions made by applications and/or users at the device 250, for example by the prioritization engine 241. Importance or priority of requests/transactions can be determined by the request/transaction manager 235 by applying a rule set, for example, according to time sensitivity of the transaction, time sensitivity of the content in the transaction, time criticality of the transaction, time criticality of the data transmitted in the transaction, and/or time criticality or importance of an application making the request.


In addition, transaction characteristics can also depend on whether the transaction was a result of user-interaction or other user-initiated action on the device (e.g., user interaction with an application (e.g., a mobile application)). In general, a time critical transaction can include a transaction resulting from a user-initiated data transfer, and can be prioritized as such. Transaction characteristics can also depend on the amount of data that will be transferred or is anticipated to be transferred as a result of the requested transaction. For example, the connection manager 265, can adjust the radio mode (e.g., high power or low power mode via the radio controller 266) based on the amount of data that will need to be transferred.


In addition, the radio controller 266/connection manager 265 can adjust the radio power mode (high or low) based on time criticality/sensitivity of the transaction. The radio controller 266 can trigger the use of high power radio mode when a time-critical transaction (e.g., a transaction resulting from a user-initiated data transfer, an application running in the foreground, any other event meeting a certain criteria) is initiated or detected.


In general, the priorities can be set by default, for example, based on device platform, device manufacturer, operating system, etc. Priorities can alternatively or in additionally be set by the particular application; for example, the Facebook application (e.g., a mobile application) can set its own priorities for various transactions (e.g., a status update can be of higher priority than an add friend request or a poke request, a message send request can be of higher priority than a message delete request, for example), an email client or IM chat client may have its own configurations for priority. The prioritization engine 241 may include set of rules for assigning priority.


The prioritization engine 241 can also track network provider limitations or specifications on application or transaction priority in determining an overall priority status for a request/transaction. Furthermore, priority can in part or in whole be determined by user preferences, either explicit or implicit. A user, can in general, set priorities at different tiers, such as, specific priorities for sessions, or types, or applications (e.g., a browsing session, a gaming session, versus an IM chat session, the user may set a gaming session to always have higher priority than an IM chat session, which may have higher priority than web-browsing session). A user can set application-specific priorities, (e.g., a user may set Facebook-related transactions to have a higher priority than LinkedIn-related transactions), for specific transaction types (e.g., for all send message requests across all applications to have higher priority than message delete requests, for all calendar-related events to have a high priority, etc.), and/or for specific folders.


The prioritization engine 241 can track and resolve conflicts in priorities set by different entities. For example, manual settings specified by the user may take precedence over device OS settings, network provider parameters/limitations (e.g., set in default for a network service area, geographic locale, set for a specific time of day, or set based on service/fee type) may limit any user-specified settings and/or application-set priorities. In some instances, a manual synchronization request received from a user can override some, most, or all priority settings in that the requested synchronization is performed when requested, regardless of the individually assigned priority or an overall priority ranking for the requested action.


Priority can be specified and tracked internally in any known and/or convenient manner, including but not limited to, a binary representation, a multi-valued representation, a graded representation and all are considered to be within the scope of the disclosed technology.












TABLE I





Change

Change



(initiated on device)
Priority
(initiated on server)
Priority







Send email
High
Receive email
High


Delete email
Low
Edit email
Often not


(Un)read email
Low

possible to





sync (Low





if possible)


Move message
Low
New email in deleted
Low




items



Read more
High




Download
High
Delete an email
Low


attachment

(Un)Read an email
Low


New Calendar event
High
Move messages
Low


Edit/change Calendar
High
Any calendar change
High


event

Any contact change
High


Add a contact
High
Wipe/lock device
High


Edit a contact
High
Settings change
High


Search contacts
High
Any folder change
High


Change a setting
High
Connector restart
High (if


Manual send/receive
High

no changes





nothing





is sent)


IM status change
Medium
Social Network Status
Medium




Updates



Auction outbid or
High
Severe Weather Alerts
High


change notification





Weather Updates
Low
News Updates
Low









Table I above shows, for illustration purposes, some examples of transactions with examples of assigned priorities in a binary representation scheme. Additional assignments are possible for additional types of events, requests, transactions, and as previously described, priority assignments can be made at more or less granular levels, e.g., at the session level or at the application level, etc.


As shown by way of example in the above table, in general, lower priority requests/transactions can include, updating message status as being read, unread, deleting of messages, deletion of contacts; higher priority requests/transactions, can in some instances include, status updates, new IM chat message, new email, calendar event update/cancellation/deletion, an event in a mobile gaming session, or other entertainment related events, a purchase confirmation through a web purchase or online, request to load additional or download content, contact book related events, a transaction to change a device setting, location-aware or location-based events/transactions, or any other events/request/transactions initiated by a user or where the user is known to be, expected to be, or suspected to be waiting for a response, etc.


Inbox pruning events (e.g., email, or any other types of messages), are generally considered low priority and absent other impending events, generally will not trigger use of the radio on the device 250. Specifically, pruning events to remove old email or other content can be ‘piggy backed’ with other communications if the radio is not otherwise on, at the time of a scheduled pruning event. For example, if the user has preferences set to ‘keep messages for 7 days old,’ then instead of powering on the device radio to initiate a message delete from the device 250 the moment that the message has exceeded 7 days old, the message is deleted when the radio is powered on next. If the radio is already on, then pruning may occur as regularly scheduled.


The request/transaction manager 235, can use the priorities for requests (e.g., by the prioritization engine 241) to manage outgoing traffic from the device 250 for resource optimization (e.g., to utilize the device radio more efficiently for battery conservation). For example, transactions/requests below a certain priority ranking may not trigger use of the radio on the device 250 if the radio is not already switched on, as controlled by the connection manager 265. In contrast, the radio controller 266 can turn on the radio such a request can be sent when a request for a transaction is detected to be over a certain priority level.


In one embodiment, priority assignments (such as that determined by the local proxy 275 or another device/entity) can be used cause a remote device to modify its communication with the frequency with the mobile device or wireless device. For example, the remote device can be configured to send notifications to the device 250 when data of higher importance is available to be sent to the mobile device or wireless device.


In one embodiment, transaction priority can be used in conjunction with characteristics of user activity in shaping or managing traffic, for example, by the traffic shaping engine 255. For example, the traffic shaping engine 255 can, in response to detecting that a user is dormant or inactive, wait to send low priority transactions from the device 250, for a period of time. In addition, the traffic shaping engine 255 can allow multiple low priority transactions to accumulate for batch transferring from the device 250 (e.g., via the batching module 257). In one embodiment, the priorities can be set, configured, or readjusted by a user. For example, content depicted in Table I in the same or similar form can be accessible in a user interface on the device 250 and for example, used by the user to adjust or view the priorities.


The batching module 257 can initiate batch transfer based on certain criteria. For example, batch transfer (e.g., of multiple occurrences of events, some of which occurred at different instances in time) may occur after a certain number of low priority events have been detected, or after an amount of time elapsed after the first of the low priority event was initiated. In addition, the batching module 257 can initiate batch transfer of the cumulated low priority events when a higher priority event is initiated or detected at the device 250. Batch transfer can otherwise be initiated when radio use is triggered for another reason (e.g., to receive data from a remote device such as host server 100 or 300). In one embodiment, an impending pruning event (pruning of an inbox), or any other low priority events, can be executed when a batch transfer occurs.


In general, the batching capability can be disabled or enabled at the event/transaction level, application level, or session level, based on any one or combination of the following: user configuration, device limitations/settings, manufacturer specification, network provider parameters/limitations, platform-specific limitations/settings, device OS settings, etc. In one embodiment, batch transfer can be initiated when an application/window/file is closed out, exited, or moved into the background; users can optionally be prompted before initiating a batch transfer; users can also manually trigger batch transfers.


In one embodiment, the local proxy 275 locally adjusts radio use on the device 250 by caching data in the cache 285. When requests or transactions from the device 250 can be satisfied by content stored in the cache 285, the radio controller 266 need not activate the radio to send the request to a remote entity (e.g., the host server 100, 300, as shown in FIG. 1B or a content provider/application server such as the server/provider 110 shown in the examples of FIGS. 1B-1C). As such, the local proxy 275 can use the local cache 285 and the cache policy manager 245 to locally store data for satisfying data requests to eliminate or reduce the use of the device radio for conservation of network resources and device battery consumption.


In leveraging the local cache, once the request/transaction manager 225 intercepts a data request by an application on the device 250, the local repository 285 can be queried to determine if there is any locally stored response, and also determine whether the response is valid. When a valid response is available in the local cache 285, the response can be provided to the application on the device 250 without the device 250 needing to access the cellular network or wireless broadband network.


If a valid response is not available, the local proxy 275 can query a remote proxy (e.g., the server proxy 125 of FIGS. 1C-1D, 1F) to determine whether a remotely stored response is valid. If so, the remotely stored response (e.g., which may be stored on the server cache 135 or optional caching server 199 shown in the example of FIG. 1C) can be provided to the mobile device, possibly without the mobile device 250 needing to access the cellular network, thus relieving consumption of network resources.


If a valid cache response is not available, or if cache responses are unavailable for the intercepted data request, the local proxy 275, for example, the caching policy manager 245, can send the data request to a remote proxy (e.g., server proxy 125 of FIG. 1C) which forwards the data request to a content source (e.g., application server/content provider 110 of FIG. 1C) and a response from the content source can be provided through the remote proxy, as will be further described in the description associated with the example host server 100 of FIG. 1C. The cache policy manager 245 can manage or process requests that use a variety of protocols, including but not limited to HTTP, HTTPS, IMAP, POP, SMTP, XMPP, and/or ActiveSync. The caching policy manager 245 can locally store responses for data requests in the local database 285 as cache entries, for subsequent use in satisfying same or similar data requests.


The caching policy manager 245 can request that the remote proxy monitor responses for the data request and the remote proxy can notify the device 250 when an unexpected response to the data request is detected. In such an event, the cache policy manager 245 can erase or replace the locally stored response(s) on the device 250 when notified of the unexpected response (e.g., new data, changed data, additional data, etc.) to the data request. In one embodiment, the caching policy manager 245 is able to detect or identify the protocol used for a specific request, including but not limited to HTTP, HTTPS, IMAP, POP, SMTP, XMPP, and/or ActiveSync. In one embodiment, application specific handlers (e.g., via the application protocol module 246 of the caching policy manager 245) on the local proxy 275 allows for optimization of any protocol that can be port mapped to a handler in the distributed proxy (e.g., port mapped on the proxy server 125 in the example of FIG. 1C).


In one embodiment, the local proxy 275 notifies the remote proxy such that the remote proxy can monitor responses received for the data request from the content source for changed results prior to returning the result to the device 250, for example, when the data request to the content source has yielded same results to be returned to the mobile device. In general, the local proxy 275 can simulate application server responses for applications on the device 250, using locally cached content. This can prevent utilization of the cellular network for transactions where new/changed data is not available, thus freeing up network resources and preventing network congestion.


In one embodiment, the local proxy 275 includes an application behavior detector 236 to track, detect, observe, monitor, applications (e.g., proxy-unaware and/or aware applications 210 and 220) accessed or installed on the device 250. Application behaviors, or patterns in detected behaviors (e.g., via the pattern detector 237) of one or more applications accessed on the device 250 can be used by the local proxy 275 to optimize traffic in a wireless network needed to satisfy the data needs of these applications.


For example, based on detected behavior of multiple applications, the traffic shaping engine 255 can align content requests made by at least some of the applications over the network (wireless network) (e.g., via the alignment module 256). The alignment module 256 can delay or expedite some earlier received requests to achieve alignment. When requests are aligned, the traffic shaping engine 255 can utilize the connection manager to poll over the network to satisfy application data requests. Content requests for multiple applications can be aligned based on behavior patterns or rules/settings including, for example, content types requested by the multiple applications (audio, video, text, etc.), device (e.g., mobile or wireless device) parameters, and/or network parameters/traffic conditions, network service provider constraints/specifications, etc.


In one embodiment, the pattern detector 237 can detect recurrences in application requests made by the multiple applications, for example, by tracking patterns in application behavior. A tracked pattern can include, detecting that certain applications, as a background process, poll an application server regularly, at certain times of day, on certain days of the week, periodically in a predictable fashion, with a certain frequency, with a certain frequency in response to a certain type of event, in response to a certain type user query, frequency that requested content is the same, frequency with which a same request is made, interval between requests, applications making a request, or any combination of the above, for example.


Such recurrences can be used by traffic shaping engine 255 to offload polling of content from a content source (e.g., from an application server/content provider 110 of FIG. 1A) that would result from the application requests that would be performed at the mobile device or wireless device 250 to be performed instead, by a proxy server (e.g., proxy server 125 of FIG. 1C) remote from the device 250. Traffic shaping engine 255 can decide to offload the polling when the recurrences match a rule. For example, there are multiple occurrences or requests for the same resource that have exactly the same content, or returned value, or based on detection of repeatable time periods between requests and responses such as a resource that is requested at specific times during the day. The offloading of the polling can decrease the amount of bandwidth consumption needed by the mobile device 250 to establish a wireless (cellular or other wireless broadband) connection with the content source for repetitive content polls.


As a result of the offloading of the polling, locally cached content stored in the local cache 285 can be provided to satisfy data requests at the device 250, when content change is not detected in the polling of the content sources. As such, when data has not changed, application data needs can be satisfied without needing to enable radio use or occupying cellular bandwidth in a wireless network. When data has changed and/or new data has been received, the remote entity (e.g., the host server) to which polling is offloaded, can notify the device 250.


In one embodiment, the local proxy 275 can mitigate the need/use of periodic keep-alive messages (heartbeat messages) to maintain TCP/IP connections, which can consume significant amounts of power thus having detrimental impacts on mobile device battery life. The connection manager 265 in the local proxy (e.g., the heartbeat manager 267) can detect, identify, and intercept any or all heartbeat (keep-alive) messages being sent from applications.


The heartbeat manager 267 can prevent any or all of these heartbeat messages from being sent over the cellular, or other network, and instead rely on the server component of the distributed proxy system (e.g., shown in FIG. 1C) to generate and send the heartbeat messages to maintain a connection with the backend (e.g., application server/provider 110 in the example of FIG. 1B).


The local proxy 275 generally represents any one or a portion of the functions described for the individual managers, modules, and/or engines. The local proxy 275 and device 250 can include additional or less components; more or less functions can be included, in whole or in part, without deviating from the novel art of the disclosure.



FIG. 2B illustrates a block diagram illustrating additional components in the congestion detector or recognizer shown in the example of FIG. 2A.


The congestion recognizer 164 can detect congestion in the network based on increase in setup times experienced by the mobile device in attempting to connect to a network, and further confirm that the increase in setup times is due to congestion, and for no other reasons (e.g., operator or network equipment specific). In one embodiment, the congestion recognizer 164 includes a congestion recognition configuration engine 270, a setup time calculator 276, a radio state detector 277, a congestion data logger 290, a congestion reporting agent 292 and a congestion detection engine 280 having an initial setup time stack manager 282, a temporary setup time stack manager 281, a baseline setup time calculator 283, a potential congestion case detector 284, a confirmed congestion case detector 286 having a reception quality analyzer 287 and a data connection rejection query module 288 and a final congestion case detector 289 having a congestion pattern detector 290. More or less components may be included in the congestion recognizer 164 in some other embodiments.


As used herein, a “module,” “a manager,” a “handler,” a “detector,” an “interface,” a “controller,” a “normalizer,” a “generator,” an “invalidator,” a “calculator,” a “logger,” an “analyzer,” an “agent,” or an “engine” includes a general purpose, dedicated or shared processor and, typically, firmware or software modules that are executed by the processor. Depending upon implementation-specific or other considerations, the module, manager, handler, detector, interface, controller, normalizer, generator, invalidator, or engine can be centralized or its functionality distributed. The module, manager, handler, detector, interface, controller, normalizer, generator, invalidator, calculator, logger, analyzer, agent or engine can include general or special purpose hardware, firmware, or software embodied in a computer-readable (storage) medium for execution by the processor.


As used herein, a computer-readable medium or computer-readable storage medium is intended to include all mediums that are statutory (e.g., in the United States, under 35 U.S.C. 101), and to specifically exclude all mediums that are non-statutory in nature to the extent that the exclusion is necessary for a claim that includes the computer-readable (storage) medium to be valid. Known statutory computer-readable mediums include hardware (e.g., registers, random access memory (RAM), non-volatile (NV) storage, to name a few), but may or may not be limited to hardware.


The congestion recognition configuration engine 270 configures the congestion recognizer 164 based on various settings and/or parameters. The settings and/or parameters may impact how aggressively congestion is recognized, the criteria for detecting and verifying that congestion is present, and the like. These parameters can be used in detecting potential congestion state from a sample of setup times, promoting potential congestion state to confirmed congestion state and triggering congestion decision from confirmed congestion state. In one implementation, one or more of the settings and/or parameters can be configured as a function of time. For example, during peak traffic times, the congestion recognition can be configured to be more aggressive.


In one implementation, the congestion recognition configuration engine 270 can be used to configure a number of setup time samples (st_stack) to be collected, a setup time standard deviation allowance (st_std), aggressiveness/sensitivity in triggering congestion decision from confirmed congestion state (num_ccc), and threshold for triggering congestion decision (pcd_trg). When st_stack is defined, a memory for storing the configured number of setup time samples is then allocated. A large sample or stack size adapts to change in setup time more slowly than a smaller sample or stack size. The setup time standard deviation allowance (st_std) can be used to adjust how aggressively a potential congestion state is detected. For example, if the st_std is zero, the logic is very sensitive to potential congestion. In one implementation, the congestion recognition configuration engine 270 can also configure the signal strength range for determining whether to convert a potential congested state to a confirmed congested state. For example, when the received signal code power (RSCP) that denotes the power measured by the mobile device on a communication channel, and provides an indication of signal strength, is between −105 and −115 dB, the signal strength is determined to be low, and a potential congestion state is not converted to confirmed congestion state, as the increase in setup times may be caused by poor signal strength, poor coverage or poor condition of radio link, and most likely not due to congestion.


The request/transaction manager 235 (of FIG. 2A) can detect, identify, intercept, process, manage, data requests initiated on the device 250. In one implementation, the request/transaction manager 235 can detect, identify or filter those requests requiring radio connection that are made when the radio state is idle. The setup time calculator 276 can measure the setup time for establishing a connection with a base station in the radio access network. The setup time is determined or measured as the time elapsed between detecting of a data request that requires a radio connection (or a radio turn on request) and transition of the radio state to a connected state from idle state in some implementations (i.e., RRC high timestamp—request time stamp during RRC low or idle). The radio state information can be determined or obtained from the radio state detector 277, for example. In other implementations, the setup time may be measured based on a radio access bearer setup time, measured as a time difference between transition to high RRC state timestamp and request timestamp. During a radio bearer reconfiguration procedure, a radio bearer reconfiguration message is sent by the network to a mobile device, and the mobile device acknowledges receipt of the message by sending a radio bearer reconfiguration complete message to the network.


The initial setup time stack manager 282 of the congestion detection engine 280 can aggregate a predetermined number of setup time samples (e.g., 20 samples or another number of samples based on st_stack), until the stack is full. When the stack is full, the initial setup time stack manager 282 can activate the logic for detecting potential congestion.


The baseline setup time calculator 283 can be triggered by initial setup time stack manager 282 to calculate a baseline or reference setup time from the sample of setup times collected by the initial setup time stack manager 282. In one implementation, the baseline is calculated as the sum of the average or mean of the setup times in the initial stack, the standard deviation of the setup times in the initial stack and the setup time standard deviation allowance (st_std). The baseline can be determined using a variation of the method above, or any other statistical method in other implementations. The baseline setup time calculator 283 can be triggered to update its calculation of baseline every time a new setup time value is measured by the setup time calculator module 276.


The potential congestion (PC) case detector 284 can be triggered by the activation of the congestion detection logic when the initial setup time stack is full. The potential congestion case detector 284 detects a potential case of congestion by detecting an increase in setup time values compared to the baseline. The setup time values that are longer than the baseline are stored in a temporary stack of the same size as the initial stack by the temporary setup time stack manager 281. The setup time values below the baseline replace the oldest values in the initial stack (via the initial setup time stack manager 282). In one implementation, the potential congestion case detector 284 can acquire cell-ID or other base station identifier information and/or location area code for each potential congestion case detected. In one implementation, the cell-ID and/or location area code may be obtained using Attention (AT) commands used for controlling a device modem. For example, AT+CREG command returns cell-ID and location area code.


The confirmed congestion case detector 286 can analyze the potential congestion cases and determine whether the potential congestion cases should be promoted to confirmed congestion cases. In order to detect confirmed congestion cases from potential congestion cases, the modem of the mobile device may be queried for reception quality data via the reception quality analyzer 287, for example. In one implementation, using AT+CSQ command, received signal strength indicator (RSSI) value, which can be mapped to signal condition (e.g., marginal, OK, good, excellent or the like), can be determined. Other reception quality data that can be queried include, for example, received signal code power (RSCP) and ratio of received energy per chip (Ec/Io). In a further implementation, the modem may be queried for any RRC rejection messages from the base station by the data connection rejection query module 288, for example.


The final or positive congestion case detector 289 can evaluate the confirmed congestion cases using the attached location area codes, cell IDs and other parameters (e.g., num_ccc and pcd_trg) to determine and/or verify whether the network is congested. In one implementation, the congestion pattern detector 290 can examine the cell-IDs and location area codes attached to the confirmed congestion cases to determine whether the confirmed congestion cases are concentrated on a few specific cell-IDs or are distributed over many cell-IDs and/or over multiple location area codes. This pattern of cell-IDs and/or location area codes associated with confirmed congestion cases can provide an indication to the final congestion case detector 289 that the mobile device is in motion, and the confirmed congestion cases cannot be reliably used to determine the presence of network congestion. For example, if the analysis of the congestion pattern indicates that a large number of confirmed congestion cases are concentrated on a one or two cells, the final congestion case detector 289 can make a positive or final congestion decision, and trigger the blocking policy manager 178 (shown in FIG. 2A, FIG. 2C). By way of another example, if the pattern of the confirmed congestion cases indicates cases associated with multiple cells belonging to different location area codes, the final congestion case detector 289 can determine that the mobile device is in motion, and a final decision cannot be taken.


The congestion data logger 290 can log select or all data relating to congestion detection. For example, the congestion data logger 290 can log data request timestamps, radio turn on timestamps, setup times in association with corresponding cell-IDs and location area codes, reception quality measurements (e.g., RSCP, a/Io, RSSI, and the like), final congestion detection data (e.g., final congestion detection date, time, cell-IDs, location area code, network operator (e.g., Verizon, AT&T, etc.), and the like), configuration parameters and/or settings, device information, and the like.


The congestion reporting agent 292, in one implementation, can upload the logged congestion data to the server-side proxy, the host server, and/or the log storage and processing service. The congestion reporting agent 292 may be configured to generate and send congestion reports to the LSPS or other remote entities periodically, or whenever a connection is available. In one implementation, the congestion reporting agent 292 can crate congestion reports using one or more templates.



FIG. 2C illustrates a block diagram depicting additional components in the user activity module, the application behavior detector and the blocking policy manager shown in the example of FIG. 2A.


One embodiment of the local proxy 275 includes the user activity module 215, which further includes one or more of, a user activity detector/tracker 215a, a user activity prediction engine 215b, and/or a user expectation manager 215c. The application behavior detector 236 can further include a prioritization engine 241a, a time criticality detection engine 241b, an application state categorizer 241c, and/or an application traffic categorizer 241d. The local proxy 275 can further include a backlight detector 219. The blocking policy manager 178, in one embodiment, can include one or more of a traffic blocking rules engine 178a and a blocking policy effective time period configuration module 178b. One or more rules stored in the rules datastore 178d can be accessed by the blocking policy manager in implementing a blocking policy on traffic from the mobile device.


In one embodiment, the application behavior detector 236 may detect, determine, identify, or infer, the activity state of an application on the mobile device 250 from which traffic has originated or is directed to, for example, via the application state categorizer 241c and/or the application traffic categorizer 241d. The activity state can be determined based on whether the application is in a foreground or background state on the mobile device (via the application state categorizer 241c) since the traffic for a foreground application versus a background application may be handled differently.


In one embodiment, the activity state can be determined, detected, identified, or inferred with a level of certainty of heuristics, based on the backlight status of the mobile device 250 (e.g., by the backlight detector 219) or other software agents or hardware sensors on the mobile device, including but not limited to, resistive sensors, capacitive sensors, ambient light sensors, motion sensors, touch sensors, and the like. In general, if the backlight is on, the traffic can be treated as being or determined to be generated from an application that is active or in the foreground, or the traffic is interactive. In addition, if the backlight is on, the traffic can be treated as being or determined to be traffic from user interaction or user activity, or traffic containing data that the user is expecting within some time frame.


In one embodiment, the activity state is determined based on whether the traffic is interactive traffic or maintenance traffic. Interactive traffic can include transactions from responses and requests generated directly from user activity/interaction with an application and can include content or data that a user is waiting or expecting to receive. Maintenance traffic may be used to support the functionality of an application which is not directly detected by a user. Maintenance traffic can also include actions or transactions that may take place in response to a user action, but the user is not actively waiting for or expecting a response.


For example, a mail or message delete action at a mobile device 250 generates a request to delete the corresponding mail or message at the server, but the user typically is not waiting for a response. Thus, such a request may be categorized as maintenance traffic, or traffic having a lower priority (e.g., by the prioritization engine 241a) and/or is not time-critical (e.g., by the time criticality detection engine 241b).


Contrastingly, a mail ‘read’ or message ‘read’ request initiated by a user a the mobile device 250, can be categorized as ‘interactive traffic’ since the user generally is waiting to access content or data when they request to read a message or mail. Similarly, such a request can be categorized as having higher priority (e.g., by the prioritization engine 241a) and/or as being time critical/time sensitive (e.g., by the time criticality detection engine 241b).


The time criticality detection engine 241b can generally determine, identify, infer the time sensitivity of data contained in traffic sent from the mobile device 250 or to the mobile device from a host server (e.g., host 300) or application server (e.g., app server/content source 110). For example, time sensitive data can include, status updates, stock information updates, IM presence information, email messages or other messages, actions generated from mobile gaming applications, webpage requests, location updates, etc. Data that is not time sensitive or time critical, by nature of the content or request, can include requests to delete messages, mark-as-read or edited actions, application-specific actions such as an add-friend or delete-friend request, certain types of messages, or other information which does not frequently changing by nature, etc. In some instances when the data is not time critical, the timing with which to allow the traffic to pass through is set based on when additional data needs to be sent from the mobile device 250. For example, traffic shaping engine 255 can align the traffic with one or more subsequent transactions to be sent together in a single power-on event of the mobile device radio (e.g., using the alignment module 256 and/or the batching module 257). The alignment module 256 can also align polling requests occurring close in time directed to the same host server, since these requests are likely to be responded to with the same data.


In the alternate or in combination, the activity state can be determined from assessing, determining, evaluating, inferring, identifying user activity at the mobile device 250 (e.g., via the user activity module 215). For example, user activity can be directly detected and tracked using the user activity tracker 215a. The traffic resulting therefrom can then be categorized appropriately for subsequent processing to determine the policy for handling. Furthermore, user activity can be predicted or anticipated by the user activity prediction engine 215b. By predicting user activity or anticipating user activity, the traffic thus occurring after the prediction can be treated as resulting from user activity and categorized appropriately to determine the transmission policy.


In addition, the user activity module 215 can also manage user expectations (e.g., via the user expectation manager 215c and/or in conjunction with the activity tracker 215a and/or the prediction engine 215b) to ensure that traffic is categorized appropriately such that user expectations are generally met. For example, a user-initiated action should be analyzed (e.g., by the expectation manager 215c) to determine or infer whether the user would be waiting for a response. If so, such traffic should be handled under a policy such that the user does not experience an unpleasant delay in receiving such a response or action.


In one embodiment, an advanced generation wireless standard network is selected for use in sending traffic between a mobile device and a host server in the wireless network based on the activity state of the application on the mobile device for which traffic is originated from or directed to. An advanced technology standards such as the 3G, 3.5G, 3G+, 4G, or LTE network can be selected for handling traffic generated as a result of user interaction, user activity, or traffic containing data that the user is expecting or waiting for. Advanced generation wireless standard network can also be selected for to transmit data contained in traffic directed to the mobile device which responds to foreground activities.


In categorizing traffic and defining a transmission policy for mobile traffic, a network configuration can be selected for use (e.g., by a network configuration selection engine) on the mobile device 250 in sending traffic between the mobile device and a proxy server and/or an application server (e.g., app server/host 110). The network configuration that is selected can be determined based on information gathered by the application behavior module 236 regarding application activity state (e.g., background or foreground traffic), application traffic category (e.g., interactive or maintenance traffic), any priorities of the data/content, time sensitivity/criticality.


The blocking policy manager 178 allows traffic management policies such as traffic blocking policies to be enforced at the mobile device via the traffic blocking rules engine 178a and the blocking policy effective time period configuration module 178b. Enforcement of a blocking policy can be triggered by a specific event such as detection or recognition of congestion (e.g., via the final congestion case detector 289), or combination of events such as congestion detection and time of day, screen status, network interface (Wi-Fi or mobile, for example), and the like. Policies can be enforced over part of a defined time window. For example, the blocking policy manager can enforce a blocking policy for a period of time (e.g., 15 minutes) upon receiving or detecting an indication of congestion. When the blocking period of time is over, the blocking policy manager can drop the blocking policy.


In one embodiment, the blocking policy manager 178 can apply an intelligent algorithm based on a computed level of congestion to determine an optimal amount of time to wait before attempting to reconnect. For example, if the number of confirmed congestion cases per cell exceeds a threshold, then the level of congestion may be deemed high or above normal, and the blocking policy manager 178 can enforce the blocking policy for a longer duration than normal. By way of another example, if congestion is detected immediately after dropping the blocking policy, the blocking policy manager 178 can enforce another round of blocking policy for a duration longer than the previously enforced duration (e.g., 30 minutes instead of 15 minutes). In some instances, if certain conditions or criteria are met, a blocking policy can be enforced for a predefined or dynamically adjusted duration. For example, when congestion is detected during a certain time of day (e.g., between 5 PM and 7 PM), the blocking policy may be implemented for a longer period of time than normal (e.g., 30 minutes instead of 15 minutes). In one embodiment, the level of congestion can be quantitatively determined based on factors such as number of cells associated n number of congestion cases (confirmed, and/or potential), number of congestion cases per cell, timing, average setup times per cell, and the like and weights for the factors. Other methods for determining a quantitative measure of congestion may be used.


In some embodiments, the blocking policy manager 178 can block all traffic from the mobile device for the duration of the blocking policy enforcement. Alternately, the blocking policy manager 178 can implement a priority based traffic management, whereby certain high priority traffic can be allowed, while other low priority traffic would not be allowed to signal the network. The priority of the traffic may be determined via the application behavior detector 236, for example. These and other rules and conditions for implementing and/or configuring a blocking policy may be specified in the rules datastore 178d, in one implementation, and can be evaluated by the traffic blocking rules engine 178a.



FIG. 2D illustrates a block diagram depicting components of a log storage and processing service 174 shown in FIG. 1F. The log storage and processing service 174 can be component of the host server or proxy server, or can be a separate server that communicates with the client-side and server-side proxies. As previously described, the log storage and processing service 174 can aggregate, store and process data such as bytes and transactions data, network connectivity data, power data, subscriber count data, and the like. In one embodiment, the log storage and processing service 174 can include a network interface 190 and a packet call quality agent 133, among others.


The packet call quality agent 133 can aggregate and analyze congestion reports that include findings on congested cells or cell towers, including setup time, signal strength and/or other information from multiple mobile devices, and provide validated and near real time feedback about the network, saving the operator resources such as time and money. For example, if there is a congestion in a cell tower, the operator would be not be aware of the problem until a subscriber calls in to report the problem in his or her area, and the operator has a portable lab in the area to check for problems. However, with the packet call quality agent 133a, near real time information on call quality and congestion in various geographical locations can be provided to the operator to help the operator understand the network from a mobile device perspective and facilitate in shaping their strategy for preparing or upgrading hardware in a specific geographic location or area.


The packet call quality agent 133 can further include a congestion feedback aggregator 133a, a packet call quality problem detector 133b and/or a graphical reporting module 133c. The congestion feedback aggregator 133a can aggregate congestion reports from mobile devices equipped with congestion recognition, in one implementation. Alternately, the congestion feedback aggregator 133a can query an LSPS data store 130 for logs and/or congestion reports uploaded by mobile devices. The congestion feedback aggregator 133a can further aggregate congestion reports based on network operator (e.g., AT&T, Verizon, Sprint, and the like), network connection technology (2G, 2.5G, 3G, 4G LTE, and the like), time frame (e.g., congestion reports for April, congestion reports for congestion detected between 5 PM and 7 PM), by zip code or geographical area, and the like.


The packet call quality problem detector 133b can analyze the information in the congestion reports, and determine problem areas where call quality is poor, has poor or no coverage, and/or is congested on a regular basis. For example, in one implementation, the packet call quality problem detector 133b can be configured to identify a location as a problem area if the location has been reported as being congested by at least a certain number of mobile devices. Similarly, the packet call quality problem detector 133b can also determine and report a location as a chronic problem area if the location is reported as being congested by a certain number of mobile devices for n consecutive days/time period. Even when a location is not reported as being congested, the packet call quality problem detector 133b can examine the call quality data, setup times, and the like to determine potential problem areas. The graphical reporting module 133c can be used to generate a graphical report and/or display a map that depicts the problem areas (or areas in general) identified by the packet call quality problem detector 133b. In one implementation, the graphical reporting module 133c provides a user interface with which operators can interact to specify parameters (e.g., time, geographical area, and the like) and/or view a report or mapping of congestion patterns. The graphical reporting module 133c can depict congestion information as it is available (i.e., almost real time), or on an hourly, daily, weekly or other period basis.



FIG. 9 illustrates an example map 900 generated using data from congestion reports from mobile devices via the graphical reporting module 133c. The map 900 depicts markers corresponding to cell towers distributed throughout a geographical region. Data from congestion reports can be overlaid on top of the map 900 to identify or mark specific cell towers which have been reported as congested during a certain period of time. For example, marker 904 identifies a cell tower that has been identified as congested based on congestion reports from over 400 mobile devices. Similarly, marker 902 identifies a cell tower that has been identified as being congested based on congestion reports from 52 mobile devices. The information on congestion reports can be processed and displayed as they become available, so that a network operator can view this congestion report mapping in near real time, as the reports come in. The map 900, and/or other details may be accessed from a portal for network operators/service providers in one implementation. Alternately, aggregated congested data can be pushed or made available to subscribing network operators/service providers.



FIG. 3A illustrates a logic flow diagram of an example method for activating congestion recognition logic. The example method may be performed by one or more components of the congestion recognizer 164. At block 302, an outgoing data request from the mobile device is intercepted by the local proxy. At decision block 304, if the data request is made while the radio state of the mobile device idle, the congestion recognizer measures setup time for establishing a connection with the network at block 308. However, if the radio state is not idle (i.e., is connected), the data request is ignored at block 306 and the next data request is intercepted at block 302. The setup time is measured as the difference between when the radio state transitions to connected mode and when the data request was made (i.e., timestamp of radio state transition from idle to connected—timestamp of data request).


At block 310, the measured setup time is stored in a memory stack. The memory stack may be configured to store a preconfigured number of samples of setup time data (e.g., n samples). New setup times are measured and stored in the memory stack until the memory stack is determined to be full at decision block 312. When the memory stack is full, the congestion logic is activated or triggered at block 314. At block 316, a baseline setup time value is calculated from the setup time values in the stack. New setup time values are then compared with the baseline to detect an increase in setup time values which can indicate presence of congestion in the network.


The baseline is a statistical measure of the sample of setup time values stored in the memory stack. In one implementation, an average and a standard deviation of the setup time samples are calculated, and added to determine the baseline. In a further implementation, a setup time standard deviation allowance (st_std) can be added to the baseline to make the congestion detection logic more or less aggressive.



FIGS. 3B-3C illustrate logic flow diagrams of an example method for detecting and verifying congestion in the mobile network. At block 320, a setup time value (e.g., the n+1 sample) for the next data request is measured. The setup time value is compared with the baseline to determine whether the setup time value is higher than the baseline at decision block 322. If the setup time value is not higher than the baseline, the setup time value is stored in the original memory stack at block 342. To make room for the new value, the oldest value in the original memory stack is removed. At block 344, the baseline is updated to account for the new setup time value in the original memory stack.


However, if the setup time value is greater than the baseline as determined at decision block 322, the setup time value is added to a temporary memory stack at block 324. If a temporary memory stack does not exist, a new one having the same size as the original memory stack is created. The setup time samples in the temporary memory stack form the potential congestion cases (PCC). At block 326, the cell ID and/or location area code of the base station serving the mobile device when the setup time was calculated is retrieved. The cell ID and/or location area code are attached to the corresponding potential congestion case at block 326. At block 328, congestion confirmatory data including reception quality data (e.g., data providing indication of signal strength (e.g., RSCP, RSSI, Ec/Io, and the like)) are retrieved and associated with the corresponding potential congestion case.


In one implementation, the modem of the mobile device is queried to determine if an RRC rejection message has been received. At decision block 330, if the data connection rejection message is received from the network operator, a positive or final congestion decision is triggered at block 358 of FIG. 3C. However, if the data connection rejection has not been received at decision block 330, then the signal quality data is evaluated at decision block 334. The evaluation may include determining if the signal strength is high or low. For example, an RSCP value between −105 dB and −115 dB is considered low and is indicative of poor signal strength. Similarly, an RSCP value between −50 dB and −70 dB is considered high and is indicative of good signal strength. The evaluation of the signal quality data confirms whether the increase in setup times is due to congestion in the network, or due to poor coverage or poor condition of the radio link. When the signal strength associated with a potential congestion case is high, the potential congestion case is converted to a confirmed congestion case at block 332. Conversely, if the signal strength associated with a potential congestion case is low, the potential congestion case remains in the same state, and is not converted to a confirmed congestion case.


At decision block 336, if the temporary stack is full of potential congestion cases, but there has been no positive or final congestion decision, the content of the temporary stack is transferred to the original stack at block 338, such that the original stack now includes higher setup time values, and results in a higher baseline. This scenario may occur when the mobile device moves to an area that is associated with higher setup times, which may be due to network equipment or other reasons. For example, when a user is in his office in the city, the mobile device may record an average setup time of 2 seconds to establish a network connection. When the same user travels to his home in the suburb, the mobile device may record an average setup time of 3 seconds. Thus the congestion recognizer adapts to the increase or decrease of setup times that are characteristic of the network equipment and geographic location, and not necessarily congestion.


Referring to FIG. 3C, at block 350, the aggregated confirmed congestion cases are sorted under location area code and cell ID to further verify if the network is actually congested. At block 352, the number of cell IDs in the same location area code that have a number of congestion cases greater than a num_ccc parameter is counted. For example, assuming that the num_ccc parameter is 4 and cell ID 1 and 2 in the location area code 22, each have 5 and 6 confirmed congestion cases respectively, the number of cell IDs counted is equal to 2. If the number of cell IDs counted at block 352 is equal to or greater than a parameter such as the pcd_trg parameter, positive or final congestion decision is triggered at block 358. However, if the number of cell IDs counted is less than the pcd_trg, no positive congestion decision is triggered at block 364, and the congestion recognizer continues to sample new setup times. At block 360, a blocking policy to selectively block traffic from the mobile device from reaching the congested mobile network is applied. In one implementation, the blocking policy may be enforced for a predetermined duration of time, or until a user action or other priority request requiring network connection is detected.



FIG. 4 illustrates a logic flow diagram of an example method for determining and confirming congestion in a mobile network using increase in setup times for establishing connection to the mobile network, reception quality of the connections, and distribution patterns of the cells to which the mobile device connects to. The example method may be performed by one or more components of the local proxy 275 on the mobile device.


At block 402, the local proxy 275 having a congestion recognizer 164 aggregates setup times for connection requests in a mobile network to determine a baseline. In one implementation, the baseline is a statistical measure that adapts to network peculiarities. At block 404, the local proxy 275 detects increase in setup times for subsequent connection requests in the mobile network from the baseline, and at block 406 the local proxy 275 further determines that a base station in the mobile network is congested based at least in part on the detected increase in setup times. In one implementation, the local proxy 275 uses reception quality associated with the subsequent connection requests to confirm that the base station in the mobile network is congested at block 408. Further at block 410, the local proxy 275 determines a distribution pattern of the subsequent connection requests based on location area code and base station identifier information associated with the subsequent connection request. At block 412, the local proxy 275 uses distribution pattern of the subsequent connection requests to further confirm that the base station in the mobile network is congested.


In one implementation, the local proxy 275 applies or triggers application of a blocking policy (via the blocking policy manager 178) to selectively block traffic from the mobile device from reaching the mobile network in response to confirming that the mobile network is congested. In a further implementation, the blocking policy is applied for a predefined duration of time, or until a high priority data request is detected at the mobile device. In certain implementations, the local proxy 275 can further determine that the base station in the mobile network is congested when a rejection message is received in response to any one of the subsequent connection requests. The local proxy 275 can then apply or trigger the application of a blocking policy on traffic from the mobile device to reduce signaling to the mobile network.



FIG. 5 illustrates a logic flow diagram of an example method for anticipating network congestion performed by a local proxy 275 on a mobile device equipped with a congestion recognizer 164. In this embodiment, the local proxy 275 can anticipate network congestion by sampling time consumed to establish data connection between a mobile device and a mobile network (block 502), collecting data including at least one of signal strength data, cell identifier, and location area code (504 and 508) associated with the data connection between the mobile device and the mobile network and anticipating, based at least on the time consumed and the collected data, network congestion at block 510. In a further implementation, the local proxy 275 can query the modem to check for connection rejection message from mobile network at block 506 in anticipating network congestion at block 510. At block 512, the local proxy 275 can block or trigger blocking of traffic from the mobile device to the mobile network in response to the anticipated network congestion at block 510. In one implementation, the local proxy 275 blocks low priority traffic from accessing the network. In a further implementation, the low priority traffic includes requests from background processes on the mobile device. Alternately, the local proxy 275 allows high priority traffic from the mobile device to signal the mobile network. High priority traffic includes a phone call, an SMS, an MMS, an email, or other user initiated request in one implementation. At block 514, the local proxy 275 can generate a congestion report using at least some of the collected data. Further at block 516, the congestion report can be uploaded to a server cloud (e.g., LSPS 174) periodically or when a connection is available. In one implementation, information in the congestion report and other congestion reports from multiple mobile devices associated with the mobile network is aggregated and provided to an operator of the mobile network (by the local proxy 275, the server-side proxy 125, or the LSPS 174, for example). The information in the congestion report can provide near real time information on network congestion and/or packet call quality information relating to the mobile network.


The local proxy 275 can anticipate network congestion on the mobile network regardless of the time consumed or the collected data when the data connection rejection message is received from the mobile network. In another implementation, the time consumed to establish the data connection is based on time difference between time of a data request and time of transition of the radio state to connected state from idle state. The data connection can be established by sending a radio resource control (RRC) connection request from the mobile device to a base station, which can be any one of a base transceiver station (BTS), evolved node B (eNodeB) or NodeB in the radio access network. The time consumed in establishing each data connection is compared to a threshold to detect a potential case of network congestion. The threshold, in one implementation, is a statistical measure derived from a dataset stored in a memory stack, wherein the dataset includes values of time consumed to establish data connection between the mobile device and the mobile network. In some instances, the threshold is adjustable by a parameter for conservative or aggressive detection of the potential case of network congestion.


In one implementation, the signal strength data (from block 504) is evaluated against a predefined range or a threshold to determine whether to promote the potential case of network congestion to a confirmed case of network congestion. In a further implementation, cell identifiers and location area codes associated with confirmed cases of network congestion are used to make a final decision on the confirmed cases of network congestion to anticipate network congestion.


In some embodiments, the mobile network uses any of Global System for Mobile Communications (GSM), Code Division Multiple Access (CDMA) or Long-Term Evolution (LTE) network communication technology. The local proxy 275 implementing the disclosed method anticipates the network congestion independent of other mobile devices on the mobile network. The local proxy 275 also anticipates network congestion without incurring signaling load on the mobile network.



FIG. 6 illustrates a logic flow diagram of an example method for managing data traffic performed by local proxy 275 on a mobile device equipped with congestion recognition capability to reduce network signaling. At block 602, the local proxy 275 detects increase in radio turn on time values associated with data connection requests. The local proxy 275 retrieves an indication of signal strength measured by the mobile device at block 604, and determines a number of base stations under a location area code that are each associated with a threshold number of instances of detection of increase in radio turn on time values at block 608. The signal strength information may be used to reduce or eliminate effect of signal strength on the detected increase in radio turn on time values. Information relating to the base station and the location area code may be used to reduce or eliminate effect of geographic mobility of the mobile device on the detected increase in radio turn on time values.


At block 610, the local proxy 275 determines, based on information from blocks 604 and 608, whether the increase in radio turn on time values is due to congestion in the mobile network. Alternately, the local proxy 275 can determine whether the increase in radio turn on time values is due to congestion in the mobile network based on the indication of signal strength measured by the mobile device (block 604) or based on number of base stations under a location area code that are each associated with a threshold number of instances of detection of increase in radio turn on time values (block 608).


In one implementation, if the increase in radio turn on time values is due to congestion in the mobile network, the local proxy 275 manages data traffic on the mobile device by applying or triggering a blocking policy to reduce network signaling. The blocking policy can include rules to block data traffic having low priority and allow data traffic having high priority to the mobile network. The data traffic having high priority can be from active applications on the mobile device, while the data traffic having low priority can be from applications in background of the mobile device in some implementations. Alternately, if the increase in radio turn on time values is not caused by congestion in the mobile network, the local proxy 275 allows data traffic from the mobile device to signal the mobile network.



FIG. 7 illustrates a logic flow diagram of an example method for optimizing data traffic to reduce network signaling. The example method can be performed by one or more components of the local proxy 275.


At block 702, the local proxy 275 collects a sample of radio turn on time values associated with data connection requests. In one implementation, the local proxy 275 can determine radio turn on time value as the difference between the time of a data request from an application on the mobile device to transition of the radio state to a connected state from the idle state. At block 704, the local proxy 275 stores the sample of radio turn on time values in a memory stack. The memory stack can be a logical memory on the mobile device, for example. At block 706, the local proxy 275 determines a baseline radio turn on time value from the sample of radio turn on time values. Further at block 708, the local proxy 275 compares radio turn on time values of subsequent data connection requests to the baseline radio turn on time value to detect potential cases of network congestion. Next at block 710, the radio turn on time values for the potential cases of network congestion is then stored in a temporary memory stack locally on the mobile device.


At block 712, the local proxy 275 evaluates the potential cases of network congestion using congestion confirmatory data to detect network congestion. In one implementation, the evaluation can include promoting the potential cases of network congestion to confirmed cases of network congestion based on indications of signal quality associated with the potential cases of network congestion. In a further or alternate implementation, the evaluation can also include promoting the potential cases of network congestion to confirmed cases of network congestion based on a rejection message received from the network in response to one of the subsequent data connection requests. In a further implementation, the evaluation can include taking a final decision on the confirmed cases of network congestion based number of the confirmed cases of network congestion per base station in the same location area code.


At block 714, the local proxy 275 optimizes data traffic from the mobile device to reduce network signaling in response to detecting network congestion. At block 716, the local proxy 275 reports the detection of network congestion to a remote server or network provider when a connection is available.



FIG. 8 illustrates examples of data sampled and analyzed by the congestion detector/recognizer 164 in detecting and verifying congestion in the mobile network. Table 802 depicts an example initial setup time stack that stores n number of setup time samples, from where a baseline is calculated. Table 804 depicts an example temporary stack that stores setup time values that are higher than the baseline. Table 806 depicts potential congestion cases from the temporary stack 804 that have increased setup time values. The potential congestion cases have cell ID, location area code, signal strength, and/or the like along with setup time values. Based at least on the signal strength data, some of the potential congestion cases (e.g., 808) are promoted to confirmed congestion cases, which are tabulated on table 810. The confirmed congestion cases are evaluated based on number of confirmed congestion cases per cell ID in the same location area code to determine whether to take a final decision on congestion, and enforce a blocking policy on the mobile device to manage congestion at the mobile network.



FIG. 10 shows a diagrammatic representation of a machine in the example form of a computer system within which a set of instructions, for causing the machine to perform any one or more of the methodologies discussed herein, may be executed.


In the example of FIG. 10, the computer system 1000 includes a processor, main memory, non-volatile memory, and an interface device. Various common components (e.g., cache memory) are omitted for illustrative simplicity. The computer system 1000 is intended to illustrate a hardware device on which any of the components depicted in the example of FIGS. 2A-2D (and any other components described in this specification) can be implemented. The computer system 1000 can be of any applicable known or convenient type. The components of the computer system 1000 can be coupled together via a bus or through some other known or convenient device.


The processor may be, for example, a conventional microprocessor such as an Intel Pentium microprocessor or Motorola power PC microprocessor. One of skill in the relevant art will recognize that the terms “machine-readable (storage) medium” or “computer-readable (storage) medium” include any type of device that is accessible by the processor.


The memory is coupled to the processor by, for example, a bus. The memory can include, by way of example but not limitation, random access memory (RAM), such as dynamic RAM (DRAM) and static RAM (SRAM). The memory can be local, remote, or distributed.


The bus also couples the processor to the non-volatile memory and drive unit. The non-volatile memory is often a magnetic floppy or hard disk, a magnetic-optical disk, an optical disk, a read-only memory (ROM), such as a CD-ROM, EPROM, or EEPROM, a magnetic or optical card, or another form of storage for large amounts of data. Some of this data is often written, by a direct memory access process, into memory during execution of software in the computer 1000. The non-volatile storage can be local, remote, or distributed. The non-volatile memory is optional because systems can be created with all applicable data available in memory. A typical computer system will usually include at least a processor, memory, and a device (e.g., a bus) coupling the memory to the processor.


Software is typically stored in the non-volatile memory and/or the drive unit. Indeed, for large programs, it may not even be possible to store the entire program in the memory. Nevertheless, it should be understood that for software to run, if necessary, it is moved to a computer readable location appropriate for processing, and for illustrative purposes, that location is referred to as the memory in this paper. Even when software is moved to the memory for execution, the processor will typically make use of hardware registers to store values associated with the software, and local cache. Ideally, this serves to speed up execution. As used herein, a software program is assumed to be stored at any known or convenient location (from non-volatile storage to hardware registers) when the software program is referred to as “implemented in a computer-readable medium.” A processor is considered to be “configured to execute a program” when at least one value associated with the program is stored in a register readable by the processor.


The bus also couples the processor to the network interface device. The interface can include one or more of a modem or network interface. It will be appreciated that a modem or network interface can be considered to be part of the computer system. The interface can include an analog modem, isdn modem, cable modem, token ring interface, satellite transmission interface (e.g., “direct PC”), or other interfaces for coupling a computer system to other computer systems. The interface can include one or more input and/or output devices. The I/O devices can include, by way of example but not limitation, a keyboard, a mouse or other pointing device, disk drives, printers, a scanner, and other input and/or output devices, including a display device. The display device can include, by way of example but not limitation, a cathode ray tube (CRT), liquid crystal display (LCD), or some other applicable known or convenient display device. For simplicity, it is assumed that controllers of any devices not depicted in the example of FIG. 10 reside in the interface.


In operation, the computer system 1000 can be controlled by operating system software that includes a file management system, such as a disk operating system. One example of operating system software with associated file management system software is the family of operating systems known as Windows® from Microsoft Corporation of Redmond, Wash., and their associated file management systems. Another example of operating system software with its associated file management system software is the Linux operating system and its associated file management system. The file management system is typically stored in the non-volatile memory and/or drive unit and causes the processor to execute the various acts required by the operating system to input and output data and to store data in the memory, including storing files on the non-volatile memory and/or drive unit.


Some portions of the detailed description may be presented in terms of algorithms and symbolic representations of operations on data bits within a computer memory. These algorithmic descriptions and representations are the means used by those skilled in the data processing arts to most effectively convey the substance of their work to others skilled in the art. An algorithm is here, and generally, conceived to be a self-consistent sequence of operations leading to a desired result. The operations are those requiring physical manipulations of physical quantities. Usually, though not necessarily, these quantities take the form of electrical or magnetic signals capable of being stored, transferred, combined, compared, and otherwise manipulated. It has proven convenient at times, principally for reasons of common usage, to refer to these signals as bits, values, elements, symbols, characters, terms, numbers, or the like.


It should be borne in mind, however, that all of these and similar terms are to be associated with the appropriate physical quantities and are merely convenient labels applied to these quantities. Unless specifically stated otherwise as apparent from the following discussion, it is appreciated that throughout the description, discussions utilizing terms such as “processing” or “computing” or “calculating” or “determining” or “displaying” or the like, refer to the action and processes of a computer system, or similar electronic computing device that manipulates and transforms data represented as physical (electronic) quantities within the computer system's registers and memories into other data similarly represented as physical quantities within the computer system memories or registers or other such information storage, transmission, or display devices.


The algorithms and displays presented herein are not inherently related to any particular computer or other apparatus. Various general purpose systems may be used with programs in accordance with the teachings herein, or it may prove convenient to construct more specialized apparatus to perform the methods of some embodiments. The required structure for a variety of these systems will appear from the description below. In addition, the techniques are not described with reference to any particular programming language, and various embodiments may thus be implemented using a variety of programming languages.


In alternative embodiments, the machine operates as a standalone device or may be connected (e.g., networked) to other machines. In a networked deployment, the machine may operate in the capacity of a server or a client machine in a client-server network environment, or as a peer machine in a peer-to-peer (or distributed) network environment.


The machine may be a server computer, a client computer, a personal computer (PC), a tablet PC, a laptop computer, a set-top box (STB), a personal digital assistant (PDA), a cellular telephone, an iPhone, a Blackberry, a processor, a telephone, a web appliance, a network router, switch or bridge, or any machine capable of executing a set of instructions (sequential or otherwise) that specify actions to be taken by that machine.


While the machine-readable medium or machine-readable storage medium is shown in an exemplary embodiment to be a single medium, the term “machine-readable medium” and “machine-readable storage medium” should be taken to include a single medium or multiple media (e.g., a centralized or distributed database, and/or associated caches and servers) that store the one or more sets of instructions. The term “machine-readable medium” and “machine-readable storage medium” shall also be taken to include any medium that is capable of storing, encoding or carrying a set of instructions for execution by the machine and that cause the machine to perform any one or more of the methodologies of the presently disclosed technique and innovation.


In general, the routines executed to implement the embodiments of the disclosure, may be implemented as part of an operating system or a specific application, component, program, object, module, or sequence of instructions referred to as “computer programs.” The computer programs typically comprise one or more instructions set at various times in various memory and storage devices in a computer, and that, when read and executed by one or more processing units or processors in a computer, cause the computer to perform operations to execute elements involving the various aspects of the disclosure.


Moreover, while embodiments have been described in the context of fully functioning computers and computer systems, those skilled in the art will appreciate that the various embodiments are capable of being distributed as a program product in a variety of forms, and that the disclosure applies equally regardless of the particular type of machine or computer-readable media used to actually effect the distribution.


Further examples of machine-readable storage media, machine-readable media, or computer-readable (storage) media include but are not limited to recordable type media such as volatile and non-volatile memory devices, floppy and other removable disks, hard disk drives, optical disks (e.g., Compact Disk Read-Only Memory (CD ROMS), Digital Versatile Disks, (DVDs), etc.), among others, and transmission type media such as digital and analog communication links.


Unless the context clearly requires otherwise, throughout the description and the claims, the words “comprise,” “comprising,” and the like are to be construed in an inclusive sense, as opposed to an exclusive or exhaustive sense; that is to say, in the sense of “including, but not limited to.” As used herein, the terms “connected,” “coupled,” or any variant thereof, means any connection or coupling, either direct or indirect, between two or more elements; the coupling of connection between the elements can be physical, logical, or a combination thereof. Additionally, the words “herein,” “above,” “below,” and words of similar import, when used in this application, shall refer to this application as a whole and not to any particular portions of this application. Where the context permits, words in the above Detailed Description using the singular or plural number may also include the plural or singular number respectively. The word “or,” in reference to a list of two or more items, covers all of the following interpretations of the word: any of the items in the list, all of the items in the list, and any combination of the items in the list.


The above detailed description of embodiments of the disclosure is not intended to be exhaustive or to limit the teachings to the precise form disclosed above. While specific embodiments of, and examples for, the disclosure are described above for illustrative purposes, various equivalent modifications are possible within the scope of the disclosure, as those skilled in the relevant art will recognize. For example, while processes or blocks are presented in a given order, alternative embodiments may perform routines having steps, or employ systems having blocks in a different order, and some processes or blocks may be deleted, moved, added, subdivided, combined, and/or modified to provide alternative or subcombinations. Each of these processes or blocks may be implemented in a variety of different ways. Also, while processes or blocks are at times shown as being performed in series, these processes or blocks may instead be performed in parallel, or may be performed at different times. Further any specific numbers noted herein are only examples: alternative implementations may employ differing values or ranges.


The teachings of the disclosure provided herein can be applied to other systems, not necessarily the system described above. The elements and acts of the various embodiments described above can be combined to provide further embodiments.


Any patents and applications and other references noted above, including any that may be listed in accompanying filing papers, are incorporated herein by reference. Aspects of the disclosure can be modified, if necessary, to employ the systems, functions, and concepts of the various references described above to provide yet further embodiments of the disclosure.


These and other changes can be made to the disclosure in light of the above Detailed Description. While the above description describes certain embodiments of the disclosure, and describes the best mode contemplated, no matter how detailed the above appears in text, the teachings can be practiced in many ways. Details of the system may vary considerably in its implementation details, while still being encompassed by the subject matter disclosed herein. As noted above, particular terminology used when describing certain features or aspects of the disclosure should not be taken to imply that the terminology is being redefined herein to be restricted to any specific characteristics, features, or aspects of the disclosure with which that terminology is associated. In general, the terms used in the following claims should not be construed to limit the disclosure to the specific embodiments disclosed in the specification, unless the above Detailed Description section explicitly defines such terms. Accordingly, the actual scope of the disclosure encompasses not only the disclosed embodiments, but also all equivalent ways of practicing or implementing the disclosure under the claims.


While certain aspects of the disclosure are presented below in certain claim forms, the inventors contemplate the various aspects of the disclosure in any number of claim forms. For example, while only one aspect of the disclosure is recited as a means-plus-function claim under 35 U.S.C. §112, ¶13, other aspects may likewise be embodied as a means-plus-function claim, or in other forms, such as being embodied in a computer-readable medium. (Any claims intended to be treated under 35 U.S.C. §112, ¶13 will begin with the words “means for.”) Accordingly, the applicant reserves the right to add additional claims after filing the application to pursue such additional claim forms for other aspects of the disclosure.

Claims
  • 1. A mobile device equipped for managing data traffic to reduce network signaling, comprising: a radio configured to send data connection requests to a mobile network;a processor;a memory unit having instructions stored thereon which when executed by the processor, causes the processor to: detect increase in radio turn-on time values associated with data connection requests;determine whether the increase in radio turn-on time values is due to congestion in the mobile network;wherein an indication of signal strength measured by the mobile device is used to determine that the increase in radio turn-on time values is due to congestion in the mobile network; andwherein a number of base stations under a location area code that are each associated with a threshold number of instances of detection of increase in radio turn-on time values is also used to determine that the increase in radio turn-on time values is due to congestion in the mobile network.
  • 2. The mobile device of claim 1, wherein the radio turn-on time is measured as the difference between time of a data request from an application on the mobile device and time of radio state transition to a connected state from an idle state.
  • 3. The mobile device of claim 1, wherein when the increase in radio turn-on time values is due to congestion in the mobile network, the processor is further caused to manage data traffic on the mobile device to reduce network signaling.
  • 4. The mobile device of claim 3, wherein managing the data traffic on the mobile device to reduce network signaling includes blocking data traffic having low priority from traversing the mobile network and allowing data traffic that is time critical to traverse the mobile network.
  • 5. The mobile device of claim 4, wherein the data traffic that is time critical includes a transaction resulting from a user interaction with the mobile device.
  • 6. The mobile device of claim 1, wherein the indication of signal strength is used to reduce or eliminate effect of signal strength on the detected increase in radio turn-on time values.
  • 7. The mobile device of claim 1, wherein information relating to the base stations and the location area code is used to reduce or eliminate effect of geographic mobility of the mobile device on the detected increase in radio turn-on time values.
  • 8. A system for managing data traffic at a mobile device to reduce network signaling, comprising: a memory;a processor disposed in communication with the memory and configured to execute instructions stored in the memory to:detect increase in setup times for connection requests in a mobile network from a baseline;detect congestion at one or more base stations in the mobile network based at least in part on the detected increase in setup times, wherein, the congestion is detected by the mobile device before a rejection to a connection request is received from one of the one or more base stations;wherein an indication of signal strength measured by the mobile device is used to determine that the increase in setup times is due to congestion in the mobile network;wherein a number of base stations under a location area code that are each associated with a threshold number of instances of detection of increase in setup times is also used to determine that the increase in setup times is due to congestion in the mobile network.
  • 9. The system of claim 8, further configured to apply a blocking policy to selectively block traffic from the mobile device from reaching the mobile network in response to detecting and confirming that the mobile network is congested.
  • 10. The system of claim 9, wherein the blocking policy selectively blocks the traffic from the mobile device based on time criticality of transactions.
  • 11. The system of claim 10, wherein a time critical transaction includes a transaction resulting from a user-initiated request.
  • 12. The system of claim 9, wherein the blocking policy blocks low priority traffic from going out to the mobile network to reduce network signaling from the mobile device to the one or more base stations.
  • 13. The system of claim 9, wherein the blocking policy is in effect until the end of a predefined time period or when a time critical transaction is detected.
  • 14. The system of claim 8, further configured to log setup times to periodically inform a service provider associated with the mobile network regarding the congestion at the one or more base stations.
  • 15. The system of claim 8, wherein the congestion is detected by the mobile device, independent of other mobile devices on the mobile network.
  • 16. The system of claim 8, wherein the congestion is detected by the mobile device without incurring signaling load on the mobile network.
  • 17. The system of claim 8, further configured to detect congestion at the one or more base stations without relying on a specific mobile device chipset or baseband.
  • 18. The system of claim 8, further configured to use application behavior to categorize application traffic and selectively block certain types of application traffic from traversing the mobile network to reduce signaling overload on the mobile network in response to detecting congestion in the mobile network.
  • 19. The system of claim 8, wherein a base station from the one or more base stations is a Base Transceiver Station (BTS) in a Global System for Mobile Communications (GSM) or Code Division Multiple Access (CDMA) mobile network, a Node B in a 3G mobile network or an Evolved Node B in Long-Term Evolution (LTE) network.
  • 20. The system of claim 8, wherein, a setup time for a connection request is measured as an elapsed time between detecting of an outgoing data request from the mobile device while a radio state is idle and transition of the radio state to a connected state.
  • 21. A method for managing data traffic at a mobile device to reduce network signaling, comprising: detecting increase in setup times from a baseline for connection requests in a mobile network;detecting, by the mobile device, congestion at one or more base stations in the mobile network based at least in part on the detected increase in setup times;using an indication of signal strength measured by the mobile device to determine that the increase in setup times is due to congestion in the mobile network; andusing a number of base stations under a location area code that are each associated with a threshold number of instances of detection of increase in setup times to further determine that the increase in setup times is due to congestion in the mobile network.
  • 22. The method of claim 21, wherein the congestion is detected by the mobile device before a rejection to a connection request is received from one of the one or more base stations.
  • 23. The method of claim 21, further comprising applying a blocking policy to selectively block traffic from the mobile device from reaching the mobile network in response to detecting that the mobile network is congested, wherein the blocking policy is in effect until the end of a predefined time period or when a time critical transaction is detected.
  • 24. The method of claim 23, wherein a time critical transaction includes a transaction resulting from a user-initiated request.
  • 25. The method of claim 21, further comprising logging the setup times to periodically inform a service provider associated with the mobile network regarding the congestion at the one or more base stations.
  • 26. The method of claim 21, wherein the congestion is detected by the mobile device, independent of other mobile devices on the mobile network.
  • 27. The method of claim 21, wherein the congestion is detected by the mobile device without incurring signaling load on the mobile network.
  • 28. The method of claim 23, wherein the blocking policy selectively blocks low priority traffic from going out to the mobile network to reduce network signaling from the mobile device to the one or more base stations.
  • 29. The method of claim 21, wherein the congestion is detected by the mobile device without relying on a specific mobile device chipset or baseband.
  • 30. The method of claim 21, further comprising using application behavior to categorize application traffic and selectively block certain types of application traffic from traversing the mobile network to reduce signaling overload on the mobile network in response to detecting and confirming congestion in the mobile network.
US Referenced Citations (1726)
Number Name Date Kind
222458 Connolly et al. Dec 1879 A
447918 Strowger Mar 1891 A
4200770 Hellman et al. Apr 1980 A
4255796 Gabbe et al. Mar 1981 A
4276597 Dissly et al. Jun 1981 A
4531020 Wechselberger et al. Jul 1985 A
4807182 Queen Feb 1989 A
4831582 Miller et al. May 1989 A
4875159 Cary et al. Oct 1989 A
4897781 Chang et al. Jan 1990 A
4972457 O'Sullivan Nov 1990 A
5008853 Bly et al. Apr 1991 A
5159624 Makita Oct 1992 A
5220657 Bly et al. Jun 1993 A
5263157 Janis Nov 1993 A
5283856 Gross et al. Feb 1994 A
5357431 Nakada et al. Oct 1994 A
5384892 Strong Jan 1995 A
5386564 Shearer et al. Jan 1995 A
5392390 Crozier Feb 1995 A
5434994 Shaheen et al. Jul 1995 A
5436960 Campana, Jr. et al. Jul 1995 A
5438611 Campana, Jr. et al. Aug 1995 A
5479472 Campana, Jr. et al. Dec 1995 A
5487100 Kane Jan 1996 A
5491703 Barnaby et al. Feb 1996 A
5493692 Theimer et al. Feb 1996 A
5519606 Frid-Nielsen et al. May 1996 A
5537464 Lewis et al. Jul 1996 A
5555376 Theimer et al. Sep 1996 A
5559800 Mousseau et al. Sep 1996 A
5572571 Shirai Nov 1996 A
5572643 Judson Nov 1996 A
5574859 Yeh Nov 1996 A
5581749 Hossain et al. Dec 1996 A
5600834 Howard Feb 1997 A
5603054 Theimer et al. Feb 1997 A
5604788 Tett Feb 1997 A
5613012 Hoffman et al. Mar 1997 A
5619507 Tsuda Apr 1997 A
5619648 Canale et al. Apr 1997 A
5623601 Vu Apr 1997 A
5625670 Campana, Jr. et al. Apr 1997 A
5625815 Maier et al. Apr 1997 A
5627658 Connors et al. May 1997 A
5630081 Rybicki et al. May 1997 A
5631946 Campana, Jr. et al. May 1997 A
5632018 Otorii May 1997 A
5634053 Noble et al. May 1997 A
5644788 Courtright et al. Jul 1997 A
5647002 Brunson Jul 1997 A
5652884 Palevich Jul 1997 A
5664207 Crumpler et al. Sep 1997 A
5666530 Clark et al. Sep 1997 A
5666553 Crozier Sep 1997 A
5673322 Pepe et al. Sep 1997 A
5680542 Mulchandani et al. Oct 1997 A
5682524 Freund et al. Oct 1997 A
5684990 Boothby Nov 1997 A
5689654 Kikinis et al. Nov 1997 A
5692039 Brankley et al. Nov 1997 A
5696903 Mahany Dec 1997 A
5701423 Crozier Dec 1997 A
5701469 Brandli et al. Dec 1997 A
5704029 Wright, Jr. Dec 1997 A
5706211 Beletic et al. Jan 1998 A
5706502 Foley et al. Jan 1998 A
5706507 Schloss Jan 1998 A
5710918 Lagarde et al. Jan 1998 A
5713019 Keaten Jan 1998 A
5715403 Stefik Feb 1998 A
5717925 Harper et al. Feb 1998 A
5721908 Lagarde et al. Feb 1998 A
5721914 DeVries Feb 1998 A
5727202 Kucala Mar 1998 A
5729549 Kostreski et al. Mar 1998 A
5729704 Stone et al. Mar 1998 A
5729735 Meyering Mar 1998 A
5742905 Pepe et al. Apr 1998 A
5745360 Leone et al. Apr 1998 A
5752186 Malackowski et al. May 1998 A
5752246 Rogers et al. May 1998 A
5754938 Herz et al. May 1998 A
5757916 MacDoran et al. May 1998 A
5758088 Bezaire et al. May 1998 A
5758150 Bell et al. May 1998 A
5758322 Rongley May 1998 A
5758354 Huang et al. May 1998 A
5758355 Buchanan May 1998 A
5765171 Gehani et al. Jun 1998 A
5778346 Frid-Nielsen et al. Jul 1998 A
5778361 Nanjo et al. Jul 1998 A
5781614 Brunson Jul 1998 A
5781901 Kuzma Jul 1998 A
5781906 Aggarwal et al. Jul 1998 A
5787430 Doeringer et al. Jul 1998 A
5787441 Beckhardt Jul 1998 A
5790425 Wagle Aug 1998 A
5790790 Smith et al. Aug 1998 A
5790974 Tognazzini Aug 1998 A
5793413 Hylton et al. Aug 1998 A
5794210 Goldhaber et al. Aug 1998 A
5799318 Cardinal et al. Aug 1998 A
5802312 Lazaridis et al. Sep 1998 A
5802454 Goshay et al. Sep 1998 A
5802518 Karaev et al. Sep 1998 A
5802524 Flowers et al. Sep 1998 A
5806074 Souder et al. Sep 1998 A
5809242 Shaw et al. Sep 1998 A
5809415 Rossmann Sep 1998 A
5818437 Grover et al. Oct 1998 A
5819172 Campana, Jr. et al. Oct 1998 A
5819274 Jackson, Jr. Oct 1998 A
5819284 Farber et al. Oct 1998 A
5822324 Kostresti et al. Oct 1998 A
5822747 Graefe et al. Oct 1998 A
5826269 Hussey Oct 1998 A
5831664 Wharton et al. Nov 1998 A
5832483 Barker Nov 1998 A
5832489 Kucala Nov 1998 A
5832500 Burrows Nov 1998 A
5835087 Herz et al. Nov 1998 A
5835722 Bradshaw et al. Nov 1998 A
5838252 Kikinis Nov 1998 A
5838768 Sumar et al. Nov 1998 A
5838973 Carpenter-Smith et al. Nov 1998 A
5845278 Kirsch et al. Dec 1998 A
5852775 Hidary Dec 1998 A
5852820 Burrows Dec 1998 A
5857201 Wright, Jr. et al. Jan 1999 A
5862223 Walker et al. Jan 1999 A
5867665 Butman et al. Feb 1999 A
5867817 Catallo et al. Feb 1999 A
5870759 Bauer et al. Feb 1999 A
5881231 Takagi et al. Mar 1999 A
5884323 Hawkins et al. Mar 1999 A
5889845 Staples et al. Mar 1999 A
5889953 Thebaut et al. Mar 1999 A
5890147 Peltonen et al. Mar 1999 A
5892909 Grasso et al. Apr 1999 A
5898780 Liu et al. Apr 1999 A
5898917 Batni et al. Apr 1999 A
5903723 Beck et al. May 1999 A
5907618 Gennaro et al. May 1999 A
5909689 Van Ryzin Jun 1999 A
5913032 Schwartz et al. Jun 1999 A
5924096 Draper et al. Jul 1999 A
5928325 Shaughnessy et al. Jul 1999 A
5928329 Clark et al. Jul 1999 A
5937161 Mulligan et al. Aug 1999 A
5940813 Hutchings Aug 1999 A
5943676 Boothby Aug 1999 A
5948066 Whalen et al. Sep 1999 A
5951636 Zerber Sep 1999 A
5960394 Gould et al. Sep 1999 A
5960406 Rasansky et al. Sep 1999 A
5961590 Mendez et al. Oct 1999 A
5963642 Goldstein Oct 1999 A
5964833 Kikinis Oct 1999 A
5968131 Mendez et al. Oct 1999 A
5974238 Chase, Jr. Oct 1999 A
5974327 Agrawal et al. Oct 1999 A
5978837 Foladare et al. Nov 1999 A
5978933 Wyld et al. Nov 1999 A
5987440 O'Neil et al. Nov 1999 A
6000000 Hawkins et al. Dec 1999 A
6003070 Frantz Dec 1999 A
6006197 d'Eon et al. Dec 1999 A
6006274 Hawkins et al. Dec 1999 A
6016478 Zhang et al. Jan 2000 A
6016520 Facq et al. Jan 2000 A
6018762 Brunson et al. Jan 2000 A
6023700 Owens et al. Feb 2000 A
6023708 Mendez et al. Feb 2000 A
6029238 Furukawa Feb 2000 A
6034621 Kaufman Mar 2000 A
6035104 Zahariev Mar 2000 A
6044205 Reed et al. Mar 2000 A
6044372 Rothfus et al. Mar 2000 A
6044381 Boothby et al. Mar 2000 A
6047051 Ginzboorg et al. Apr 2000 A
6047327 Tso et al. Apr 2000 A
6052563 Macko Apr 2000 A
6052735 Ulrich et al. Apr 2000 A
6057855 Barkans May 2000 A
6065055 Hughes et al. May 2000 A
6067477 Wewalaarachchi et al. May 2000 A
6073138 de l'Etraz et al. Jun 2000 A
6073142 Geiger et al. Jun 2000 A
6073165 Narasimhan et al. Jun 2000 A
6085166 Beckhardt et al. Jul 2000 A
6085192 Mendez et al. Jul 2000 A
6088677 Spurgeon Jul 2000 A
6098172 Coss et al. Aug 2000 A
6101320 Schuetze et al. Aug 2000 A
6101480 Conmy et al. Aug 2000 A
6101531 Eggleston et al. Aug 2000 A
6112181 Shear et al. Aug 2000 A
6119014 Alperovich et al. Sep 2000 A
6119171 Alkhatib Sep 2000 A
6125369 Wu et al. Sep 2000 A
6125388 Reisman Sep 2000 A
6125441 Green Sep 2000 A
6128627 Mattis et al. Oct 2000 A
6130898 Kostreski et al. Oct 2000 A
6131096 Ng et al. Oct 2000 A
6131116 Riggins et al. Oct 2000 A
6134432 Holmes et al. Oct 2000 A
6138013 Blanchard et al. Oct 2000 A
6138124 Beckhardt Oct 2000 A
6138128 Perkowitz et al. Oct 2000 A
6138146 Moon et al. Oct 2000 A
6141664 Boothby Oct 2000 A
6151606 Mendez Nov 2000 A
6157630 Adler et al. Dec 2000 A
6161008 Lee et al. Dec 2000 A
6161140 Moriya Dec 2000 A
6167379 Dean et al. Dec 2000 A
6167435 Druckenmiller et al. Dec 2000 A
6170014 Darago et al. Jan 2001 B1
6173312 Atarashi et al. Jan 2001 B1
6173446 Khan et al. Jan 2001 B1
6175831 Weinreich et al. Jan 2001 B1
6178419 Legh-Smith et al. Jan 2001 B1
6181935 Gossman et al. Jan 2001 B1
6185184 Mattaway et al. Feb 2001 B1
6195533 Tkatch et al. Feb 2001 B1
6198696 Korpi et al. Mar 2001 B1
6198922 Baynham Mar 2001 B1
6201469 Balch et al. Mar 2001 B1
6202085 Benson et al. Mar 2001 B1
6205448 Kruglikov et al. Mar 2001 B1
6209038 Bowen et al. Mar 2001 B1
6212529 Boothby et al. Apr 2001 B1
6219694 Lazaridis et al. Apr 2001 B1
6221877 Aronov et al. Apr 2001 B1
6223187 Boothby et al. Apr 2001 B1
6226686 Rothschild et al. May 2001 B1
6233341 Riggins May 2001 B1
6233606 Dujari May 2001 B1
6243705 Kucala Jun 2001 B1
6246875 Seazholtz et al. Jun 2001 B1
6247135 Feague Jun 2001 B1
6249808 Seshadri Jun 2001 B1
6256666 Singhal Jul 2001 B1
6263201 Hashimoto et al. Jul 2001 B1
6263340 Green Jul 2001 B1
6269369 Robertson Jul 2001 B1
6272545 Flanagin et al. Aug 2001 B1
6275850 Beyda et al. Aug 2001 B1
6275858 Bates et al. Aug 2001 B1
6289212 Stein et al. Sep 2001 B1
6289214 Backstrom Sep 2001 B1
6292904 Broomhall et al. Sep 2001 B1
6295541 Bodnar et al. Sep 2001 B1
6300947 Kanevsky Oct 2001 B1
6304881 Halim et al. Oct 2001 B1
6308201 Pivowar et al. Oct 2001 B1
6311216 Smith et al. Oct 2001 B1
6317594 Gossman et al. Nov 2001 B1
6320943 Borland Nov 2001 B1
6324541 de l'Etraz et al. Nov 2001 B1
6324542 Wright, Jr. et al. Nov 2001 B1
6324544 Alam et al. Nov 2001 B1
6324587 Trenbeath et al. Nov 2001 B1
6327586 Kisiel Dec 2001 B1
6336117 Massarani Jan 2002 B1
6336138 Caswell et al. Jan 2002 B1
6341311 Smith et al. Jan 2002 B1
6351767 Batchelder et al. Feb 2002 B1
6356937 Montville et al. Mar 2002 B1
6363051 Eslambolchi et al. Mar 2002 B1
6363352 Dailey et al. Mar 2002 B1
6370566 Discolo et al. Apr 2002 B2
6377790 Ishii Apr 2002 B1
6377810 Geiger et al. Apr 2002 B1
6377991 Smith et al. Apr 2002 B1
6380959 Wang et al. Apr 2002 B1
6389422 Doi et al. May 2002 B1
6389455 Fuisz May 2002 B1
6389457 Lazaridis et al. May 2002 B2
6397057 Malackowski et al. May 2002 B1
6397230 Carmel et al. May 2002 B1
6401104 LaRue et al. Jun 2002 B1
6401112 Boyer et al. Jun 2002 B1
6401113 Lazaridis et al. Jun 2002 B2
6405197 Gilmour Jun 2002 B2
6411696 Iverson et al. Jun 2002 B1
6415031 Colligan et al. Jul 2002 B1
6418308 Heinonen et al. Jul 2002 B1
6421669 Gilmour et al. Jul 2002 B1
6421674 Yoakum et al. Jul 2002 B1
6421781 Fox et al. Jul 2002 B1
6430602 Kay et al. Aug 2002 B1
6438585 Mousseau et al. Aug 2002 B2
6438612 Ylonen et al. Aug 2002 B1
6442589 Takahashi et al. Aug 2002 B1
6442637 Hawkins et al. Aug 2002 B1
6446118 Gottlieb Sep 2002 B1
6463463 Godfrey et al. Oct 2002 B1
6463464 Lazaridis et al. Oct 2002 B1
6484203 Porras et al. Nov 2002 B1
6487557 Nagatomo Nov 2002 B1
6487560 LaRue et al. Nov 2002 B1
6490353 Tan Dec 2002 B1
6496802 van Zoest et al. Dec 2002 B1
6499054 Hesselink et al. Dec 2002 B1
6505214 Sherman et al. Jan 2003 B1
6516327 Zondervan et al. Feb 2003 B1
6526433 Chang et al. Feb 2003 B1
6526506 Lewis Feb 2003 B1
6529908 Piett et al. Mar 2003 B1
6532446 King Mar 2003 B1
6535892 LaRue et al. Mar 2003 B1
6546005 Berkley et al. Apr 2003 B1
6549939 Ford et al. Apr 2003 B1
6556217 Mäkipää et al. Apr 2003 B1
6557026 Stephens, Jr. Apr 2003 B1
6571140 Wewalaarachchi et al. May 2003 B1
6593944 Nicolas et al. Jul 2003 B1
6601026 Appelt et al. Jul 2003 B2
6615253 Bowman-Amuah Sep 2003 B1
6618710 Zondervan et al. Sep 2003 B1
6621892 Banister et al. Sep 2003 B1
6622157 Heddaya et al. Sep 2003 B1
6625621 Tan et al. Sep 2003 B2
6636482 Cloonan et al. Oct 2003 B2
6639693 Ejiri et al. Oct 2003 B1
6640097 Corrigan et al. Oct 2003 B2
6640244 Bowman-Amuah Oct 2003 B1
6640249 Bowman-Amuah Oct 2003 B1
6643650 Slaughter et al. Nov 2003 B1
6643688 Fuisz Nov 2003 B1
6647384 Gilmour Nov 2003 B2
6650890 Irlam et al. Nov 2003 B1
6662016 Buckham et al. Dec 2003 B1
6668046 Albal Dec 2003 B1
6671695 McFadden Dec 2003 B2
6671700 Creemer et al. Dec 2003 B1
6671702 Kruglikov et al. Dec 2003 B2
6671757 Multer et al. Dec 2003 B1
6694336 Multer et al. Feb 2004 B1
6697807 McGeachie Feb 2004 B2
6701378 Gilhuly et al. Mar 2004 B1
6707801 Hsu Mar 2004 B2
6708221 Mendez et al. Mar 2004 B1
6714965 Kakuta et al. Mar 2004 B2
6721787 Hiscock Apr 2004 B1
6727917 Chew et al. Apr 2004 B1
6728530 Heinonen et al. Apr 2004 B1
6728786 Hawkins et al. Apr 2004 B2
6732101 Cook May 2004 B1
6732158 Hesselink et al. May 2004 B1
6735591 Khan May 2004 B2
6741232 Siedlikowski et al. May 2004 B1
6741855 Martin et al. May 2004 B1
6742015 Bowman-Amuah May 2004 B1
6742059 Todd et al. May 2004 B1
6745024 DeJaco et al. Jun 2004 B1
6745326 Wary Jun 2004 B1
6756882 Benes et al. Jun 2004 B2
6757362 Cooper et al. Jun 2004 B1
6757696 Multer et al. Jun 2004 B2
6757708 Craig et al. Jun 2004 B1
6760916 Holtz et al. Jul 2004 B2
6771294 Pulli et al. Aug 2004 B1
6775362 Ransom Aug 2004 B1
6779019 Mousseau et al. Aug 2004 B1
6782409 Yoshida Aug 2004 B1
6785868 Raff Aug 2004 B1
6785906 Gaughan et al. Aug 2004 B1
6799190 Boothby Sep 2004 B1
6804707 Ronning Oct 2004 B1
6810405 LaRue et al. Oct 2004 B1
6816849 Halt, Jr. Nov 2004 B1
6820088 Hind et al. Nov 2004 B1
6820204 Desai et al. Nov 2004 B1
6829487 Eiden et al. Dec 2004 B2
6834195 Brandenberg et al. Dec 2004 B2
6845383 Kraenzel et al. Jan 2005 B1
6847974 Wachtel Jan 2005 B2
6850757 Watanabe et al. Feb 2005 B2
6859212 Kumar et al. Feb 2005 B2
6867774 Halmshaw et al. Mar 2005 B1
6868447 Slaughter et al. Mar 2005 B1
6871220 Rajan et al. Mar 2005 B1
6871236 Fishman et al. Mar 2005 B2
6873688 Aarnio Mar 2005 B1
6874017 Inoue et al. Mar 2005 B1
6879985 Deguchi et al. Apr 2005 B2
6886030 Easterbrook et al. Apr 2005 B1
6892070 Warrier et al. May 2005 B2
6892196 Hughes May 2005 B1
6895394 Kremer et al. May 2005 B1
6895558 Loveland May 2005 B1
6898427 Griffith et al. May 2005 B1
6912562 Krishnamurthy et al. Jun 2005 B1
6922547 O'Neill et al. Jul 2005 B2
6922721 Minborg et al. Jul 2005 B1
6925477 Champagne et al. Aug 2005 B1
6931529 Kunzinger Aug 2005 B2
6938079 Anderson et al. Aug 2005 B1
6938100 Kang Aug 2005 B2
6941351 Vetrivelkumaran et al. Sep 2005 B2
6944447 Portman et al. Sep 2005 B2
6944662 Devine et al. Sep 2005 B2
6947770 Rydbeck Sep 2005 B2
6954754 Peng Oct 2005 B2
6957397 Hawkins et al. Oct 2005 B1
6965917 Aloni et al. Nov 2005 B1
6965968 Touboul Nov 2005 B1
6966058 Earl et al. Nov 2005 B2
6968175 Raivisto et al. Nov 2005 B2
6970879 Gilmour Nov 2005 B1
6972682 Lareau et al. Dec 2005 B2
6973299 Apfel Dec 2005 B2
6981041 Araujo et al. Dec 2005 B2
6981047 Hanson et al. Dec 2005 B2
6985933 Singhal et al. Jan 2006 B1
6985983 Pellegrino et al. Jan 2006 B2
6986061 Kunzinger Jan 2006 B1
6987734 Hundemer Jan 2006 B2
6990472 Rosenhaft et al. Jan 2006 B2
6993326 Link, II et al. Jan 2006 B2
6993327 Mathis Jan 2006 B2
6996627 Carden Feb 2006 B1
6999753 Beckmann et al. Feb 2006 B2
7016710 Carmeli et al. Mar 2006 B2
7020685 Chen et al. Mar 2006 B1
7024491 Hanmann et al. Apr 2006 B1
7026984 Thandu et al. Apr 2006 B1
7032242 Grabelsky et al. Apr 2006 B1
7035630 Knowles Apr 2006 B2
7046993 Haaramo et al. May 2006 B2
7047202 Jaipuria et al. May 2006 B2
7062024 Kreckel et al. Jun 2006 B2
7069308 Abrams Jun 2006 B2
7072678 Allison Jul 2006 B2
7079499 Akhtar et al. Jul 2006 B1
7080371 Arnaiz et al. Jul 2006 B1
7082316 Eiden et al. Jul 2006 B2
7085260 Karaul et al. Aug 2006 B2
7085365 Kauppinen Aug 2006 B2
7096030 Huomo Aug 2006 B2
7100821 Rasti Sep 2006 B2
7103432 Drader et al. Sep 2006 B2
7116682 Waclawsky et al. Oct 2006 B1
7120692 Hesselink et al. Oct 2006 B2
7120928 Sheth et al. Oct 2006 B2
7124320 Wipfel Oct 2006 B1
7127492 Calo et al. Oct 2006 B1
7130839 Boreham et al. Oct 2006 B2
7136645 Hanson et al. Nov 2006 B2
7139555 Apfel Nov 2006 B2
7139565 Fiatal et al. Nov 2006 B2
7140549 de Jong Nov 2006 B2
7146645 Hellsten et al. Dec 2006 B1
7149780 Quine et al. Dec 2006 B2
7149789 Slivka et al. Dec 2006 B2
7149959 Jones et al. Dec 2006 B1
7162241 Kim et al. Jan 2007 B2
7165727 de Jong Jan 2007 B2
7172118 Urken Feb 2007 B2
7177912 Ignatoff et al. Feb 2007 B1
7181212 Hogan et al. Feb 2007 B2
7181228 Boesch Feb 2007 B2
7184790 Dorenbosch et al. Feb 2007 B2
7185362 Hawkes et al. Feb 2007 B2
7194273 Vaudreuil Mar 2007 B2
7200390 Henager et al. Apr 2007 B1
7203733 Bern Apr 2007 B1
7206806 Pineau Apr 2007 B2
7209757 Naghian et al. Apr 2007 B2
7210121 Xia et al. Apr 2007 B2
7219139 Martin et al. May 2007 B2
7219222 Durbin et al. May 2007 B1
7224957 Spector May 2007 B2
7231206 Cudak et al. Jun 2007 B2
7233795 Ryden Jun 2007 B1
7234111 Chu et al. Jun 2007 B2
7239877 Corneille et al. Jul 2007 B2
7240095 Lewis Jul 2007 B1
7242680 Gallant Jul 2007 B2
7245926 Liao et al. Jul 2007 B2
7249370 Kodama et al. Jul 2007 B2
7257391 Burgess et al. Aug 2007 B2
7257639 Li et al. Aug 2007 B1
7259666 Hermsmeyer et al. Aug 2007 B1
7260552 Riera Jorba et al. Aug 2007 B2
7260590 Williams Aug 2007 B1
7260651 Parrella, Sr. et al. Aug 2007 B2
7272830 de Jong Sep 2007 B2
7274783 Yoakum et al. Sep 2007 B2
7277408 Sorsa Oct 2007 B2
7284664 Ivchenko et al. Oct 2007 B1
7289792 Turunen Oct 2007 B1
7289964 Bowman-Amuah Oct 2007 B1
7289971 O'Neil et al. Oct 2007 B1
7293107 Hanson et al. Nov 2007 B1
7295853 Jin et al. Nov 2007 B2
7296155 Trostle et al. Nov 2007 B1
7305252 Britt et al. Dec 2007 B2
7305700 Boynton et al. Dec 2007 B2
7310350 Shao et al. Dec 2007 B1
7310729 Gordon et al. Dec 2007 B2
7324473 Corneille et al. Jan 2008 B2
7337219 Meenan et al. Feb 2008 B1
7343396 Kausik et al. Mar 2008 B2
7349871 Labrou et al. Mar 2008 B2
7353258 Washburn Apr 2008 B2
7353274 Rouhi et al. Apr 2008 B1
7359720 Hartmaier et al. Apr 2008 B2
7373386 Gardner et al. May 2008 B2
7373661 Smith et al. May 2008 B2
7374099 de Jong May 2008 B2
7376701 Bhargava et al. May 2008 B2
7382879 Miller Jun 2008 B1
7383339 Meenan et al. Jun 2008 B1
7388950 Elsey et al. Jun 2008 B2
7389412 Sharma et al. Jun 2008 B2
7392483 Wong et al. Jun 2008 B2
7395329 Holt et al. Jul 2008 B1
7398271 Borkovsky et al. Jul 2008 B1
7430609 Brown et al. Sep 2008 B2
7441271 Fiatal et al. Oct 2008 B2
7443847 Albert et al. Oct 2008 B1
7461071 Fitzpatrick et al. Dec 2008 B2
7465231 Lewin et al. Dec 2008 B2
7469125 Nurmi Dec 2008 B2
7472424 Evans et al. Dec 2008 B2
7483036 Moore Jan 2009 B2
7499537 Elsey et al. Mar 2009 B2
7502615 Wilhoite et al. Mar 2009 B2
7519042 Gorday et al. Apr 2009 B2
7532571 Price et al. May 2009 B1
7539665 Mendez May 2009 B2
7548947 Karsriel et al. Jun 2009 B2
7548969 Tripp et al. Jun 2009 B2
7551900 Kang et al. Jun 2009 B2
7555291 Wassingbo Jun 2009 B2
7567575 Chen et al. Jul 2009 B2
7574208 Hanson et al. Aug 2009 B2
7575171 Lev Aug 2009 B2
7584294 Plamondon Sep 2009 B2
7587482 Henderson et al. Sep 2009 B2
7587510 Klager et al. Sep 2009 B1
7587608 Haller et al. Sep 2009 B2
7589223 Bildstein et al. Sep 2009 B2
7593714 Schultz et al. Sep 2009 B2
7596608 Alexander et al. Sep 2009 B2
7596791 Wei et al. Sep 2009 B2
7613792 Zervas et al. Nov 2009 B2
7630986 Herz et al. Dec 2009 B1
7634558 Mangal et al. Dec 2009 B1
7636763 Fein et al. Dec 2009 B1
7643818 Backholm et al. Jan 2010 B2
7644166 Appelman et al. Jan 2010 B2
7647047 Moghaddam et al. Jan 2010 B2
7647561 Zondervan et al. Jan 2010 B2
7650416 Wu et al. Jan 2010 B2
7650432 Bosworth et al. Jan 2010 B2
7672291 Wang Mar 2010 B2
7672439 Appelman et al. Mar 2010 B2
7680281 Fiatal et al. Mar 2010 B2
7680520 Ruuska et al. Mar 2010 B2
7684346 Valli Mar 2010 B2
7689664 Karlberg Mar 2010 B2
7693555 Srinivasan et al. Apr 2010 B2
7693944 Appelman et al. Apr 2010 B2
7694008 Chang et al. Apr 2010 B2
7706781 Backholm et al. Apr 2010 B2
7707573 Marmaros et al. Apr 2010 B1
7716710 Everson et al. May 2010 B1
7751803 Vialen et al. Jul 2010 B2
7752633 Fleming Jul 2010 B1
7757956 Koenck et al. Jul 2010 B2
7769395 Fiatal et al. Aug 2010 B2
7769400 Backholm et al. Aug 2010 B2
7769805 Barnes et al. Aug 2010 B1
7770223 Shevenell et al. Aug 2010 B2
7778792 Huang et al. Aug 2010 B2
7783757 Plamondon Aug 2010 B2
7796742 Sutaria et al. Sep 2010 B1
7797064 Loomis et al. Sep 2010 B2
7809818 Plamondon Oct 2010 B2
7827055 Snodgrass et al. Nov 2010 B1
7827597 Boynton et al. Nov 2010 B2
7849507 Bloch et al. Dec 2010 B1
7853563 Alvarado et al. Dec 2010 B2
7865618 Howell et al. Jan 2011 B2
7873609 Kim et al. Jan 2011 B2
7873705 Kalish Jan 2011 B2
7877703 Fleming Jan 2011 B1
7877807 Shipp Jan 2011 B2
7881745 Rao et al. Feb 2011 B1
7899996 Levin-Michael Mar 2011 B1
7904548 Shah et al. Mar 2011 B2
7908656 Mu Mar 2011 B1
7917468 Ariel et al. Mar 2011 B2
7917505 van Gent et al. Mar 2011 B2
7921167 Shroff et al. Apr 2011 B2
7930416 Miller et al. Apr 2011 B2
7933929 McClendon et al. Apr 2011 B1
7937091 Roman et al. May 2011 B2
7941582 Bushell et al. May 2011 B2
7958238 Batz et al. Jun 2011 B1
7970860 Kline et al. Jun 2011 B2
7970939 Satish et al. Jun 2011 B1
7996487 Snyder Aug 2011 B2
7996876 Everson et al. Aug 2011 B1
8005891 Knowles et al. Aug 2011 B2
8010082 Sutaria et al. Aug 2011 B2
8032409 Mikurak Oct 2011 B1
8056136 Zaitsev Nov 2011 B1
8060154 Bali et al. Nov 2011 B1
8064583 Sutaria et al. Nov 2011 B1
8069166 Alvarado et al. Nov 2011 B2
8074162 Cohen Dec 2011 B1
8078158 Backholm Dec 2011 B2
8087085 Hu et al. Dec 2011 B2
8107921 Fiatal Jan 2012 B2
8116214 Backholm et al. Feb 2012 B2
8127342 Boynton et al. Feb 2012 B2
8131763 Tuscano et al. Mar 2012 B2
8160062 Qian et al. Apr 2012 B2
8166164 Luna et al. Apr 2012 B1
8190680 Spilo et al. May 2012 B2
8190701 Luna et al. May 2012 B2
8194680 Brandwine et al. Jun 2012 B1
8195196 Haran et al. Jun 2012 B2
8204953 Luna et al. Jun 2012 B2
8209709 Fleming Jun 2012 B2
8214813 Harris et al. Jul 2012 B2
8239915 Satish et al. Aug 2012 B1
8260852 Cselle Sep 2012 B1
8291076 Luna et al. Oct 2012 B2
8316098 Luna et al. Nov 2012 B2
8326985 Luna et al. Dec 2012 B2
8340633 Rege et al. Dec 2012 B1
8356080 Luna et al. Jan 2013 B2
8364181 Backholm et al. Jan 2013 B2
8412675 Alvarado et al. Apr 2013 B2
8417823 Luna et al. Apr 2013 B2
8438633 Backholm et al. May 2013 B1
8484314 Luna et al. Jul 2013 B2
8522086 Garrett Aug 2013 B1
8539040 Luna et al. Sep 2013 B2
8606290 Gerber et al. Dec 2013 B2
8621075 Luna Dec 2013 B2
8635339 Luna Jan 2014 B2
20010005364 Kang Jun 2001 A1
20010009025 Ahonen Jul 2001 A1
20010010046 Muyres et al. Jul 2001 A1
20010013069 Shah Aug 2001 A1
20010013088 Matsumoto Aug 2001 A1
20010023414 Kumar et al. Sep 2001 A1
20010032254 Hawkins Oct 2001 A1
20010034225 Gupte et al. Oct 2001 A1
20010034244 Calder et al. Oct 2001 A1
20010037453 Mitty et al. Nov 2001 A1
20010039191 Maierhofer Nov 2001 A1
20010041566 Xanthos et al. Nov 2001 A1
20010042009 Montague Nov 2001 A1
20010042099 Peng Nov 2001 A1
20010043148 Stewart Nov 2001 A1
20010052052 Peng Dec 2001 A1
20010053687 Sivula Dec 2001 A1
20020002478 Swart et al. Jan 2002 A1
20020002591 Ketola Jan 2002 A1
20020004746 Ferber et al. Jan 2002 A1
20020007303 Brookler et al. Jan 2002 A1
20020013727 Lee Jan 2002 A1
20020019225 Miyashita Feb 2002 A1
20020019812 Board et al. Feb 2002 A1
20020019830 Hamberg et al. Feb 2002 A1
20020032671 Iinuma Mar 2002 A1
20020035556 Shah et al. Mar 2002 A1
20020035617 Lynch et al. Mar 2002 A1
20020038253 Seaman et al. Mar 2002 A1
20020042875 Shukla Apr 2002 A1
20020049828 Pekarek-Kostka Apr 2002 A1
20020049857 Farber et al. Apr 2002 A1
20020052965 Dowling May 2002 A1
20020053078 Holtz et al. May 2002 A1
20020055351 Elsey et al. May 2002 A1
20020059201 Work May 2002 A1
20020059251 Stern et al. May 2002 A1
20020059457 Ballard et al. May 2002 A1
20020062467 Hunzinger May 2002 A1
20020065110 Enns et al. May 2002 A1
20020068559 Sharma et al. Jun 2002 A1
20020069037 Hendrickson et al. Jun 2002 A1
20020073207 Widger et al. Jun 2002 A1
20020077077 Rezvani et al. Jun 2002 A1
20020077084 Zellner et al. Jun 2002 A1
20020078300 Dharap Jun 2002 A1
20020078384 Hippelainen Jun 2002 A1
20020087549 Mostafa Jul 2002 A1
20020087679 Pulley et al. Jul 2002 A1
20020087723 Williams et al. Jul 2002 A1
20020087883 Wohlgemuth et al. Jul 2002 A1
20020089542 Imamura Jul 2002 A1
20020091921 Kunzinger Jul 2002 A1
20020095319 Swart et al. Jul 2002 A1
20020095328 Swart et al. Jul 2002 A1
20020095391 Swart et al. Jul 2002 A1
20020095399 Devine et al. Jul 2002 A1
20020098855 Hartmaier et al. Jul 2002 A1
20020099613 Swart et al. Jul 2002 A1
20020099809 Lee Jul 2002 A1
20020101975 Tiburtius et al. Aug 2002 A1
20020103008 Rahn et al. Aug 2002 A1
20020103934 Fishman et al. Aug 2002 A1
20020107042 Murnaghan et al. Aug 2002 A1
20020107944 Bai et al. Aug 2002 A1
20020107985 Hwang et al. Aug 2002 A1
20020108121 Alao et al. Aug 2002 A1
20020116499 Ennus et al. Aug 2002 A1
20020116501 Ho et al. Aug 2002 A1
20020120388 Bullock Aug 2002 A1
20020120766 Okajima et al. Aug 2002 A1
20020120779 Teeple et al. Aug 2002 A1
20020126701 Requena Sep 2002 A1
20020128908 Levin et al. Sep 2002 A1
20020129088 Zhou et al. Sep 2002 A1
20020133504 Vlahos et al. Sep 2002 A1
20020138601 Piponius et al. Sep 2002 A1
20020144109 Benantar et al. Oct 2002 A1
20020146129 Kaplan Oct 2002 A1
20020152379 Gefwert et al. Oct 2002 A1
20020155848 Suryanarayana Oct 2002 A1
20020156839 Peterson et al. Oct 2002 A1
20020158908 Vaajala et al. Oct 2002 A1
20020161587 Pitts, III et al. Oct 2002 A1
20020161925 Munger et al. Oct 2002 A1
20020161928 Ndili Oct 2002 A1
20020164977 Link, II et al. Nov 2002 A1
20020165988 Khan et al. Nov 2002 A1
20020167484 Hatanaka et al. Nov 2002 A1
20020174189 Peng Nov 2002 A1
20020174208 Morlitz Nov 2002 A1
20020186848 Shaik Dec 2002 A1
20020188940 Breckner et al. Dec 2002 A1
20020193094 Lawless et al. Dec 2002 A1
20020194183 Yoakum et al. Dec 2002 A1
20020194207 Bartlett et al. Dec 2002 A1
20020194209 Bolosky et al. Dec 2002 A1
20020198027 Rydbeck Dec 2002 A1
20020198991 Gopalakrishnan et al. Dec 2002 A1
20030005151 Ullman et al. Jan 2003 A1
20030009571 Bavadekar Jan 2003 A1
20030012147 Buckman et al. Jan 2003 A1
20030014491 Horvitz et al. Jan 2003 A1
20030021400 Grandgent et al. Jan 2003 A1
20030022662 Mittal Jan 2003 A1
20030023692 Moroo Jan 2003 A1
20030023975 Schrader et al. Jan 2003 A1
20030025599 Monroe Feb 2003 A1
20030028430 Zimmerman Feb 2003 A1
20030028441 Barsness et al. Feb 2003 A1
20030037094 Douceur et al. Feb 2003 A1
20030046433 Luzzatti et al. Mar 2003 A1
20030046586 Bheemarasetti et al. Mar 2003 A1
20030046587 Bheemarasetti et al. Mar 2003 A1
20030050041 Wu Mar 2003 A1
20030051142 Hidalgo et al. Mar 2003 A1
20030054810 Chen et al. Mar 2003 A1
20030055555 Knockeart et al. Mar 2003 A1
20030056096 Albert et al. Mar 2003 A1
20030060188 Gidron et al. Mar 2003 A1
20030063120 Wong et al. Apr 2003 A1
20030065738 Yang et al. Apr 2003 A1
20030065739 Shnier Apr 2003 A1
20030065802 Vitikainen et al. Apr 2003 A1
20030069816 Ung et al. Apr 2003 A1
20030070061 Wong et al. Apr 2003 A1
20030072451 Pimentel et al. Apr 2003 A1
20030078880 Alley et al. Apr 2003 A1
20030084165 Kjellberg et al. May 2003 A1
20030084361 Lawrence et al. May 2003 A1
20030088629 Berkowitz et al. May 2003 A1
20030093341 Millard et al. May 2003 A1
20030093691 Simon et al. May 2003 A1
20030096608 Mortensen et al. May 2003 A1
20030097381 Detweiler et al. May 2003 A1
20030100321 Rao et al. May 2003 A1
20030100326 Grube et al. May 2003 A1
20030105837 Kamen et al. Jun 2003 A1
20030117432 Kautto-Kiovula et al. Jun 2003 A1
20030120685 Duncombe et al. Jun 2003 A1
20030125023 Fishler Jul 2003 A1
20030126216 Avila et al. Jul 2003 A1
20030126233 Bryers et al. Jul 2003 A1
20030130984 Quinlan et al. Jul 2003 A1
20030145038 Bin Tariq et al. Jul 2003 A1
20030146934 Bailey et al. Aug 2003 A1
20030153338 Herz et al. Aug 2003 A1
20030154212 Schirmer et al. Aug 2003 A1
20030156146 Suomela et al. Aug 2003 A1
20030157947 Fiatal et al. Aug 2003 A1
20030169262 Lavelle et al. Sep 2003 A1
20030172112 Vignaud Sep 2003 A1
20030177281 McQuillan et al. Sep 2003 A1
20030182420 Jones et al. Sep 2003 A1
20030182431 Sturniolo et al. Sep 2003 A1
20030182441 Andrew et al. Sep 2003 A1
20030187984 Banavar et al. Oct 2003 A1
20030204605 Hudson et al. Oct 2003 A1
20030204708 Hulme et al. Oct 2003 A1
20030208529 Pendyala et al. Nov 2003 A1
20030208559 Velline et al. Nov 2003 A1
20030210666 Trossen et al. Nov 2003 A1
20030211845 Lohtia et al. Nov 2003 A1
20030217098 Bobde et al. Nov 2003 A1
20030217142 Bobde et al. Nov 2003 A1
20030223554 Zhang Dec 2003 A1
20030227487 Hugh Dec 2003 A1
20030227745 Khoo Dec 2003 A1
20030229549 Wolinsky et al. Dec 2003 A1
20030233329 Laraki et al. Dec 2003 A1
20030235308 Boynton et al. Dec 2003 A1
20030236857 Takase et al. Dec 2003 A1
20030236981 Marmigere et al. Dec 2003 A1
20040002324 Juntunen et al. Jan 2004 A1
20040006630 Friend et al. Jan 2004 A1
20040010590 Manzano Jan 2004 A1
20040015504 Ahad et al. Jan 2004 A1
20040024795 Hind et al. Feb 2004 A1
20040024892 Creswell et al. Feb 2004 A1
20040027326 Hays et al. Feb 2004 A1
20040027375 Ellis et al. Feb 2004 A1
20040027378 Hays et al. Feb 2004 A1
20040030620 Benjamin et al. Feb 2004 A1
20040030749 Bowman-Amuah Feb 2004 A1
20040043770 Amit et al. Mar 2004 A1
20040047356 Bauer Mar 2004 A1
20040049579 Ims et al. Mar 2004 A1
20040049599 Friend et al. Mar 2004 A1
20040051715 Brokenshire et al. Mar 2004 A1
20040054711 Multer Mar 2004 A1
20040054739 Friend et al. Mar 2004 A1
20040054854 Thiyagaranjan et al. Mar 2004 A1
20040064445 Pfleging et al. Apr 2004 A1
20040064488 Sinha Apr 2004 A1
20040068579 Marmigere et al. Apr 2004 A1
20040068698 Wu et al. Apr 2004 A1
20040071146 Belling Apr 2004 A1
20040072559 Kakumaru et al. Apr 2004 A1
20040073476 Donahue et al. Apr 2004 A1
20040073651 Beaulieu et al. Apr 2004 A1
20040073707 Dillon Apr 2004 A1
20040073867 Kausik et al. Apr 2004 A1
20040075675 Raivisto et al. Apr 2004 A1
20040075695 Chew et al. Apr 2004 A1
20040078814 Allen Apr 2004 A1
20040080515 Hagiwara Apr 2004 A1
20040081088 Schinner et al. Apr 2004 A1
20040082346 Skytt et al. Apr 2004 A1
20040085909 Soliman May 2004 A1
20040085980 Lee May 2004 A1
20040098625 Lagadec et al. May 2004 A1
20040103147 Flesher et al. May 2004 A1
20040107319 D'Orto et al. Jun 2004 A1
20040110497 Little Jun 2004 A1
20040120262 Hirose et al. Jun 2004 A1
20040120323 Viikari et al. Jun 2004 A1
20040122907 Chou et al. Jun 2004 A1
20040123095 Marshall Jun 2004 A1
20040123304 Black et al. Jun 2004 A1
20040127214 Reddy et al. Jul 2004 A1
20040128375 Rockwell Jul 2004 A1
20040133626 Herrero et al. Jul 2004 A1
20040138931 Hope et al. Jul 2004 A1
20040141011 Smethers et al. Jul 2004 A1
20040147223 Cho Jul 2004 A1
20040147248 Will Jul 2004 A1
20040147262 Lescuyer et al. Jul 2004 A1
20040148375 Levett et al. Jul 2004 A1
20040151186 Akama Aug 2004 A1
20040152450 Kouznetsov et al. Aug 2004 A1
20040153537 Rezvani et al. Aug 2004 A1
20040158611 Daniell et al. Aug 2004 A1
20040162890 Ohta Aug 2004 A1
20040167966 Lee et al. Aug 2004 A1
20040170257 Gross et al. Sep 2004 A1
20040172481 Engstrom Sep 2004 A1
20040176128 Grabelsky et al. Sep 2004 A1
20040177369 Akins, III Sep 2004 A1
20040179513 Smith et al. Sep 2004 A1
20040181550 Warsta et al. Sep 2004 A1
20040184475 Meier Sep 2004 A1
20040186889 Washburn Sep 2004 A1
20040186902 Stewart Sep 2004 A1
20040189610 Friend Sep 2004 A1
20040198344 Pitt et al. Oct 2004 A1
20040199497 Timmons Oct 2004 A1
20040199582 Kucharewski et al. Oct 2004 A1
20040199649 Tarnanen et al. Oct 2004 A1
20040199663 Horvitz et al. Oct 2004 A1
20040204085 Vargas et al. Oct 2004 A1
20040205248 Little et al. Oct 2004 A1
20040205330 Godfrey et al. Oct 2004 A1
20040209602 Joyce et al. Oct 2004 A1
20040210639 Ben-Yoseph et al. Oct 2004 A1
20040218609 Foster et al. Nov 2004 A1
20040219940 Kong et al. Nov 2004 A1
20040229609 Yamaguchi Nov 2004 A1
20040230619 Blanco et al. Nov 2004 A1
20040230739 Tsern et al. Nov 2004 A1
20040233930 Colby, Jr. Nov 2004 A1
20040236792 Celik Nov 2004 A1
20040242209 Kruis et al. Dec 2004 A1
20040252816 Nicolas Dec 2004 A1
20040255126 Reith Dec 2004 A1
20040258231 Elsey et al. Dec 2004 A1
20040259535 Elsey et al. Dec 2004 A1
20040259537 Ackley Dec 2004 A1
20040260948 Miyata et al. Dec 2004 A1
20040264396 Ginzburg et al. Dec 2004 A1
20040266364 Nguyen et al. Dec 2004 A1
20040268148 Karjala et al. Dec 2004 A1
20050002501 Elsey et al. Jan 2005 A1
20050002508 Elsey et al. Jan 2005 A1
20050002509 Elsey et al. Jan 2005 A1
20050002510 Elsey et al. Jan 2005 A1
20050010694 Ma et al. Jan 2005 A1
20050015432 Cohen Jan 2005 A1
20050021750 Abrams Jan 2005 A1
20050022000 Inomata et al. Jan 2005 A1
20050022182 Mittal Jan 2005 A1
20050027591 Gailey et al. Feb 2005 A9
20050027716 Apfel Feb 2005 A1
20050027869 Johnson Feb 2005 A1
20050030913 Roy Feb 2005 A1
20050033657 Herrington et al. Feb 2005 A1
20050033812 McCarthy et al. Feb 2005 A1
20050033926 Dumont Feb 2005 A1
20050037741 Gilbert Feb 2005 A1
20050038707 Roever et al. Feb 2005 A1
20050038724 Roever et al. Feb 2005 A1
20050038863 Onyon et al. Feb 2005 A1
20050041584 Lau et al. Feb 2005 A1
20050041793 Fulton et al. Feb 2005 A1
20050044144 Malik et al. Feb 2005 A1
20050044235 Balahura et al. Feb 2005 A1
20050050222 Packer Mar 2005 A1
20050054381 Lee et al. Mar 2005 A1
20050055578 Wright et al. Mar 2005 A1
20050063544 Uusitalo et al. Mar 2005 A1
20050071489 Parupudi et al. Mar 2005 A1
20050071511 Chen Mar 2005 A1
20050071674 Chou et al. Mar 2005 A1
20050073982 Corneille et al. Apr 2005 A1
20050075109 Neyret et al. Apr 2005 A1
20050076085 Budd et al. Apr 2005 A1
20050076136 Cho et al. Apr 2005 A1
20050076241 Appelman Apr 2005 A1
20050080928 Beverly et al. Apr 2005 A1
20050086385 Rouleau Apr 2005 A1
20050086540 Gunter et al. Apr 2005 A1
20050094625 Bouat May 2005 A1
20050097225 Glatt et al. May 2005 A1
20050097570 Bomers May 2005 A1
20050099963 Multer et al. May 2005 A1
20050101307 Brugge et al. May 2005 A1
20050102257 Onyon et al. May 2005 A1
20050102328 Ring et al. May 2005 A1
20050102351 Jiang et al. May 2005 A1
20050108322 Kline et al. May 2005 A1
20050108427 Datta May 2005 A1
20050117606 Kim Jun 2005 A1
20050120082 Hesselink et al. Jun 2005 A1
20050120084 Hu et al. Jun 2005 A1
20050120181 Arunagirinathan et al. Jun 2005 A1
20050122333 Sumanaweera et al. Jun 2005 A1
20050124332 Clark et al. Jun 2005 A1
20050125459 Sutinen et al. Jun 2005 A1
20050138111 Aton et al. Jun 2005 A1
20050138176 Singh et al. Jun 2005 A1
20050138198 May Jun 2005 A1
20050144219 Terada Jun 2005 A1
20050147130 Hurwitz et al. Jul 2005 A1
20050154698 Ikezawa et al. Jul 2005 A1
20050154796 Forsyth Jul 2005 A1
20050154836 Steeley et al. Jul 2005 A1
20050155027 Wei Jul 2005 A1
20050163048 Arora et al. Jul 2005 A1
20050164703 Huynh Jul 2005 A1
20050164721 Yeh et al. Jul 2005 A1
20050165909 Cromer et al. Jul 2005 A1
20050170776 Siorpaes Aug 2005 A1
20050183143 Anderholm et al. Aug 2005 A1
20050188038 Yabe Aug 2005 A1
20050188048 Yuan et al. Aug 2005 A1
20050193036 Phillips et al. Sep 2005 A1
20050193096 Yu et al. Sep 2005 A1
20050198170 LaMay et al. Sep 2005 A1
20050203966 Labrou et al. Sep 2005 A1
20050210104 Torvinen Sep 2005 A1
20050210125 Li Sep 2005 A1
20050210150 Bahl Sep 2005 A1
20050213511 Reece et al. Sep 2005 A1
20050216295 Abrahamsohn Sep 2005 A1
20050222891 Chan et al. Oct 2005 A1
20050228812 Hansmann et al. Oct 2005 A1
20050232295 Young Oct 2005 A1
20050234860 Roever et al. Oct 2005 A1
20050235214 Shimizu et al. Oct 2005 A1
20050245241 Durand et al. Nov 2005 A1
20050246139 Rivenbark et al. Nov 2005 A1
20050248526 Twerdahl et al. Nov 2005 A1
20050250452 Walton et al. Nov 2005 A1
20050251555 Little, II Nov 2005 A1
20050254443 Campbell et al. Nov 2005 A1
20050256880 Nam Koong et al. Nov 2005 A1
20050262220 Ecklund et al. Nov 2005 A1
20050273804 Preisman Dec 2005 A1
20050278307 Battagin et al. Dec 2005 A1
20050278641 Mansour et al. Dec 2005 A1
20050278647 Leavitt et al. Dec 2005 A1
20050288006 Apfel Dec 2005 A1
20060012672 Schrader et al. Jan 2006 A1
20060020525 Borelli et al. Jan 2006 A1
20060020580 Dettinger et al. Jan 2006 A1
20060020715 Jungck Jan 2006 A1
20060020804 Schleifer et al. Jan 2006 A1
20060020947 Hallamaa et al. Jan 2006 A1
20060021023 Stewart et al. Jan 2006 A1
20060022048 Johnson Feb 2006 A1
20060025169 Maciocco et al. Feb 2006 A1
20060026580 Cabillic et al. Feb 2006 A1
20060029062 Rao et al. Feb 2006 A1
20060029063 Rao et al. Feb 2006 A1
20060029064 Rao et al. Feb 2006 A1
20060031114 Zommers Feb 2006 A1
20060031300 Kock et al. Feb 2006 A1
20060031365 Kay et al. Feb 2006 A1
20060031428 Wikman Feb 2006 A1
20060031522 Soulhi et al. Feb 2006 A1
20060031785 Raciborski Feb 2006 A1
20060031938 Choi Feb 2006 A1
20060037071 Rao et al. Feb 2006 A1
20060041717 Rosker et al. Feb 2006 A1
20060045121 Monk Mar 2006 A1
20060046686 Hawkins et al. Mar 2006 A1
20060047844 Deng Mar 2006 A1
20060048061 Forlenza et al. Mar 2006 A1
20060052091 Onyon et al. Mar 2006 A1
20060052137 Randall et al. Mar 2006 A1
20060059495 Spector Mar 2006 A1
20060063544 Zhao et al. Mar 2006 A1
20060065716 Peters Mar 2006 A1
20060069686 Beyda et al. Mar 2006 A1
20060069687 Cui et al. Mar 2006 A1
20060069715 Vayssiere Mar 2006 A1
20060069742 Segre Mar 2006 A1
20060069746 Davis et al. Mar 2006 A1
20060073810 Pyhalammi et al. Apr 2006 A1
20060074951 Beier et al. Apr 2006 A1
20060075028 Zager et al. Apr 2006 A1
20060084410 Sutaria et al. Apr 2006 A1
20060085503 Stoye et al. Apr 2006 A1
20060093026 Montojo et al. May 2006 A1
20060093135 Fiatal et al. May 2006 A1
20060099969 Staton et al. May 2006 A1
20060099970 Morgan et al. May 2006 A1
20060112177 Barkley et al. May 2006 A1
20060122976 Baluja et al. Jun 2006 A1
20060123042 Xie et al. Jun 2006 A1
20060129766 Cassia et al. Jun 2006 A1
20060132495 Anderson Jun 2006 A1
20060141962 Forbes et al. Jun 2006 A1
20060142018 Matz et al. Jun 2006 A1
20060143464 Ananthanarayanan et al. Jun 2006 A1
20060143692 Kodama et al. Jun 2006 A1
20060149591 Hauf et al. Jul 2006 A1
20060149843 Rhoads et al. Jul 2006 A1
20060149970 Imazu Jul 2006 A1
20060155822 Yang et al. Jul 2006 A1
20060161621 Rosenberg Jul 2006 A1
20060165226 Ernst et al. Jul 2006 A1
20060166663 Haehnichen et al. Jul 2006 A1
20060167969 Andreev et al. Jul 2006 A1
20060168043 Eisenberger et al. Jul 2006 A1
20060168164 Lemson Jul 2006 A1
20060179410 Deeds Aug 2006 A1
20060182025 Kim et al. Aug 2006 A1
20060184591 Backholm et al. Aug 2006 A1
20060184613 Stienessen et al. Aug 2006 A1
20060188864 Shah Aug 2006 A1
20060190428 Jung et al. Aug 2006 A1
20060190569 Neil et al. Aug 2006 A1
20060190984 Heard et al. Aug 2006 A1
20060192014 Hamilton et al. Aug 2006 A1
20060195570 Zellner et al. Aug 2006 A1
20060203765 Laroia et al. Sep 2006 A1
20060209842 Creamer et al. Sep 2006 A1
20060212531 Kikkawa et al. Sep 2006 A1
20060224629 Alexander et al. Oct 2006 A1
20060230058 Morris Oct 2006 A1
20060230394 Forth et al. Oct 2006 A1
20060234630 Lai Oct 2006 A1
20060236392 Thomas et al. Oct 2006 A1
20060240804 Backholm et al. Oct 2006 A1
20060240805 Backholm et al. Oct 2006 A1
20060242137 Shah et al. Oct 2006 A1
20060242210 Ring et al. Oct 2006 A1
20060242320 Nettle et al. Oct 2006 A1
20060242607 Hudson Oct 2006 A1
20060252435 Henderson et al. Nov 2006 A1
20060253456 Pacholec et al. Nov 2006 A1
20060253575 Carter et al. Nov 2006 A1
20060253605 Sundarrajan et al. Nov 2006 A1
20060259517 Urscheler et al. Nov 2006 A1
20060259923 Chiu Nov 2006 A1
20060265595 Scottodiluzio Nov 2006 A1
20060271884 Hurst Nov 2006 A1
20060274701 Albertsson Dec 2006 A1
20060277265 Backholm et al. Dec 2006 A1
20060277271 Morse et al. Dec 2006 A1
20060282408 Wisely et al. Dec 2006 A1
20060294071 Weare et al. Dec 2006 A1
20060294223 Glasgow et al. Dec 2006 A1
20060294388 Abraham et al. Dec 2006 A1
20070002897 Goshen et al. Jan 2007 A1
20070005738 Alexion-Tiernan et al. Jan 2007 A1
20070006317 Asami et al. Jan 2007 A1
20070011367 Scott et al. Jan 2007 A1
20070019610 Backholm et al. Jan 2007 A1
20070021065 Sengupta et al. Jan 2007 A1
20070022118 Layne Jan 2007 A1
20070027775 Hwang Feb 2007 A1
20070027832 Fiatal et al. Feb 2007 A1
20070027886 Gent et al. Feb 2007 A1
20070027917 Ariel et al. Feb 2007 A1
20070027920 Alvarado et al. Feb 2007 A1
20070027921 Alvarado et al. Feb 2007 A1
20070027930 Alvarado et al. Feb 2007 A1
20070033531 Marsh Feb 2007 A1
20070038567 Allaire et al. Feb 2007 A1
20070038931 Allaire et al. Feb 2007 A1
20070039049 Kupferman et al. Feb 2007 A1
20070041393 Westhead et al. Feb 2007 A1
20070044041 Beynon et al. Feb 2007 A1
20070049258 Thibeault Mar 2007 A1
20070050591 Boyd et al. Mar 2007 A1
20070053345 Hsu et al. Mar 2007 A1
20070060196 Sharma Mar 2007 A1
20070061393 Moore Mar 2007 A1
20070067147 Huang Mar 2007 A1
20070067381 Grant et al. Mar 2007 A1
20070067424 Raciborski et al. Mar 2007 A1
20070070931 Lewis et al. Mar 2007 A1
20070072617 Lewis et al. Mar 2007 A1
20070076264 Pierce et al. Apr 2007 A1
20070077949 Henderson et al. Apr 2007 A1
20070078857 Punaganti et al. Apr 2007 A1
20070078964 East et al. Apr 2007 A1
20070083600 Bakos et al. Apr 2007 A1
20070088801 Levkovitz et al. Apr 2007 A1
20070088852 Levkovitz Apr 2007 A1
20070100650 Ramer et al. May 2007 A1
20070101061 Baskaran et al. May 2007 A1
20070105627 Campbell May 2007 A1
20070111764 Park et al. May 2007 A1
20070116223 Burke et al. May 2007 A1
20070118620 Cartmell et al. May 2007 A1
20070118669 Rand et al. May 2007 A1
20070123214 Mock May 2007 A1
20070130108 Simpson et al. Jun 2007 A1
20070130217 Linyard et al. Jun 2007 A1
20070136533 Church et al. Jun 2007 A1
20070140193 Dosa et al. Jun 2007 A1
20070147317 Smith et al. Jun 2007 A1
20070147411 Bijwaard et al. Jun 2007 A1
20070150599 Neogi et al. Jun 2007 A1
20070150881 Khawand et al. Jun 2007 A1
20070153798 Krstulich Jul 2007 A1
20070156824 Thompson Jul 2007 A1
20070156842 Vermeulen et al. Jul 2007 A1
20070161402 Ng et al. Jul 2007 A1
20070161411 Liao et al. Jul 2007 A1
20070162514 Civetta et al. Jul 2007 A1
20070165516 Xu et al. Jul 2007 A1
20070167178 Al-Harbi Jul 2007 A1
20070174420 Khusial et al. Jul 2007 A1
20070174433 Mendez et al. Jul 2007 A1
20070174470 Burgess et al. Jul 2007 A1
20070175998 Lev Aug 2007 A1
20070192122 Routson et al. Aug 2007 A1
20070194913 Yokoshima et al. Aug 2007 A1
20070198698 Boyd et al. Aug 2007 A1
20070202850 Pantalone et al. Aug 2007 A1
20070204341 Rand et al. Aug 2007 A1
20070220080 Humphrey Sep 2007 A1
20070220099 Di Giorgio et al. Sep 2007 A1
20070226417 Davis Sep 2007 A1
20070232263 Chandhok et al. Oct 2007 A1
20070233855 Brown et al. Oct 2007 A1
20070237318 McGary Oct 2007 A1
20070240218 Tuvell et al. Oct 2007 A1
20070245010 Arn et al. Oct 2007 A1
20070245409 Harris et al. Oct 2007 A1
20070249365 Jendbro Oct 2007 A1
20070250591 Milic-Frayling et al. Oct 2007 A1
20070254631 Spooner Nov 2007 A1
20070255848 Sewall et al. Nov 2007 A1
20070259673 Willars et al. Nov 2007 A1
20070264993 Hughes Nov 2007 A1
20070267492 Maclaine Pont Nov 2007 A1
20070276925 LaJoie et al. Nov 2007 A1
20070276926 LaJoie et al. Nov 2007 A1
20070277231 Medvinsky et al. Nov 2007 A1
20070288469 Shenfield Dec 2007 A1
20070290787 Fiatal et al. Dec 2007 A1
20070293207 Guedalia et al. Dec 2007 A1
20070293238 Fiatal et al. Dec 2007 A1
20070293958 Stehle et al. Dec 2007 A1
20070294295 Finkelstein et al. Dec 2007 A1
20070294373 Harrison Dec 2007 A1
20070294395 Strub et al. Dec 2007 A1
20070294763 Udezue et al. Dec 2007 A1
20070296701 Pope et al. Dec 2007 A1
20070299631 Macbeth et al. Dec 2007 A1
20070299918 Roberts Dec 2007 A1
20070300273 Turner Dec 2007 A1
20080001717 Fiatal Jan 2008 A1
20080005695 Ozzie et al. Jan 2008 A1
20080008095 Gilfix Jan 2008 A1
20080009344 Graham et al. Jan 2008 A1
20080010365 Schneider Jan 2008 A1
20080016236 Beverly et al. Jan 2008 A1
20080020786 Smith et al. Jan 2008 A1
20080026778 Cai et al. Jan 2008 A1
20080032718 Suresh Feb 2008 A1
20080034031 Weisbrot et al. Feb 2008 A1
20080034034 Agrawal Feb 2008 A1
20080037787 Boynton et al. Feb 2008 A1
20080039032 Haumont Feb 2008 A1
20080043692 Morita Feb 2008 A1
20080045253 Mousseau et al. Feb 2008 A1
20080052206 Edwards et al. Feb 2008 A1
20080056225 Brok Mar 2008 A1
20080059308 Gerken Mar 2008 A1
20080059398 Tsutsui Mar 2008 A1
20080059582 Hartikainen et al. Mar 2008 A1
20080061142 Howcroft et al. Mar 2008 A1
20080068519 Adler et al. Mar 2008 A1
20080072324 Repasi et al. Mar 2008 A1
20080077506 Rampell et al. Mar 2008 A1
20080077571 Harris et al. Mar 2008 A1
20080085719 Kuchibhotla et al. Apr 2008 A1
20080085724 Cormier et al. Apr 2008 A1
20080086379 Dion et al. Apr 2008 A1
20080086556 Ramalingam et al. Apr 2008 A1
20080086599 Maron et al. Apr 2008 A1
20080091773 Hameen-Anttila Apr 2008 A1
20080096526 Miettinen et al. Apr 2008 A1
20080098062 Balia Apr 2008 A1
20080098120 Johnson et al. Apr 2008 A1
20080103877 Gerken May 2008 A1
20080104666 Dillaway May 2008 A1
20080108298 Selen et al. May 2008 A1
20080114881 Lee et al. May 2008 A1
20080117922 Cockrell et al. May 2008 A1
20080125225 Lazaridis May 2008 A1
20080130663 Fridman et al. Jun 2008 A1
20080133326 Goncalves et al. Jun 2008 A1
20080133641 Gent et al. Jun 2008 A1
20080133708 Alvarado et al. Jun 2008 A1
20080134292 Ariel et al. Jun 2008 A1
20080140665 Ariel et al. Jun 2008 A1
20080140794 Rybak Jun 2008 A1
20080146257 Clegg Jun 2008 A1
20080148146 Estrada et al. Jun 2008 A1
20080150704 Igoe Jun 2008 A1
20080151817 Fitchett et al. Jun 2008 A1
20080154870 Evermann et al. Jun 2008 A1
20080155613 Benya et al. Jun 2008 A1
20080163318 Chen et al. Jul 2008 A1
20080166999 Guedalia et al. Jul 2008 A1
20080167019 Guedalia et al. Jul 2008 A1
20080168145 Wilson Jul 2008 A1
20080172662 Harris et al. Jul 2008 A1
20080177872 Vengroff Jul 2008 A1
20080178294 Hu et al. Jul 2008 A1
20080180228 Wakefield et al. Jul 2008 A1
20080183800 Herzog et al. Jul 2008 A1
20080184001 Stager Jul 2008 A1
20080186166 Zhou et al. Aug 2008 A1
20080189365 Narayanaswami et al. Aug 2008 A1
20080192820 Brooks et al. Aug 2008 A1
20080195819 Dumont Aug 2008 A1
20080198995 McGary et al. Aug 2008 A1
20080200161 Morse et al. Aug 2008 A1
20080201225 Maharajh et al. Aug 2008 A1
20080201362 Multer et al. Aug 2008 A1
20080201751 Ahmed et al. Aug 2008 A1
20080207182 Maharajh et al. Aug 2008 A1
20080209491 Hasek Aug 2008 A1
20080214148 Ramer et al. Sep 2008 A1
20080214157 Ramer et al. Sep 2008 A1
20080216094 Anderson et al. Sep 2008 A1
20080220797 Meiby et al. Sep 2008 A1
20080221715 Krzyzanowski et al. Sep 2008 A1
20080222271 Spires Sep 2008 A1
20080232290 Elzur et al. Sep 2008 A1
20080233983 Park et al. Sep 2008 A1
20080235351 Banga et al. Sep 2008 A1
20080235383 Schneider Sep 2008 A1
20080242370 Lando et al. Oct 2008 A1
20080256090 Dietterich et al. Oct 2008 A1
20080261663 Park et al. Oct 2008 A1
20080263170 Caron et al. Oct 2008 A1
20080270379 Ramakrishna Oct 2008 A1
20080271123 Ollis et al. Oct 2008 A1
20080273498 Jalil et al. Nov 2008 A1
20080281798 Chatterjee et al. Nov 2008 A1
20080288659 Hasha et al. Nov 2008 A1
20080294769 Doi et al. Nov 2008 A1
20080298386 Fiatal Dec 2008 A1
20080299956 Bailey et al. Dec 2008 A1
20080301231 Mehta et al. Dec 2008 A1
20080301300 Toub Dec 2008 A1
20080305819 Chun et al. Dec 2008 A1
20080307035 Burckart et al. Dec 2008 A1
20080313282 Warila et al. Dec 2008 A1
20080320577 Larduinat Dec 2008 A1
20090006116 Baker et al. Jan 2009 A1
20090010204 Pratt, Jr. et al. Jan 2009 A1
20090010259 Sirotkin Jan 2009 A1
20090012841 Saft et al. Jan 2009 A1
20090016526 Fiatal et al. Jan 2009 A1
20090019105 Sebastian Jan 2009 A1
20090019141 Bush et al. Jan 2009 A1
20090019153 Sebastian Jan 2009 A1
20090019485 Ellis et al. Jan 2009 A1
20090019532 Jacobsen et al. Jan 2009 A1
20090024794 Iyer et al. Jan 2009 A1
20090027222 Larsson et al. Jan 2009 A1
20090031006 Johnson Jan 2009 A1
20090043741 Kim Feb 2009 A1
20090049166 Roman et al. Feb 2009 A1
20090049173 Pulito et al. Feb 2009 A1
20090049482 Auerbach et al. Feb 2009 A1
20090052372 Durazzo et al. Feb 2009 A1
20090054034 Backholm et al. Feb 2009 A1
20090055353 Meema Feb 2009 A1
20090059950 Gao et al. Mar 2009 A1
20090063647 Backholm et al. Mar 2009 A1
20090064346 Larsson et al. Mar 2009 A1
20090070526 Tetrick et al. Mar 2009 A1
20090075683 Backholm et al. Mar 2009 A1
20090077205 Quinet et al. Mar 2009 A1
20090077263 Koganti et al. Mar 2009 A1
20090077326 Motohashi Mar 2009 A1
20090081944 Yavuz et al. Mar 2009 A1
20090083602 Sarkar et al. Mar 2009 A1
20090086651 Luft et al. Apr 2009 A1
20090094317 Venkitaraman Apr 2009 A1
20090100416 Brown et al. Apr 2009 A1
20090100506 Whang et al. Apr 2009 A1
20090109983 Dixon et al. Apr 2009 A1
20090110179 Elsey et al. Apr 2009 A1
20090112778 Beck et al. Apr 2009 A1
20090119266 Fitzpatrick et al. May 2009 A1
20090122772 Jung May 2009 A1
20090125523 Fitzpatrick et al. May 2009 A1
20090131045 Feuer et al. May 2009 A1
20090138427 Kalavade May 2009 A1
20090144632 Mendez Jun 2009 A1
20090147008 Do et al. Jun 2009 A1
20090149203 Backholm et al. Jun 2009 A1
20090156178 Elsey et al. Jun 2009 A1
20090157792 Fiatal Jun 2009 A1
20090164433 R et al. Jun 2009 A1
20090164560 Fiatal Jun 2009 A1
20090164605 Lusher et al. Jun 2009 A1
20090165115 Toumura et al. Jun 2009 A1
20090172565 Jackson et al. Jul 2009 A1
20090181641 Fiatal Jul 2009 A1
20090182500 Dicke Jul 2009 A1
20090187939 Lajoie Jul 2009 A1
20090191903 Fiatal Jul 2009 A1
20090193130 Fiatal Jul 2009 A1
20090193338 Fiatal Jul 2009 A1
20090204682 Jeyaseelan et al. Aug 2009 A1
20090213837 Ku et al. Aug 2009 A1
20090215504 Lando Aug 2009 A1
20090216903 Howell et al. Aug 2009 A1
20090221326 Roussel et al. Sep 2009 A1
20090222584 Josefsberg et al. Sep 2009 A1
20090225778 Sharif-Ahmadi et al. Sep 2009 A1
20090228545 Mendez et al. Sep 2009 A1
20090233595 Harris et al. Sep 2009 A1
20090234861 Ramer et al. Sep 2009 A1
20090241180 Fiatal Sep 2009 A1
20090248670 Fiatal Oct 2009 A1
20090248696 Rowles et al. Oct 2009 A1
20090248794 Helms et al. Oct 2009 A1
20090248878 Tran et al. Oct 2009 A1
20090249480 Osipkov et al. Oct 2009 A1
20090249482 Sarathy Oct 2009 A1
20090252136 Mahany et al. Oct 2009 A1
20090254589 Nair et al. Oct 2009 A1
20090254663 Alperovitch et al. Oct 2009 A1
20090254971 Herz et al. Oct 2009 A1
20090264138 Kang et al. Oct 2009 A1
20090268672 Kline et al. Oct 2009 A1
20090271491 Pan Oct 2009 A1
20090282125 Jeide et al. Nov 2009 A1
20090282130 Antoniou et al. Nov 2009 A1
20090286531 Bhatt et al. Nov 2009 A1
20090287750 Banavar et al. Nov 2009 A1
20090299817 Fok et al. Dec 2009 A1
20090307133 Holloway et al. Dec 2009 A1
20090307196 Shuster Dec 2009 A1
20090307731 Beyabani Dec 2009 A1
20090310501 Catovic et al. Dec 2009 A1
20090318171 Backholm et al. Dec 2009 A1
20090323678 Wang Dec 2009 A1
20090325565 Backholm Dec 2009 A1
20090327390 Tran et al. Dec 2009 A1
20090327819 Pan Dec 2009 A1
20100010993 Hussey, Jr. et al. Jan 2010 A1
20100011031 Huang et al. Jan 2010 A1
20100023582 Pedersen et al. Jan 2010 A1
20100036885 Shen et al. Feb 2010 A1
20100042691 Maguire Feb 2010 A1
20100042718 Morris Feb 2010 A1
20100049852 Whitnah et al. Feb 2010 A1
20100049872 Roskind Feb 2010 A1
20100057924 Rauber et al. Mar 2010 A1
20100064341 Aldera Mar 2010 A1
20100067413 Schneider et al. Mar 2010 A1
20100069127 Fiennes Mar 2010 A1
20100076994 Soroca et al. Mar 2010 A1
20100077035 Li et al. Mar 2010 A1
20100077083 Tran et al. Mar 2010 A1
20100082811 Van Der Merwe et al. Apr 2010 A1
20100083255 Bane et al. Apr 2010 A1
20100087167 Tsurutome et al. Apr 2010 A1
20100087179 Makavy et al. Apr 2010 A1
20100088722 Jiang Apr 2010 A1
20100093273 Hohl Apr 2010 A1
20100095018 Khemani et al. Apr 2010 A1
20100095065 Gray et al. Apr 2010 A1
20100099421 Patel et al. Apr 2010 A1
20100100952 Sample et al. Apr 2010 A1
20100115050 Sultenfuss et al. May 2010 A1
20100118190 Salfati et al. May 2010 A1
20100121744 Belz et al. May 2010 A1
20100131593 Kihara et al. May 2010 A1
20100131617 Osborne et al. May 2010 A1
20100146107 Fiatal Jun 2010 A1
20100146607 Piepenbrink et al. Jun 2010 A1
20100149975 Tripathi et al. Jun 2010 A1
20100153652 Thomas et al. Jun 2010 A1
20100154044 Manku Jun 2010 A1
20100174735 Fiatal Jul 2010 A1
20100174756 Lazaridis et al. Jul 2010 A1
20100174861 Katz et al. Jul 2010 A1
20100174939 Vexler Jul 2010 A1
20100180005 Sebastian et al. Jul 2010 A1
20100186011 Magenheimer Jul 2010 A1
20100188994 Raleigh Jul 2010 A1
20100192212 Raleigh Jul 2010 A1
20100197282 Uchida Aug 2010 A1
20100198752 Digon et al. Aug 2010 A1
20100203876 Krishnaswamy Aug 2010 A1
20100205148 Leblanc et al. Aug 2010 A1
20100207870 Cho Aug 2010 A1
20100211651 Guedalia et al. Aug 2010 A1
20100212010 Stringer et al. Aug 2010 A1
20100214984 Cho et al. Aug 2010 A1
20100220619 Chikira et al. Sep 2010 A1
20100223364 Wei Sep 2010 A1
20100227594 DeVries Sep 2010 A1
20100228863 Kawauchi Sep 2010 A1
20100229096 Maiocco et al. Sep 2010 A1
20100235473 Koren et al. Sep 2010 A1
20100238915 Cayla et al. Sep 2010 A1
20100250695 Shenfield et al. Sep 2010 A1
20100250706 Burckart et al. Sep 2010 A1
20100250733 Turanyi et al. Sep 2010 A1
20100250986 Black et al. Sep 2010 A1
20100251366 Baldry Sep 2010 A1
20100257580 Zhao Oct 2010 A1
20100260038 Dhodapkar et al. Oct 2010 A1
20100260173 Johnson Oct 2010 A1
20100262487 Edwards et al. Oct 2010 A1
20100262664 Brown et al. Oct 2010 A1
20100268757 Fisher Oct 2010 A1
20100274983 Murphy et al. Oct 2010 A1
20100279662 Kuusinen et al. Nov 2010 A1
20100281112 Plamondon Nov 2010 A1
20100284327 Miklos Nov 2010 A1
20100293335 Muthiah et al. Nov 2010 A1
20100299223 Crouch Nov 2010 A1
20100299455 Master et al. Nov 2010 A1
20100299518 Viswanathan et al. Nov 2010 A1
20100305983 De Marcken Dec 2010 A1
20100312946 Bold et al. Dec 2010 A1
20100313018 Jorgensen Dec 2010 A1
20100315535 Nurit et al. Dec 2010 A1
20100317340 Lee et al. Dec 2010 A1
20100319054 Mehta et al. Dec 2010 A1
20100322124 Luoma et al. Dec 2010 A1
20100323664 Sivaram et al. Dec 2010 A1
20100323730 Karmarkar Dec 2010 A1
20100325306 Vimpari et al. Dec 2010 A1
20100332513 Azar et al. Dec 2010 A1
20100332680 Anderson et al. Dec 2010 A1
20110019978 Jagmag Jan 2011 A1
20110022812 van der Linden et al. Jan 2011 A1
20110023084 Kraemer Jan 2011 A1
20110028129 Hutchison et al. Feb 2011 A1
20110029378 Ramer et al. Feb 2011 A1
20110035799 Handler Feb 2011 A1
20110040718 Tendjoukian et al. Feb 2011 A1
20110040872 Blackburn et al. Feb 2011 A1
20110044304 Connelly et al. Feb 2011 A1
20110047594 Mahaffey et al. Feb 2011 A1
20110065419 Book et al. Mar 2011 A1
20110065424 Estevez et al. Mar 2011 A1
20110066646 Danado et al. Mar 2011 A1
20110066715 Schieder et al. Mar 2011 A1
20110069663 Shu et al. Mar 2011 A1
20110072306 Racey et al. Mar 2011 A1
20110083186 Niemela et al. Apr 2011 A1
20110093725 Theocharous et al. Apr 2011 A1
20110093917 Alcorn et al. Apr 2011 A1
20110095903 Gudlavenkatasiva et al. Apr 2011 A1
20110099363 Boynton et al. Apr 2011 A1
20110113109 LeVasseur et al. May 2011 A1
20110119134 Zivkovic et al. May 2011 A1
20110119217 Moon et al. May 2011 A1
20110119444 DeCusatis et al. May 2011 A1
20110126060 Grube et al. May 2011 A1
20110126250 Turner May 2011 A1
20110138102 Glikson et al. Jun 2011 A1
20110138402 Fleming Jun 2011 A1
20110145646 Harris et al. Jun 2011 A1
20110151944 Morgan Jun 2011 A1
20110153816 Lloyd et al. Jun 2011 A1
20110153937 Annamalaisami et al. Jun 2011 A1
20110158239 Mohaban Jun 2011 A1
20110161484 Van den Bogaert et al. Jun 2011 A1
20110165889 Fiatal et al. Jul 2011 A1
20110170410 Zhao et al. Jul 2011 A1
20110170464 Sengottaiyan et al. Jul 2011 A1
20110173055 Ross et al. Jul 2011 A1
20110177847 Huang Jul 2011 A1
20110179138 Van Geest et al. Jul 2011 A1
20110179377 Fleming Jul 2011 A1
20110182220 Black et al. Jul 2011 A1
20110184576 Hasan et al. Jul 2011 A1
20110184827 Hubert Jul 2011 A1
20110185355 Chawla et al. Jul 2011 A1
20110189997 Tiwari et al. Aug 2011 A1
20110190014 Fiatal Aug 2011 A1
20110191474 Fiatal Aug 2011 A1
20110194539 Blasinski et al. Aug 2011 A1
20110199905 Pinheiro et al. Aug 2011 A1
20110201304 Sutaria et al. Aug 2011 A1
20110202988 Otranen et al. Aug 2011 A1
20110207436 van Gent et al. Aug 2011 A1
20110208810 Li et al. Aug 2011 A1
20110213800 Saros et al. Sep 2011 A1
20110213898 Fiatal et al. Sep 2011 A1
20110214182 Adams et al. Sep 2011 A1
20110217982 Zhao Sep 2011 A1
20110218951 Kline et al. Sep 2011 A1
20110219133 Shanmugham Sep 2011 A1
20110225646 Crawford Sep 2011 A1
20110237222 Niejadlik Sep 2011 A1
20110238772 Fiatal Sep 2011 A1
20110241872 Mahaffey Oct 2011 A1
20110244859 Tsuda Oct 2011 A1
20110246950 Luna et al. Oct 2011 A1
20110249553 Wang et al. Oct 2011 A1
20110252088 Fiatal Oct 2011 A1
20110264622 Vargas et al. Oct 2011 A1
20110264731 Knowles et al. Oct 2011 A1
20110265174 Thornton et al. Oct 2011 A1
20110294463 Fiatal Dec 2011 A1
20110294464 Fiatal Dec 2011 A1
20110296050 Cherukuri Dec 2011 A1
20110296120 Khan Dec 2011 A1
20110296415 Khan et al. Dec 2011 A1
20110299454 Krishnaswamy Dec 2011 A1
20110302154 Snyder Dec 2011 A1
20110307541 Walsh et al. Dec 2011 A1
20110320614 Makavy et al. Dec 2011 A1
20120005276 Guo et al. Jan 2012 A1
20120008536 Tervahauta et al. Jan 2012 A1
20120020219 Kamiya et al. Jan 2012 A1
20120022980 Angelone Jan 2012 A1
20120023190 Backholm et al. Jan 2012 A1
20120023226 Petersen et al. Jan 2012 A1
20120023236 Backholm et al. Jan 2012 A1
20120026879 Foottit et al. Feb 2012 A1
20120030280 Wang et al. Feb 2012 A1
20120030750 Bargava et al. Feb 2012 A1
20120034922 Jones et al. Feb 2012 A1
20120054386 Hanes Mar 2012 A1
20120072910 Martin et al. Mar 2012 A1
20120077482 Backholm Mar 2012 A1
20120078725 Maitra et al. Mar 2012 A1
20120078996 Shah Mar 2012 A1
20120084397 Shinohara Apr 2012 A1
20120096058 Mameri et al. Apr 2012 A1
20120096092 Davidge et al. Apr 2012 A1
20120099592 Ludwig Apr 2012 A1
20120108200 Rubin et al. May 2012 A1
20120108225 Luna et al. May 2012 A1
20120110109 Luna et al. May 2012 A1
20120110110 Luna et al. May 2012 A1
20120110111 Luna et al. May 2012 A1
20120110112 Luna et al. May 2012 A1
20120110118 Luna et al. May 2012 A1
20120110171 Luna et al. May 2012 A1
20120110173 Luna et al. May 2012 A1
20120110174 Wootton et al. May 2012 A1
20120110275 Ganti et al. May 2012 A1
20120130973 Tamm et al. May 2012 A1
20120131095 Luna et al. May 2012 A1
20120131184 Luna et al. May 2012 A1
20120131685 Broch et al. May 2012 A1
20120135726 Luna et al. May 2012 A1
20120140750 Yan et al. Jun 2012 A1
20120144038 Hildebrand Jun 2012 A1
20120144336 Pinter et al. Jun 2012 A1
20120144384 Baek Jun 2012 A1
20120149352 Backholm et al. Jun 2012 A1
20120151044 Luna et al. Jun 2012 A1
20120157170 Backholm et al. Jun 2012 A1
20120158837 Kaul Jun 2012 A1
20120158908 Luna et al. Jun 2012 A1
20120170496 Yang et al. Jul 2012 A1
20120170569 Al-Khudairi Jul 2012 A1
20120173616 Luna et al. Jul 2012 A1
20120174220 Rodriguez Jul 2012 A1
20120176968 Luna Jul 2012 A1
20120178414 Fiatal Jul 2012 A1
20120179801 Luna et al. Jul 2012 A1
20120185597 Luna Jul 2012 A1
20120185918 Backholm et al. Jul 2012 A1
20120198046 Shah et al. Aug 2012 A1
20120198516 Lim Aug 2012 A1
20120203761 Biran et al. Aug 2012 A1
20120209923 Mathur et al. Aug 2012 A1
20120210121 Boynton et al. Aug 2012 A1
20120221697 Sainio et al. Aug 2012 A1
20120224528 Tapia et al. Sep 2012 A1
20120226767 Luna et al. Sep 2012 A1
20120227059 Fleming Sep 2012 A1
20120246333 Fiatal Sep 2012 A1
20120254417 Luna Oct 2012 A1
20120265836 Nemoto et al. Oct 2012 A1
20120271903 Luna Oct 2012 A1
20120271908 Luna et al. Oct 2012 A1
20120278431 Luna Nov 2012 A1
20120278432 Luna Nov 2012 A1
20120278464 Lehane et al. Nov 2012 A1
20120278886 Luna Nov 2012 A1
20120284356 Luna Nov 2012 A1
20120289239 Luna et al. Nov 2012 A1
20120290642 Shaughnessy et al. Nov 2012 A1
20120290675 Luna et al. Nov 2012 A1
20120290717 Luna Nov 2012 A1
20120295645 Yariv et al. Nov 2012 A1
20120297213 Nishida Nov 2012 A1
20120304288 Wright et al. Nov 2012 A1
20120316992 Oborne Dec 2012 A1
20120317284 Raleigh et al. Dec 2012 A1
20120317370 Luna Dec 2012 A1
20120324041 Gerber et al. Dec 2012 A1
20120324575 Choi et al. Dec 2012 A1
20120327779 Gell et al. Dec 2012 A1
20120329442 Luft et al. Dec 2012 A1
20120331059 Luna Dec 2012 A1
20120331087 Luna et al. Dec 2012 A1
20130010693 Luna et al. Jan 2013 A1
20130012180 Backholm et al. Jan 2013 A1
20130013726 Westberg et al. Jan 2013 A1
20130023232 Mendiola Jan 2013 A1
20130031191 Bott Jan 2013 A1
20130031599 Luna et al. Jan 2013 A1
20130031600 Luna et al. Jan 2013 A1
20130031601 Bott Jan 2013 A1
20130041974 Luna et al. Feb 2013 A1
20130052990 Zhang Feb 2013 A1
20130110636 Bott May 2013 A1
20130110637 Bott May 2013 A1
20130110758 Jung et al. May 2013 A1
20130124442 Tendjoukian et al. May 2013 A1
20130142050 Luna Jun 2013 A1
20130143609 Richardson et al. Jun 2013 A1
20130145010 Luna et al. Jun 2013 A1
20130145017 Luna Jun 2013 A1
20130151648 Luna Jun 2013 A1
20130151649 Luna Jun 2013 A1
20130151709 Luna Jun 2013 A1
20130159395 Backholm et al. Jun 2013 A1
20130159511 Backholm et al. Jun 2013 A1
20130165084 Xu et al. Jun 2013 A1
20130166669 Luna et al. Jun 2013 A1
20130170348 Luna et al. Jul 2013 A1
20130173756 Luna et al. Jul 2013 A1
20130178195 Luna et al. Jul 2013 A1
20130182572 Backholm et al. Jul 2013 A1
20130203433 Luna et al. Aug 2013 A1
20130205366 Luna et al. Aug 2013 A1
20130267209 Bott Oct 2013 A1
20130268655 Luna et al. Oct 2013 A1
20130268656 Bott Oct 2013 A1
20130275563 Luna et al. Oct 2013 A1
20130275586 Luna et al. Oct 2013 A1
20130291099 Donfried et al. Oct 2013 A1
20130304604 Hoffman et al. Nov 2013 A1
20130311594 Luna et al. Nov 2013 A1
20130315088 Gerber et al. Nov 2013 A1
20130315161 Luna et al. Nov 2013 A1
20130316675 Luna et al. Nov 2013 A1
20140025953 Venters, III et al. Jan 2014 A1
Foreign Referenced Citations (234)
Number Date Country
2658185 Sep 2009 CA
2806527 Feb 2012 CA
2806529 Feb 2012 CA
2806548 Feb 2012 CA
2806549 Feb 2012 CA
2806550 Feb 2012 CA
2806557 Feb 2012 CA
2798523 May 2012 CA
2797631 Nov 2012 CA
2797631 Nov 2013 CA
103404193 Nov 2013 CN
103620576 Mar 2014 CN
0772327 May 1997 EP
0993165 Apr 2000 EP
1278390 Jan 2003 EP
1135741 Feb 2004 EP
1422899 May 2004 EP
1466261 Oct 2004 EP
1466435 Oct 2004 EP
1482702 Dec 2004 EP
1483689 Dec 2004 EP
1669878 Jun 2006 EP
1775911 Apr 2007 EP
1815634 Aug 2007 EP
1815652 Aug 2007 EP
1817883 Aug 2007 EP
2060085 May 2009 EP
2080123 Jul 2009 EP
2120014 Nov 2009 EP
2122973 Nov 2009 EP
2206390 Jul 2010 EP
2267968 Dec 2010 EP
2332294 Jun 2011 EP
2378712 Oct 2011 EP
2386164 Nov 2011 EP
2395412 Dec 2011 EP
2396953 Dec 2011 EP
2465275 Jun 2012 EP
2503473 Sep 2012 EP
2556441 Feb 2013 EP
2591628 May 2013 EP
2596658 May 2013 EP
2599003 Jun 2013 EP
2599004 Jun 2013 EP
2599280 Jun 2013 EP
2599345 Jun 2013 EP
2599346 Jun 2013 EP
2599363 Jun 2013 EP
2621144 Jul 2013 EP
2635973 Sep 2013 EP
2636252 Sep 2013 EP
2636268 Sep 2013 EP
2661697 Nov 2013 EP
2700019 Feb 2014 EP
2700020 Feb 2014 EP
2700021 Feb 2014 EP
2702500 Mar 2014 EP
2702524 Mar 2014 EP
2702827 Mar 2014 EP
117152 Jun 2006 FI
118288 Sep 2007 FI
119581 Dec 2008 FI
123227 Dec 2013 FI
2415335 Dec 2005 GB
2476354 Jun 2011 GB
2493473 Feb 2013 GB
2495058 Mar 2013 GB
2495066 Mar 2013 GB
2495263 Apr 2013 GB
2495455 Apr 2013 GB
2495463 Apr 2013 GB
2495877 Apr 2013 GB
2496537 May 2013 GB
2497012 May 2013 GB
2493473 Jun 2013 GB
2498064 Jul 2013 GB
2499089 Aug 2013 GB
2499306 Aug 2013 GB
2499534 Aug 2013 GB
2499741 Aug 2013 GB
2499747 Aug 2013 GB
2499936 Sep 2013 GB
2500327 Sep 2013 GB
2500333 Sep 2013 GB
2500334 Sep 2013 GB
2495463 Oct 2013 GB
2495877 Oct 2013 GB
2497012 Oct 2013 GB
2501416 Oct 2013 GB
2495455 Nov 2013 GB
2502168 Nov 2013 GB
2495066 Dec 2013 GB
2503077 Dec 2013 GB
2503405 Dec 2013 GB
2503990 Jan 2014 GB
2504019 Jan 2014 GB
2504037 Jan 2014 GB
2504411 Jan 2014 GB
2495058 Mar 2014 GB
4154233 May 1992 JP
10-178453 Jun 1998 JP
10-336372 Dec 1998 JP
2001-218185 Aug 2001 JP
2001-350718 Dec 2001 JP
2001-356973 Dec 2001 JP
2003-323402 Nov 2003 JP
2005-515664 May 2005 JP
2005-520377 Jul 2005 JP
2006-060795 Mar 2006 JP
2007-172044 Jul 2007 JP
2007-226783 Sep 2007 JP
2009-207177 Sep 2009 JP
4386732 Oct 2009 JP
2010-045628 Feb 2010 JP
2010-239366 Oct 2010 JP
2011-511580 Apr 2011 JP
2013-537754 Oct 2013 JP
2013-539258 Oct 2013 JP
2013-539259 Oct 2013 JP
2013-541238 Nov 2013 JP
2001-0018568 Mar 2001 KR
2006-0068186 Jun 2006 KR
2007-0071858 Jul 2007 KR
10-0765238 Oct 2007 KR
2007-0102091 Oct 2007 KR
2007-0112412 Nov 2007 KR
2007-0117874 Dec 2007 KR
2008-0067477 Jul 2008 KR
2009-0038217 Apr 2009 KR
2009-0054528 Jun 2009 KR
2009-0077515 Jul 2009 KR
2010-0064605 Jun 2010 KR
2011-0138122 Dec 2011 KR
10-1227769 Jan 2013 KR
10-1227821 Jan 2013 KR
WO 9741661 Nov 1997 WO
WO 9824257 Jun 1998 WO
WO 9858322 Dec 1998 WO
WO 0130130 May 2001 WO
WO 0201836 Jan 2002 WO
WO 03007570 Jan 2003 WO
WO 03058483 Jul 2003 WO
WO 03058879 Jul 2003 WO
WO 03065701 Aug 2003 WO
WO 03098890 Nov 2003 WO
WO 2004017591 Feb 2004 WO
WO 2004045171 May 2004 WO
WO 2004047409 Jun 2004 WO
WO 2005015925 Feb 2005 WO
WO 2005020108 Mar 2005 WO
WO 2006045005 Apr 2006 WO
WO 2006045102 Apr 2006 WO
WO 2006053952 May 2006 WO
WO 2006053954 May 2006 WO
WO 2006058967 Jun 2006 WO
WO 2007009252 Jan 2007 WO
WO 2007015725 Feb 2007 WO
WO 2007015726 Feb 2007 WO
WO 2007069245 Jun 2007 WO
WO 2007073422 Jun 2007 WO
WO 2007127878 Nov 2007 WO
WO 2007131914 Nov 2007 WO
WO 2007149526 Dec 2007 WO
WO 2007149540 Dec 2007 WO
WO 2008061042 May 2008 WO
WO 2008102265 Aug 2008 WO
WO 2008134880 Nov 2008 WO
WO 2008147258 Dec 2008 WO
WO 2009017712 Feb 2009 WO
WO 2009132700 Nov 2009 WO
WO 2009135290 Nov 2009 WO
WO 2009144688 Dec 2009 WO
WO 2010035108 Apr 2010 WO
WO 2010068842 Jun 2010 WO
WO 2010071345 Jun 2010 WO
WO 2010076997 Jul 2010 WO
WO 2010088074 Aug 2010 WO
WO 2011126889 Oct 2011 WO
WO 2011158067 Dec 2011 WO
WO 2012012109 Jan 2012 WO
WO 2012018430 Feb 2012 WO
WO 2012018431 Feb 2012 WO
WO 2012018477 Feb 2012 WO
WO 2012018479 Feb 2012 WO
WO 2012018556 Feb 2012 WO
WO 2012024030 Feb 2012 WO
WO 2012033593 Mar 2012 WO
WO 2012051044 Apr 2012 WO
WO 2012060995 May 2012 WO
WO 2012060996 May 2012 WO
WO 2012060997 May 2012 WO
WO 2012061430 May 2012 WO
WO 2012061433 May 2012 WO
WO 2012061437 May 2012 WO
WO 2012071283 May 2012 WO
WO 2012071384 May 2012 WO
WO 2012094675 Jul 2012 WO
WO 2012117157 Sep 2012 WO
WO 2012142884 Oct 2012 WO
WO 2012145533 Oct 2012 WO
WO 2012145541 Oct 2012 WO
WO 2012145544 Oct 2012 WO
WO 2012149216 Nov 2012 WO
WO 2012149221 Nov 2012 WO
WO 2012149434 Nov 2012 WO
WO 2012149443 Nov 2012 WO
WO 2012161751 Nov 2012 WO
WO 2013015835 Jan 2013 WO
WO 2013015994 Jan 2013 WO
WO 2013015995 Jan 2013 WO
WO 2013016663 Jan 2013 WO
WO 2013016666 Jan 2013 WO
WO 2013049060 Apr 2013 WO
WO 2013055413 Apr 2013 WO
WO 2013066464 May 2013 WO
WO 2013066465 May 2013 WO
WO 2013085590 Jun 2013 WO
WO 2013085591 Jun 2013 WO
WO 2013086214 Jun 2013 WO
WO 2013086225 Jun 2013 WO
WO 2013086447 Jun 2013 WO
WO 2013086455 Jun 2013 WO
WO 2013088186 Jun 2013 WO
WO 2013090212 Jun 2013 WO
WO 2013090821 Jun 2013 WO
WO 2013090834 Jun 2013 WO
WO 2013103988 Jul 2013 WO
WO 2013116852 Aug 2013 WO
WO 2013116856 Aug 2013 WO
WO 2013154905 Oct 2013 WO
WO 2013155208 Oct 2013 WO
WO 2013177390 Nov 2013 WO
WO 2013187658 Dec 2013 WO
WO 2014011216 Jan 2014 WO
Non-Patent Literature Citations (206)
Entry
Adwankar, Sandeep et al., “Universal Manager: Seamless Management of Enterprise Mobile and Non-Mobile Devices,” Proceedings of the 2004 IEEE International Conference on Mobile Data Management, 12 pages, 2004.
Amato, Guiseppe et al., “Detection of Images With Adult Content for Parental Control on Mobile Devices,” Mobility, 5 pages, 2009.
Android Developers, “Date,” 10 pages, Oct. 27, 2011.
Ankeny, Jason, “F-Secure: Android to Blame for 79% of All Mobile Malware in 2012,” FierceMobileContent, FierceMarkets, 3 pages, Mar. 7, 2013.
Armstrong, Trevor et al., “Efficient and Transparent Dynamic Content Updates for Mobile Clients,” The Fourth International Conference on Mobile Systems, Applications and Services, MobiSys 2006, pp. 56-68, Jun. 19-22, 2006.
Baset, Salman et al., “An Analysis of the Skype Peer-To-Peer Internet Telephony Protocol,” Columbia University, Department of Computer Science, 12 pages, Sep. 15, 2004.
Bedell, Doug, “Meeting Your New Best Friends Six Degrees Widens Your Contacts in Exchange for Sampling Web Sites,” The Dallas Morning News, 4 pages, Oct. 27, 1998.
Bergman, Lawrence D. et al., “Programming-By-Demonstration for Behavior-Based User Interface Customization,” IBM Research Report, RC23116, 5 pages, Feb. 20, 2004.
B'Far, Reza et al., “Designing Effective User Interfaces for Wireless Devices,” Publication Unknown, 14 pages, Published prior to Feb. 23, 2006.
Blefari-Melazzi, N. et al., “Autonomic Control and Personalization of a Wireless Access Network,” Computer Networks, vol. 51, pp. 2645-2676, 2007.
Braden, R., “Requirements for Internet Hosts—Application and Support,” RFC 1123, 80 pages, Oct. 1989.
Canadian Patent Application No. 2,798,523, Office Action, 5 pages, Sep. 30, 2013.
Canadian Patent Application No. 2,806,527, Office Action, 4 pages, Apr. 3, 2013.
Canadian Patent Application No. 2,806,527, Office Action, 8 pages, Aug. 8, 2013.
Canadian Patent Application No. 2,806,529, Office Action, 4 pages, Apr. 2, 2013.
Canadian Patent Application No. 2,806,529, Office Action, 6 pages, Aug. 8, 2013.
Canadian Patent Application No. 2,806,548, Office Action, 4 pages, Oct. 10, 2013.
Canadian Patent Application No. 2,806,549, Office Action, 2 pages, Jul. 23, 2013.
Canadian Patent Application No. 2,806,549, Office Action, 3 pages, Nov. 4, 2013.
Canadian Patent Application No. 2,806,550, Office Action, 3 pages, May 23, 2013.
Canadian Patent Application No. 2,806,550, Office Action, 3 pages, Oct. 1, 2013.
Canadian Patent Application No. 2,806,557, Office Action, 4 pages, Mar. 21, 2013.
Canadian Patent Application No. 2,806,557, Office Action, 4 pages, Jul. 18, 2013.
Canadian Patent Application No. 2,806,557, Office Action, 6 pages, Nov. 15, 2013.
“CR 3483 to Release 8 TS 25.331, Rev. 2,” 3GPP TSG-RAN2 Meeting #64, Prague, Czech Republic, 11 pages, Nov. 10-14, 2008.
“CR 4100 to Release 8 TS 25.331, Rev. 1,” 3GPP TSG-RAN WG2 Meeting #69, San Francisco, U.S., 6 pages, Feb. 22-26, 2010.
Decker, Stefan et al., “The Social Semantic Desktop,” Digital Enterprise Research Institute, DERI Technical Report May 2, 2004, 7 pages, May 2004.
de la Iglesia, Didac Gil et al., “Enhancing Mobile Learning Activities by the Use of Mobile Virtual Devices—Some Design and Implementation Issues,” 2010 International Conference on Intelligent Networking and Collaborative Systems, IEEE Computer Society, pp. 137-144, 2010.
Elz, R. et al., “Clarifications to the DNS Specification,” RFC 2181, 12 pages, Jul. 1997.
Eronen, “TCP Wake-Up: Reducing Keep-Alive Traffic in Mobile IPv4 and Ipsec NAT Traversal,” NRC-TR-2008-002, Nokia, 10 pages, Jan. 31, 2008.
European Patent Application No. EP 03705704.9, Supplementary European Search Report, 4 pages, Jun. 9, 2010.
European Patent Application No. EP 03707338.4, Supplementary European Search Report, 2 pages, Apr. 18, 2011.
European Patent Application No. EP 05815115.0, Supplementary European Search Report, 7 pages, Nov. 17, 2011.
European Patent Application No. EP 11814939.2, Supplementary European Search Report, 6 pages, Nov. 6, 2013.
European Patent Application No. EP 11814940.0, Supplementary European Search Report, 7 pages, Nov. 7, 2013.
European Patent Application No. EP 11814971.5, Supplementary European Search Report, 10 pages, Oct. 24, 2013.
European Patent Application No. EP 11814973.1, Supplementary European Search Report, 10 pages, Oct. 30, 2013.
European Patent Application No. EP 11838437.9, Supplementary European Search Report, 7 pages, Dec. 18, 2013.
European Patent Application No. EP 11838705.9, Supplementary European Search Report, 6 pages, Dec. 12, 2013.
European Patent Application No. EP 11842623.8, Supplementary European Search Report, 7 pages, Jan. 16, 2014.
European Patent Application No. EP 11843111.3, Supplementary European Search Report, 6 pages, Oct. 21, 2013.
European Patent Application No. EP 12732122.2, Supplementary European Search Report, 6 pages, Dec. 6, 2013.
European Patent Application No. EP 12775986.8, Supplementary European Search Report, 6 pages, Jul. 2, 2013.
European Patent Application No. EP 13150313.8, Examination Report, 5 pages, Jul. 19, 2013.
European Patent Application No. EP 13150313.8, Supplementary European Search Report, 3 pages, Jul. 2, 2013.
Fukushima, Yukinobu et al., “Planning Method of Robust WDM Networks Against Traffic Changes,” IEIC Technical Report, vol. 103, No. 1, pp. 11-16, 2003.
Gameline, Advertisement, 1 page, 1982.
GSM Association, “Network Efficiency Task Force Fast Dormancy Best Practices,” V1.0, 21 pages, May 26, 2010.
Haas, Zygmunt J. et al., “Mobile-TCP: An Asymmetric Transport Protocol Design for Mobile Systems,” IEEE, pp. 1054-1058, 1997.
Haas, Zygmunt J. et al., “The Design and Performance of Mobile TCP for Wireless Networks,” Journal of High Speed Networks, vol. 10, pp. 187-207, 2001.
Hardy, Ed, “Microsoft Proposes Two New Thumb-Driven User Interfaces,” Brighthand Consulting, Inc., 2 pages, 2003.
ImTOO, “ImTOO iPod Movie Converter,” 3 pages, Nov. 9, 2005.
International Application No. PCT/US2003/000618, International Search Report, 1 page, Apr. 4, 2003.
International Application No. PCT/US2003/000624, International Search Report, 2 pages, May 13, 2003.
International Application No. PCT/US2005/037702, International Preliminary Examination Report, 6 pages, Nov. 20, 2007.
International Application No. PCT/US2005/037702, International Search Report, 1 page, Nov. 5, 2007.
International Application No. PCT/US2005/037702, Written Opinion, 6 pages, Nov. 5, 2007.
International Application No. PCT/US2005/038135, International Search Report, 2 pages, Aug. 8, 2008.
International Application No. PCT/US2005/038135, Written Opinion, 8 pages, Aug. 8, 2008.
International Application No. PCT/US2005/038135, International Preliminary Report on Patentability, 9 pages, Oct. 31, 2011.
International Application No. PCT/FI2005/050424, International Search Report, 4 pages, Mar. 2, 2006.
International Application No. PCT/FI2005/050426, International Search Report, 3 pages, Mar. 1, 2006.
International Application No. PCT/FI2005/050441, International Search Report, 3 pages, Mar. 1, 2006.
International Application No. PCT/US2006/023426, International Search Report, 1 page, Feb. 21, 2007.
International Application No. PCT/US2006/023427, International Search Report, 1 page, Oct. 12, 2006.
International Application No. PCT/US2007/014462, International Search Report, 1 page, Jul. 2, 2008.
International Application No. PCT/US2007/014497, International Search Report, 1 page, Aug. 25, 2008.
International Application No. PCT/US2011/030534, International Search Report & Written Opinion, 10 pages, Dec. 29, 2011.
International Application No. PCT/US2011/037932, International Search Report & Written Opinion, 9 pages, Jan. 2, 2012.
International Application No. PCT/US2011/037943, International Search Report & Written Opinion, 11 pages, Jan. 2, 2012.
International Application No. PCT/US2011/043322, International Search Report & Written Opinion, 9 pages, Feb. 9, 2012.
International Application No. PCT/US2011/043328, International Search Report & Written Opinion, 12 pages, Feb. 27, 2012.
International Application No. PCT/US2011/043409, International Search Report & Written Opinion, 11 pages, Feb. 9, 2012.
International Application No. PCT/US2011/044974, International Search Report & Written Opinion, 15 pages, Jun. 1, 2012.
International Application No. PCT/US2011/056474, International Search Report & Written Opinion, 9 pages, May 4, 2012.
International Application No. PCT/US2011/056476, International Search Report & Written Opinion, 12 pages, May 24, 2012.
International Application No. PCT/US2011/056478, International Search Report & Written Opinion, 11 pages, May 31, 2012.
International Application No. PCT/US2011/058840, International Search Report & Written Opinion, 10 pages, Apr. 26, 2012.
International Application No. PCT/US2011/058843, International Search Report & Written Opinion, 11 pages, May 16, 2012.
International Application No. PCT/US2011/058848, International Search Report & Written Opinion, 10 pages, Apr. 10, 2012.
International Application No. PCT/US2011/061512, International Search Report, 10 pages, May 10, 2012.
International Application No. PCT/US2011/061795, International Search Report & Written Opinion, 10 pages, Jul. 31, 2012.
International Application No. PCT/US2012/020669, International Search Report & Written Opinion, 10 pages, Sep. 12, 2012.
International Application No. PCT/US2012/021459, International Search Report & Written Opinion, 10 pages, Jun. 1, 2012.
International Application No. PCT/US2012/022121, International Search Report & Written Opinion, 11 pages, May 14, 2012.
International Application No. PCT/US2012/034288, International Search Report & Written Opinion, 15 pages, Nov. 23, 2012.
International Application No. PCT/US2012/034297, International Search Report & Written Opinion, 11 pages, Nov. 26, 2012.
International Application No. PCT/US2012/034300, International Search Report & Written Opinion, 9 pages, Nov. 23, 2012.
International Application No. PCT/US2012/035292, International Search Report & Written Opinion, 11 pages, Nov. 28, 2012.
International Application No. PCT/US2012/035300, International Search Report & Written Opinion, 9 pages, Nov. 28, 2012.
International Application No. PCT/US2012/035608, International Search Report & Written Opinion, 9 pages, Nov. 28, 2012.
International Application No. PCT/US2012/035617, International Search Report & Written Opinion, 9 pages, Oct. 10, 2012.
International Application No. PCT/US2012/042982, International Search Report & Written Opinion, 11 pages, Jan. 2, 2013.
International Application No. PCT/US2012/046317, International Search Report & Written Opinion, 10 pages, Jan. 3, 2013.
International Application No. PCT/US2012/046321, International Search Report & Written Opinion, 11 pages, Dec. 27, 2012.
International Application No. PCT/US2012/048623, International Search Report & Written Opinion, 13 pages, Jan. 31, 2013.
International Application No. PCT/US2012/048639, International Search Report & Written Opinion, 15 pages, Jan. 29, 2013.
International Application No. PCT/US2012/050467, International Search Report & Written Opinion, 14 pages, Mar. 4, 2013.
International Application No. PCT/US2012/050476, International Search Report & Written Opinion, 14 pages, Feb. 28, 2013.
International Application No. PCT/US2012/055931, International Search Report & Written Opinion, 9 pages, Mar. 4, 2013.
International Application No. PCT/US2012/055934, International Search Report & Written Opinion, 12 pages, Jan. 31, 2013.
International Application No. PCT/US2012/068278, International Search Report & Written Opinion, 11 pages, Mar. 21, 2013.
International Application No. PCT/US2012/068291, International Search Report & Written Opinion, 10 pages, Mar. 21, 2013.
International Application No. PCT/US2012/068612, International Search Report & Written Opinion, 10 pages, Mar. 29, 2013.
International Application No. PCT/US2012/068624, International Search Report & Written Opinion, 10 pages, Mar. 25, 2013.
International Application No. PCT/US2012/068822, International Search Report & Written Opinion, 13 pages, Mar. 29, 2013.
International Application No. PCT/US2012/069917, International Search Report & Written Opinion, 14 pages, Apr. 30, 2013.
International Application No. PCT/US2012/069931, International Search Report & Written Opinion, 10 pages, Apr. 30, 2013.
International Application No. PCT/US2013/020574, International Search Report & Written Opinion, 9 pages, Mar. 4, 2013.
International Application No. PCT/US2013/024657, International Search Report & Written Opinion, 14 pages, May 30, 2013.
International Application No. PCT/US2013/024664, International Search Report & Written Opinion, 11 pages, Apr. 1, 2013.
International Application No. PCT/US2013/027694, International Search Report & Written Opinion, 12 pages, Jun. 4, 2013.
International Application No. PCT/US2013/035257, International Search Report & Written Opinion, 14 pages, Jul. 26, 2013.
International Application No. PCT/US2013/036013, International Search Report & Written Opinion, 16 pages, Jul. 26, 2013.
International Application No. PCT/US2013/042417, International Search Report & Written Opinion, 19 pages, Sep. 13, 2013.
Japanese Patent Application No. 2003-558726, Office Action, 2 pages, Jun. 10, 2008.
Johnsen, Lotte, Master's Thesis for “Content Distribution in Ad Hoc Networks,” Norwegian University of Science and Technology, Department of Telematics, 158 pages, Spring 2006.
Kanter, Theo et al., “Smart Delivery of Multimedia Content for Wireless Applications,” Computer Science, vol. 1818, pp. 70-81, 2000.
Karlson, Amy K. et al., “AppLens and LaunchTile: Two Designs for One-Handed Thumb Use on Small Devices,” Proceedings of CHI 2005, 10 pages, Apr. 2-7, 2005.
Kent, S. et al., “Security Architecture for the Internet Protocol,” RFC 2401, The Internet Society, 62 pages, Nov. 1998.
Kino, Toru, “Infrastructure Technology for Cloud Services,” Fujitsu Sci. Tech. J., vol. 47, No. 4, pp. 434-442, Oct. 2011.
Kleinberg, Jon, “The Small-World Phenomenon: An Algorithmic Perspective,” Cornell Computer Science Technical Report 99-1776, 14 pages, Oct. 1999.
Koeppel, Dan, “GUIs Just Want to Have Fun,” Wired Magazine, Issue 8.10, 12 pages, Oct. 2000.
LeBrun, Jason et al., “Bluetooth Content Distribution Stations on Public Transit,” ACM, Inc., 3 pages, 2006.
MacGregor, Rob et al., “The Domino Defense: Security in Lotus Notes and the Internet,” IBM Corporation, 183 pages, Dec. 1997.
Maltz, David A. et al., “MSOCKS: An Architecture for Transport Layer Mobility,” IEEE, pp. 1037-1045, 1998.
Mason, Luke, “Windows XP: New GUI Design Shows Skin Is In,” TechRepublic, 4 pages, Apr. 4, 2001.
Microsoft, Definition of “Access,” Microsoft Computer Dictionary, Fifth Edition, 2 pages, May 1, 2002.
Microsoft, Definition of “Synchronization,” Microsoft Computer Dictionary, Fifth Edition, 2 pages, May 1, 2002.
Milgram, Stanley, “The Small-World Problem,” Psychology Today, vol. 2, pp. 60-67, 1967.
Mockapetris, P., “Domain Names—Concepts and Facilities,” RFC 1034, 43 pages, Nov. 1987.
Mockapetris, P., “Domain Names—Implementation and Specification,” RFC 1035, 43 pages, Nov. 1987.
Myers, Brad A. et al., “Extending the Windows Desktop Interface With Connected Handheld Computers,” WSS'00 Proceedings of the 4th Conference on USENIX Windows Systems Symposium, vol. 4, 10 pages, 2000.
Myers, Brad A. et al., “User Interfaces That Span Hand-Held and Fixed Devices,” CHI'2001 Workshop on Distributed and Disappearing User Interfaces in Ubiquitous Computer, 4 pages, 2001.
National Institute of Standards and Technology, “Advanced Encryption Standard (AES),” Federal Information Processing Standards Publication 197, 52 pages, Nov. 26, 2001.
National Institute of Standards and Technology, “Secure Hash Standard,” Federal Information Processing Standards Publication 180-2, 83 pages, Aug. 1, 2002.
Newton, Harry, “Newton's Telecom Dictionary,” 20th Edition, pp. 67, 127, 542, Mar. 2004.
Niederée, Claudia et al., “A Multi-Dimensional, Unified User Model for Cross-System Personalization,” Proceedings of the AVI 2004 Workshop on Environments for Personalized Information Access, 11 pages, 2004.
Nokia, “Developer Platforms,” 3 pages, 2005.
Open Mobile Alliance Ltd., “OMA AOI Architecture Principles—OMA-CD-AO1-2012-0012,” 12 pages, Dec. 17, 2012.
Openet Telecom, “Taming Signaling: Addressing the Signaling Storm,” Openet Labs Technical White Paper, 11 pages, 2012.
Ortiz, C. Enrique, “An Introduction to the Symbian OS™ Platform for Palm OS® Developers,” Metrowerks Corp., 21 pages, 2002.
Parker, Tammy, “SK Telecom Aims to License, Standardize Smart Push,” FierceBroadbandWireless, 4 pages, Aug. 26, 2012.
Paul, Sanjoy et al., “The Cache-and-Forward Network Architecture for Efficient Mobile Content Delivery Services in the Future Internet,” First ITU-T Kaleidoscope Academic Conference for Innovations in NGN—Future Network and Services, 7 pages, May 12-13, 2008.
Pei, Guangyu et al., “Mobility Management in Hierarchical Multi-Hop Mobile Wireless Networks,” IEEE, pp. 324-329, 1999.
Perez, Sarah, “Onavo's Data-Compressing Mobile App Raises $10 Million Series B From Horizons, Motorola Ventures,” 2 pages, Jan. 24, 2012.
Phillips, Joshua et al., “Modeling the Intelligence Analysis Process for Intelligent User Agent Development,” Research and Practice in Human Resource Management, vol. 9, No. 1, pp. 59-73, 2001.
Qualcomm Incorporated, “A 3G/LTE Wi-Fi Offload Framework: Connectivity Engine (CnE) to Manage Inter-System Radio Connections and Applications,” 15 pages, Jun. 2011.
Qualcomm Incorporated, “Managing Background Data Traffic in Mobile Devices,” 16 pages, Jan. 2012.
Qualcomm, “System Parameter Recommendations to Optimize PS Data User Experience and UE Battery Life,” 80-W1112-1, Revision B, 9 pages, Mar. 2007.
Ringel, Meredith et al., “iStuff: A Scalable Architecture for Lightweight, Wireless Devices for Ubicomp User Interfaces,” Proceedings of UbiComp 2002, 2 pages, 2002.
Seven Networks, Inc., “Seven Optimizing the Mobile Ecosystem,” www.seven.com/products.traffic—optimization.php, 1 page, May 29, 2012.
Signorini, Eugene, “SEVEN's Service-Based Wireless Solutions Enable Enterprises to Untether E-Mail,” Wireless/Mobile Enterprise & Commerce, 16 pages, Oct. 2004.
Sung, Dan Keun, Ph.D., “EE624 Mobile Communications Systems (MCS),” Korea Advanced Institute of Science and Technology, Department of Electrical Engineering and Computer Science, 13 pages, Fall 2000.
U.K. Patent Application No. GB1219986.5, Examination Report, 6 pages, Dec. 24, 2012.
U.K. Patent Application No. GB1222083.6, Search Report, 4 pages, Apr. 30, 2013.
U.K. Patent Application No. GB1222636.1, Search Report, 4 pages, May 30, 2013.
U.K. Patent Application No. GB1222637.9, Search Report, 4 pages, Sep. 13, 2013.
U.K. Patent Application No. GB1300185.4, Examination Report, 10 pages, Oct. 29, 2013.
U.K. Patent Application No. GB1300808.1, Examination Report, 10 pages, Mar. 11, 2013.
U.K. Patent Application No. GB1300808.1, Examination Report, 3 pages, Sep. 20, 2013.
U.K. Patent Application No. GB1301235.6, Examination Report, 3 pages, Jun. 24, 2013.
U.K. Patent Application No. GB1301258.8, Examination Report, 5 pages, Feb. 18, 2013.
U.K. Patent Application No. GB1301271.1, Examination Report, 4 pages, Mar. 14, 2013.
U.K. Patent Application No. GB1302153.0, Examination Report, 3 pages, Nov. 20, 2013.
U.K. Patent Application No. GB1302158.9, Examination Report, 7 pages, Mar. 15, 2013.
U.K. Patent Application No. GB1302515.0, Examination Report, 3 pages, Mar. 5, 2013.
U.K. Patent Application No. GB1306198.1, Examination Report, 4 pages, Oct. 14, 2013.
U.K. Patent Application No. GB1307218.6, Examination Report, 5 pages, Jun. 24, 2013.
U.K. Patent Application No. GB1307573.4, Examination Report, 4 pages, Jul. 3, 2013.
U.K. Patent Application No. GB1307573.4, Examination Report, 4 pages, Nov. 12, 2013.
U.K. Patent Application No. GB1309204.4, Examination Report, 6 pages, Jun. 25, 2013.
U.K. Patent Application No. GB1309366.1, Examination Report, 4 pages, Nov. 27, 2013.
U.K. Patent Application No. GB1309373.7, Examination Report, 6 pages, Jun. 26, 2013.
U.K. Patent Application No. GB1309373.7, Examination Report, 3 pages, Dec. 5, 2013.
U.K. Patent Application No. GB1310340.3, Examination Report, 8 pages, Jul. 10, 2013.
U.K. Patent Application No. GB1310348.6, Examination Report, 5 pages, Jul. 15, 2013.
U.K. Patent Application No. GB1316847.1, Examination Report, 7 pages, Nov. 12, 2013.
U.K. Patent Application No. GB1317828.0, Examination Report, 7 pages, Jan. 3, 2014.
U.K. Patent Application No. GB1317972.6, Examination Report, 8 pages, Dec. 9, 2013.
U.K. Patent Application No. GB1318796.8, Examination Report, 7 pages, Dec. 5, 2013.
U.K. Patent Application No. GB1318908.9, Examination Report, 6 pages, Nov. 29, 2013.
U.K. Patent Application No. GB1319222.4, Examination Report, 6 pages, Dec. 12, 2013.
U.K. Patent Application No. GB1319283.6, Examination Report, 7 pages, Nov. 21, 2013.
U.S. Appl. No. 60/663,463, File History, 113 pages, Mar. 18, 2005.
Vivacqua, Adriana et al., “Profiling and Matchmaking Strategies in Support of Opportunistic Collaboration,” CoopIS/DOA/ODBASE 2003, LNCS 2888, pp. 162-177, 2003.
Wikipedia, Definition for “General Packet Radio Service,” 7 pages, downloaded on May 31, 2012.
Yin, Chunjiang et al., “IST-2001-32125 FLOWS,” Deliverable No. D15, Information Society Technologies, 97 pages, Dec. 22, 2003.
Zhang, Qi et al., “Cloud Computing: State-of-the-Art and Research Challenges,” J Internet Serv Appl, vol. 1, pp. 7-18, 2010.
Canadian Patent Application No. 2,806,548, Office Action, 3 pages, Feb. 25, 2014.
Canadian Patent Application No. 2,806,549, Office Action, 3 pages, Feb. 18, 2014.
Canadian Patent Application No. 2,806,550, Office Action, 3 pages, Feb. 14, 2014.
European Patent Application No. EP 11748780.1, Examination Report, 4 pages, Jan. 17, 2014.
European Patent Application No. EP 11814971.5, Examination Report, 4 pages, Feb. 17, 2014.
European Patent Application No. EP 11814973.1, Examination Report, 4 pages, Feb. 17, 2014.
European Patent Application No. EP 11838437.9, Examination Report, 2 pages, Feb. 19, 2014.
European Patent Application No. EP 11843111.3, Examination Report, 4 pages, Feb. 17, 2014.
International Application No. PCT/US2013/070360, International Search Report & Written Opinion, 13 pages, Feb. 28, 2014.
Japanese Patent Application No. 2013-521801, Office Action, 6 pages, Feb. 3, 2014.
Japanese Patent Application No. 2013-521845, Office Action, 6 pages, Dec. 18, 2013.
U.K. Patent Application No. GB1300808.1, Examination Report, 4 pages, Feb. 3, 2014.
U.K. Patent Application No. GB1310340.3, Examination Report, 6 pages, Jan. 31, 2014.
U.K. Patent Application No. GB1318437.9, Examination Report, 7 pages, Feb. 6, 2014.
U.K. Patent Application No. GB1320293.2, Examination Report, 3 pages, Jan. 23, 2014.
U.K. Patent Application No. GB1321790.6, Examination Report, 6 pages, Jan. 17, 2014.
U.K. Patent Application No. GB1400632.4, Combined Search and Examination Report, 5 pages, Feb. 19, 2014.
Provisional Applications (4)
Number Date Country
61776573 Mar 2013 US
61818801 May 2013 US
61829965 May 2013 US
61776584 Mar 2013 US