Systems and methods for application management of mobile device radio state promotion and demotion

Description

BACKGROUND

Multiple factors may contribute to the proliferation of data on a mobile network: the end-user, mobile devices, wireless devices, mobile applications, and the network. As mobile devices evolve, so may the various elements associated with the network, such as, availability, applications, user behavior, location thus changing the way the network interacts with the device and the application.

Some mobile devices may have applications or other clients that create data (e.g., background data, background activity) that appear active to the network when it is in fact idle or in a background state when the user is not using the device. This background data or signaling may cause the network to unnecessarily promote the mobile device from a lower powered radio state to a higher powered one, causing unneeded or non-optimal battery consumption and network resource consumption.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1A-1 depicts diagrams showing radio states and transitions in a 3G network.

FIG. 1A-2 depicts a diagram showing radio states and transitions in a 4G/LTE network.

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 manage mobile device radio state promotion and demotion by buffer and/or activity monitoring.

FIG. 1C illustrates an example diagram of a proxy and cache system distributed between the host server and device which facilitates network traffic management between a 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. In some embodiments, the proxy system distributed among the host server and the device can further manage mobile device radio state promotion and demotion by buffer and/or activity monitoring.

FIG. 2A depicts a block diagram illustrating an example of client-side components in a distributed proxy and cache system, further including a radio state management engine.

FIG. 2B depicts a block diagram illustrating additional components in the radio state management engine shown in the example of FIG. 2A.

FIG. 3A depicts a block diagram illustrating an example of server-side components in a distributed proxy and cache system, further including a radio state management engine.

FIG. 3B depicts a block diagram illustrating additional components in the radio state management engine shown in the example of FIG. 3A.

FIG. 4A depicts a block diagram illustrating an example of client-side components in a distributed proxy and cache system residing on a mobile device (e.g., wireless device) that manages traffic in a wireless network (or broadband network) for resource conservation, content caching, and/or traffic management. The client-side proxy (or local proxy) can further categorize mobile traffic and/or implement delivery policies based on application behavior, content priority, user activity, and/or user expectations.

FIG. 4B depicts a block diagram illustrating a further example of components in the cache system shown in the example of FIG. 4A which in some embodiments is capable of caching and adapting caching strategies for mobile application behavior and/or network conditions. Components capable of detecting long poll requests and managing caching of long polls are also illustrated.

FIG. 4C depicts a block diagram illustrating examples of additional components in the local cache shown in the example of FIG. 4A which is further capable of performing mobile traffic categorization and policy implementation based on application behavior and/or user activity.

FIG. 5A depicts a block diagram illustrating an example of server-side components, in certain embodiments of a distributed proxy and cache system that manages traffic in a wireless network (or broadband network) for resource conservation, content caching, and/or traffic management. In some embodiments, the server-side proxy (or proxy server) can further categorize mobile traffic and/or implement delivery policies based on application behavior, content priority, user activity, and/or user expectations.

FIG. 5B depicts a block diagram illustrating a further example of components in the caching policy manager in the cache system shown in the example of FIG. 5A which is capable of caching and adapting caching strategies for mobile application behavior and/or network conditions. Components capable in some embodiments of detecting long poll requests and managing caching of long polls are also illustrated.

FIG. 5C depicts a block diagram illustrating examples of additional components in certain embodiments in the proxy server shown in the example of FIG. 5A which is further capable of performing mobile traffic categorization and policy implementation based on application behavior and/or traffic priority.

FIG. 6 is a flow diagram depicting certain steps in a process for assessing background data and performing a radio status transition as implemented in certain embodiments.

FIG. 7 is a flow diagram depicting a process for assessing background data and performing a radio status transition based on power state transition criteria as implemented in certain embodiments.

FIG. 8 is a flow diagram generally depicting a process for monitoring applications which transmit background data and performing a radio status transition based on radio state transition criteria as implemented in certain embodiments.

FIG. 9 depicts a table showing examples of different traffic or application category types which can be used in implementing network access and content delivery policies.

FIG. 10 depicts a table showing examples of different content category types which can be used in implementing network access and content delivery policies.

FIG. 11 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 embodiment” 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 some embodiments” 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, nor is any special significance 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.

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.

Data Proliferation and Mobile Traffic Management

Certain of the embodiments disclose a comprehensive and end-to-end solution that is able to address each element for operators and devices manufacturers to support both the shift in mobile or wireless devices and the surge in data by leveraging the premise that mobile content has a definable or relevant “freshness” value. The “freshness” of mobile content can be determined, either with certainty, or with some heuristics having a tolerance within which the user experience is enhanced, or not negatively impacted, or negatively impacted but is either not perceptible to the user or within a tolerable threshold level.

Certain of the embodiments transparently determine such “freshness” by monitoring, analyzing, and applying rules (which may be heuristically determined) the transactions (requests/responses) between applications (e.g., mobile applications) and the peers (corresponding server or other clients). Moreover, the technology is further able to effectively cache content which may be marked by its originating/host server as being “non-cacheable” and identify some “freshness” value which can then be used in implementing application-specific caching. In general, the “freshness” value has an approximate minimum value which is typically determined using the update interval (e.g., interval with which requests are sent) between the application and its corresponding server/host.

One embodiment of the disclosed technology includes a system that optimizes multiple aspects of the connection with wired and wireless networks and devices through a comprehensive view of device and application activity including: loading, current application needs on a device, controlling the type of access (push vs. pull or hybrid), location, concentration of users in a single area, time of day, how often the user interacts with the application, content or device, and using this information to shape traffic to a cooperative client/server or simultaneously mobile devices without a cooperative client. Because the disclosed server is not tied to any specific network provider it has visibility into the network performance across all service providers. This enables optimizations to be applied to devices regardless of the operator or service provider, thereby enhancing the user experience and managing network utilization while roaming. Bandwidth has been considered a major issue in wireless networks today. More and more research has been done related to the need for additional bandwidth to solve access problems. Many of the performance enhancing solutions and next generation standards, such as those commonly referred to as 3.5G, Long Term Evolution (LTE), 4G, and WiMax, are focused on providing increased bandwidth. Although partially addressed by the standards, a key problem that remains is lack of bandwidth on the signaling channel more so than the data channel and the standard does not address battery life very well.

Certain embodiments of the disclosed technology includes, for example, alignment of requests from multiple applications to minimize the need for several polling requests; leverage specific content types to determine how to proxy/manage a connection/content; and applying specific heuristics associated with device, user behavioral patterns (how often they interact with the device/application) and/or network parameters.

Certain of the disclosed embodiments can further include, moving recurring Hypertext Transfer Protocol (HTTP) polls performed by various widgets, RSS readers, etc., to remote network node (e.g., Network Operation Center (NOC)), thus considerably lowering device battery/power consumption, radio channel signaling and bandwidth usage. Additionally, the offloading can be performed transparently so that existing applications do not need to be changed.

In some embodiments, this can be implemented using a local proxy on the mobile device (e.g., any wireless device) which automatically detects recurring requests for the same content (RSS feed, Widget data set) that matches a specific rule (e.g., happens every 15 minutes). The local proxy can automatically cache the content on the mobile device while delegating the polling to the server (e.g., a proxy server operated as an element of a communications network). The server can then notify the mobile/client proxy if the content changes, and if content has not changed (or not changed sufficiently, or in an identified manner or amount) the mobile proxy provides the latest version in its cache to the user (without need to utilize the radio at all). This way the mobile or wireless device (e.g., a mobile phone, smart phone, M2M module/MODEM, or any other wireless devices, etc.) does not need to open (e.g., thus powering on the radio) or use a data connection if the request is for content that is monitored and that has been not flagged as new/changed.

The logic for automatically adding content sources/application servers (e.g., including URLs/content) to be monitored can also check for various factors like how often the content is the same, how often the same request is made (is there a fixed interval/pattern?), which application is requesting the data, etc. Similar rules to decide between using the cache and request the data from the original source may also be implemented and executed by the local proxy and/or server in certain embodiments.

For example, when the request comes at an unscheduled/unexpected time (user initiated check), or after every (n) consecutive times the response has been provided from the cache, etc., or if the application is running in the background vs. in a more interactive mode of the foreground. As more and more mobile applications or wireless enabled applications base their features on resources available in the network, this becomes increasingly important. In addition, the disclosed technology allows elimination of unnecessary chatter from the network, benefiting the operators trying to optimize the wireless spectrum usage.

Traffic Categorization and Policy

In some embodiments, the disclosed proxy system is able to establish policies for choosing traffic (data, content, messages, updates, etc.) to cache and/or shape. Additionally, by combining information from observing the application making the network requests, getting explicit information from the application, or knowing the network destination the application is reaching, the disclosed technology can determine or infer what category the transmitted traffic belongs to.

For example, In some embodiments, mobile or wireless traffic can be categorized as: (a1) interactive traffic or (a2) background traffic. The difference is that in (a1) a user is actively waiting for a response, while in (a2) a user is not expecting a response. This categorization can be used in conjunction with or in lieu of a second type of categorization of traffic: (b1) immediate, (b2) low priority, (b3) immediate if the requesting application is in the foreground and active.

For example, a new update, message or email may be in the (b1) category to be delivered immediately, but it still is (a2) background traffic—a user is not actively waiting for it. A similar categorization applies to instant messages when they come outside of an active chat session. During an active chat session a user is expecting a response faster. Such user expectations are determined or inferred and factored into when optimizing network use and device resources in performing traffic categorization and policy implementation.

Some examples of the applications of the described categorization scheme, include the following: (a1) interactive traffic can be categorized as (b1) immediate—but (a2) background traffic may also be (b2) or (b3). An example of a low priority transfer is email or message maintenance transaction such as deleting email or other messages or marking email as read at the mail or application server. Such a transfer can typically occur at the earlier of (a) timer exceeding a timeout value (for example, 2 minutes), and (b) data being sent for other purposes.

An example of (b3) is IM presence updates, stock ticker updates, weather updates, status updates, news feeds. When the UI of the application is in the foreground and/or active (for example, as indicated by the backlight of the device/phone being lit or as determined or inferred from the status of other sensors), updates can be considered immediate whenever the server has something to push to the device. When the application is not in the foreground or not active, such updates can be suppressed until the application comes to foreground and is active.

With some embodiments, networks can be selected or optimized simultaneously for (a1) interactive traffic and (a2) background traffic.

In some embodiments, as the wireless device or mobile device proxy (separately or in conjunction with the server proxy) is able to categorize the traffic as (for example) (a1) interactive traffic or (a2) background traffic, it can apply different policies to different types of traffic. This means that it can internally operate differently for (a1) and (a2) traffic (for example, by allowing interactive traffic to go through to the network in whole or in part, and apply stricter traffic control to background traffic; or the device side only allows a request to activate the radio if it has received information from the server that the content at the host has been updated, etc.).

When the request does require access over the wireless network, the disclosed technology can request the radio layer to apply different network configurations to different traffic. Depending on the type of traffic and network this may be achieved by different means:

(1) Using 3G/4G for (a1) and 2G/2.5G for (a2);

(2) Explicitly specifying network configuration for different data sets (e.g. in terms of use of FACH (forward access channel) vs. DCH (dedicated channel), or otherwise requesting lower/more network efficient data rates for background traffic); or

(3) Utilizing different network access points for different data sets (access points which would be configured to use network resources differently similar to (1) and (2) above).

Additionally, 3GPP Fast Dormancy calls for improvements so that applications, operating systems or the mobile device would have awareness of the traffic type to be more efficient in the future. Certain embodiments of the disclosed system, having the knowledge of the traffic category and being able to utilize Fast Dormancy appropriately may solve the problem identified in Fast Dormancy. In this manner, the mobile or broadband network does not need to be configured with a compromised configuration that adversely impacts both battery consumption and network signaling resources.

Polling Schedule

Detecting (or determining) a polling schedule allows the proxy server (server-side of the distributed cache system) to be as close as possible with its polls to the application polls. Many applications employ scheduled interval polling (e.g., every 4 hours or every 30 seconds, at another time interval). The client side proxy can detect automatic polls based on time measurements and create an automatic polling profile for an application. As an example, the local proxy attempts to detect the time interval between requests and after 2, 3, 4, or more polls, determines an automatic rate if the time intervals are all within 1 second (or another measure of relative closeness) of each other. If not, the client may collect data from a greater number of polling events (e.g., 10-12 polls) and apply a statistical analysis to determine, compute, or estimate a value for the average interval that is used. The polling profile is delivered to the server where it is used. If it is a frequent manual request, the locally proxy can substitute it with a default interval for this application taken from a profile for non-critical applications.

In some embodiments, the local proxy (e.g., device side proxy) may keep monitoring the application/client polls and update the polling interval. If it changes by more than 30% (or another predetermined/dynamic/conditional value) from the current value, it is communicated to the proxy server (e.g., server-side proxy). This approach can be referred to as the scenario of “lost interest.” In some instances, the local proxy can recognize requests made outside of this schedule, consider them “manual,” and treat them accordingly.

Application Classes/Modes of Caching

In some embodiments, applications can be organized into three groups or modes of caching. Each mobile client/application can be categorized to be treated as one of these modes, or treated using multiple modes, depending on one or more conditions.

A) Fully cached—local proxy updates (e.g., sends application requests directly over the network to be serviced by the application server/content host) only when the proxy server tells the local proxy to update. In this mode, the local proxy can ignore manual requests and the proxy server uses the detected automatic profile (e.g., sports score applets, Facebook, every 10, 15, 30, or more polls) to poll the application server/content provider.

B) Partially cached—the local proxy uses the local or internal cache for automatic requests (e.g., application automatic refreshes), other scheduled requests but passes through some manual requests (e.g., email download, EBay or some Facebook requests); and

C) Never cached (e.g., real-time stock ticker, sports scores/statuses; however, in some instances, 15 minutes delayed quotes can be safely placed on 30 seconds schedules—B or even A).

The actual application or caching mode classification can be determined based on the rate of content change and critical character of data. Unclassified applications by default can be set as class C.

Backlight and Active Applications

In some embodiments, the local proxy starts by detecting the device backlight status. Requests made with the screen light ‘off’ can be allowed to use the local cache if a request with identical signature is registered with the proxy server, which is polling the original host server/content server(s) to which the requests are directed. If the screen light is ‘on’, further detection can be made to determine whether it is a background application or for other indicators that local cache entries can or cannot be used to satisfy the request. When identified, the requests for which local entries can be used may be processed identically to the screen light off situation. Foreground requests can use the aforementioned application classification to assess when cached data is safe to use to process requests.

FIG. 1A-1 depicts diagrams showing radio states 4000 and transitions in a 3G network. A 3G device can be in one of the following Radio Resource Control (RRC) connection states (the Idle state may not technically be considered a “connected state” in some instances). A high state may include, e.g. DCH, Cell DCH or High Speed Packet Access (HSPA) 4004. In the state 4004, the device may communicate with the network in a dedicated fashion, which may require the most network resources and the highest device power (compared with the other states). The low state may include, e.g., FACH or Cell FACH 4003. In this state 4003, the device may communicate with the network, but doing so may require some network resources (e.g., supporting data throughput at low rates) and some device power. Low state 4003 may generally impose a lesser burden than the High state 4004.

A standby state may include, e.g., URA, URA PCH or Cell PCH 4002. In this state 4002, the network may be aware of the device, but there may be no requirement for network resources to be consumed. In an idle state 4001, the network may be aware of the device, but the device may be in sleep mode. In sleep mode, the device may not really communicate with the network and may therefore require the least amount of network resources and consume the least power (compared with the other states).

FIG. 1A-2 depicts a diagram showing radio states and transitions in a 4G/LTE network. Particularly, mobility states 4100 may be the status conditions of a mobile device as the mobile device relates to a communication network. Mobility states may include detached 4101 (unknown to the network), active 4102 (communicating with the network), and idle 4103 (awaiting actions). In some embodiments, the Universal Mobile Telecommunications System (UMTS) LTE device may starts in the detached 4101 (unknown status) state when it is turned on. After the mobile device registers with the network, it may change into the active state 4102. If the device is inactive for a period of time (does not transfer information), it may be moved into the idle mode 4103. If there is data to be transferred, the mode may be changed back to the active 4102. When a device is powered off, it may inform the system (deregisters) and may detach from the network.

The mobile device may have applications or other clients that create data (e.g., background data, background activity) that appear active to the network when it is in fact idle or in a background state when the user is not using the device. This background data or signaling may cause the network to unnecessarily promote the mobile device from a lower powered radio state to a higher powered one, causing unneeded or non-optimal battery consumption and network resource consumption.

Various of the disclosed embodiments include one or more of client-side components (in the local proxy 275 as shown in the examples of FIG. 2A-FIG. 2B) and/or server-side components (in the proxy server 325 as shown in the examples of FIG. 3A-FIG. 3B) which can derive information from the mobile device (150, 250) about device usage to implicitly control radio state (as dictated on the network side via network-side throttling. For example, the disclosed technology, in the case of the 3 or 4 state Wideband Code Division Multiple Access (WCDMA)/3G model (IDLE/(PCH)/FACH/DCH)) can take advantage of knowing or determining the FACH consumption rate and byte buffers by keeping the radio in FACH for e.g. background data transfer until the buffer crosses a threshold (predetermined or dynamically adjusted, device dependent, carrier dependent, network condition dependent), or when the device's backlight is off, or until user activity/lack thereof is determined/detected or some other similar criteria.

The client side components in the local proxy 275 can, alone or in combination with the server side components in the proxy server 325, more intelligently determine what user activity and/or data activity should justify a radio state promotion and communicate the information to the network to be implemented as a single session, multi-session, or global policy (e.g., via a policy manager on the network side such as the Policy and Charging Rules Function (PCRF) node). This policy can be used to execute the appropriate level of throttling to prevent the radio from going to higher powered states when unjustified based on dynamic conditions (e.g., network status, traffic, congestion, user expectations and/or user behavior/other activity).

In some embodiments, buffer size can be used as a trigger or indication of when to trigger radio state changes. The parameters related to the buffer (e.g., threshold, timer, buffer sensitivity) which are configured by the network to cause radio state changes may be dynamic based on the network conditions, hardware/software configuration and can differ based on network operator/carrier.

Due to the predominantly dynamic nature of buffer parameters, to use the buffer size in the disclosed technology for optimizing situations for radio state promotions and/or demotions, in some embodiments the client side components and/or the server side components can be configured to include dynamic adaptive logic to discover network specific or condition specific values and adjust accordingly. In some instances, static values for the buffer parameters can also be used. Some example of implementations include as follows:

- The client side and/or the server side can include components (e.g., the components shown in FIG. 2A-FIG. 3B) which handle the traffic over a common channel, to handle specific types of traffic.
- The client side components can include logic (e.g., the components shown in the example of FIG. 2A-FIG. 2B) to load and adjust itself with related values for the buffer parameters by communicating with the server-side components. The server-side components can then learn about those values while the client side determines or computes them.
- The server-side components (e.g., the components shown in FIG. 3A-FIG. 3B), can be ready to use and apply the parameter values (transfer instructions) (e.g., there can be different values for each client).

The client side and server side components can be transparent and can receive a normal junk of bytes. In general, the implementation may include logic which would keep the device radio in lower powered states such as PCH or FACH, or inactive state, for as long as possible to avoid over consumption of device and network resources, so long as the user experience is not negatively impacted or noticeable by the user. This technology can provide signaling optimization in both WCDMA/3G networks as well as 4G/LTE networks.

In some embodiments, the disclosed system including the client side and/or server side components (e.g., the components shown in FIG. 2A-FIG. 3B) can be integrated with policy management nodes/components of wireless networks (e.g., the PCRF node in the RNS (radio network system) of an UMTS network)). In some embodiments, the PCRF, through interoperation with the disclosed system, can determine whether a given mobile device (150, 250) is in “idle” or “active” at a given moment. The PCRF can then govern or dictate the Radio Network Controller (RNC) (in WCDMA 3G), NodeB or eNodeB (in LTE 4G) policies that would, for example allow or forbid a radio channel status upgrade into a higher powered state, or lower the radio channel status to a lower powered state in a more intelligent and resource efficient manner. Note that UMTS networks (via the PCRF) can perform throttling and the disclosed system including client side and/or server side components can provide the information to the network regarding what level of throttling should occur to trigger radio state changes to higher powered or lower powered states.

In a further embodiment, the client-side components (e.g., as illustrated in FIG. 2A-FIG. 2B) can be configured to rate-limit data transmission upon request for data, to avoid triggering transition to higher powered radio states (e.g., DCH in the ¾ state model) for that particular transaction. In this example, such data can be transmitted through or using a rate-limiting proxy (e.g., a rate limiting proxy 520 as shown in the example of FIG. 3B) which can limit or adjust the rate of the response as requested/specified by the client side components. The rate limiting proxy 520 can be a component of the server-side components (e.g., internal to), or it can be a separate entity (external to the server-side components). Note that the ‘rate limit’ can include the speed of transmission, or the buffer size after which the server will accumulate data for the client side components to acknowledge the transmission. The client side components can utilize various parameters including request and/or anticipated response characteristics, application, device state (e.g., screen off, backlight status), user activity, user preferences/behavior, to determine/specify whether to rate-limit the response data and/or the degree to which to rate-limit the response data.

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 (e.g., wireless devices 150), and an application server or content provider 110, 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 manage mobile device radio state promotion and demotion by buffer and/or activity monitoring.

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 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 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 smart phone, a PDA, a Blackberry device, a Palm device, a handheld tablet (e.g., an iPad or any other tablet), a hand held console, a hand held gaming device or console, 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 some embodiments, the client 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, motion detector (e.g., including 1-axis, 2-axis, 3-axis accelerometer, etc.), 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 a 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 may include, 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 may also include 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 some embodiments, 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.

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 may alter device 150's behaviors in response. The device 150 can also request that host server 100 alter the behavior for network resource consumption based upon user activity or behavior.

In some embodiments, the traffic management for resource conservation may be 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.

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, the host server 100, and the related components therein are described, respectively, in detail with further reference to the examples of FIG. 2A-5C.

In some embodiments, client devices 150 may 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 some embodiments, 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 can be 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 some embodiments, 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 some embodiments, 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, 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, UMTS-TDD, 1×RTT, 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 100 and device 150 which facilitates network traffic management between the device 150 and an application server or content provider 110, or other servers such as an ad server 120A, promotional content server 120B, or an e-coupon server 120C for resource conservation and content caching. The proxy system distributed among the host server 100 and the device 150 can further manage mobile device radio state promotion and demotion by buffer and/or activity monitoring.

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 some embodiments, 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 some embodiments, 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 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 may provide content and data to satisfy requests made at the device 150.

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, 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-5C.

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.

In some embodiments, the local proxy 175 and the proxy server 125 are transparent to the multiple applications executing on the mobile device. The local proxy 175 may be 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 may be 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 some embodiments, 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 112 can also utilize any other type of alternative channel including USSD or other network control mechanisms. As will be further described with reference to the example of FIG. 3, 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.

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.

FIG. 2A depicts a block diagram illustrating another example of client-side components in a distributed proxy and cache system, further including a radio state management engine 401. FIG. 2B depicts a block diagram illustrating additional components in the radio state management engine 401 shown in the example of FIG. 2A.

The radio state management engine 401 can include a response rate configuration engine 402 having a data rate configurator 403, a buffer size configurator 404 and/or a PCRF policy recommendation engine 405. The engine 401 may also include a radio state change criteria manager 411 having an FACH consumption rate and/or buffer tracker 412, a state change threshold configuration engine 439, and/or a state change trigger detector 413. Additional or less modules/engines can be included.

FIG. 3A depicts a block diagram illustrating an example of server-side components in a distributed proxy and cache system, further including a radio state management engine 501. FIG. 3B depicts a block diagram illustrating additional components in the radio state management engine 501 shown in the example of FIG. 3A.

The radio state management engine 501 can include a rate limiting engine 502 having a data rate configurator 503 and/or a buffer size configurator 504, a PCRF interface engine 505, a radio state change criteria manager 511 having a 3 or 4 state CDMA radio state compatibility module, a 2 state LTE/4G radio state compatibility module, and/or a radio state change trigger detector and processing engine 539. The radio state management engine 501 can include or be coupled to a rate-limiting proxy 520 (as illustrated). Additional or less modules/engines can be included.

The various components of the radio state management engine 401 and the radio state management engine 501 can singularly or in any combination perform the management and/or policy management of mobile device radio state promotion or demotion based on buffer, activity, or device (e.g., idle or active) state monitoring as described in conjunction with FIG. 1A-1 and FIG. 1A-2. For example, the radio state management engine 401/501 can implicitly manage the radio state transition since the radio state is controlled by the network (i.e., the network orders the device to a specific state). In one implementation, the radio state transition is by managed by throttling the actual data flow through the network, such that the device is able to affect how the network will order it to change its state.

In one embodiment, for example, the radio state management engine 401 can gather and/or determine information concerning the current state of the device and provide such information to the PCRF node to allow the PCRF node to understand the current state of the device in the network and control the radio state of the device by signaling the radio access network nodes such as RNC and eNodeB. In another embodiment, for example, the radio state management engine 501 can determine whether the PCRF node can signal or control the radio access network nodes to change the radio state of the device. In one implementation, if the PCRF to radio access network node communication or control is not feasible, the radio state management engine 501 can detect such condition and can obtain information from the PCRF node to control the radio state of the mobile device. For example, in one implementation, the radio state management engine 501 can provide policy information and/or the level of throttling needed to keep the radio on the mobile device from going to the higher powered states.

Referring to FIG. 2B, the radio state management engine 401 can manage the radio state of a mobile device is a mobile network by monitoring a criteria associated with the mobile and determining whether to perform a radio status transition of the mobile device in the mobile network from a first state to a second state based at least in part upon the criteria. In one implementation, the first state and the second state are distinguished from a higher powered state or a lower powered state. In one implementation the radio status transition includes one of a promotion or demotion.

The response rate configuration engine 402 can include various options for configuring response rates such as data/transmission rates, buffer size, PCRF policy recommendations, and the like. In one implementation, the response rates may be configured for various purposes such as to avoid triggering transition to higher powered radio states.

The data rate configurator 403, in one implementation, can be used to configure the data transmission rate. In one implementation, data rate can be specified or configured for traffic based on, or when one or more of the following is detected, the application is not interacting with the user, the application is running in the background on the mobile device, or the data contained in the traffic is not time critical, and the like. The buffer size configurator 404, in one implementation, can be used to configure the size or capacity of a buffer on the mobile device, which can cause the server to accumulate data for the client to acknowledge the transmission. The PCRF policy recommendation engine 405, in one implementation, can communicate a plurality of rules to a network component such as a radio access network node (e.g., RNC, eNodeB, and the like). In one implementation, the rules determine a level of throttling.

The radio state change criteria manager 411, in one implementation, can monitor, configure and/or manage criteria for changing radio state. In one implementation, the criteria can include, but are not limited to: a capacity of a buffer, the buffer located on a mobile device, a Forward Access Channel (FACH) consumption rate, a backlight status of the mobile device, one or more of behavior of applications running on the mobile device, user activity at the mobile device, and user preferences at the mobile device. In one implementation, the radio state change criteria manager 411 can monitor the criteria by applying logic to discover network specific or condition specific values associated with the buffer capacity. In one implementation, the logic can be adaptive to network conditions and is dynamically adjustable. In some implementations, the radio state change criteria manager 411 can leverage other modules of the local proxy 275 (e.g., application behavior detector 236, user activity module 215) to manage criteria for radio state change. In one implementation, the radio state change criteria manager 411 can determine whether to perform radio channel status transition from a first state to a second state based on various information such as one or more of the criteria, application, and the like.

The FACH consumption rate and/or buffer tracker 412 can, in one implementation, can know, track and/or determine the FACH consumption rate and byte buffers by keeping the radio in FACH for e.g. background data transfer until the buffer crosses a threshold or when the device's backlight is off, or until user activity/lack thereof is determined/detected or some other similar criteria. In one implementation, the tracking of the buffer can be used to determine if the buffer exceeds a threshold. If the buffer exceeds the threshold, the criteria for radio state change is determined as being met, such that the radio state is promoted from a first state to the second state. In one implementation, the second state can be a higher powered state than the first state.

The state change threshold configuration engine 439, in one implementation, can be used to configure the thresholds for causing or triggering radio state changes. For example, buffer size can be configured for use as a trigger or indication of when to trigger radio state changes.

The state change trigger detector 413 can detect the change of radio state, such as promotion or a demotion. In one implementation, the state change detector 413 can also effect the change by changing the radio state. In another implementation, the state change trigger detector 413 can perform the radio status transition by adjusting a level of throttling.

In one embodiment, the radio state management engine 401 may also include a module for determining whether an application transmits a background data or foreground data over a wireless network. In one implementation, background data can include, but is not limited to: data transmitted or generated by an application without a user interaction or a user request, data transmitted or generated by the application for application maintenance or updating, and the like. The foreground data can include, but is not limited to: data transmitted or generated as a result of a user interaction or a user request.

Referring to FIG. 3B, some of the components of the radio state management engine 501 may perform functions similar to the components of the radio state management engine 401.

In one implementation, the rate limiting proxy 520 can limit or adjust the rate of the response as requested/specified by the client side components. The rate limiting proxy 520 can be a component of the radio state management engine 501 or it can be a separate entity (external to engine 501). The rate limiting proxy 520 can, for example, be responsive to various parameters specified or requested by the client-side, including request and/or anticipated response characteristics, application, device state (e.g., screen off, backlight status), user activity, user preferences/behavior, to determine/specify whether to rate-limit the response data and/or the degree to which to rate-limit the response data.

The rate limiting engine 502, in one implementation, can perform some or all of the functions of the rate limiting proxy 520. The rate limiting engine 502 can, for example, limit the speed of transmission, or the buffer size after which the server will accumulate data for the client side components to acknowledge the transmission.

The PCRF interface engine 505 can, in one implementation, interface with the PCRF node. The interface engine can obtain policies from the PCRF node, and/or provide policies or enhanced policies to the PCRF node. For example, via the interface engine, the radio state management engine 501 can provide information concerning when or what level of throttling should happen to keep the radio from transitioning to the higher powered states. The components in the UMTS network (through PCRF) can then perform the throttling and thereby manage the radio states.

The radio state change criteria manager 511 can receive, access, obtain, configure, and/or apply various criteria for managing radio state change in mobile devices. In one implementation, for example, the manager 511 can monitor criteria associated with the mobile device, network, and/or the like. In a further implementation, such criteria may be specific to WCDMA or LTE/4G networks. The 3 or 4 state WCDMA radio state compatibility module 512 may, for example, have its own set of criteria for when to trigger radio state change, or the state to which the change can be triggered, and the like. In one implementation, in the case of 3 or 4 state WCDMA, the module 512 can take advantage of knowing or determining the FACH consumption rate and byte buffers by keeping the radio in FACH for e.g. background data transfer until the buffer crosses a threshold (predetermined or dynamically adjusted, device dependent, carrier dependent, network condition dependent), or when the device's backlight is off, or until user activity/lack thereof is determined/detected or some other similar criteria. The 2 state LTE/4G radio state compatibility module 513 can similarly monitor criteria associated with LTE/4G network and the two states specific to the network to determine whether to perform a radio status transition, and which state to transition to.

The radio state change trigger detector and processing engine 539, in one implementation, can detect a trigger to change the radio state of a mobile device (e.g., from the radio state change criteria manager), and can determine whether to perform a radio channel status transition based on the criteria and upon the application, such as upon the application's behavior. In one implementation, to perform the transition or cause the transition to be performed, the radio state change trigger detector and processing engine can modify or provide rules to a PCRF network component via the PCRF interface engine. In one implementation, PCRF can cause the transition at the appropriate time. In some implementation, the radio state change trigger detector and processing engine can determine that rules which avoid a transition and maintain the current state as appropriate.

FIG. 4A depicts a block diagram illustrating an example of client-side components in a distributed proxy and cache system residing on a mobile device (e.g., wireless device) 250 that manages traffic in a wireless network (or broadband network) for resource conservation, content caching, and/or traffic management. The client-side proxy (or local proxy 275) can further categorize mobile traffic and/or implement delivery policies based on application behavior, content priority, user activity, and/or user expectations.

The 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 Application Programming Interface (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, etc.).

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, etc.,), 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 some embodiments, 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. 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. Additional or less components/modules/engines can be included in the local proxy 275 and each illustrated component.

In some embodiments, 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, voice mail, 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-aware and proxy-unaware 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/325 shown in the examples of FIG. 1B and FIG. 5A). 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, etc. 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 some embodiments, 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 some embodiments, 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 some embodiments, 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. In some embodiments, 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 some embodiments, 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 and 300 in the examples of FIG. 1B-1C and FIG. 5A) which can communicate (e.g., via a cellular or other network) with the device 250 to modify its communication frequency with the mobile 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 some embodiments, 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 and 300 in the examples of FIG. 1B-1C and FIG. 3A) 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 and 300 in the examples of FIG. 1B-1C and FIG. 5A) and the remote device may determine how to alter its own communication frequency with the device 250 for network resource conservation and conservation of device 250 resources.

In some embodiments, 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.

In some embodiments, 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 some embodiments, 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 a set of rules for assigning priority.

In some embodiments, 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.

In some embodiments, 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

Move message
Low

sync (Low if

Read more
High

possible)

Download
High
New email in deleted
Low

attachment

items

New Calendar event
High
Delete an email
Low

Edit/change
High
(Un)Read an email
Low

Calendar event

Move messages
Low

Add a contact
High
Any calendar change
High

Edit a contact
High
Any contact change
High

Search contacts
High
Wipe/lock device
High

Change a setting
High
Settings change
High

Manual send/receive
High
Any folder change
High

IM status change
Medium
Connector restart
High (if no

Auction outbid or
High

changes nothing

change notification

is sent)

Weather Updates
Low
Social Network
Medium

Status Updates

Severe Weather Alerts
High

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 some embodiments, 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 some embodiments, 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 some embodiments, 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.

In some embodiments, 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 some embodiments, 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 some embodiments, 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 some embodiments, 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 and FIG. 5A or a content provider/application server such as the server/provider 110 shown in the examples of FIG. 1B and FIG. 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 325 of FIG. 5A) 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 325 of FIG. 5A) which forwards the data request to a content source (e.g., application server/content provider 110 of FIG. 1B) 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 300 of FIG. 5A. 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 some embodiments, 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 some embodiments, 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 325 in the example of FIG. 5A).

In some embodiments, 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 some embodiments, the local proxy 275 includes an application behavior detector 236 to track, detect, observe, monitor, applications (e.g., proxy-aware and/or unaware 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 some embodiments, 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 or proxy server 325 of FIG. 5A) 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 to which polling is offloaded, can notify the device 250. The remote entity may be the host server 300 as shown in the example of FIG. 5A.

In some embodiments, 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. 1A).

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. 4B depicts a block diagram illustrating a further example of components in the cache system shown in the example of FIG. 4A which is capable of caching and adapting caching strategies for mobile application behavior and/or network conditions.

In some embodiments, the caching policy manager 245 includes a metadata generator 203, a cache look-up engine 205, a cache appropriateness decision engine 246, a poll schedule generator 247, an application protocol module 248, a cache or connect selection engine 249 and/or a local cache invalidator 244. The cache appropriateness decision engine 246 can further include a timing predictor 246a,a content predictor 246b, a request analyzer 246c, and/or a response analyzer 246d, and the cache or connect selection engine 249 includes a response scheduler 249a. The metadata generator 203 and/or the cache look-up engine 205 are coupled to the cache 285 (or local cache) for modification or addition to cache entries or querying thereof.

The cache look-up engine 205 may further include an ID or URI filter 205a, the local cache invalidator 244 may further include a TTL manager 244a, and the poll schedule generator 247 may further include a schedule update engine 247a and/or a time adjustment engine 247b. One embodiment of caching policy manager 245 includes an application cache policy repository 243. In some embodiments, the application behavior detector 236 includes a pattern detector 237, a poll interval detector 238, an application profile generator 239, and/or a priority engine 241. The poll interval detector 238 may further include a long poll detector 238a having a response/request tracking engine 238b. The poll interval detector 238 may further include a long poll hunting detector 238c. The application profile generator 239 can further include a response delay interval tracker 239a.

The pattern detector 237, application profile generator 239, and the priority engine 241 were also described in association with the description of the pattern detector shown in the example of FIG. 4A. One embodiment further includes an application profile repository 242 which can be used by the local proxy 275 to store information or metadata regarding application profiles (e.g., behavior, patterns, type of HTTP requests, etc.)

The cache appropriateness decision engine 246 can detect, assess, or determine whether content from a content source (e.g., application server/content provider 110 in the example of FIG. 1B) with which a mobile device 250 interacts and has content that may be suitable for caching. For example, the decision engine 246 can use information about a request and/or a response received for the request initiated at the mobile device 250 to determine cacheability, potential cacheability, or non-cacheability. In some instances, the decision engine 246 can initially verify whether a request is directed to a blacklisted destination or whether the request itself originates from a blacklisted client or application. If so, additional processing and analysis may not be performed by the decision engine 246 and the request may be allowed to be sent over the air to the server to satisfy the request. The black listed destinations or applications/clients (e.g., mobile applications) can be maintained locally in the local proxy (e.g., in the application profile repository 242) or remotely (e.g., in the proxy server 325 or another entity).

In some embodiments, the decision engine 246, for example, via the request analyzer 246c, collects information about an application or client request generated at the mobile device 250. The request information can include request characteristics information including, for example, request method. For example, the request method can indicate the type of HTTP request generated by the mobile application or client. In some embodiments, response to a request can be identified as cacheable or potentially cacheable if the request method is a GET request or POST request. Other types of requests (e.g., OPTIONS, HEAD, PUT, DELETE, TRACE, or CONNECT) may or may not be cached. In general, HTTP requests with uncacheable request methods will not be cached.

Request characteristics information can further include information regarding request size, for example. Responses to requests (e.g., HTTP requests) with body size exceeding a certain size will not be cached. For example, cacheability can be determined if the information about the request indicates that a request body size of the request does not exceed a certain size. In some instances, the maximum cacheable request body size can be set to 8092 bytes. In other instances, different values may be used, dependent on network capacity or network operator specific settings, for example.

In some instances, content from a given application server/content provider (e.g., the server/content provider 110 of FIG. 1C) is determined to be suitable for caching based on a set of criteria, for example, criteria specifying time criticality of the content that is being requested from the content source. In some embodiments, the local proxy (e.g., the local proxy 175 or 275 of FIG. 1C and FIG. 4A) applies a selection criteria to store the content from the host server which is requested by an application as cached elements in a local cache on the mobile device to satisfy subsequent requests made by the application.

The cache appropriateness decision engine 246, further based on detected patterns of requests sent from the mobile device 250 (e.g., by a mobile application or other types of clients on the device 250) and/or patterns of received responses, can detect predictability in requests and/or responses. For example, the request characteristics information collected by the decision engine 246, (e.g., the request analyzer 246c) can further include periodicity information between a request and other requests generated by a same client on the mobile device or other requests directed to the same host (e.g., with similar or same identifier parameters).

Periodicity can be detected, by the decision engine 246 or the request analyzer 246c, when the request and the other requests generated by the same client occur at a fixed rate or nearly fixed rate, or at a dynamic rate with some identifiable or partially or wholly reproducible changing pattern. If the requests are made with some identifiable pattern (e.g., regular intervals, intervals having a detectable pattern, or trend (e.g., increasing, decreasing, constant, etc.) the timing predictor 246a can determine that the requests made by a given application on a device is predictable and identify it to be potentially appropriate for caching, at least from a timing standpoint.

An identifiable pattern or trend can generally include any application or client behavior which may be simulated either locally, for example, on the local proxy 275 on the mobile device 250 or simulated remotely, for example, by the proxy server 325 on the host 300, or a combination of local and remote simulation to emulate application behavior.

In some embodiments, the decision engine 246, for example, via the response analyzer 246d, can collect information about a response to an application or client request generated at the mobile device 250. The response is typically received from a server or the host of the application (e.g., mobile application) or client which sent the request at the mobile device 250. In some instances, the mobile client or application can be the mobile version of an application (e.g., social networking, search, travel management, voicemail, contact manager, email) or a web site accessed via a web browser or via a desktop client.

For example, response characteristics information can include an indication of whether transfer encoding or chunked transfer encoding is used in sending the response. In some instances, responses to HTTP requests with transfer encoding or chunked transfer encoding are not cached, and therefore are also removed from further analysis. The rationale here is that chunked responses are usually large and non-optimal for caching, since the processing of these transactions may likely slow down the overall performance. Therefore, In some embodiments, cacheability or potential for cacheability can be determined when transfer encoding is not used in sending the response.

In addition, the response characteristics information can include an associated status code of the response which can be identified by the response analyzer 246d. In some instances, HTTP responses with uncacheable status codes are typically not cached. The response analyzer 246d can extract the status code from the response and determine whether it matches a status code which is cacheable or uncacheable. Some cacheable status codes include by way of example: 200—OK, 301—Redirect, 302—Found, 303—See other, 304—Not Modified, 307 Temporary Redirect, or 500—Internal server error. Some uncacheable status codes can include, for example, 403—Forbidden or 404—Not found.

In some embodiments, cacheability or potential for cacheability can be determined if the information about the response does not indicate an uncacheable status code or indicates a cacheable status code. If the response analyzer 246d detects an uncacheable status code associated with a given response, the specific transaction (request/response pair) may be eliminated from further processing and determined to be uncacheable on a temporary basis, a semi-permanent, or a permanent basis. If the status code indicates cacheability, the transaction (e.g., request and/or response pair) may be subject to further processing and analysis to confirm cacheability.

Response characteristics information can also include response size information. In general, responses can be cached locally at the mobile device 250 if the responses do not exceed a certain size. In some instances, the default maximum cached response size is set to 115 KB. In other instances, the max cacheable response size may be different and/or dynamically adjusted based on operating conditions, network conditions, network capacity, user preferences, network operator requirements, or other application-specific, user specific, and/or device-specific reasons. In some embodiments, the response analyzer 246d can identify the size of the response, and cacheability or potential for cacheability can be determined if a given threshold or max value is not exceeded by the response size.

Furthermore, response characteristics information can include response body information for the response to the request and other response to other requests generated by a same client on the mobile device, or directed to a same content host or application server. The response body information for the response and the other responses can be compared, for example, by the response analyzer 246d, to prevent the caching of dynamic content (or responses with content that changes frequently and cannot be efficiently served with cache entries, such as financial data, stock quotes, news feeds, real-time sporting event activities, etc.), such as content that would no longer be relevant or up-to-date if served from cached entries.

The cache appropriateness decision engine 246 (e.g., the content predictor 246b) can definitively identify repeatability or identify indications of repeatability, potential repeatability, or predictability in responses received from a content source (e.g., the content host/application server 110 shown in the example of FIG. 1C). Repeatability can be detected by, for example, tracking at least two responses received from the content source and determines if the two responses are the same. For example, cacheability can be determined, by the response analyzer 246d, if the response body information for the response and the other responses sent by the same mobile client or directed to the same host/server are same or substantially the same. The two responses may or may not be responses sent in response to consecutive requests. In some embodiments, hash values of the responses received for requests from a given application are used to determine repeatability of content (with or without heuristics) for the application in general and/or for the specific request. Additional same responses may be required for some applications or under certain circumstances.

Repeatability in received content need not be 100% ascertained. For example, responses can be determined to be repeatable if a certain number or a certain percentage of responses are the same, or similar. The certain number or certain percentage of same/similar responses can be tracked over a select period of time, set by default or set based on the application generating the requests (e.g., whether the application is highly dynamic with constant updates or less dynamic with infrequent updates). Any indicated predictability or repeatability, or possible repeatability, can be utilized by the distributed system in caching content to be provided to a requesting application or client on the mobile device 250.

In some embodiments, for a long poll type request, the local proxy 175 can begin to cache responses on a third request when the response delay times for the first two responses are the same, substantially the same, or detected to be increasing in intervals. In general, the received responses for the first two responses should be the same, and upon verifying that the third response received for the third request is the same (e.g., if R0=R1=R2), the third response can be locally cached on the mobile device. Less or more same responses may be required to begin caching, depending on the type of application, type of data, type of content, user preferences, or carrier/network operator specifications.

Increasing response delays with same responses for long polls can indicate a hunting period (e.g., a period in which the application/client on the mobile device is seeking the longest time between a request and response that a given network will allow), as detected by the long poll hunting detector 238c of the application behavior detector 236.

An example can be described below using T0, T1, T2, where T indicates the delay time between when a request is sent and when a response (e.g., the response header) is detected/received for consecutive requests:

T0=Response0(t)−Request0(t)=180 s.(+/−tolerance)
T1=Response1(t)−Request1(t)=240 s.(+/−tolerance)
T2=Response2(t)−Request2(t)=500 s.(+/−tolerance)

In the example timing sequence shown above, T0<T1<T2, this may indicate a hunting pattern for a long poll when network timeout has not yet been reached or exceeded. Furthermore, if the responses R0, R1, and R2 received for the three requests are the same, R2 can be cached. In this example, R2 is cached during the long poll hunting period without waiting for the long poll to settle, thus expediting response caching (e.g., this is optional accelerated caching behavior which can be implemented for all or select applications).

As such, the local proxy 275 can specify information that can be extracted from the timing sequence shown above (e.g., polling schedule, polling interval, polling type) to the proxy server and begin caching and to request the proxy server to begin polling and monitoring the source (e.g., using any of T0, T1, T2 as polling intervals but typically T2, or the largest detected interval without timing out, and for which responses from the source is received will be sent to the proxy server 325 of FIG. 5A for use in polling the content source (e.g., application server/service provider 310)).

However, if the time intervals are detected to be getting shorter, the application (e.g., mobile application)/client may still be hunting for a time interval for which a response can be reliably received from the content source (e.g., application/server server/provider 110 or 310), and as such caching typically should not begin until the request/response intervals indicate the same time interval or an increasing time interval, for example, for a long poll type request.

An example of handling a detected decreasing delay can be described below using T0, T1, T2, T3, and T4 where T indicates the delay time between when a request is sent and when a response (e.g., the response header) is detected/received for consecutive requests:

T0=Response0(t)−Request0(t)=160 s.(+/−tolerance)
T1=Response1(t)−Request1(t)=240 s.(+/−tolerance)
T2=Response2(t)−Request2(t)=500 s.(+/−tolerance)
T3=Time out at 700 s.(+/−tolerance)
T4=Response4(t)−Request4(t)=600(+/−tolerance)

If a pattern for response delays T1<T2<T3>T4 is detected, as shown in the above timing sequence (e.g., detected by the long poll hunting detector 238c of the application behavior detector 236), it can be determined that T3 likely exceeded the network time out during a long poll hunting period. In Request 3, a response likely was not received since the connection was terminated by the network, application, server, or other reason before a response was sent or available. On Request 4 (after T4), if a response (e.g., Response 4) is detected or received, the local proxy 275 can then use the response for caching (if the content repeatability condition is met). The local proxy can also use T4 as the poll interval in the polling schedule set for the proxy server to monitor/poll the content source.

Note that the above description shows that caching can begin while long polls are in hunting mode in the event of detecting increasing response delays, as long as responses are received and not timed out for a given request. This can be referred to as the optional accelerated caching during long poll hunting. Caching can also begin after the hunting mode (e.g., after the poll requests have settled to a constant or near constant delay value) has completed. Note that hunting may or may not occur for long polls and when hunting occurs; the proxy 275 can generally detect this and determine whether to begin to cache during the hunting period (increasing intervals with same responses) or wait until the hunt settles to a stable value.

In some embodiments, the timing predictor 246a of the cache appropriateness decision engine 246 can track timing of responses received from outgoing requests from an application (e.g., mobile application) or client to detect any identifiable patterns which can be partially wholly reproducible, such that locally cached responses can be provided to the requesting client on the mobile device 250 in a manner that simulates content source (e.g., application server/content provider 110 or 310) behavior. For example, the manner in which (e.g., from a timing standpoint) responses or content would be delivered to the requesting application/client on the device 250. This ensures preservation of user experience when responses to application or mobile client requests are served from a local and/or remote cache instead of being retrieved/received directly from the content source (e.g., application, content provider 110 or 310).

In some embodiments, the decision engine 246 or the timing predictor 246a determines the timing characteristics a given application (e.g., mobile application) or client from, for example, the request/response tracking engine 238b and/or the application profile generator 239 (e.g., the response delay interval tracker 239a). Using the timing characteristics, the timing predictor 246a determines whether the content received in response to the requests are suitable or are potentially suitable for caching. For example, poll request intervals between two consecutive requests from a given application can be used to determine whether request intervals are repeatable (e.g., constant, near constant, increasing with a pattern, decreasing with a pattern, etc.) and can be predicted and thus reproduced at least some of the times either exactly or approximated within a tolerance level.

In some instances, the timing characteristics of a given request type for a specific application, for multiple requests of an application, or for multiple applications can be stored in the application profile repository 242. The application profile repository 242 can generally store any type of information or metadata regarding application request/response characteristics including timing patterns, timing repeatability, content repeatability, etc.

The application profile repository 242 can also store metadata indicating the type of request used by a given application (e.g., long polls, long-held HTTP requests, HTTP streaming, push, COMET push, etc.) Application profiles indicating request type by applications can be used when subsequent same/similar requests are detected, or when requests are detected from an application which has already been categorized. In this manner, timing characteristics for the given request type or for requests of a specific application which has been tracked and/or analyzed, need not be reanalyzed.

Application profiles can be associated with a time-to-live (e.g., or a default expiration time). The use of an expiration time for application profiles, or for various aspects of an application or request's profile can be used on a case by case basis. The time-to-live or actual expiration time of application profile entries can be set to a default value or determined individually, or a combination thereof. Application profiles can also be specific to wireless networks, physical networks, network operators, or specific carriers.

One embodiment includes an application blacklist manager 201. The application blacklist manager 201 can be coupled to the application cache policy repository 243 and can be partially or wholly internal to local proxy or the caching policy manager 245. Similarly, the blacklist manager 201 can be partially or wholly internal to local proxy or the application behavior detector 236. The blacklist manager 201 can aggregate, track, update, manage, adjust, or dynamically monitor a list of destinations of servers/host that are ‘blacklisted,’ or identified as not cached, on a permanent or temporary basis. The blacklist of destinations, when identified in a request, can potentially be used to allow the request to be sent over the (cellular) network for servicing. Additional processing on the request may not be performed since it is detected to be directed to a blacklisted destination.

Blacklisted destinations can be identified in the application cache policy repository 243 by address identifiers including specific URIs or patterns of identifiers including URI patterns. In general, blacklisted destinations can be set by or modified for any reason by any party including the user (owner/user of mobile device 250), operating system/mobile platform of device 250, the destination itself, network operator (of cellular network), Internet service provider, other third parties, or according to a list of destinations for applications known to be uncacheable/not suited for caching. Some entries in the blacklisted destinations may include destinations aggregated based on the analysis or processing performed by the local proxy (e.g., cache appropriateness decision engine 246).

For example, applications or mobile clients on the mobile device for which responses have been identified as non-suitable for caching can be added to the blacklist. Their corresponding hosts/servers may be added in addition to or in lieu of an identification of the requesting application/client on the mobile device 250. Some or all of such clients identified by the proxy system can be added to the blacklist. For example, for all application clients or applications that are temporarily identified as not being suitable for caching, only those with certain detected characteristics (based on timing, periodicity, frequency of response content change, content predictability, size, etc.) can be blacklisted.

The blacklisted entries may include a list of requesting applications or requesting clients on the mobile device (rather than destinations) such that, when a request is detected from a given application or given client, it may be sent through the network for a response, since responses for blacklisted clients/applications are in most circumstances not cached.

A given application profile may also be treated or processed differently (e.g., different behavior of the local proxy 275 and the remote proxy 325) depending on the mobile account associated with a mobile device from which the application is being accessed. For example, a higher paying account, or a premier account may allow more frequent access of the wireless network or higher bandwidth allowance thus affecting the caching policies implemented between the local proxy 275 and proxy server 325 with an emphasis on better performance compared to conservation of resources. A given application profile may also be treated or processed differently under different wireless network conditions (e.g., based on congestion or network outage, etc.).

Note that cache appropriateness can be determined, tracked, and managed for multiple clients or applications on the mobile device 250. Cache appropriateness can also be determined for different requests or request types initiated by a given client or application on the mobile device 250. The caching policy manager 245, along with the timing predictor 246a and/or the content predictor 246b which heuristically determines or estimates predictability or potential predictability, can track, manage and store cacheability information for various application or various requests for a given application. Cacheability information may also include conditions (e.g., an application can be cached at certain times of the day, or certain days of the week, or certain requests of a given application can be cached, or all requests with a given destination address can be cached) under which caching is appropriate which can be determined and/or tracked by the cache appropriateness decision engine 246 and stored and/or updated when appropriate in the application cache policy repository 243 coupled to the cache appropriateness decision engine 246.

The information in the application cache policy repository 243 regarding cacheability of requests, applications, and/or associated conditions can be used later on when same requests are detected. In this manner, the decision engine 246 and/or the timing and content predictors 246a/b need not track and reanalyze request/response timing and content characteristics to make an assessment regarding cacheability. In addition, the cacheability information can in some instances be shared with local proxies of other mobile devices by way of direct communication or via the host server (e.g., proxy server 325 of host server 300).

For example, cacheability information detected by the local proxy 275 on various mobile devices can be sent to a remote host server or a proxy server 325 on the host server (e.g., host server 300 or proxy server 325 shown in the example of FIG. 5A, host 100 and proxy server 125 in the example of FIG. 1B-1C). The remote host or proxy server can then distribute the information regarding application-specific, request-specific cacheability information and/or any associated conditions to various mobile devices or their local proxies in a wireless network or across multiple wireless networks (same service provider or multiple wireless service providers) for their use.

In general, the selection criteria for caching can further include, by way of example but not limitation, the state of the mobile device indicating whether the mobile device is active or inactive, network conditions, and/or radio coverage statistics. The cache appropriateness decision engine 246 can in any one or any combination of the criteria, and in any order, identifying sources for which caching may be suitable.

Once application servers/content providers having identified or detected content that is potentially suitable for local caching on the mobile device 250, the cache policy manager 245 can proceed to cache the associated content received from the identified sources by storing content received from the content source as cache elements in a local cache (e.g., local cache 185 or 285 shown in the examples of FIG. 1B-1C and FIG. 4A, respectively) on the mobile device 250.

The response can be stored in the cache 285 (e.g., also referred as the local cache) as a cache entry. In addition to the response to a request, the cached entry can include response metadata having additional information regarding caching of the response. The metadata may be generated by the metadata generator 203 and can include, for example, timing data such as the access time of the cache entry or creation time of the cache entry. Metadata can include additional information, such as any information suited for use in determining whether the response stored as the cached entry is used to satisfy the subsequent response. For example, metadata information can further include, request timing history (e.g., including request time, request start time, request end time), hash of the request and/or response, time intervals or changes in time intervals, etc.

In some embodiments, the cache entry is stored in the cache 285 in association with a time-to-live (TTL), which for example may be assigned or determined by the TTL manager 244a of the cache invalidator 244. The time-to-live of a cache entry is the amount of time the entry is persisted in the cache 285 regardless of whether the response is still valid or relevant for a given request or client/application on the mobile device 250. For example, if the time-to-live of a given cache entry is set to 12 hours, the cache entry is purged, removed, or otherwise indicated as having exceeded the time-to-live, even if the response body contained in the cache entry is still current and applicable for the associated request.

A default time-to-live can be automatically used for all entries unless otherwise specified (e.g., by the TTL manager 244a), or each cache entry can be created with its individual TTL (e.g., determined by the TTL manager 244a based on various dynamic or static criteria). Note that each entry can have a single time-to-live associated with both the response data and any associated metadata. In some instances, the associated metadata may have a different time-to-live (e.g., a longer time-to-live) than the response data.

The content source having content for caching can, in addition or in alternate, be identified to a proxy server (e.g., proxy server 125 or 325 shown in the examples of FIG. 1B-1C and FIG. 5A, respectively) remote from and in wireless communication with the mobile device 250 such that the proxy server can monitor the content source (e.g., application server/content provider 110) for new or changed data. Similarly, the local proxy (e.g., the local proxy 175 or 275 of FIG. 1B-1C and FIG. 4A, respectively) can identify to the proxy server that content received from a specific application server/content provider is being stored as cached elements in the local cache 285.

Once content has been locally cached, the cache policy manager 245, upon receiving future polling requests to contact the application server/content host (e.g., 110 or 310), can retrieve the cached elements from the local cache to respond to the polling request made at the mobile device 250 such that a radio of the mobile device is not activated to service the polling request. For example, the cache look-up engine 205 can query the cache 285 to identify the response to be served to a response. The response can be served from the cache in response to identifying a matching cache entry and also using any metadata stored with the response in the cache entry. The cache entries can be queried by the cache look-up engine using a URI of the request or another type of identifier (e.g., via the ID or URI filter 205a). The cache-lookup engine 205 can further use the metadata (e.g., extract any timing information or other relevant information) stored with the matching cache entry to determine whether response is still suited for use in being served to a current request.

Note that the cache-look-up can be performed by the engine 205 using one or more of various multiple strategies. In some embodiments, multiple cook-up strategies can be executed sequentially on each entry store din the cache 285, until at least one strategy identifies a matching cache entry. The strategy employed to performing cache look-up can include a strict matching criteria or a matching criteria which allows for non-matching parameters.

For example, the look-up engine 205 can perform a strict matching strategy which searches for an exact match between an identifier (e.g., a URI for a host or resource) referenced in a present request for which the proxy is attempting to identify a cache entry and an identifier stored with the cache entries. In the case where identifiers include URIs or URLs, the matching algorithm for strict matching will search for a cache entry where all the parameters in the URLs match. For example:

Example 1

1. Cache contains entry for http://test.com/products/

2. Request is being made to URI http://test.com/products/

Strict strategy will find a match, since both URIs are same.

Example 2

1. Cache contains entry for http://test.com/products/?query=all

2. Request is being made to URI http://test.com/products/?query=sub

Under the strict strategy outlined above, a match will not be found since the URIs differ in the query parameter.

In another example strategy, the look-up engine 205 looks for a cache entry with an identifier that partially matches the identifier references in a present request for which the proxy is attempting to identify a matching cache entry. For example, the look-up engine 205 may look for a cache entry with an identifier which differs from the request identifier by a query parameter value. In utilizing this strategy, the look-up engine 205 can collect information collected for multiple previous requests (e.g., a list of arbitrary parameters in an identifier) to be later checked with the detected arbitrary parameter in the current request. For example, in the case where cache entries are stored with URI or URL identifiers, the look-up engine may search for a cache entry with a URI differing by a query parameter. If found, the engine 205 can examine the cache entry for information collected during previous requests (e.g. a list of arbitrary parameters) and checked whether the arbitrary parameter detected in or extracted from the current URI/URL belongs to the arbitrary parameters list.

Example 1

1. Cache contains entry for http://test.com/products/?query=all, where query is marked as arbitrary.

2. Request is being made to URI http://text.com/products/?query=sub

Match will be found, since query parameter is marked as arbitrary.

Example 2

1. Cache contains entry for http://test.com/products/?query=all, where query is marked as arbitrary.

2. Request is being made to URI http://test.com/products/?query=sub&sort=asc

Match will not be found, since current request contains sort parameter which is not marked as arbitrary in the cache entry.

Additional strategies for detecting cache hit may be employed. These strategies can be implemented singly or in any combination thereof. A cache-hit can be determined when any one of these strategies determines a match. A cache miss may be indicated when the look-up engine 205 determines that the requested data cannot be served from the cache 285, for any reason. For example, a cache miss may be determined when no cache entries are identified for any or all utilized look-up strategies.

Cache miss may also be determined when a matching cache entry exists but determined to be invalid or irrelevant for the current request. For example, the look-up engine 205 may further analyze metadata (e.g., which may include timing data of the cache entry) associated with the matching cache entry to determine whether it is still suitable for use in responding to the present request.

When the look-up engine 205 has identified a cache hit (e.g., an event indicating that the requested data can be served from the cache), the stored response in the matching cache entry can be served from the cache to satisfy the request of an application/client.

By servicing requests using cache entries stored in cache 285, network bandwidth and other resources need not be used to request/receive poll responses which may have not changed from a response that has already been received at the mobile device 250. Such servicing and fulfilling application (e.g., mobile application) requests locally via cache entries in the local cache 285 allows for more efficient resource and mobile network traffic utilization and management since the request need not be sent over the wireless network further consuming bandwidth. In general, the cache 285 can be persisted between power on/off of the mobile device 250, and persisted across application/client refreshes and restarts.

For example, the local proxy 275, upon receipt of an outgoing request from its mobile device 250 or from an application or other type of client on the mobile device 250, can intercept the request and determine whether a cached response is available in the local cache 285 of the mobile device 250. If so, the outgoing request is responded to by the local proxy 275 using the cached response on the cache of the mobile device. As such, the outgoing request can be filled or satisfied without a need to send the outgoing request over the wireless network, thus conserving network resources and battery consumption.

In some embodiments, the responding to the requesting application/client on the device 250 is timed to correspond to a manner in which the content server would have responded to the outgoing request over a persistent connection (e.g., over the persistent connection, or long-held HTTP connection, long poll type connection, that would have been established absent interception by the local proxy). The timing of the response can be emulated or simulated by the local proxy 275 to preserve application behavior such that end user experience is not affected, or minimally affected by serving stored content from the local cache 285 rather than fresh content received from the intended content source (e.g., content host/application server 110 of FIG. 1B-FIG. 1C). The timing can be replicated exactly or estimated within a tolerance parameter, which may go unnoticed by the user or treated similarly by the application so as to not cause operation issues.

For example, the outgoing request can be a request for a persistent connection intended for the content server (e.g., application server/content provider of examples of FIG. 1B-1C). In a persistent connection (e.g., long poll, COMET-style push or any other push simulation in asynchronous HTTP requests, long-held HTTP request, HTTP streaming, or others) with a content source (server), the connection is held for some time after a request is sent. The connection can typically be persisted between the mobile device and the server until content is available at the server to be sent to the mobile device. Thus, there typically can be some delay in time between when a long poll request is sent and when a response is received from the content source. If a response is not provided by the content source for a certain amount of time, the connection may also terminate due to network reasons (e.g., socket closure) if a response is not sent.

Thus, to emulate a response from a content server sent over a persistent connection (e.g., a long poll style connection), the manner of response of the content server can be simulated by allowing a time interval to elapse before responding to the outgoing request with the cached response. The length of the time interval can be determined on a request by request basis or on an application by application (client by client basis), for example.

In some embodiments, the time interval is determined based on request characteristics (e.g., timing characteristics) of an application on the mobile device from which the outgoing request originates. For example, poll request intervals (e.g., which can be tracked, detected, and determined by the long poll detector 238a of the poll interval detector 238) can be used to determine the time interval to wait before responding to a request with a local cache entry and managed by the response scheduler 249a.

Some embodiments of the cache policy manager 245 includes a poll schedule generator 247 which can generate a polling schedule for one or more applications on the mobile device 250. The polling schedule can specify a polling interval that can be employed by an entity which is physically distinct and/or separate from the mobile device 250 in monitoring the content source for one or more applications (such that cached responses can be verified periodically by polling a host server (host server 110 or 310) to which the request is directed) on behalf of the mobile device. One example of such an external entity which can monitor the content at the source for the mobile device 250 is a proxy server (e.g., proxy server 125 or 325 shown in the examples of FIG. 1B-1C and FIG. 5A-C).

The polling schedule (e.g., including a rate/frequency of polling) can be determined, for example, based on the interval between the polling requests directed to the content source from the mobile device. The polling schedule or rate of polling may be determined at the mobile device 250 (by the local proxy). In some embodiments, the poll interval detector 238 of the application behavior detector 236 can monitor polling requests directed to a content source from the mobile device 250 in order to determine an interval between the polling requests made from any or all application (e.g., mobile application).

For example, the poll interval detector 238 can track requests and responses for applications or clients on the device 250. In some embodiments, consecutive requests are tracked prior to detection of an outgoing request initiated from the application (e.g., mobile application) on the mobile device 250 by the same mobile client or application (e.g., mobile application). The polling rate can be determined using request information collected for the request for which the response is cached. In some embodiments, the rate is determined from averages of time intervals between previous requests generated by the same client which generated the request. For example, a first interval may be computed between the current request and a previous request, and a second interval can be computed between the two previous requests. The polling rate can be set from the average of the first interval and the second interval and sent to the proxy server in setting up the caching strategy.

Alternate intervals may be computed in generating an average; for example, multiple previous requests in addition to two previous requests may be used, and more than two intervals may be used in computing an average. In general, in computing intervals, a given request need not have resulted in a response to be received from the host server/content source in order to use it for interval computation. In other words, the timing characteristics of a given request may be used in interval computation, as long as the request has been detected, even if the request failed in sending, or if the response retrieval failed.

Some embodiments of the poll schedule generator 247 includes a schedule update engine 247a and/or a time adjustment engine 247b. The schedule update engine 247a can determine a need to update a rate or polling interval with which a given application server/content host from a previously set value, based on a detected interval change in the actual requests generated from a client or application (e.g., mobile application) on the mobile device 250.

For example, a request for which a monitoring rate was determined may now be sent from the application (e.g., mobile application) or client at a different request interval. The scheduled update engine 247a can determine the updated polling interval of the actual requests and generate a new rate, different from the previously set rate to poll the host at on behalf of the mobile device 250. The updated polling rate can be communicated to the remote proxy (proxy server 325) over the cellular network for the remote proxy to monitor the given host. In some instances, the updated polling rate may be determined at the remote proxy or remote entity which monitors the host.

In some embodiments, the time adjustment engine 247b can further optimize the poll schedule generated to monitor the application server/content source (110 or 310). For example, the time adjustment engine 247b can optionally specify a time to start polling to the proxy server. For example, in addition to setting the polling interval at which the proxy server is to monitor the application, server/content host can also specify the time at which an actual request was generated at the mobile client/application.

However, in some cases, due to inherent transmission delay or added network delays or other types of latencies, the remote proxy server receives the poll setup from the local proxy with some delay (e.g., a few minutes, or a few seconds). This has the effect of detecting response change at the source after a request is generated by the mobile client/application causing the invalidate of the cached response to occur after it has once again been served to the application after the response is no longer current or valid.

To resolve this non-optimal result of serving the out-dated content once again before invalidating it, the time adjustment engine 247b can specify the time (t0) at which polling should begin in addition to the rate, where the specified initial time t0 can be specified to the proxy server 325 as a time that is less than the actual time when the request was generated by the mobile app/client. This way, the server polls the resource slightly before the generation of an actual request by the mobile client such that any content change can be detected prior to an actual application request. This prevents invalid or irrelevant out-dated content/response from being served once again before fresh content is served.

In some embodiments, an outgoing request from a mobile device 250 is detected to be for a persistent connection (e.g., a long poll, COMET style push, and long-held (HTTP) request) based on timing characteristics of prior requests from the same application or client on the mobile device 250. For example, requests and/or corresponding responses can be tracked by the request/response tracking engine 238b of the long poll detector 238a of the poll interval detector 238.

The timing characteristics of the consecutive requests can be determined to set up a polling schedule for the application or client. The polling schedule can be used to monitor the content source (content source/application server) for content changes such that cached content stored on the local cache in the mobile device 250 can be appropriately managed (e.g., updated or discarded). In some embodiments, the timing characteristics can include, for example, a response delay time (‘D’) and/or an idle time (‘IT’).

In some embodiments, the response/request tracking engine 238b can track requests and responses to determine, compute, and/or estimate, the timing diagrams for applicant or client requests.

For example, the response/request tracking engine 238b detects a first request (Request 0) initiated by a client on the mobile device and a second request (Request 1) initiated by the client on the mobile device after a response is received at the mobile device responsive to the first request. The second request is one that is subsequent to the first request.

In some embodiments, the response/request tracking engine 238b can track requests and responses to determine, compute, and/or estimate the timing diagrams for applicant or client requests. The response/request tracking engine 238b can detect a first request initiated by a client on the mobile device and a second request initiated by the client on the mobile device after a response is received at the mobile device responsive to the first request. The second request is one that is subsequent to the first request.

The response/request tracking engine 238b further determines relative timings between the first, second requests, and the response received in response to the first request. In general, the relative timings can be used by the long poll detector 238a to determine whether requests generated by the application are long poll requests.

Note that in general, the first and second requests that are used by the response/request tracking engine 238b in computing the relative timings are selected for use after a long poll hunting period has settled or in the event when long poll hunting does not occur. Timing characteristics that are typical of a long poll hunting period can be, for example, detected by the long poll hunting detector 238c. In other words, the requests tracked by the response/request tracking engine 238b and used for determining whether a given request is a long poll occurs after the long poll has settled.

In some embodiments, the long poll hunting detector 238c can identify or detect hunting mode, by identifying increasing request intervals (e.g., increasing delays). The long poll hunting detector 238a can also detect hunting mode by detecting increasing request intervals, followed by a request with no response (e.g., connection timed out), or by detecting increasing request intervals followed by a decrease in the interval. In addition, the long poll hunting detector 238c can apply a filter value or a threshold value to request-response time delay value (e.g., an absolute value) above which the detected delay can be considered to be a long poll request-response delay. The filter value can be any suitable value characteristic of long polls and/or network conditions (e.g., 2 s, 5 s, 10 s, 15 s, 20 s., etc.) and can be used as a filter or threshold value.

The response delay time (‘D’) refers to the start time to receive a response after a request has been sent and the idle refers to time to send a subsequent request after the response has been received. In some embodiments, the outgoing request is detected to be for a persistent connection based on a comparison (e.g., performed by the tracking engine 238b) of the response delay time relative (‘D’) or average of (‘D’) (e.g., any average over any period of time) to the idle time (‘IT’), for example, by the long poll detector 238a. The number of averages used can be fixed, dynamically adjusted, or changed over a longer period of time. For example, the requests initiated by the client are determined to be long poll requests if the response delay time interval is greater than the idle time interval (D>IT or D>>IT). In some embodiments, the tracking engine 238b of the long poll detector computes, determines, or estimates the response delay time interval as the amount of time elapsed between time of the first request and initial detection or full receipt of the response.

In some embodiments, a request is detected to be for a persistent connection when the idle time (‘IT’) is short since persistent connections, established in response to long poll requests or long poll HTTP requests for example, can also be characterized in detecting immediate or near-immediate issuance of a subsequent request after receipt of a response to a previous request (e.g., IT ˜0). As such, the idle time (‘IT’) can also be used to detect such immediate or near-immediate re-request to identify long poll requests. The absolute or relative timings determined by the tracking engine 238b are used to determine whether the second request is immediately or near-immediately re-requested after the response to the first request is received. For example, a request may be categorized as a long poll request if D+RT+IT˜D+RT since IT is small for this to hold true. IT may be determined to be small if it is less than a threshold value. Note that the threshold value could be fixed or calculated over a limited time period (a session, a day, a month, etc.), or calculated over a longer time period (e.g., several months or the life of the analysis). For example, for every request, the average IT can be determined, and the threshold can be determined using this average IT (e.g., the average IT less a certain percentage may be used as the threshold). This can allow the threshold to automatically adapt over time to network conditions and changes in server capability, resource availability or server response. A fixed threshold can take upon any value including by way of example but not limitation (e.g., 1 s. 2 s. 3 s . . . . etc.).

In some embodiments, the long poll detector 238a can compare the relative timings (e.g., determined by the tracker engine 238b) to request-response timing characteristics for other applications to determine whether the requests of the application are long poll requests. For example, the requests initiated by a client or application can be determined to be long poll requests if the response delay interval time (‘D’) or the average response delay interval time (e.g., averaged over x number of requests or any number of delay interval times averaged over x amount of time) is greater than a threshold value.

The threshold value can be determined using response delay interval times for requests generated by other clients, for example by the request/response tracking engine 238b and/or by the application profile generator 239 (e.g., the response delay interval tracker 239a). The other clients may reside on the same mobile device and the threshold value is determined locally by components on the mobile device. The threshold value can be determined for all requests over all resources server over all networks, for example. The threshold value can be set to a specific constant value (e.g., 30 seconds, for example) to be used for all requests, or any request which does not have an applicable threshold value (e.g., long poll is detected if D>30 seconds).

In some instances, the other clients reside on different mobile devices and the threshold can be determined by a proxy server (e.g., proxy server 325 of the host 300 shown in the example of FIG. 5A-B) which is external to the mobile device and able to communicate over a wireless network with the multiple different mobile devices, as will be further described with reference to FIG. 5B.

In some embodiments, the cache policy manager 245 sends the polling schedule to the proxy server (e.g., proxy server 125 or 325 shown in the examples of FIG. 1B-1C and FIG. 5A) and can be used by the proxy server in monitoring the content source, for example, for changed or new content (updated response different from the cached response associated with a request or application). A polling schedule sent to the proxy can include multiple timing parameters including but not limited to interval (time from request 1 to request 2) or a time out interval (time to wait for response, used in long polls, for example). Referring to the timing diagram of a request/response timing sequence timing intervals ‘RI’, ‘D’, ‘RT’, and/or ‘IT’, or some statistical manipulation of the above values (e.g., average, standard deviation, etc.) may all or in part be sent to the proxy server.

For example, in the case when the local proxy 275 detects a long poll, the various timing intervals in a request/response timing sequence (e.g., ‘D’, ‘RT’, and/or ‘IT’) can be sent to the proxy server 325 for use in polling the content source (e.g., application server/content host 110). The local proxy 275 can also identify to the proxy server 325 that a given application or request to be monitored is a long poll request (e.g., instructing the proxy server to set a ‘long poll flag’, for example). In addition, the proxy server uses the various timing intervals to determine when to send keep-alive indications on behalf of mobile devices.

The local cache invalidator 244 of the caching policy manager 245 can invalidate cache elements in the local cache (e.g., cache 185 or 285) when new or changed data (e.g., updated response) is detected from the application server/content source for a given request. The cached response can be determined to be invalid for the outgoing request based on a notification received from the proxy server (e.g., proxy 325 or the host server 300). The source which provides responses to requests of the mobile client can be monitored to determine relevancy of the cached response stored in the cache of the mobile device 250 for the request. For example, the cache invalidator 244 can further remove/delete the cached response from the cache of the mobile device when the cached response is no longer valid for a given request or a given application.

In some embodiments, the cached response is removed from the cache after it is provided once again to an application which generated the outgoing request after determining that the cached response is no longer valid. The cached response can be provided again without waiting for the time interval or provided again after waiting for a time interval (e.g., the time interval determined to be specific to emulate the response delay in a long poll). In some embodiments, the time interval is the response delay ‘D’ or an average value of the response delay ‘D’ over two or more values.

The new or changed data can be, for example, detected by the proxy server (e.g., proxy server 125 or 325 shown in the examples of FIG. 1B-1C, FIG. 3A-3B, and FIG. 5A-5C). When a cache entry for a given request/poll has been invalidated, the use of the radio on the mobile device 250 can be enabled (e.g., by the local proxy 275 or the cache policy manager 245) to satisfy the subsequent polling requests.

Some embodiments of the cache policy manager 245 include a cache or connect selection engine 249 which can decide whether to use a locally cached entry to satisfy a poll/content request generated at the mobile device 250 by an application or widget. For example, the local proxy 275 or the cache policy manger 245 can intercept a polling request, made by an application (e.g., mobile application) on the mobile device, to contact the application server/content provider. The selection engine 249 can determine whether the content received for the intercepted request has been locally stored as cache elements for deciding whether the radio of the mobile device needs to be activated to satisfy the request made by the application (e.g., mobile application) and also determine whether the cached response is still valid for the outgoing request prior to responding to the outgoing request using the cached response.

In some embodiments, the local proxy 275, in response to determining that relevant cached content exists and is still valid, can retrieve the cached elements from the local cache to provide a response to the application (e.g., mobile application) which made the polling request such that a radio of the mobile device is not activated to provide the response to the application (e.g., mobile application). In general, the local proxy 275 continues to provide the cached response each time the outgoing request is received until the updated response different from the cached response is detected.

When it is determined that the cached response is no longer valid, a new request for a given request is transmitted over the wireless network for an updated response. The request can be transmitted to the application server/content provider (e.g., server/host 110) or the proxy server on the host server (e.g., proxy 325 on the host 300) for a new and updated response. In some embodiments the cached response can be provided again as a response to the outgoing request if a new response is not received within the time interval, prior to removal of the cached response from the cache on the mobile device.

FIG. 4C depicts a block diagram illustrating examples of additional components in the local proxy 275 shown in the example of FIG. 4A which is further capable of performing mobile traffic categorization and policy implementation based on application behavior and/or user activity.

In this embodiment of the local proxy 275, the user activity module 215 further includes one or more of, a user activity tracker 215a, a user activity prediction engine 215b, and/or a user expectation manager 215c. The application behavior detect 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 and/or a network configuration selection engine 251. The network configuration selection engine 251 can further include, one or more of, a wireless generation standard selector 251a, a data rate specifier 251b, an access channel selection engine 251c, and/or an access point selector.

In some embodiments, the application behavior detector 236 is able to detect, determined, identify, or infer, the activity state of an application on the mobile device 250 to which traffic has originated from or is directed to, for example, via the application state categorizer 241c and/or the traffic categorizer 241d. The activity state can be determined by 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 vs. a background application may be handled differently.

In some embodiments, 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, etc. 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 some embodiments, 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 214b).

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 request 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 215 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 215) 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 some embodiments, 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 the network configuration selection engine 251) on the mobile device 250 in sending traffic between the mobile device and a proxy server (325) 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 network configuration selection engine 2510 can select or specify one or more of, a generation standard (e.g., via wireless generation standard selector 251a), a data rate (e.g., via data rate specifier 251b), an access channel (e.g., access channel selection engine 251c), and/or an access point (e.g., via the access point selector 251d), in any combination.

For example, a more advanced generation (e.g., 3G, LTE, or 4G or later) can be selected or specified for traffic when the activity state is in interaction with a user or in a foreground on the mobile device. Contrastingly, an older generation standard (e.g., 2G, 2.5G, or 3G or older) can be specified for traffic when one or more of the following is detected, the application is not interacting with the user, the application is running in the background on the mobile device, or the data contained in the traffic is not time critical, or is otherwise determined to have lower priority.

Similarly, a network configuration with a slower data rate can be specified for traffic when one or more of the following is detected, the application is not interacting with the user, the application is running in the background on the mobile device, or the data contained in the traffic is not time critical. The access channel (e.g., Forward access channel or dedicated channel) can be specified.

FIG. 5A depicts a block diagram illustrating an example of server-side components in a distributed proxy and cache system residing on a host server 300 that manages traffic in a wireless network for resource conservation. The server-side proxy (or proxy server 325) can further categorize mobile traffic and/or implement delivery policies based on application behavior, content priority, user activity, and/or user expectations.

The host server 300 generally includes, for example, a network interface 308 and/or one or more repositories 312, 314, and 316. Note that server 300 may be any portable/mobile or non-portable device, server, cluster of computers and/or other types of processing units (e.g., any number of a machine shown in the example of FIG. 1B) able to receive or transmit signals to satisfy data requests over a network including any wired or wireless networks (e.g., WiFi, cellular, Bluetooth, etc.).

The network interface 308 can include networking module(s) or devices(s) that enable the server 300 to mediate data in a network with an entity that is external to the host server 300, through any known and/or convenient communications protocol supported by the host and the external entity. Specifically, the network interface 308 allows the server 300 to communicate with multiple devices including mobile phone devices 350 and/or one or more application servers/content providers 310.

The host server 300 can store information about connections (e.g., network characteristics, conditions, types of connections, etc.) with devices in the connection metadata repository 312. Additionally, any information about third party application or content providers can also be stored in the repository 312. The host server 300 can store information about devices (e.g., hardware capability, properties, device settings, device language, network capability, manufacturer, device model, OS, OS version, etc.) in the device information repository 314. Additionally, the host server 300 can store information about network providers and the various network service areas in the network service provider repository 316.

The communication enabled by network interface 308 allows for simultaneous connections (e.g., including cellular connections) with devices 350 and/or connections (e.g., including wired/wireless, HTTP, Internet connections, LAN, WiFi, etc.) with content servers/providers 310 to manage the traffic between devices 350 and content providers 310, for optimizing network resource utilization and/or to conserver power (battery) consumption on the serviced devices 350. The host server 300 can communicate with mobile devices 350 serviced by different network service providers and/or in the same/different network service areas. The host server 300 can operate and is compatible with devices 350 with varying types or levels of mobile capabilities, including by way of example but not limitation, 1G, 2G, 2G transitional (2.5G, 2.75G), 3G (IMT-2000), 3G transitional (3.5G, 3.75G, 3.9G), 4G (IMT-advanced), etc.

In general, the network interface 308 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 1G, 2G, 3G, 3.5G, 4G type networks such as LTE, WiMAX, etc.), Bluetooth, WiFi, or any other network whether or not connected 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.

The host server 300 can further include server-side components of the distributed proxy and cache system which can include a proxy server 325 and a server cache 335. In some embodiments, the proxy server 325 can include an HTTP access engine 345, a caching policy manager 355, a proxy controller 365, a traffic shaping engine 375, a new data detector 347 and/or a connection manager 395.

The HTTP access engine 345 may further include a heartbeat manager 398; the proxy controller 365 may further include a data invalidator module 368; the traffic shaping engine 375 may further include a control protocol 376 and a batching module 377. Additional or less components/modules/engines can be included in the proxy server 325 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 the example of a device (e.g., mobile device 350) making an application or content request to an application server or content provider 310, the request may be intercepted and routed to the proxy server 325 which is coupled to the device 350 and the application server/content provider 310. Specifically, the proxy server is able to communicate with the local proxy (e.g., proxy 175 and 275 of the examples of FIG. 1C and FIG. 4A respectively) of the mobile device 350, the local proxy forwards the data request to the proxy server 325 in some instances for further processing and, if needed, for transmission to the application server/content server 310 for a response to the data request.

In such a configuration, the host 300, or the proxy server 325 in the host server 300 can utilize intelligent information provided by the local proxy in adjusting its communication with the device in such a manner that optimizes use of network and device resources. For example, the proxy server 325 can identify characteristics of user activity on the device 350 to modify its communication frequency. The characteristics of user activity can be determined by, for example, the activity/behavior awareness module 366 in the proxy controller 365 via information collected by the local proxy on the device 350.

In some embodiments, communication frequency can be controlled by the connection manager 395 of the proxy server 325, for example, to adjust push frequency of content or updates to the device 350. For instance, push frequency can be decreased by the connection manager 395 when characteristics of the user activity indicate that the user is inactive. In some embodiments, when the characteristics of the user activity indicate that the user is subsequently active after a period of inactivity, the connection manager 395 can adjust the communication frequency with the device 350 to send data that was buffered as a result of decreased communication frequency to the device 350.

In addition, the proxy server 325 includes priority awareness of various requests, transactions, sessions, applications, and/or specific events. Such awareness can be determined by the local proxy on the device 350 and provided to the proxy server 325. The priority awareness module 367 of the proxy server 325 can generally assess the priority (e.g., including time-criticality, time-sensitivity, etc.) of various events or applications; additionally, the priority awareness module 367 can track priorities determined by local proxies of devices 350.

In some embodiments, through priority awareness, the connection manager 395 can further modify communication frequency (e.g., use or radio as controlled by the radio controller 396) of the server 300 with the devices 350. For example, the server 300 can notify the device 350, thus requesting use of the radio if it is not already in use when data or updates of an importance/priority level which meets a criteria becomes available to be sent.

In some embodiments, the proxy server 325 can detect multiple occurrences of events (e.g., transactions, content, data received from server/provider 310) and allow the events to accumulate for batch transfer to device 350. Batch transfer can be cumulated and transfer of events can be delayed based on priority awareness and/or user activity/application behavior awareness as tracked by modules 367 and/or 366. For example, batch transfer of multiple events (of a lower priority) to the device 350 can be initiated by the batching module 377 when an event of a higher priority (meeting a threshold or criteria) is detected at the server 300. In addition, batch transfer from the server 300 can be triggered when the server receives data from the device 350, indicating that the device radio is already in use and is thus on. In some embodiments, the proxy server 325 can order the each messages/packets in a batch for transmission based on event/transaction priority such that higher priority content can be sent first in case connection is lost or the battery dies, etc.

In some embodiments, the server 300 caches data (e.g., as managed by the caching policy manager 355) such that communication frequency over a network (e.g., cellular network) with the device 350 can be modified (e.g., decreased). The data can be cached, for example, in the server cache 335 for subsequent retrieval or batch sending to the device 350 to potentially decrease the need to turn on the device 350 radio. The server cache 335 can be partially or wholly internal to the host server 300, although in the example of FIG. 5A it is shown as being external to the host 300. In some instances, the server cache 335 may be the same as and/or integrated in part or in whole with another cache managed by another entity (e.g., the optional caching proxy server 199 shown in the example of FIG. 1C), such as being managed by an application server/content provider 310, a network service provider, or another third party.

In some embodiments, content caching is performed locally on the device 350 with the assistance of host server 300. For example, proxy server 325 in the host server 300 can query the application server/provider 310 with requests and monitor changes in responses. When changed or new responses are detected (e.g., by the new data detector 347), the proxy server 325 can notify the mobile device 350 such that the local proxy on the device 350 can make the decision to invalidate (e.g., indicated as out-dated) the relevant cache entries stored as any responses in its local cache. Alternatively, the data invalidator module 368 can automatically instruct the local proxy of the device 350 to invalidate certain cached data, based on received responses from the application server/provider 310. The cached data is marked as invalid, and can get replaced or deleted when new content is received from the content server 310.

Note that data change can be detected by the detector 347 in one or more ways. For example, the server/provider 310 can notify the host server 300 upon a change. The change can also be detected at the host server 300 in response to a direct poll of the source server/provider 310. In some instances, the proxy server 325 can in addition, pre-load the local cache on the device 350 with the new/updated data. This can be performed when the host server 300 detects that the radio on the mobile device is already in use, or when the server 300 has additional content/data to be sent to the device 350.

One or more the above mechanisms can be implemented simultaneously or adjusted/configured based on application (e.g., different policies for different servers/providers 310). In some instances, the source provider/server 310 may notify the host 300 for certain types of events (e.g., events meeting a priority threshold level). In addition, the provider/server 310 may be configured to notify the host 300 at specific time intervals, regardless of event priority.

In some embodiments, the proxy server 325 of the host 300 can monitor/track responses received for the data request from the content source for changed results prior to returning the result to the mobile device, such monitoring may be suitable when data request to the content source has yielded same results to be returned to the mobile device, thus preventing network/power consumption from being used when no new changes are made to a particular requested. The local proxy of the device 350 can instruct the proxy server 325 to perform such monitoring or the proxy server 325 can automatically initiate such a process upon receiving a certain number of the same responses (e.g., or a number of the same responses in a period of time) for a particular request.

In some embodiments, the server 300, through the activity/behavior awareness module 366, is able to identify or detect user activity at a device that is separate from the mobile device 350. For example, the module 366 may detect that a user's message inbox (e.g., email or types of inbox) is being accessed. This can indicate that the user is interacting with his/her application using a device other than the mobile device 350 and may not need frequent updates, if at all.

The server 300, in this instance, can thus decrease the frequency with which new or updated content is sent to the mobile device 350, or eliminate all communication for as long as the user is detected to be using another device for access. Such frequency decrease may be application specific (e.g., for the application with which the user is interacting with on another device), or it may be a general frequency decrease (E.g., since the user is detected to be interacting with one server or one application via another device, he/she could also use it to access other services) to the mobile device 350.

In some embodiments, the host server 300 is able to poll content sources 310 on behalf of devices 350 to conserve power or battery consumption on devices 350. For example, certain applications on the mobile device 350 can poll its respective server 310 in a predictable recurring fashion. Such recurrence or other types of application behaviors can be tracked by the activity/behavior module 366 in the proxy controller 365. The host server 300 can thus poll content sources 310 for applications on the mobile device 350 that would otherwise be performed by the device 350 through a wireless (e.g., including cellular connectivity). The host server can poll the sources 310 for new or changed data by way of the HTTP access engine 345 to establish HTTP connection or by way of radio controller 396 to connect to the source 310 over the cellular network. When new or changed data is detected, the new data detector 347 can notify the device 350 that such data is available and/or provide the new/changed data to the device 350.

In some embodiments, the connection manager 395 determines that the mobile device 350 is unavailable (e.g., the radio is turned off) and utilizes SMS to transmit content to the device 350, for instance, via the SMSC shown in the example of FIG. 1C. SMS is used to transmit invalidation messages, batches of invalidation messages, or even content in the case where the content is small enough to fit into just a few (usually one or two) SMS messages. This avoids the need to access the radio channel to send overhead information. The host server 300 can use SMS for certain transactions or responses having a priority level above a threshold or otherwise meeting a criteria. The server 300 can also utilize SMS as an out-of-band trigger to maintain or wake-up an IP connection as an alternative to maintaining an always-on IP connection.

In some embodiments, the connection manager 395 in the proxy server 325 (e.g., the heartbeat manager 398) can generate and/or transmit heartbeat messages on behalf of connected devices 350 to maintain a backend connection with a provider 310 for applications running on devices 350.

For example, in the distributed proxy system, local cache on the device 350 can prevent any or all heartbeat messages needed to maintain TCP/IP connections required for applications from being sent over the cellular, or other, network and instead rely on the proxy server 325 on the host server 300 to generate and/or send the heartbeat messages to maintain a connection with the backend (e.g., application server/provider 110 in the example of FIG. 1A). The proxy server can generate the keep-alive (heartbeat) messages independent of the operations of the local proxy on the mobile device.

The repositories 312, 314, and/or 316 can additionally store software, descriptive data, images, system information, drivers, and/or any other data item utilized by other components of the host server 300 and/or any other servers for operation. The repositories may be managed by a database management system (DBMS), for example, which may be but is not limited to Oracle, DB2, Microsoft Access, Microsoft SQL Server, PostgreSQL, MySQL, FileMaker, etc.

The repositories can be implemented via object-oriented technology and/or via text files and can be managed by a distributed database management system, an object-oriented database management system (OODBMS) (e.g., ConceptBase, FastDB Main Memory Database Management System, JDOInstruments, ObjectDB, etc.), an object-relational database management system (ORDBMS) (e.g., Informix, OpenLink Virtuoso, VMDS, etc.), a file system, and/or any other convenient or known database management package.

FIG. 5B depicts a block diagram illustrating a further example of components in the caching policy manager 355 in the cache system shown in the example of FIG. 5A which is capable of caching and adapting caching strategies for application (e.g., mobile application) behavior and/or network conditions.

The caching policy manager 355, In some embodiments, can further include a metadata generator 303, a cache look-up engine 305, an application protocol module 356, a content source monitoring engine 357 having a poll schedule manager 358, a response analyzer 361, and/or an updated or new content detector 359. In some embodiments, the poll schedule manager 358 further includes a host timing simulator 358a, a long poll request detector/manager 358b, a schedule update engine 358c, and/or a time adjustment engine 358d. The metadata generator 303 and/or the cache look-up engine 305 can be coupled to the cache 335 (or, server cache) for modification or addition to cache entries or querying thereof.

In some embodiments, the proxy server (e.g., the proxy server 125 or 325 of the examples of FIG. 1B-1C and FIG. 5A) can monitor a content source for new or changed data via the monitoring engine 357. The proxy server, as shown, is an entity external to the mobile device 250 of FIG. 4A-4B. The content source (e.g., application server/content provider 110 of FIG. 1B-1C) can be one that has been identified to the proxy server (e.g., by the local proxy) as having content that is being locally cached on a mobile device (e.g., mobile device 150 or 250). The content source can be monitored, for example, by the monitoring engine 357 at a frequency that is based on polling frequency of the content source at the mobile device. The poll schedule can be generated, for example, by the local proxy and sent to the proxy server. The poll frequency can be tracked and/or managed by the poll schedule manager 358.

For example, the proxy server can poll the host (e.g., content provider/application server) on behalf of the mobile device and simulate the polling behavior of the client to the host via the host timing simulator 358a. The polling behavior can be simulated to include characteristics of a long poll request-response sequences experienced in a persistent connection with the host (e.g., by the long poll request detector/manager 358b). Note that once a polling interval/behavior is set, the local proxy 275 on the device-side and/or the proxy server 325 on the server-side can verify whether application and application server/content host behavior match or can be represented by this predicted pattern. In general, the local proxy and/or the proxy server can detect deviations and, when appropriate, re-evaluate and compute, determine, or estimate another polling interval.

In some embodiments, the caching policy manager 355 on the server-side of the distribute proxy can, in conjunction with or independent of the proxy server 275 on the mobile device, identify or detect long poll requests. For example, the caching policy manager 355 can determine a threshold value to be used in comparison with a response delay interval time in a request-response sequence for an application request to identify or detect long poll requests, possible long poll requests (e.g., requests for a persistent connection with a host with which the client communicates including, but not limited to, a long-held HTTP request, a persistent connection enabling COMET style push, request for HTTP streaming, etc.), or other requests which can otherwise be treated as a long poll request.

For example, the threshold value can be determined by the proxy 325 using response delay interval times for requests generated by clients/applications across mobile devices which may be serviced by multiple different cellular or wireless networks. Since the proxy 325 resides on host 300 is able to communicate with multiple mobile devices via multiple networks, the caching policy manager 355 has access to application/client information at a global level which can be used in setting threshold values to categorize and detect long polls.

By tracking response delay interval times across applications across devices over different or same networks, the caching policy manager 355 can set one or more threshold values to be used in comparison with response delay interval times for long poll detection. Threshold values set by the proxy server 325 can be static or dynamic, and can be associated with conditions and/or a time-to-live (an expiration time/date in relative or absolute terms).

In addition, the caching policy manager 355 of the proxy 325 can further determine the threshold value, in whole or in part, based on network delays of a given wireless network, networks serviced by a given carrier (service provider), or multiple wireless networks. The proxy 325 can also determine the threshold value for identification of long poll requests based on delays of one or more application server/content provider (e.g., 110) to which application (e.g., mobile application) or mobile client requests are directed.

The proxy server can detect new or changed data at a monitored content source and transmits a message to the mobile device notifying it of such a change such that the mobile device (or the local proxy on the mobile device) can take appropriate action (e.g., to invalidate the cache elements in the local cache). In some instances, the proxy server (e.g., the caching policy manager 355) upon detecting new or changed data can also store the new or changed data in its cache (e.g., the server cache 135 or 335 of the examples of FIG. 1C and FIG. 5A, respectively). The new/updated data stored in the server cache 335 can be used in some instances to satisfy content requests at the mobile device; for example, it can be used after the proxy server has notified the mobile device of the new/changed content and that the locally cached content has been invalidated.

The metadata generator 303, similar to the metadata generator 203 shown in the example of FIG. 4B, can generate metadata for responses cached for requests at the mobile device 250. The metadata generator 303 can generate metadata for cache entries stored in the server cache 335. Similarly, the cache look-up engine 305 can include the same or similar functions are those described for the cache look-up engine 205 shown in the example of FIG. 4B.

The response analyzer 361 can perform any or all of the functionalities related to analyzing responses received for requests generated at the mobile device 250 in the same or similar fashion to the response analyzer 246d of the local proxy shown in the example of FIG. 4B. Since the proxy server 325 is able to receive responses from the application server/content source 310 directed to the mobile device 250, the proxy server 325 (e.g., the response analyzer 361) can perform similar response analysis steps to determine cacheability, as described for the response analyzer of the local proxy. The responses can be analyzed in addition to or in lieu of the analysis that can be performed at the local proxy 275 on the mobile device 250.

Furthermore, the schedule update engine 358c can update the polling interval of a given application server/content host based on application request interval changes of the application at the mobile device 250 as described for the schedule update engine in the local proxy 275. The time adjustment engine 358d can set an initial time at which polls of the application server/content host is to begin to prevent the serving of out of date content once again before serving fresh content as described for the schedule update engine in the local proxy 275. Both the schedule updating and the time adjustment algorithms can be performed in conjunction with or in lieu of the similar processes performed at the local proxy 275 on the mobile device 250.

FIG. 5C depicts a block diagram illustrating examples of additional components in proxy server 325 shown in the example of FIG. 5A which is further capable of performing mobile traffic categorization and policy implementation based on application behavior and/or traffic priority.

In some embodiments of the proxy server 325, the traffic shaping engine 375 is further coupled to a traffic analyzer 336 for categorizing mobile traffic for policy definition and implementation for mobile traffic and transactions directed to one or more mobile devices (e.g., mobile device 250 of FIG. 4A-4C) or to an application server/content host (e.g., 110 of FIG. 1B-1C). In general, the proxy server 325 is remote from the mobile devices and remote from the host server, as shown in the examples of FIG. 1B-1C. The proxy server 325 or the host server 300 can monitor the traffic for multiple mobile devices and is capable of categorizing traffic and devising traffic policies for different mobile devices.

In addition, the proxy server 325 or host server 300 can operate with multiple carriers or network operators and can implement carrier-specific policies relating to categorization of traffic and implementation of traffic policies for the various categories. For example, the traffic analyzer 336 of the proxy server 325 or host server 300 can include one or more of, a prioritization engine 341a, a time criticality detection engine 341b, an application state categorizer 341c, and/or an application traffic categorizer 341d.

Each of these engines or modules can track different criterion for what is considered priority, time critical, background/foreground, or interactive/maintenance based on different wireless carriers. Different criterion may also exist for different mobile device types (e.g., device model, manufacturer, operating system, etc.). In some instances, the user of the mobile devices can adjust the settings or criterion regarding traffic category and the proxy server 325 is able to track and implement these user adjusted/configured settings.

In some embodiments, the traffic analyzer 336 is able to detect, determined, identify, or infer, the activity state of an application on one or more mobile devices (e.g., mobile device 150 or 250) which traffic has originated from or is directed to, for example, via the application state categorizer 341c and/or the traffic categorizer 341d. The activity state can be determined based on whether the application is in a foreground or background state on one or more of the mobile devices (via the application state categorizer 341c) since the traffic for a foreground application vs. a background application may be handled differently to optimize network use.

In the alternate or in combination, the activity state of an application can be determined by the wirelessly connected mobile devices (e.g., via the application behavior detectors in the local proxies) and communicated to the proxy server 325. For example, the activity state can be determined, detected, identified, or inferred with a level of certainty of heuristics, based on the backlight status at mobile devices (e.g., by a backlight detector) 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, etc. 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.

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) and communicated to the proxy server 325. In some embodiments, 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.

The time criticality detection engine 341b 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 the host server 300 or proxy server 325, or the 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 be sent to a mobile device is based on when there is additional data that needs to the sent to the same mobile device. For example, traffic shaping engine 375 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 378 and/or the batching module 377). The alignment module 378 can also align polling requests occurring close in time directed to the same host server, since these request are likely to be responded to with the same data.

In general, whether new or changed data is sent from a host server to a mobile device can be determined based on whether an application on the mobile device to which the new or changed data is relevant, is running in a foreground (e.g., by the application state categorizer 341c), or the priority or time criticality of the new or changed data. The proxy server 325 can send the new or changed data to the mobile device if the application is in the foreground on the mobile device, or if the application is in the foreground and in an active state interacting with a user on the mobile device, and/or whether a user is waiting for a response that would be provided in the new or changed data. The proxy server 325 (or traffic shaping engine 375) can send the new or changed data that is of a high priority or is time critical.

Similarly, the proxy server 325 (or the traffic shaping engine 375) can suppressing the sending of the new or changed data if the application is in the background on the mobile device. The proxy server 325 can also suppress the sending of the new or changed data if the user is not waiting for the response provided in the new or changed data; wherein the suppressing is performed by a proxy server coupled to the host server and able to wirelessly connect to the mobile device.

In general, if data, including new or change data is of a low priority or is not time critical, the proxy server can waiting to transfer the data until after a time period, or until there is additional data to be sent (e.g. via the alignment module 378 and/or the batching module 377).

In FIG. 6 is a flow diagram depicting steps in a process 2000 for assessing background data and performing a radio status transition as implemented in some embodiments. At step 2001, the system can monitor criteria associated with a mobile device, e.g., using a local proxy. As discussed above, the criteria may include a capacity of a buffer, the state of a backlight on the device, a FACH consumption rate, user activity at the device, user preferences, or other criteria indicative of the mobile device's status. In some embodiments, the buffer may not be monitored directly, but may instead be modeled to avoid the need for heavy computations. Certain of the criteria may be combined into a “group” of criteria. For example, the system may determine that data transmitted/received is background data based on the buffer exceeding a threshold when the backlight is off.

In some embodiments, the monitored criteria may not be a size of the data sent, but rather the speed with which the data is sent. For example, data sent or received at a rate exceeding a threshold during an inactive state of the mobile device, may be indicative of background data. In some embodiments, the system may apply dynamic adaptive logic to discover network specific or condition specific values associated with the criteria. In some embodiments, the system may detect background data transmissions by monitoring the draw on a battery at the mobile device.

At step 2002 the system may determine whether to perform a radio status transition based at least in part on the criteria. As discussed above, in some embodiments, the radio status transition may be performed by communicating rules to a PCRF component in a network. A local proxy on the mobile device may determine a plurality of rules, e.g., rules used at a PCRF, based on the monitoring and may communicate the rules to a network component so as to adjust a level of throttling. In one implementation, the PCRF may request the network component to change the radio status.

FIG. 7 is a flow diagram generally depicting a process 2100 for assessing background data and performing a radio status transition accordingly as implemented in certain embodiments. At step 2101 the system may monitor an application on a mobile device. At step 2102 the system may determine whether data transmitted or received because of the monitored application meets power state transition criteria. In some embodiments, the power state transition criteria may be used to determine if the data transmitted or received is background data. If the data meets the criteria, at step 2103 the system may perform a radio status transition from a first state to a second state. For example, if the system may determine that the data is background data, and demote to the system a lower radio status state in a 3G or LTE network. In some embodiments, if the state does not meet the criteria, the system may take action to preserve the existing state. For example, the system may adjust rules at a PCRF component, so that the current state is not promoted or demoted based on the current configuration of the monitored criteria.

FIG. 8 is a flow diagram generally depicting a process 2200 for assessing background data and performing a radio status transition accordingly as implemented in certain embodiments. At step 2201 the system may determine if an application intends to transmit or receive background data. If the system determines that the application may transmit or receive background data, at step 2202 the system may monitor the application. At step 2203 the system may determine if the criteria to transition the radio state have been met. At step 2204, the system may determine whether to perform a radio channel status transition based on the criteria and upon the application, such as upon the application's behavior. If the system determines that the transition is to occur, at step 2205, the system may perform the transition or cause the transition to be performed. For example, the system may modify or provide rules to a PCRF network component, such that the PCRF will cause the transition at the appropriate time. Note that in some embodiments, based upon the monitoring, the system may determine that rules which avoid a transition and maintain the current state are appropriate.

FIG. 9 depicts a table 700 showing examples of different traffic or application category types which can be used in implementing network access and content delivery policies. For example, traffic/application categories can include interactive or background, whether a user is waiting for the response, foreground/background application, and whether the backlight is on or off.

FIG. 10 depicts a table 800 showing examples of different content category types which can be used in implementing network access and content delivery policies. For example, content category types can include content of high or low priority, and time critical or non-time critical content/data.

In the example of FIG. 11, the computer system 1100 includes a processor, memory, non-volatile memory, and an interface device. Various common components (e.g., cache memory) are omitted for illustrative simplicity. The computer system 1100 is intended to illustrate a hardware device on which any of the components depicted in the example of FIGS. 2A-2B, 3A-3B, 4A-4D and 5A-C (and any other components described in this specification) can be implemented. The computer system 1100 can be of any applicable known or convenient type. The components of the computer system 1100 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 1100. 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 that, ideally, 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. 8 reside in the interface.

In operation, the computer system 1100 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 user device, a tablet PC, a laptop computer, a set-top box (STB), a personal digital assistant (PDA), a cellular telephone, an iPhone, an iPad, a Blackberry, a processor, a telephone, a web appliance, a network router, switch or bridge, a console, a hand-held console, a (hand-held) gaming device, a music player, any portable, mobile, hand-held device, 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 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 sub-combinations. 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, ¶6, 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, ¶6 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 which promotes or demotes a radio state based on an application accessed or installed thereon, the mobile device comprising: a radio;a processor;a memory unit having instructions stored thereon which when executed by the processor, causes the radio to transition between a lower powered state and a higher powered state based on at least:a determination of whether the application transmits background or foreground data over a wireless network,wherein the memory unit further has instructions stored thereon which when executed by the processor, causes the mobile device to:monitor the mobile device and the application while the radio is in the lower-powered state;determine, based on the monitored mobile device and application, whether rate-limiting data transmission from the mobile device would avoid causing the radio to transition to the higher powered state; andin response to determining that rate-limiting data transmission from the mobile device would avoid causing the radio to transition to the higher powered state, transmit data through a rate-limited proxy configured to limit at least one of a speed of transmission of the data and a buffer size.
2. The mobile device of claim 1, wherein, the foreground data includes data transmitted or generated as a result of a user interaction or a user request.
3. The mobile device of claim 1, wherein the background data includes data transmitted or generated by the application without a user interaction or a user request.
4. The mobile device of claim 1, wherein, the background data includes data transmitted or generated by the application for application maintenance or updating.
5. A mobile device which promotes or demotes a radio state based on an application accessed or installed thereon, the mobile device comprising: a radio; a processor;a local proxy on the mobile device, the local proxy configured to: monitor the application while the radio is in the first state;monitor the mobile device to determine whether criteria to transition radio states on the mobile device is met; anddetermine whether to perform a radio channel status transition from a first state to a second state based at least in part upon the criteria and the at least one application˜determine, based on the monitored application, whether rate-limiting data transmission from the mobile device would avoid causing the radio to transition to the second state; andin response to determining that rate-limiting data transmission from the mobile device would avoid causing the radio to transition to the second state, transmit data through a rate- limited proxy configured to limit at least one of a speed of transmission of the data and a buffer size.
6. The mobile device of claim 5, wherein the criteria includes a capacity of a buffer on the mobile device; wherein, the radio channel status is promoted from the first state to the second state if the buffer exceeds a threshold; wherein the second state is a higher powered state than the first state.
7. The mobile device of claim 6, wherein the application comprises applying dynamic adaptive logic to discover network specific or condition specific values associated with the buffer capacity.
8. The mobile device of claim 5, wherein the criteria comprises applications running on the mobile device.
9. The mobile device of claim 5, wherein the criteria comprises a mobile device state.
10. The mobile device of claim 5, wherein the criteria comprises a backlight status.
11. The mobile device of claim 5, wherein the criteria comprises user activity at the mobile device.
12. The mobile device of claim 5, wherein the criteria comprises user preferences at the mobile device.
13. The mobile device of claim 5, wherein determining whether to perform a radio channel status transition comprises communicating rules to a PCRF component in a network.
14. The mobile device of claim 5, wherein the local proxy is further configured to: determine a plurality of rules based on the monitoring the mobile device and monitoring the application; and communicate the plurality of rules to a network component, the plurality of rules configured to determine a level of throttling.
15. The mobile device of claim 5, wherein to determine whether to perform a radio channel status transition comprises determining whether to adjust a level of throttling.
16. The mobile device of claim 5, wherein the first state comprises a state in a 3G Model.
17. The mobile device of claim 5, wherein the first state comprises a state in an LTE Model.
18. A method for radio state management of a mobile device comprising: assessing whether an application on the mobile device is transmitting or receiving background data; anddetermining whether to perform a radio status transition from a high state to a low state based on a level of certainty that the data being transmitted or received is background data;monitoring the mobile device and the application while the radio is in the low state;determining, based on the monitored mobile device and application, whether rate-limiting data transmission from the mobile device would avoid causing the radio to transition to the high state; andin response to determining that rate-limiting data transmission from the mobile device would avoid causing the radio to transition to the high state, transmitting data through a rate-limited proxy configured to limit at least one of a speed of transmission of the data and a buffer size.
19. The method of claim 18, wherein the high state is a CELL_DCH state and the low state is a CELL FACH state.
20. The method of claim 18, wherein the high state is a CELL FACH state and the low state is an IDLE state.
21. The method of claim 18, wherein the high state is a CELL_DCH state and the low state is an IDLE state.
22. The method of claim 18, wherein the high state is active and the low state is CELL_DCH state and the low state is idle.
23. The method of claim 18, wherein the level of certainty is based on a capacity of a buffer located on a mobile device.
24. The method of claim 23, wherein determining whether to perform the radio status transition comprises applying logic to discover network specific values associated with the buffer capacity.
25. The method of claim 24, wherein, the logic is adaptive to network conditions and is dynamically adjustable.
26. The method of claim 23, wherein determining whether to perform the radio status transition comprises applying logic to discover condition specific values associated with the buffer capacity.
27. The method of claim 26, wherein, the logic is adaptive to network conditions and is dynamically adjustable.
28. The method of claim 18, wherein, the level of certainty is based on a Forward Access Channel (FACH) consumption rate.
29. The method of claim 18, wherein, the level of certainty is based on a backlight status of the mobile device.
30. The method of claim 18, wherein the level of certainty is based on a behavior of applications running on the mobile device.
31. The method of claim 18, wherein the level of certainty is based on user activity at the mobile device.
32. The method of claim 18, wherein the level of certainty is based on user preferences at the mobile device.
33. The method of claim 18, wherein determining whether to perform the radio status transition comprises communicating rules to a Policy and Charging Rules Function (PCRF) component of a network component in a mobile network.
34. The method of claim 18, wherein the level of certainty is based on a determination by a local proxy on the mobile device.
35. The method of claim 34, wherein the method further comprises: determining, using the local proxy, rules based on the level of certainty and monitoring the one or more applications; andcommunicating the rules to a network component in the mobile network, the rules configured to determine a level of throttling.
36. The method of claim 18, wherein, the level of certainty is determined by a proxy server remote from the mobile device.
37. The method of claim 36, the method further comprising: determining, using the proxy server, rules based on the level of certainty and monitoring the one or more mobile applications on or accessed via the mobile device; and communicating the rules to a network component in the mobile network, the rules configured to determine a level of throttling.
38. The method of claim 18, further comprising, performing the radio status transition includes adjusting a level of throttling.
39. The method of claim 18, wherein the level of certainty with which the data is ascertained to be background data is based on a capacity of a buffer, the buffer located on the mobile device.
40. The method of claim 18, wherein the level of certainty is based on one of, applications running on a mobile device, mobile device state, mobile device backlight status, user activity at a mobile device, or user preferences at a mobile device.
41. The method of claim 18, wherein the level of certainty with which the data is ascertained to be background data is based on statistical data or historical data gathered for the application.
42. The method of claim 18, wherein the statistical data is collected by a proxy server which gathers information from a plurality of local proxies, the plurality of local proxies associated with various mobile devices.
43. A system to manage radio state change of a mobile device, comprising: a proxy server configured to: monitor the application;monitor the mobile device to determine whether criteria to transition radio states on the mobile device is met; anddetermine whether to cause a radio channel status transition from a first state to a second state on the mobile device based at least in part upon the criteria and the at least one application,monitor the mobile device and the application while the radio is in the first state;determine, based on the monitored mobile device and application, whether rate-limiting data transmission from the mobile device would avoid causing the radio to transition to the second state; andin response to determining that rate-limiting data transmission from the mobile device would avoid causing the radio to transition to the second state, transmit data through a rate-limited proxy configured to limit at least one of a speed of transmission of the data and a buffer size.
44. The system of claim 43, wherein the background data includes data transmitted or generated by the application without a user interaction or a user request.
45. The system of claim 43, wherein, the background data includes data transmitted or generated by the application for application maintenance or updating.
46. The system of claim 43, wherein the criteria includes a capacity of a buffer, the buffer located on the mobile device.
47. The system of claim 46, wherein monitoring the criteria comprises applying dynamic adaptive logic to discover network specific or condition specific values associated with the buffer capacity.
48. The system of claim 43, wherein the criteria comprises one of request characteristics, response characteristics, a FACH consumption rate, applications running on a mobile device, mobile device state, mobile device backlight status, user activity at a mobile device, user preferences at a mobile device.
49. The system of claim 43, wherein determining whether to cause a radio channel status transition comprises communicating rules to a PCRF component in a network.
50. The system of claim 43, wherein the proxy is further configured to: determine a plurality of rules based on monitoring a criteria and monitoring the application; and communicate the plurality of rules to a network component, the plurality of rules configured to determine a level of throttling.
51. The system of claim 43, wherein to determine whether to cause a radio channel status transition comprises adjusting a level of throttling.
52. The system of claim 43, wherein the first state comprises a state in a 3G network or a state in an LTE network.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application claims priority to and the benefit of the U.S. Provisional Application 61/740,392, entitled MANAGEMENT OF MOBILE DEVICE RADIO STATE PROMOTION AND DEMOTION BY BUFFER AND/OR ACTIVITY MONITORING, filed on Dec. 20, 2012, the contents of which are all incorporated by reference herein. This application is related to U.S. patent application Ser. No. 13/844,682 entitled “MANAGEMENT OF MOBILE DEVICE RADIO STATE PROMOTION AND DEMOTION,”, filed on Mar. 15, 2013, the contents of which are all incorporated by reference herein.

US Referenced Citations (1452)

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
5884323	Hawkins et al.	Mar 1999	A
5889845	Staples 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
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
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
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
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
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
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
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
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
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
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
7085365	Kauppinen	Aug 2006	B2
7096030	Huomo	Aug 2006	B2
7100821	Rasti	Sep 2006	B2
7103432	Drader et al.	Sep 2006	B2
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
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
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
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	Kasriel et al.	Jun 2009	B2
7548969	Tripp et al.	Jun 2009	B2
7551900	Kang et al.	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
7587608	Haller 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
7650416	Wu et al.	Jan 2010	B2
7672291	Wang	Mar 2010	B2
7672439	Appelman et al.	Mar 2010	B2
7680281	Fiatal 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
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
7873609	Kim et al.	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
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
7970860	Kline et al.	Jun 2011	B2
7996487	Snyder	Aug 2011	B2
8005891	Knowles et al.	Aug 2011	B2
8010082	Sutaria et al.	Aug 2011	B2
8032409	Mikurak	Oct 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
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
8166164	Luna et al.	Apr 2012	B1
8190701	Luna et al.	May 2012	B2
8194680	Brandwine et al.	Jun 2012	B1
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
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
20010009025	Ahonen	Jul 2001	A1
20010010046	Muyres et al.	Jul 2001	A1
20010013069	Shah	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
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
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
20020078384	Hippelainen	Jun 2002	A1
20020087549	Mostafa	Jul 2002	A1
20020087679	Pulley 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
20020103934	Fishman et al.	Aug 2002	A1
20020107944	Bai et al.	Aug 2002	A1
20020107985	Hwang et al.	Aug 2002	A1
20020116499	Enns 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
20020133504	Vlahos 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
20020167484	Hatanaka et al.	Nov 2002	A1
20020174189	Peng	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
20020194209	Bolosky et al.	Dec 2002	A1
20020198027	Rydbeck	Dec 2002	A1
20030005151	Ullman 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
20030028430	Zimmerman	Feb 2003	A1
20030028441	Barsness 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
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
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
20030088629	Berkowitz 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
20030187984	Banavar et al.	Oct 2003	A1
20030204605	Hudson 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
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
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
20040054739	Friend 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
20040073476	Donahue et al.	Apr 2004	A1
20040073651	Beaulieu et al.	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
20040082346	Skytt et al.	Apr 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
20040120323	Viikari et al.	Jun 2004	A1
20040121785	Vance 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
20040141011	Smethers et al.	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
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
20040186902	Stewart	Sep 2004	A1
20040189610	Friend	Sep 2004	A1
20040199497	Timmons	Oct 2004	A1
20040199582	Kucharewski 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
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
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
20050041793	Fulton et al.	Feb 2005	A1
20050044144	Malik 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
20050076136	Cho et al.	Apr 2005	A1
20050076241	Appelman	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
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
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	Steely et al.	Jul 2005	A1
20050155027	Wei	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	LeMay et al.	Sep 2005	A1
20050203966	Labrou et al.	Sep 2005	A1
20050210104	Torvinen	Sep 2005	A1
20050210125	Li	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
20050246139	Rivenbark et al.	Nov 2005	A1
20050248526	Twerdahl 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
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
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
20060031785	Raciborski	Feb 2006	A1
20060031938	Choi	Feb 2006	A1
20060037071	Rao et al.	Feb 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
20060052113	Ophir 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
20060123042	Xie et al.	Jun 2006	A1
20060132495	Anderson	Jun 2006	A1
20060141962	Forbes et al.	Jun 2006	A1
20060143464	Ananthanarayanan et al.	Jun 2006	A1
20060149591	Hanf 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 et al.	Jul 2006	A1
20060179410	Deeds	Aug 2006	A1
20060182025	Kim 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
20060230394	Forth et al.	Oct 2006	A1
20060234630	Lai	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
20060259923	Chiu	Nov 2006	A1
20060265595	Scottodiluzio	Nov 2006	A1
20060271884	Hurst	Nov 2006	A1
20060277265	Backholm et al.	Dec 2006	A1
20060277271	Morse 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
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
20070044041	Beynon et al.	Feb 2007	A1
20070049258	Thibeault	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
20070077949	Henderson et al.	Apr 2007	A1
20070078857	Punaganti et al.	Apr 2007	A1
20070078964	East et al.	Apr 2007	A1
20070088852	Levkovitz	Apr 2007	A1
20070100650	Ramer et al.	May 2007	A1
20070105627	Campbell	May 2007	A1
20070111764	Park	May 2007	A1
20070116223	Burke et al.	May 2007	A1
20070118620	Cartmell 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
20070150881	Khawand et al.	Jun 2007	A1
20070153798	Krstulich	Jul 2007	A1
20070156824	Thompson	Jul 2007	A1
20070156842	Vermeulen 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
20070198698	Boyd et al.	Aug 2007	A1
20070220080	Humphrey	Sep 2007	A1
20070220099	Di Giorgio et al.	Sep 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
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
20070294763	Udezue et al.	Dec 2007	A1
20070296701	Pope 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
20080016236	Beverly et al.	Jan 2008	A1
20080032718	Suresh	Feb 2008	A1
20080034031	Weisbrot et al.	Feb 2008	A1
20080037787	Boynton et al.	Feb 2008	A1
20080039032	Haumont	Feb 2008	A1
20080043692	Morita	Feb 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
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
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
20080178294	Hu et al.	Jul 2008	A1
20080180228	Wakefield et al.	Jul 2008	A1
20080183800	Herzog et al.	Jul 2008	A1
20080186166	Zhou 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
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
20080298386	Fiatal	Dec 2008	A1
20080299956	Bailey et al.	Dec 2008	A1
20080301231	Mehta et al.	Dec 2008	A1
20080301300	Toub	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
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
20090077263	Koganti et al.	Mar 2009	A1
20090077326	Motohashi	Mar 2009	A1
20090081944	Yavuz et al.	Mar 2009	A1
20090094317	Venkitaraman	Apr 2009	A1
20090100416	Brown et al.	Apr 2009	A1
20090110179	Elsey et al.	Apr 2009	A1
20090119266	Fitzpatrick et al.	May 2009	A1
20090122772	Jung	May 2009	A1
20090125523	Fitzpatrick et al.	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
20090215504	Lando	Aug 2009	A1
20090221326	Roussel et al.	Sep 2009	A1
20090228545	Mendez 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
20090249482	Sarathy	Oct 2009	A1
20090252136	Mahany et al.	Oct 2009	A1
20090254589	Nair 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
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
20100036885	Shen et al.	Feb 2010	A1
20100042691	Maguire	Feb 2010	A1
20100049872	Roskind	Feb 2010	A1
20100057924	Rauber et al.	Mar 2010	A1
20100067413	Schneider et al.	Mar 2010	A1
20100069127	Fiennes	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
20100088722	Jiang	Apr 2010	A1
20100093273	Hohl	Apr 2010	A1
20100095018	Khemani et al.	Apr 2010	A1
20100099421	Patel et al.	Apr 2010	A1
20100115050	Sultenfuss et al.	May 2010	A1
20100118190	Salfati et al.	May 2010	A1
20100131593	Kihara et al.	May 2010	A1
20100131617	Osborne et al.	May 2010	A1
20100146107	Fiatal	Jun 2010	A1
20100149975	Tripathi et al.	Jun 2010	A1
20100159948	Spivey et al.	Jun 2010	A1
20100174735	Fiatal	Jul 2010	A1
20100174756	Lazaridis et al.	Jul 2010	A1
20100174939	Vexler	Jul 2010	A1
20100186011	Magenheimer	Jul 2010	A1
20100192212	Raleigh	Jul 2010	A1
20100203876	Krishnaswamy	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
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
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
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
20100313018	Jorgensen	Dec 2010	A1
20100315535	Nurit 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
20100325306	Vimpari et al.	Dec 2010	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
20110044304	Connelly 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
20110083186	Niemela 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
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
20110165889	Fiatal 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
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
20110199905	Pinheiro et al.	Aug 2011	A1
20110201304	Sutaria 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
20110219133	Shanmugham	Sep 2011	A1
20110225646	Crawford	Sep 2011	A1
20110238772	Fiatal	Sep 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
20110302154	Snyder	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
20120030280	Wang et al.	Feb 2012	A1
20120030750	Bhargava 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
20120096058	Mameri et al.	Apr 2012	A1
20120096092	Davidge et al.	Apr 2012	A1
20120099592	Ludwig	Apr 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
20120135726	Luna et al.	May 2012	A1
20120140750	Yan et al.	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
20120173901	Soliman	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
20120209923	Mathur et al.	Aug 2012	A1
20120210121	Boynton et al.	Aug 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
20120304288	Wright et al.	Nov 2012	A1
20120317370	Luna	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
20130031191	Bott	Jan 2013	A1
20130031599	Luna et al.	Jan 2013	A1
20130031600	Luna et al.	Jan 2013	A1
20130031601	Bott	Jan 2013	A1
20130040669	Bengtsson et al.	Feb 2013	A1
20130041974	Luna et al.	Feb 2013	A1
20130078999	Martin	Mar 2013	A1
20130083713	Johansson	Apr 2013	A1
20130110636	Bott	May 2013	A1
20130110637	Bott	May 2013	A1

Foreign Referenced Citations (116)

Number	Date	Country
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
1815634	Aug 2007	EP
1815652	Aug 2007	EP
1817883	Aug 2007	EP
2122973	Nov 2009	EP
2206390	Jul 2010	EP
2267968	Dec 2010	EP
2332294	Jun 2011	EP
2378712	Oct 2011	EP
2465275	Jun 2012	EP
2503473	Sep 2012	EP
2556441	Feb 2013	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
4154233	May 1992	JP
10-336372	Dec 1998	JP
2001-218185	Aug 2001	JP
2001-350718	Dec 2001	JP
2001-356973	Dec 2001	JP
2005-515664	May 2005	JP
2009-207177	Sep 2009	JP
4386732	Oct 2009	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-0077515	Jul 2009	KR
2010-0064605	Jun 2010	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 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 2009132700	Nov 2009	WO
WO 2010035108	Apr 2010	WO
WO 2010068842	Jun 2010	WO
WO 2010088074	Aug 2010	WO
WO 2011126889	Oct 2011	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 2012145533	Oct 2012	WO
WO 2012145541	Oct 2012	WO
WO 2012149216	Nov 2012	WO
WO 2012149434	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 2013055413	Apr 2013	WO

Non-Patent Literature Citations (142)

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.
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,806,527, Office Action, 4 pages, Apr. 3, 2013.
Canadian Patent Application No. 2,806,529, Office Action, 4 pages, Apr. 2, 2013.
Canadian Patent Application No. 2,806,557, Office Action, 4 pages, Mar. 21, 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.
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/F12005/050424, International Search Report, 4 pages, Mar. 2, 2006.
International Application No. PCT/F12005/050426, International Search Report, 3 pages, Mar. 1, 2006.
International Application No. PCT/F12005/050441, International Search Report, 3 pages, Mar. 1, 2006.
International Application No. PCT/US2006/023426, International Search Report, 1 pages, 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/024664, International Search Report & Written Opinion, 11 pages, Apr. 1, 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-AOI-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.
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. GB1300808.1, Examination Report, 10 pages, Mar. 11, 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. GB1302158.9, Examination Report, 7 pages, Mar. 15, 2013.
U.K. Patent Application No. GB1302515.0, Examination Report, 3 pages, Mar. 5, 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.
Zhang, Qi et al., “Cloud Computing: State-of-the-Art and Research Challenges,” J Internet Serv Appl, vol. 1, pp. 7-18, 2010.
PCT search report mailed May 28, 2015 for international application No. PCT/US2013/070360.
Non-Final Office Action mailed Apr. 14, 2015 for U.S. Appl. No. 13/708,758.
Office Action mailed on Sep. 25, 2014 for U.S. Appl. No. 13/844,704.
Office Action mailed on Oct. 10, 2014 for U.S. Appl. No. 13/844,682.
Office Action mailed on Oct. 15, 2014 for U.S. Appl. No. 13/844,787.
Non-Final Office Action mailed Jul. 1, 2015 for U.S. Appl. No. 13/787,702.
Final Office Action mailed Jan. 30, 2015 for U.S. Appl. No. 13/844,682.

Related Publications (1)

	Number	Date	Country
	20140177496 A1	Jun 2014	US

Provisional Applications (1)

	Number	Date	Country
	61740392	Dec 2012	US

Systems and methods for application management of mobile device radio state promotion and demotion

Information

Patent Number

Date Filed

Date Issued

Inventors

Original Assignees

Examiners

Agents

CPC

Field of Search

US

CPC

International Classifications

Term Extension

Abstract