Application Data Sheet
`
`Application Information
`
`Application number::
`
`Not yet assigned
`
`Filing Date::
`
`Application Type::
`
`Subject Matter::
`
`Suggested classification::
`
`Suggested Group Art Unit::
`
`CD-ROM or CD-R??::
`
`Number of CD disks::
`
`Number of copies of COs::
`
`Sequence Submission::
`
`Computer Readable Form (CRF)?::
`
`Number of copies of CRF::
`
`Title::
`
`Attorney Docket Number::
`
`Request for Early Publication::
`
`Request for Non-Publication::
`
`Suggested Drawing Figure::
`
`Total Drawing Sheets::
`
`Small Entity?::
`
`Latin name::
`
`Variety denomination name::
`
`Petition included?::
`
`Petition Type::
`
`Licensed US Govt. Agency::
`
`Contract or Grant Numbers One::
`
`Herewith
`
`Provisional
`
`Utility
`
`INTELLIGENT MANAGEMENT OF NON(cid:173)
`
`CACHEABLE CONTENT IN WIRELESS
`
`NETWORKS
`028482-0041 oous
`No
`
`No
`
`1
`
`4
`
`yes
`
`No
`
`Page 1
`
`Initial 11/1/10
`
`Page 1 of 46
`
`GOOGLE EXHIBIT 1013
`
`

`

`Secrecy Order in Parent Appl.::
`
`No
`
`Applicant Information
`
`Applicant Authority Type::
`
`Primary Citizenship Country::
`
`Status::
`
`Given Name::
`
`Middle Name::
`
`Family Name::
`
`Name Suffix::
`
`Inventor
`us
`Full Capacity
`
`Andrei
`
`Ponomarenko
`
`City of Residence::
`
`State or Province of Residence::
`
`Country of Residence::
`
`Street of Mailing Address::
`
`City of Mailing Address::
`
`Campbell
`
`CA
`us
`44 Jim Elder Drive
`
`Campbell
`
`State or Province of mailing address::
`
`Country of mailing address::
`
`CA
`
`US
`
`Postal or Zip Code of mailing address:: 95008
`
`Correspondence Information
`
`Correspondence Customer Number::
`
`20350
`
`Representative Information
`
`Representative Customer Number::
`
`20350
`
`Dome~tic Priority Information
`
`Application::
`
`Continuity Type::
`
`Parent Application:: Parent Filing Date::
`
`Page2
`
`lnitial11/1/10
`
`Page 2 of 46
`
`

`

`Foreign Priority Information
`
`Country::
`
`Application number::
`
`Filing Date::
`
`Assignee Information
`
`Assignee Name::
`
`Street of mailing address::
`
`City of mailing address::
`
`State or Province of mailing address::
`
`Country of mailing address::
`
`Postal or Zip Code of mailing address::
`
`Submitted by:
`
`Signature ______ ...;..;/A_I...:...a.:....:.n_D_ . ...;..;M..:..:;in:..:.s:..:.kl;;:__ ___ _
`
`Date November 1, 2010
`
`Printed Name
`
`Alan D. Minsk
`----------------
`
`Registration Number
`
`35,956
`
`Page 3
`
`lnitial11/1/10
`
`Page 3 of 46
`
`

`

`Attorney Docket No.: 028482-004100
`
`PROVISIONAL PATENT APPLICATION
`
`INTELLIGENT MANAGEMENT OF NON-CACHEABLE
`
`CONTENT IN WIRELESS NETWORKS
`
`Inventor:
`
`Andrei Ponomarenko, a citizen of the United States of America,
`
`residing at Campbell, CA 95008
`
`Assignee:
`
`Seven Networks
`
`Entity:
`
`Small
`
`TOWNSEND and TOWNSEND and CREW LLP
`Two Embarcadero Center, Eighth Floor
`San Francisco, CA 94111-3834
`Tel: 415-576-0200
`
`1
`
`Page 4 of 46
`
`

`

`INTELLIGENT MANAGEMENT OF NON-CACHEABLE
`
`CONTENT IN WIRELESS NETWORKS
`
`In the art today there are performance enhancing proxies and general standards for
`
`improvements of TCP performance in wired and wireless networks. Some of these techniques
`
`use clients and some are clientless. Some can look at network performance to enhance the
`
`optimization they provide. As noted, some may utilize a client and some may operate clientless.
`
`Almost all, if not all, are focused on optimization based on only a one-sided view of the
`
`networks connected to such a platform- either outbound wired, inbound/outbound wireless, or
`
`based solely on the cooperation with a client.
`
`In some embodiments, the present invention is directed to providing a solution to
`
`problems that arise in managing content in a virtual cache, where the cache is specifically
`
`designed and implemented to avoid caching data, typically by changing URI parameters or some
`
`aspect of the content on each request.
`
`Mobile application providers are increasingly using the Internet to provide access to
`
`content, specifically over HTTP. But existing Internet infrastructure, such as caching proxies,.
`
`can create problems by caching data that has an undefined life span. Further, this may happen
`
`even in the presence of no-cache and other standard directives intended to prevent such caching.
`
`To overcome some of these challenges, some application providers have ensured that meta-data,
`
`which has no bearing on the actual content, is changed with each and every request. This meta(cid:173)
`
`data may be provided in the form of the returned content or in the URI itself. By ensuring that
`
`each and every request is different, network based caches are defeated and the caching of data is
`
`prevented.
`
`While the mechanism described (that of changing meta-data) is effective in defeating
`
`network caching, the content itself in many cases may actually be cacheable (and may preferably
`
`be cached to conserve use of resources). Typically, the situation is semi-dynamic; Facebook, for
`
`example has content that changes when a user's friends send messages or change status, etc. This
`
`2
`
`Page 5 of 46
`
`

`

`happens on an irregular basis and during intervals when there is no change, the content is
`
`cacheable. However when it does change, the goal is to deliver the change in a mode that is
`
`perceived by the user to be as close to real time as possible (e.g., when the end user hits a
`
`"refresh button", or on the next pushed or polled event, and not when a cache has expired). By
`
`defeating caching completely the user is always presented with the latest data, but at the expense
`
`of mobile radio resources (signaling, bandwidth and device battery life). Therefore, what is
`
`desired is an intelligent way of dynamically determining when "non-cacheable" content (i.e.,
`
`content that is presented in a manner that would normally prevent it being cached) can be cached
`
`and when it should be presented to the end-user without being cached.
`
`Description of One or More Embodiments of the Invention
`
`Embodiments of the present invention provide a system that optimizes multiple aspects of
`
`the connection with wired and wireless networks and devices through a complete view of activity
`
`including: loading, current application needs on a client, 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 inventive 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 the 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 L TE and WiMAX are focused on providing increased
`
`bandwidth. However, history has shown that this simply doesn't solve all the problems. A key
`
`problem is lack of bandwidth on the signaling channel more so than the data channel.
`
`Embodiments of the present invention align requests from multiple applications to
`
`minimize the need for several polling requests; leverage specific content types to determine how
`
`3
`
`Page 6 of 46
`
`

`

`to proxy/manage a connection/content; and apply specific heuristics associated with device, user
`
`behavioral patterns (how often they interact with the device/application) and network parameters.
`
`Embodiments of the present invention move recurring http polls done by various widgets,
`
`RSS readers etc. to a fixed internet (NOC), thus considerably lowering device battery/power
`
`consumption, radio channel signaling, and bandwidth usage. Additionally, embodiments of the
`
`present invention do this transparently so that existing applications do not need to be changed. In
`
`some embodiments, this can be done by implementing a local proxy on the 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) and automatically caches the content on
`
`the client while delegating the polling to the server (e.g., to a proxy or virtual proxy operated as
`
`an element of a communications network). The server would 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 device (e.g., a handset) does not
`
`need to open up 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 URLs/content to be monitored can 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 skip using
`
`the cache and request the data from the original source may also be used. 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 base their features on resources available in the network, this becomes
`
`increasingly important. Embodiments of the present invention also remove unnecessary chatter
`
`from the network, benefitting the operators trying to optimize the wireless spectrum usage.
`
`In some embodiments, the present invention includes a distributed proxy for network
`
`traffic optimization, as shown in Figure 1. The main components include a proxy client running
`
`4
`
`Page 7 of 46
`
`

`

`on a device [1 05], a proxy server running in the network [1 02], and an internal protocol between
`
`the proxy client and the proxy server [109, 110]. Typically, the proxy client and proxy server
`
`would be implemented as a set of instructions executed by a (micro) processor, although other
`
`implementations are possible (firmware, etc.). The proxy client, shown in Figure 2, includes
`
`connection management functionality [206], application protocol logic modules [213], a local
`
`cache [203], and an interface to retrieve information on device properties (e.g., information on
`
`device battery level, whether the device is being actively used or not, and the registered network)
`
`[210]. The proxy server, shown in Figure 3, includes connection management functionality
`
`[302], application protocol logic modules [31 0], a connection and content metadata database
`
`[303], and a device information database [304].
`
`In general operation, the proxy client [202] is an application independent proxy that
`
`mobile applications [200] can use to open any TCP connection to any host. The proxy client will
`
`detect the type of traffic and utilize an appropriate application protocol module [213] to process
`
`the traffic. With the chosen protocol/logic module, the proxy client may process the data locally
`
`and generate necessary talkback communication using its local cache, communicate the
`
`processed data along with device properties to the proxy server using the internal protocol [11 0],
`
`modify or delay any data before sending it to the proxy server, detect usage patterns between
`
`similar connections and provide this to the proxy server as connection metadata, or any
`
`combination of the above.
`
`If the proxy server is contacted regarding processing the original connection, the proxy
`
`server will utilize an appropriate application protocol module [31 0] to process the traffic. With
`
`the chosen protocol/logic module, the proxy server may contact the intended target of the
`
`connection and route the data from the proxy client to the target, generate talkback
`
`communication using its local cache, modify or delay any talkback communication data based on
`
`the device properties, and based on the connection metadata, start background processing to
`
`gather data for later use with similar connections, as well as any combination of the above.
`
`Both the proxy client and the proxy server will, where applicable continue to observe and
`
`process the data using the application protocol modules for the entire duration of the connection.
`
`5
`
`Page 8 of 46
`
`

`

`After the original connection no longer exists, the proxy client and proxy server may still share
`
`information about the ceased connection and its properties for later use with similar connections.
`
`In this mode of operation, the proxy server may signal the proxy client that some data in its local
`
`cache is no longer up to date (and hence is stale), or alternatively pre-load the client cache with
`
`the fresh data. This can be done in bulk to avoid multiple radio requests, or on an application by
`
`application basis.
`
`From a mobile application's [200] point of view, the proxy is transparent and no
`
`modifications are needed in the way the application uses the connections. Proxy-aware mobile
`
`applications [212] may also be implemented, and can provide additional information about the
`
`connection characteristics to the proxy client.
`
`In some embodiments, the present invention offers benefits with respect to network
`
`usage, in that by serving requests from the local cache, the proxy client reduces the number of
`
`requests that are done over the wireless network. Further, the proxy client and the proxy server
`
`may filter irrelevant data from the communicated data. The proxy client and the proxy server
`
`may also accumulate low priority data and send it in batches to avoid the protocol overhead of
`
`sending individual data fragments. The proxy client and the proxy server may compress or
`
`transcode the traffic, reducing the amount of data sent over a wireless network. The signaling
`
`traffic in a wireless network is reduced, as the wireless network is used less often by optimizing
`
`small bursts away and the network traffic can be synchronized among individual applications.
`
`With respect to the battery life of a mobile device, by serving requests from the local
`
`cache, the proxy client reduces the number of times the radio module is powered up. The proxy
`
`client and the proxy server may 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 proxy client may
`
`synchronize the network usage by performing the hatched data transfer for all connections
`
`simultaneously.
`
`In some embodiments, the present invention may be used in the case of home screen
`
`widget polling for data using HTTP, as shown in Figure 4. In the normal flow of operation, the
`
`6
`
`Page 9 of 46
`
`

`

`widget performs a HTTP request to the data provider server [405, 406]. If the data has been
`
`updated, the widget refreshes itself. The widget waits for a small period of time and starts over at
`
`the initial step. With respect to using a distributed proxy, the widget performs a HTTP request
`
`via the proxy client [ 407, 408]. The proxy client detects the connection type to be a HTTP GET
`
`request. The proxy client checks the local cache for any previous information about the request.
`
`If the locally stored response is not available, the client updates all information about the
`
`request and the time it was made for later use. The client sends the request to the proxy server
`
`and the server performs the request and returns the results. The client stores information about
`
`the result and returns the result to the requestor. If the same request has occurred multiple times
`
`(within a certain time period) and it has often yielded same results, the client notifies the proxy
`
`server that the request should be monitored for result changes [ 409]. If the request was marked
`
`for monitoring, the client will store the results into its local cache. If the locally stored response
`
`is available, the client will return the response from the local cache without performing
`
`communication over the wireless network [413].
`
`Independently of the widget or client operation, the server proxy will perform the
`
`requests marked for monitoring to see whether the response has changed [410]. Whenever an
`
`unexpected response is received for some request, the server will notify the client that the
`
`response has changed and that the locally stored response on the client should be erased or
`
`replaced with a new response [ 416]. A subsequent data request by the client results in the data
`
`being returned from the proxy server [ 417, 418]. A benefit of using the distributed proxy in this
`
`case is that the wireless network is only used whenever the content for the widget has actually
`
`changed; the traffic required to check for the changes is not done over the wireless network. This
`
`reduces the amount of generated network traffic and shortens the total time and the number of
`
`times the radio module is powered up on the mobile device, thus reducing battery consumption.
`
`With respect to polling for changes in a mailbox, in the normal flow of operation, the
`
`mail client opens a connection to the mail server, the mail client authenticates with the server and
`
`queries for new email, and if new mail has arrived, a notification is shown. The mail client then
`
`7
`
`Page 10 of 46
`
`

`

`closes the connection. The mail client waits for a period of time and starts over. A variation is to
`
`leave the connection open and start over at the second step after a predetermined period of time.
`
`In the context of a distributed proxy, the mail client opens a connection to the mail server
`
`via the proxy client, the proxy client detects the traffic type and the chosen application logic
`
`module simulates a mail server authentication, and the proxy client looks up from the local
`
`database whether information about the particular mail connection is available. If the information
`
`is not available, the connection is routed to the proxy server, the proxy server establishes a
`
`connection to the mail server and performs authentication using the data from the mail client, the
`
`data between the mail client and the mail server is directly routed through the proxy connection,
`
`and when the mail client closes the connection, the proxy client may choose to leave the actual
`
`connection to the backend open and store information about the connection into the local
`
`database for later use if the same mail connection has been used frequently. Ifthe information is
`
`available, the client proxy will continue to simulate mail server responses for the mail client for
`
`all queries for which it has the data available. If the mail client performs an operation that cannot
`
`be simulated by the proxy client, the proxy client will route the data to the proxy server and the
`
`proxy server will pass the data to the mail server and route the data between the two. The proxy
`
`server may need to re-establish the connection to the mail server at this point. When the mail
`
`client closes the connection, the proxy client may choose to continue to store information about
`
`the connection for later use or it may request the proxy server to terminate the mail server
`
`connection and remove any information about the connection from the database.
`
`Independently of the mail client or the proxy client, the proxy server will query the mail
`
`server for any changes that the mail client has previously queried. If any information in the mail
`
`server has changed, the proxy server will notify the proxy client to stop simulating any responses
`
`based on locally cached data in order to let the mail client receive the changed data from the mail
`
`server.
`
`Embodiments of the present invention mitigate application protocol keep-alive traffic.
`
`Existing application protocols may provide long lived connections that allow servers to push
`
`updated data to the client without the need of the client to periodically re-establish the
`
`8
`
`Page 11 of 46
`
`

`

`connection or to periodically query for changes. However, the client needs to be sure that the
`
`connection remains usable by periodically sending some data, often called a keep-alive message,
`
`to the server and making sure the server is receiving this data. While the amount of data sent for
`
`a single keep alive message is not significant and the keep-alive interval for an individual
`
`application is not too short, the cumulative effect of multiple applications performing this
`
`operation individually will amount to small pieces of data being sent very frequently. Frequently
`
`sending bursts of data in a wireless network results in high battery consumption by a mobile
`
`device due to the constant need of powering the radio module. Each burst will also require a
`
`significant amount of signaling traffic in a wireless network compared to the actual data being
`
`sent. By using the inventive distributed proxy model, the proxy client can prevent the keep-alive
`
`messages (or at least many of them) from being sent over the network and the proxy server can
`
`independently generate the required keep-alive messages to maintain the actual backend
`
`connection.
`
`In alternative embodiments, the proxy client can be implemented directly into the TCP/IP
`
`stack of the device operating system. The proxy client can be bundled into a wireless modem to
`
`provide transparent use for the device operating system. The proxy client can also be bundled
`
`into a firewall or a router to provide transparent use for the device operating system.
`
`Alternative embodiments apply similar techniques for a variety of protocols including
`
`HTTP, HTTPS, IMAP, POP, SMTP and ActiveSync. Use of application specific protocol
`
`handlers allows for optimization of any protocol that can be port mapped to a hander in the
`
`distributed proxy.
`
`Intelligent Management ofNon-Cacheable Content In Wireless Networks
`
`In some embodiments of the invention, one or more of the following operations or
`
`processes may be implemented to process data associated with "cache-defeating" applications
`
`(i.e., those for which meta-data or another form of data is used to in an attempt to prevent data
`
`caching).
`
`9
`
`Page 12 of 46
`
`

`

`Recognizing "cache-defeating" applications
`
`There are applications that the invention will typically not cache, for instance
`
`applications with time sensitive financial data where content changes frequently and may be
`
`time-critical. To accomplish this goal, the invention will maintain a list of "cache-defeating"
`
`applications to process. The HTTP traffic generated by applications from this list is inspected
`
`for known "cache-defeating" patterns (see below). Traffic not recognized as cache-defeating and
`
`the traffic from other applications is processed outside of the "cache-defeating" processing
`
`module of this invention. The applications outside of this list will fall into a generic processing
`
`scheme, so if they employ cache-defeating URis - no caching will be used. After HTTP traffic is
`
`received by the proxy[202] the logical processing of incoming URI is made to a) detect what
`
`application has sent the traffic b) whether the URI is attempting to defeat caches.
`
`Processing "cache-defeating" URis
`
`Each processed application has a profile that can be used by the client proxy .to process
`
`application-generated URI or other data. The invention recognizes the URI format for key
`
`applications with "cache-defeating" URis (e.g., those on the cache-defeating list). This is done
`
`by converting the incoming URI into a "normalized" URI and comparing that with the existing
`
`cache entries. Since a majority of the cache defeaters employ a schema where a changing
`
`number is attached to the URI, "normalized" URI refers to a URI where this number has been
`
`removed. Existing cache entries are stored and accessed using the "normalized" URI as a key.
`
`If the URI is already cached and the server is monitoring it for content changes, then the
`
`proxy makes a decision if the response can be made using the data stored in the local cache. The
`
`decision is based on the application current background/foreground status and application class
`
`(as described below).
`
`If the URI is not cached, then this HTTP request falls through to the remote web proxy
`
`for regular HTPP processing, the response is read and the decision is made on whether to cache
`
`the content at this point or not. The decision can be based on any suitable criteria, such as
`
`identical contents being returned in response to multiple (e.g., three) requests, but can also be
`
`based on a more complicated analysis (such as being based on application characteristics by
`
`10
`
`Page 13 of 46
`
`

`

`using profiles). If the content is cached, a request to the proxy server is made to set up
`
`monitoring for content changes. The parts of this request may include the original, non(cid:173)
`
`normalized URI, poll frequency and time-to-live information.
`
`The server makes the request using the provided URI and caches the content or unique
`
`metric of the content behind this URI for future comparisons. Using the detected polling
`
`schedule (as described below) the server makes decisions whether the device needs to be updated
`
`with the new content or not.
`
`Polling schedule
`
`Detecting (or determining) a polling schedule can be an important step as it allows the
`
`server to be as close as possible with its polls to the application polls. Many applications employ
`
`a scheduled interval polling, e.g., every 4 hours or every 30 seconds. The client side proxy can
`
`recognize automatic polls based on time measurements and create a automatic polling profile for
`
`an application. As an example, the client attempts to detect the time interval between requests
`
`and after 3-4 polls determines an automatic rate ifthe 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 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 very frequent manual request, the client will substitute it with a default interval
`
`for this application taken from a profile for non-critical applications.
`
`In some embodiments, the client side proxy may keep monitoring the application polls
`
`and update the polling interval. If it changes by more than 30% (or another predetermined value)
`
`from the current value, it is delivered to the server. This approach specifically addresses the
`
`scenario of "lost interest". Also the client can recognize requests made outside of this schedule
`
`and consider them "manual", and treat them accordingly.
`
`Application classes
`
`In some embodiments, applications can be organized into 3 groups:
`
`11
`
`Page 14 of 46
`
`

`

`A) fully cached - client updates only when server tells to update, ignoring manual
`
`requests, server uses the detected automatic profile. Example - sports score applets, Facebook,
`
`every 15 or 30 seconds polls;
`
`B) partially cached- client uses internal cache for automatic schedule requests but passes
`
`through manual requests. Example- Ebay or some Facebook requests; and
`
`C) Never cached- example- real-time stock ticker (but 15 minutes delayed quotes can
`
`be safely placed on 30 seconds schedule- B or even A).
`
`The actual application classification is based on the rate of content change and critical character
`
`of data. Unclassified applications by default are set as class C.
`
`Backlight and active applications
`
`In some embodiments, the client starts by detecting the device backlight status. Every
`
`request that is made with the screen light "off' is allowed to use the local cache if a request with
`
`identical signature is registered with the polling server. If the screen light is "on", further
`
`detection is made for background applications. They are processed identically to the screen light
`
`off situation. Foreground requests use the aforementioned application classification to decide
`
`when cached data is safe to use to process requests.
`
`12
`
`Page 15 of 46
`
`

`

`INTELLIGENT MANAGEMENT OF NON-CACHEABLE
`
`CONTENT IN WIRELESS NETWORKS
`
`What is claimed is:
`
`1.
`
`A method of controlling the operation of a cache located on a client device,
`
`comprising:
`
`determining a status of the client device;
`
`determining if an application making a request for data is one specified as not
`
`accessing the cache located on the client device when responding to a request; and
`
`accessing the cache located on the client device if the application making the
`
`request for the data is not one specified and the status of the device satisfies a predetermined
`
`criteria.
`
`13
`
`Page 16 of 46
`
`

`

`lnternet[10QJ
`
`[106]
`
`Caching Web
`Proxy [101]
`
`[i08]
`
`SEVEN
`Network Ha rmoni:zer
`Server [102]
`
`[110]
`
`SMSC[l03]
`
`MobileCiients r- _
`[105]
`
`I
`
`I
`Figure 1 SEVEN N etvrork Harmonizer System Architecture
`
`14
`
`Page 17 of 46
`
`

`

`Pro,ey-Una\vare<
`Mobile
`Appl icatioo
`[200]
`
`Pro,ey-Awa re Mobile<
`Application
`[212]
`
`411.
`
`Caching
`Policy
`[204)
`
`App.
`Protocols
`[213]
`
`I CJ ient-Side Pracy API [201]
`
`Cl i<ent-Side Pracy [202.]
`
`I
`
`,....,.
`....
`
`"
`
`")
`
`w
`
`Cache
`[203]
`
`........... * - · - -
`
`Traffic
`Shaping
`[205]
`
`Connection
`Management
`[206)
`
`D-evice Operating System
`[211]
`
`D-evice Contett: .API
`[210]
`
`SMSI/F
`[207]
`
`WiFii/F
`[208]
`
`3G/4G 1/F
`[209]
`
`Figure 2 SEVEI"'4 Network Harmonizer Client: Architecture
`
`15
`
`Page 18 of 46
`
`

`

`Web
`.Access.
`[309]
`
`Caching
`Pol icy [30l8
`
`Appl icatioo
`Protocols
`[310]
`
`Proxy Control
`Protocol
`[306]
`
`Hybrid Control
`Protocol
`[30&j
`
`Control
`Protocol
`[307]
`
`SMSControl
`PTotocol
`[305]
`
`Traffic Shaping
`[301]
`
`Connection
`M,a n.agement
`[302]
`
`Con m?ction and
`Content Metadata
`DB [303]
`
`Device I nfbrrnation
`DB [304]
`
`Figure 3 SEVEN N etv.-ork Harmonizer Senter Architecture
`
`16
`
`Page 19 of 46
`
`

`

`I Home Screen I
`
`l Widget [400]
`
`I C!ient-Sid« I
`
`Proxy [401]
`
`I Caehtrog Web I
`
`Proxy [4n2J
`
`! Traffic Harmonizer I I Data Provider Server I
`I Server[403]
`
`[404j
`
`/
`
`"
`
`Data Request [405]
`
`Data Response [406]
`
`Proxied Data Request [4C 7j
`
`'
`
`roxled Data Response [4 8]
`'
`
`Me f!itor Data Request [409!
`
`Proxied Data Request ~ 12]
`
`L Request5at!sfied From ocai Cache [413]
`
`Invalidate Notificatio i)416J
`
`Proxled Data Request ~ 17]
`
`Request5at!sfled From aching Web Proxy [41&j
`
`Monitor Data [410]
`
`same Response [411]
`
`'
`
`I"
`
`Monitor Data [414]
`
`Changed Response [415]
`
`Figure 4 SEVEN Network Harmonizer Distributed Proxy Polling
`
`Page 20 of 46
`
`

`

`Electronic Patent Application Fee Transmittal
`
`Application Number:
`
`Filing Date:
`
`Title of Invention:
`
`INTELLIGENT MANAGEMENT OF NON-CACHEABLE CONTENT IN WIRELESS
`NETWORKS
`
`First Named Inventor/Applicant Name:
`
`Andrei Ponomarenko
`
`Filer:
`
`Alan D. Minsk/Stacy Villa rose
`
`Attorney Docket Number:
`
`028482-0041 oous
`
`Filed as Small Entity
`
`Provisional Filing Fees
`
`Description
`
`Fee Code
`
`Quantity
`
`Amount
`
`Sub-Total in
`USD($)
`
`Provisional Application filing fee
`
`2005
`
`1
`
`110
`
`110
`
`Basic Filing:
`
`Pages:
`
`Claims:
`
`Miscellaneous-Filing:
`
`Petition:
`
`Patent-Appeals-and-Interference:
`
`Post-Allowance-and-Post-Issuance:
`
`Extension-of-Time:
`
`Page 21 of 46
`
`

`

`Description
`
`Fee Code
`
`Quantity
`
`Amount
`
`Sub-Total in
`USD($)
`
`Miscellaneous:
`
`Total in USD ($)
`
`110
`
`Page 22 of 46
`
`

`

`Electronic Acknowledgement Receipt
`
`EFSID:
`
`Application Number:
`
`8744068
`
`61408854
`
`International Application Number:
`
`Confirmation Number:
`
`1743
`
`Title of Invention:
`
`INTELLIGENT MANAGEMENT OF NON-CACHEABLE CONTENT IN WIRELESS
`NETWORKS
`
`First Named Inventor/Applicant Name:
`
`Andrei Ponomarenko
`
`Customer Number:
`
`20350
`
`Filer:
`
`Alan D. Minsk/Stacy Villa rose
`
`Filer Authorized By:
`
`Alan D. Minsk
`
`Attorney Docket Number:
`
`028482-0041 oous
`
`Receipt Date:
`
`01-NOV-201 0
`
`Filing Date:
`
`TimeStamp:
`
`Application Type:
`
`Payment information:
`
`Submitted with Payment
`
`Payment Type
`
`Payment was successfully received in RAM
`
`RAM confirmation Number
`
`Deposit Account
`
`Authorized User
`
`16:19:44
`
`Provisional
`
`yes
`
`Deposit Account
`
`$110
`
`2552
`
`201430
`
`The Director of the USPTO is