Systems and methods for controlling application updates across a wireless interface

Information

  • Patent Grant
  • 10268469
  • Patent Number
    10,268,469
  • Date Filed
    Friday, November 4, 2016
    8 years ago
  • Date Issued
    Tuesday, April 23, 2019
    5 years ago
  • CPC
  • Field of Search
    • CPC
    • G06F8/60-67
    • G06F17/3056
    • G06F17/30598
    • G06F8/656
    • G06F16/285
    • G06F16/252
    • F24F11/006
  • International Classifications
    • G06F9/44
    • G06F9/45
    • G06F9/445
    • G06F8/65
    • G06F8/60
    • G06F16/25
    • G06F16/28
    • G06F8/656
    • Disclaimer
      This patent is subject to a terminal disclaimer.
Abstract
Various embodiments of the present invention are directed to systems, methods, and computer program products for managing connections between a mobile device and a network server over a network connection in a bandwidth-efficient manner. In one embodiment, a mobile device includes a processor, and there are a plurality of services executed by the processor, each of the services receiving information updates over a network connection from a server. At least one update interval function executed by the processor assigns an update interval to each of the services, the update intervals governing when each of the respective services request updated information over the network connection.
Description
TECHNICAL FIELD

This disclosure relates to wireless bandwidth management and more particularly to systems and methods for adaptive bandwidth management in wireless communication systems and even more particularly to systems and methods for efficiently updating applications that reside on a wireless device.


BACKGROUND

In many situations, such as, for example, when it is required to update or change an application that is running on a mobile device, the updated or new information typically is located on the network side of the wireless interface. Thus that information must then be transmitted across the wireless interface to the device, such as a cell phone, where the application resides.


Several problems exist when attempting to manage such application updates. These problems stem from several factors, one of which is that a typical mobile wireless network has high latency and relatively low bandwidth. In addition, the wireless interface is subject to drop-outs and thus often there is difficulty maintaining a channel. Also, the use of the wireless interface causes battery drain on the mobile device and thus there is always concern as to when transmission occurs and for how long.


An additional set of problems exist when the data exchange is via the HTTP protocol which is a client initiated protocol. In this instance, the client being the mobile device. Thus, the situation exists that the update data resides in the network while the connection must be initiated from the mobile device, all while conserving bandwidth and battery life of the mobile device.


BRIEF SUMMARY

The present invention is directed to systems, methods, and computer program products providing client-side setting of application update intervals. In one embodiment, a single persistent wireless interface connection is maintained in a manner that allows for multiplexing several services over that connection. One or more client side interval update functions calculate appropriate update intervals for the various services in a dynamic manner. Therefore, each service that communicates using the network connection has an update interval associated therewith. By managing the data transfer in accordance with the update intervals, the bandwidth of the total data transfer across the interface is managed so as to conserve battery life and minimize the bandwidth required at any point in time. Update intervals can also be used to maximize cost efficiency by, e.g., increasing intervals or stopping automatic updates altogether when network data costs rise. From time to time, the update interval of any given type of data can be adjusted dynamically depending upon one or more factors that can change over time.


The foregoing has outlined rather broadly the features and technical advantages of the present invention in order that the detailed description of the invention that follows may be better understood. Additional features and advantages of the invention will be described hereinafter which form the subject of the claims of the invention. It should be appreciated by those skilled in the art that the conception and specific embodiment disclosed may be readily utilized as a basis for modifying or designing other structures for carrying out the same purposes of the present invention. It should also be realized by those skilled in the art that such equivalent constructions do not depart from the spirit and scope of the invention as set forth in the appended claims. The novel features which are believed to be characteristic of the invention, both as to its organization and method of operation, together with further objects and advantages will be better understood from the following description when considered in connection with the accompanying figures. It is to be expressly understood, however, that each of the figures is provided for the purpose of illustration and description only and is not intended as a definition of the limits of the present invention.





BRIEF DESCRIPTION OF THE DRAWINGS

For a more complete understanding of the present invention, reference is now made to the following descriptions taken in conjunction with the accompanying drawing, in which:



FIG. 1 shows one embodiment of a mobile device utilizing the concepts of the invention;



FIGS. 2 and 3 show embodiments of methods for controlling the operation of the application update function of the device shown in FIG. 1;



FIGS. 4 and 5 show embodiments of methods for controlling the operation of services according to the interval function of the device shown in FIG. 1; and



FIG. 6 illustrates an example computer system 600 adapted according to embodiments of the present invention.





DETAILED DESCRIPTION


FIG. 1 shows one embodiment 10 of a mobile device 100 (only a portion of which is illustrated) utilizing the concepts of the invention. Connection 12 exists between device 100 and network server 11. Connection 12 has a bandwidth limitation, either imposed by the physical network or imposed by the user such that the user is only willing to pay for a certain amount of data transmission (often measured in bytes per unit time). Sometimes the cost per byte is less expensive at certain times (such as at night) so the user prefers to use “night” bytes instead of “day” bytes when possible. In fact, many kinds of limitations exist and may be addressed by various embodiments of the invention. For example, there are utilization limitations assigned by networks (WiFi, Edge, UMTS, etc.), user assigned limits (e.g., to control costs), network operator assigned limits, application/service assigned limits, and the like, all of which may be addressed by one or more embodiments.


Device 10 contains service manager 13 which in turn controls various services (or data types) 13-1 to 13-N. Each of the services 13-1 to 13-N has associated therewith a priority function 14. The purpose of each service 13-1 through 13-N is to perform a particular function (application) that ultimately results in data displayed to the user via display 15. Each service 13-1 through 13-N requires some time (bandwidth) on the wireless interface and service manager 13 balancing each bandwidth request against all other service bandwidth requests against a number of factors. The priority of each service is incorporated into the priority function for each service. Since the overall connection has a bandwidth limit, the availability of the connection to any particular service is balanced across all services according to an individual priority function associated with each service. Since the output of the priority function for a given service can change from time to time (as well as the function itself), the use of the connection is dynamically balanced according to a complex and changing set of criteria, which may include user load patterns, behavior, or any characteristic or behavior expressed by the user (direct or through observation) that may be quantified. Thus, the system will indirectly balance itself in accordance with each user's needs and desires. This adaptation can use a variety of functions, such as, for example, linear, moving average, digital filter (FIR, IIR), Bayesian or support vector machine and can support active, adaptive or designed balancing or combinations thereof.


For example, assume a user desires to use only one megabyte per day. That megabyte is rationed out in some order during the day according to a plan for that user. The plan can, for example, be based on statistics or any stochastic process, for example, selecting a service to run (out of multiple services) for the current interval based on a number or value associated with that service, the value of which is determined dynamically according to a function as described. This function may be different for different services or for different users, or on any one of many other techniques, such as, for example, probability of usage of target application or data, neural network, location-based function, GPS.


In a system with scarce resources (e.g., bandwidth), there will typically be multiple competing services at any one interval. As the number of resources increases and the number of services stays the same, competition at any given interval decreases. Systems may be managed by using techniques that modify the interval for a given service and/or alter the instantaneous priority (the priority during the current interval). Both of these values are produced through a function that may operate according to multiple techniques and consider complex criteria. In many systems, there is not a single function for calculating all priorities and intervals, but rather a separate function may be employed on each type of service (or each individual service) and may vary by application and user. The air transport time is then rationed at so many megabytes per hour, if desired. The service manager then will only allow the connection to be used up to the threshold limit. To accomplish this, the service manager periodically pulls through the list of services that require bandwidth and processes the highest priority service first until it reaches the bandwidth limit set for the connection. The service manager then waits until the next pulling interval and repeats the process. The priority functions themselves are constantly changing their priority levels and thus at each polling opportunity the highest priority functions are served first. The services are also changing their polling intervals at each opportunity in concert or independently with the changes in priority.


For example, assume that a user desires to have a weather application, a news application and a sports application. The weather application may have a high priority assigned to it during the hours of 6 AM to say 9 AM. Thus, during these hours the weather information is updated every, say ten minutes. Likewise, the news application has a high priority in the morning but then switches so that only “breaking” news stories are reported during the day. The sports application has a priority such that scores are reported only at 6 AM and then again only at 10 PM, except that when a favorite team (or teams) are actually playing then the priority changes to every five minutes.


Another example would be when the user performs an action, such as pressing a key or changing the view on the display. This action then could immediately change the priority function of the associated application (service). This then would allow the service manager to control updates on a more immediate basis.


Many wireless devices, such as for example, cellular telephones, allow communications over several channels, One such channel is a main two-way real time channel which is typically used for concurrent bidirectional speech communications. Another channel, for example, is a data channel that could be used separately from the speech channel. While the concepts discussed herein can be used on either channel, it is expected that the service manager will use the data channel. During the time the service manager is managing the connection, there can be a side channel of HTTP headers, such as headers 101. These side channel headers piggyback on other messages. For instance, if service A is communicating with server 11, service B can also communicate with the server at the same time on the same message using a side channel message such as message 102.


The purpose of the side channel is to process certain class of service requests that are small but frequent or potentially frequent, but where it is not necessary to establish an explicit transaction on the network. Thus, when one service makes a request and gets a response, several other services can have their small but important requests multiplexed on the established requests so that they effectively share that time slice. An example would be for an application to check for the presence of an update such that if an update exists (i.e. there is a “flag” set). Thus, the flag message can serve to allow time to be scheduled for the actual updating of the application.


Note that while FIG. 1 shows a single manager and only one connection, in actuality there can be many connections, each with a service manager. In one embodiment, each connection is to a separate URL and thus there is a one to one relationship between the service manager and a connection. In this embodiment, all services which connect to the same host (URL) are associated with the same single service manager and with the same connection. In this manner when processing service requests, the system can connect to the same host and port and thus the connection can be opened only once for all the applications that communicate with the same server. This reduces the overhead of the communication by leaving the socket open for multiple services. In turn, this reduces battery usage because the device radio is used less.


Another example of dynamic function changing is when messages are being sent back and forth to another mobile device. The user then wants the message sending and receiving service to have a high priority during this exchange but then also wants that priority to taper off over time as the conversation dies so that the device does not use up a lot of network bandwidth checking for messages. The priority function could be anything that is reset by user actions. Examples of priority changes are: periodic, constant, decreasing priority, increasing priority.


Another example would be using statistics about times when network access has been accomplished or when things are available. This would work well for applications that change over time, such as a traffic map. The priority function would track and the changes in traffic patterns during, for example, rush hours and could therefore dynamically increase and decrease it's priority assigned to updating the information from the server.


The priority could be tailored to usage. For instance, if the user always begins his/her day by looking at the traffic information, then checking the news and then looking at the weather icon on the display. These items can be clustered to update as a group. Using this arrangement, the system might be a little late on traffic, but will be ahead on the other services in that group. For a flight icon (tile), for instance, one of things that affects the priority might be the proximity in time to the flight. As the flight time approaches, the priority can go higher for updating departure and gate information. The system might update once a day when the flight is a couple of days out, and then start updating at, say, 15 minute intervals, when it is within a few hours of flight time.


Also, the system might have a flight tile that contains several airlines on it. When the tile is selected the system could determine which airline has the highest priority from the several possible airlines on the tile with the priority based on calendar information available to the system. Thus, if the user is booked on an American Airlines flight the user probably does not need an update of Continental flights at that point in time.


Thus, by having access to other information, the priority of the information into the phone can be managed consistent with reducing bandwidth and battery drain in order to give the user increased value from the device. Thus, when it is snowing outside, the phone could sound an alarm earlier than normal to alert the user to longer commute times based on the knowledge of the weather and the user's calendar of scheduled activities.


Alternatively to, or in addition to, priority functions (e.g., function 14), embodiments of the present invention employ interval functions, such as interval function 16. For example, system 10 uses interval function 16 to manage services 13-1 to 13-N as they communicate over connection 12 by setting the intervals at which they update. Many embodiments manage the setting of updating intervals dynamically—that is, as each of services 13-1 to 13-N execute on the client's processor. For example, interval function 16 can be programmed to set an updating interval for a service each time the given service runs or each time a user accesses the given service. Service manager 13 then uses then controls the update requests according to the set intervals.


The calculation of the interval is based on one or more factors. For instance, factors such as user behavior, network characteristics, time of day, day of week, hours of operation, battery charge level, and the like may be used to set an interval for a service. For instance, for a stock feed service, interval function 16 would not request the feed after 4:00 P.M., since stock prices in most US markets are not updated after that time. However, during business hours, the updating interval may be based on other factors, including user preference, availability of updates, availability of network bandwidth, and the like.


A factor that is often important in some embodiments is network characteristics, such as price for data transfer, type of network, and home/roaming status. For instance, when a user is roaming, especially internationally, prices for use are much, much higher compared to typical home and domestic prices. Thus, a user typically does not want to use a roaming network abroad, but the same user would typically want to take advantage of the network if the device was tethered to a wire connection or running WiFi (IEEE 802.11 standard). Interval function 16 detects network characteristics and sets intervals in light of such factors. For example, interval function 16 may lengthen intervals or stop all automatic updating when roaming, while enabling automatic updating and/or shortening intervals when connected to a Local Area Network (LAN, such as may employ Ethernet, WiFi, WiMax, and/or the like).


In fact, any of the parameters that can be used to set priority (as described above) can also be used by some embodiments to set updating intervals. Factors that result in priority being increased can also be used to shorten updating intervals, while factors that result in priority being lowered may be used to increase updating intervals. Such factors include, e.g., user action, type of application (e.g., news, weather, traffic, flight information), proximity to user commitment (e.g., flight departure), and the like. Further, priority levels can even be used to assign updating intervals, since priority levels are often good indicators of application importance and relevance at a given time.


As shown in FIG. 1, interval function 16 exists on mobile device 100. Thus, the setting of the update intervals is performed on the client side rather than on the server side in the illustrated example. Client-side interval functions have not been provided in the prior art, due at least in part to an accepted belief that all complex calculations should be performed on servers rather than on handheld devices. This belief has arisen mostly because of limited processing power of handheld devices that caused decreases in user performance as more processing power was consumed. However, very recent trends in hardware have allowed more processing to be performed on handheld devices.


Embodiments of the invention provide one or more advantages over prior art systems. For instance, an advantage of performing interval and priority setting on client devices is that it allows intervals and priorities to be set using local user context. For instance, a user's device often “knows” if a user is roaming, whereas a server on the Internet may not be aware that the user is roaming. Thus, a client-side interval function (e.g., interval function 16) can dynamically set update intervals in response to roaming status, thereby providing a user with greater cost efficiency.


While interval function 16 is shown in FIG. 1 as assigning intervals to each of services 13-1 to 13-N, it should be noted that some embodiments may include one interval function as part of each respective service. For example, some embodiments include interval functions 16-1 through 16-N (not shown), each being part of its respective service 13-1 to 13-N. Embodiments of the invention can use either configuration.


Further, some embodiments include only interval function 16, while other embodiments, such as the one shown in FIG. 1, include both priority function 14 and interval function 16. Embodiments that employ both of priority function 14 and interval function 16 are possible because priority and update intervals are concepts that are complementary, rather than being mutually exclusive. Generally, updating intervals are different from priority settings in various ways. For example, priority settings are usually used to determine which service goes first when two or more services are scheduled to make a request at or near the same time. By contrast, updating intervals determine, at least in part, how often a service makes requests for information.


Typically, priority is more important when there are a number of services that are executing and updating at the same time. Priority can be used to determine which serviced make their requests first. On the other hand, if there are not a lot of services on a device, then one or more interval functions can stagger the service intervals in time so that the services will not conflict. Further, in a device with many services, an update interval function can provide a way to manage bandwidth use.



FIGS. 2 and 3 show embodiments of methods for controlling the operation of the application update function of the device shown in FIG. 1. In FIG. 2, embodiment 20 begins with process 201 determining if it is time for accessing a particular network server for those applications which rely on that server for updated information. This time is determined by a combination of calculations based on current battery level, time of day, current activity of the user with respect to the device, how long it has been since the last access to the server, how much data has already been transmitted in a given unit of time, etc. When it is time to make an access, then process 202 checks each service to determine relative priority of that application and then based on the relative priority and the available bandwidth for that connection, as determined by process 201, working in conjunction with process 210, one or more applications are updated by process 203.


Process 204 determines whether there are side channel communications that need to occur, and if so, process 205 schedules those communications.


Processes 301, 302 and 303 of embodiment 30, as shown in FIG. 3, are examples of processes that determine if a priority is to be changed at a particular time. Thus, process 301 determines if a service is being used by the user, process 302 determines if the user has changed the display (for example, by selecting a tile, or a particular service within a tile); and process 303 determines if there is some external reason to change priority. Such an external reason could be, for example, a breaking news story, a sports event going into overtime, weather conditions turning hazardous, etc.


Process 304 then coordinates this information with process 210, as shown in FIG. 2, so as to change the priority of the service. Process 305 determines when a user has stopped using a service. For example, instant messaging is finished and thus the priority for that service can return to its normal priority level. Note that the examples discussed above are only a few of the many factors that can change priority on a dynamic basis and in many situations multiple factors are used to determine relative priority and timing for a network server access, all coordinated to conserve bandwidth and battery life for the user. In one embodiment, the operations in the device are controlled by machine executable code running under control of, for example, processor 131.



FIGS. 4 and 5 show embodiments of methods for controlling the operation of services according to the interval function of the device shown in FIG. 1. Method 400 is performed, for example, by a handheld device, such as a cellular phone, a handheld computer, an email checking device, a handheld multi-media device, or the like. Specifically, method 400 is performed by a processor on such device as it runs one or more update interval functions (e.g., interval function 16 of FIG. 1).


In step 401, update intervals are set for services on the device using one or more factors. Examples of such factors are discussed above. In the embodiment shown in FIG. 4, the mobile device cycles through all services to assign them update intervals, as shown in steps 401 and 402. However, not all embodiments are limited thereto. Setting updates for a service can be performed at any of a variety of times, such as at boot-up the mobile device, when a service is first run, or any other time.


In step 403, the requests are executed according to the update intervals. For example, some services are updated at different intervals than other services. In step 404, it is determined whether an interval should be changed for one or more services. The interval for a given service can be changed for any of a variety of reasons, including a detected change in one or more factors used to set the intervals (e.g., time of day, roaming status change, etc.), user access of a service, and the like. Step 404 acknowledges that the intervals in various embodiments are set dynamically and change “on the fly” as the mobile device operates. For instance, a mobile device may change intervals for some or all of its services when the device begins roaming.


If there is no reason to change an interval, the method progresses to step 403. If an interval is to be changed, the method progresses to step 405 where the interval is changed based on one more factors. Then, the method progresses to step 403.


Method 400 is exemplary, and other methods within the scope of various embodiments may add, omit, change, or rearrange steps. For instance, as mentioned above, assignments of intervals to services can occur at any of a variety of times during operation of the device. Further, steps 401-405 may be repeated throughout operation of the device.


Method 500 is an exemplary method for performing service updates according to both priorities and assigned intervals. Method 500 is performed, for example, by a handheld device, such as a cellular phone, a handheld computer, an email checking device, a handheld multi-media device, or the like. Specifically, method 500 is performed by a processor on such device as it runs one or more update interval functions (e.g., interval function 16 of FIG. 1).


In step 501, it is determined that an interval indicates that information should be updated to a service. In step 502, it is discerned whether other services of higher priority are also set to update at the same time. If so, then the higher-priority services are updated first at step 503. If not, then the service is updated according to the set interval at step 504.


Method 500 is exemplary, and other methods within the scope of various embodiments may add, omit, change, or rearrange steps. For instance, steps 501-504 may be repeated throughout operation of the device, and the set interval may change dynamically.


When implemented via computer-executable instructions, various elements of embodiments of the present invention are in essence the software code defining the operations of such various elements. The executable instructions or software code may be obtained from a readable medium (e.g., a hard drive media, optical media, RAM, EPROM, EEPROM, tape media, cartridge media, flash memory, ROM, memory stick, and/or the like). In fact, readable media can include any medium that can store information.



FIG. 6 illustrates an example computer system 600 adapted according to embodiments of the present invention. It is understood that computer system 600 conforms to a basic exemplary architecture that is common to processor-based devices, such that computer system 600 comprises an example system on which embodiments of the present invention may be implemented (such the mobile device of FIG. 1). However, it is also understood that specific devices may vary in their architectures and still be encompassed in one or more embodiments of the invention.


Central processing unit (CPU) 601 is coupled to system bus 602. CPU 601 may be any general purpose CPU, special purpose CPU, or even a processor (or chip set) specially adapted for use in mobile devices. However, the present invention is not restricted by the architecture of CPU 601 as long as CPU 601 supports the inventive operations as described herein. CPU 601 may execute the various logical instructions according to embodiments of the present invention. For example, one or more CPUs, such as CPU 601, may execute machine-level instructions according to the exemplary operational flows described above in conjunction with FIGS. 2-5.


Computer system 600 also preferably includes random access memory (RAM) 603, which may be SRAM, DRAM, SDRAM, or the like. Computer system 600 preferably includes read-only memory (ROM) 604 which may be PROM, EPROM, EEPROM, or the like. RAM 603 and ROM 604 hold user and system data and programs, as is well known in the art.


Computer system 600 also preferably includes input/output (I/O) adapter 605, communications adapter 611, user interface adapter 608, and display adapter 609. I/O adapter 605, user interface adapter 608, and/or communications adapter 611 may, in certain embodiments, allow a user to interact with computer system 600 in order to input information, such as selection of an application.


I/O adapter 605 preferably connects to storage device(s) 606, such as one or more of hard drive, compact disc (CD) drive, floppy disk drive, tape drive, etc. to computer system 600. The storage devices may be utilized when RAM 603 is insufficient for the memory requirements associated with storing media data. Communications adapter 611 is preferably adapted to couple computer system 600 to network 612 (e.g., the Internet, a LAN, a cellular network, etc.). User interface adapter 608 couples user input/output devices, such as keyboard 613, microphone 614 speaker(s) 615, to computer system 600. Display adapter 609 is driven by CPU 601 to control the display on display device 610 (which may be a touchscreen adapted for use in a mobile device) to, for example, display tiles.


System 600 can be adapted as any of a variety of mobile devices, including, but not limited to, a cell phone, an email device (e.g., a BLACKBERRY device available from Research in Motion), a multi-media device (e.g., an IPHONE, available from Apple Inc.), a personal digital assistant, and the like. Moreover, embodiments of the present invention may be implemented on application specific integrated circuits (ASICs) or very large scale integrated (VLSI) circuits. In fact, persons of ordinary skill in the art may utilize any number of suitable structures capable of executing logical operations according to the embodiments of the present invention.


Although the present invention and its advantages have been described in detail, it should be understood that various changes, substitutions and alterations can be made herein without departing from the spirit and scope of the invention as defined by the appended claims. Moreover, the scope of the present application is not intended to be limited to the particular embodiments of the process, machine, manufacture, composition of matter, means, methods and steps described in the specification. As one of ordinary skill in the art will readily appreciate from the disclosure of the present invention, processes, machines, manufacture, compositions of matter, means, methods, or steps, presently existing or later to be developed that perform substantially the same function or achieve substantially the same result as the corresponding embodiments described herein may be utilized according to the present invention. Accordingly, the appended claims are intended to include within their scope such processes, machines, manufacture, compositions of matter, means, methods, or steps.

Claims
  • 1. A method executable at an electronic device with one or more processors, the method comprising: without user interaction, dynamically adjusting a priority of a respective application, relative to a priority of another application on the electronic device, for requesting updated application data over a network connection, including dynamically adjusting an update interval governing when the respective application requests updated application data over the network connection, wherein the dynamic adjusting of the update interval for the respective application is based at least on one or more factors of the group consisting of: a probability of using the respective application, andwhether the respective application is to be updated with one or more additional applications as a group; andretrieving updated application data over the network connection, wherein the updated application data are retrieved according to the adjusted update interval.
  • 2. The method of claim 1, wherein the electronic device is a mobile device having a touchscreen display.
  • 3. The method of claim 1, wherein: the electronic device includes a display; anda view on the display changes in response to a selection of the application.
  • 4. The method of claim 1, wherein the dynamic adjusting of the update interval for the application is further based on information indicating whether the other applications are set to be updated at a same time as the respective application.
  • 5. The method of claim 1, wherein a first application included in the group is selected at a different time from a second application included in the group.
  • 6. The method of claim 1, further comprising: determining whether a second application has a higher update priority than an update priority of the application;in accordance with the higher update priority of the second application, retrieving updated application data for the second application prior to retrieving the updated application data for the application.
  • 7. An electronic device, comprising: one or more processors;memory; andone or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the one or more processors, the one or more programs including instructions for:without user interaction, dynamically adjusting a priority of a respective application, relative to a priority of another application on the electronic device, for requesting updated application data over a network connection, including dynamically adjusting an update interval governing when the respective application requests updated application data over the network connection, wherein the dynamic adjusting of the update interval for the respective application is based at least on one or more factors of the group consisting of: a probability of using the respective application, andwhether the respective application is to be updated with one or more other additional applications as a group; andretrieving updated application data over the network connection, wherein the updated application data are retrieved according to the adjusted update interval.
  • 8. The electronic device of claim 7, wherein the electronic device is a mobile device having a touchscreen display.
  • 9. The electronic device of claim 7, wherein: the electronic device includes a display; anda view on the display changes in response to a selection of the application.
  • 10. The electronic device of claim 7, wherein the dynamic adjusting of the update interval for the respective application is further based on information indicating whether the other applications of the plurality of applications are set to be updated at a same time as the respective application of the plurality of applications.
  • 11. The electronic device of claim 7, wherein a first application included in the group is selected at a different time from a second application included in the group.
  • 12. The electronic device of claim 7, the one or more programs further including instructions for: determining whether a second application has a higher update priority than an update priority of the application;in accordance with the higher update priority of the second application, retrieving updated application data for the second application prior to retrieving the updated application data for the application.
  • 13. A non-transitory computer readable medium having instructions stored thereon, the instructions, when executed by an electronic device with one or more processors, cause the processors to perform operations comprising: without user interaction, dynamically adjusting a priority of a respective application, relative to a priority of another application on the electronic device, for requesting updated application data over a network connection, including dynamically adjusting an update interval governing when the respective application requests updated application data over the network connection, wherein the dynamic adjusting of the update interval for the respective application is based at least on one or more factors of the group consisting of: a probability of using the respective application, andwhether the respective application is to be updated with one or more additional applications as a group; andretrieving updated application data over the network connection, wherein the updated application data are retrieved according to the adjusted update interval.
  • 14. The computer readable medium of claim 13, wherein the electronic device is a mobile device having a touchscreen display.
  • 15. The computer readable medium of claim 14, wherein an application is displayed on the touchscreen display as an icon, and the icon is selectable by a touch gesture on the touchscreen display.
  • 16. The computer readable medium of claim 13, wherein: the electronic device includes a display; and a view on the display changes in response to a selection of the application.
  • 17. The computer readable medium of claim 13, wherein the dynamic adjusting of the update interval for the respective application is further based on information indicating whether the other applications are set to be updated at a same time as the respective application.
  • 18. The computer readable medium of claim 13, wherein multiple applications are included in the group.
  • 19. The computer readable medium of claim 13, wherein a first application included in the group is selected at a different time from a second application included in the group.
  • 20. The computer readable medium of claim 13, further including instructions that cause the processors to perform operations comprising: determining whether a second application has a higher update priority than an update priority of the application;in accordance with the higher update priority of the second application, retrieving updated application data for the second application prior to retrieving the updated application data for the application.
CROSS-REFERENCE TO RELATED APPLICATIONS

This patent application is a continuation of U.S. patent application Ser. No. 14/563,487, filed Dec. 8, 2014, which is a continuation of U.S. patent application Ser. No. 11/956,253, filed Dec. 13, 2007, now U.S. Pat. No. 8,914,786, all of which are incorporated herein by reference. This application is also related to concurrently filed, co-pending, and commonly-assigned U.S. patent application Ser. No. 11/690,582, filed Mar. 23, 2007; U.S. patent application Ser. No. 11/690,591 filed Mar. 23, 2007; and U.S. patent application Ser. No. 11/690,602 filed Mar. 23, 2007, now U.S. Pat. No. 8,073,474, all of which are incorporated herein by reference.

US Referenced Citations (186)
Number Name Date Kind
5619250 McClellen et al. Apr 1997 A
5627842 Brown et al. May 1997 A
5694537 Montenegro et al. Dec 1997 A
5708711 Rosauer et al. Jan 1998 A
5867281 Nozoe et al. Feb 1999 A
5896566 Averbuch et al. Apr 1999 A
6167567 Chiles et al. Dec 2000 A
6697642 Thomas Feb 2004 B1
6745224 D'Souza et al. Jun 2004 B1
6820259 Kawamata et al. Nov 2004 B1
6826614 Hanmann et al. Nov 2004 B1
6854016 Kraenzel et al. Feb 2005 B1
6879729 Kamath et al. Apr 2005 B2
7024491 Hanmann et al. Apr 2006 B1
7155528 Tam Dec 2006 B2
7165250 Lyons Jan 2007 B2
7194551 Moll et al. Mar 2007 B1
7274926 Laumen et al. Sep 2007 B1
7320010 Peng Jan 2008 B2
7353034 Haney Apr 2008 B2
7437169 Khoury et al. Oct 2008 B2
7447520 Scott Nov 2008 B2
7463631 Bao et al. Dec 2008 B2
7484175 Kirkland Jan 2009 B2
7584467 Wickham et al. Sep 2009 B2
7596784 Abrams et al. Sep 2009 B2
7624393 Egan Nov 2009 B2
7660581 Ramer et al. Feb 2010 B2
7707570 Yoshimura et al. Apr 2010 B2
7716662 Seiden May 2010 B2
7769144 Yao et al. Aug 2010 B2
7774356 Cui Aug 2010 B2
7783733 Yip et al. Aug 2010 B1
7865828 Hanson, II et al. Jan 2011 B1
7930354 Vuong et al. Apr 2011 B2
7949353 Pollock et al. May 2011 B2
7954124 Rambo May 2011 B2
8000457 Harper Aug 2011 B2
8036330 Nelson Oct 2011 B2
8201164 Reus Jun 2012 B2
8275659 Ellis et al. Sep 2012 B2
8775964 Hayashi et al. Jul 2014 B2
20010056496 Tam Dec 2001 A1
20020002581 Siddiqui Jan 2002 A1
20020016959 Barton et al. Feb 2002 A1
20020022516 Forden Feb 2002 A1
20020051017 Wishoff May 2002 A1
20020069284 Slemmer et al. Jun 2002 A1
20020069298 Birkler et al. Jun 2002 A1
20020072353 Kim Jun 2002 A1
20020107930 Itoh Aug 2002 A1
20020144233 Chong et al. Oct 2002 A1
20020144273 Reto Oct 2002 A1
20020171691 Currans et al. Nov 2002 A1
20020178022 Anderson et al. Nov 2002 A1
20020188676 Iai et al. Dec 2002 A1
20020188937 Webster et al. Dec 2002 A1
20030055908 Brown et al. Mar 2003 A1
20030065738 Yang et al. Apr 2003 A1
20030065941 Ballard et al. Apr 2003 A1
20030080998 Gonzalez May 2003 A1
20030081621 Godfrey et al. May 2003 A1
20030095527 Shanbhag May 2003 A1
20030163551 Riordan Aug 2003 A1
20030177179 Jones et al. Sep 2003 A1
20030177198 Yabe et al. Sep 2003 A1
20030187938 Mousseau et al. Oct 2003 A1
20030195950 Huang et al. Oct 2003 A1
20030233648 Earl et al. Dec 2003 A1
20040015956 Barfield Jan 2004 A1
20040073901 Imamatsu Apr 2004 A1
20040103411 Thayer May 2004 A1
20040109436 Vargas et al. Jun 2004 A1
20040111612 Choi et al. Jun 2004 A1
20040162882 Mora Aug 2004 A1
20040186897 Knauerhase et al. Sep 2004 A1
20040203803 Taylor Oct 2004 A1
20040210628 Inkinen et al. Oct 2004 A1
20040214609 Sagi et al. Oct 2004 A1
20040215755 O'Neill Oct 2004 A1
20040221289 D'Souza et al. Nov 2004 A1
20040255287 Zhang et al. Dec 2004 A1
20040261071 Chuang et al. Dec 2004 A1
20050060365 Robinson et al. Mar 2005 A1
20050060374 Phillips Mar 2005 A1
20050064887 Bengtsson et al. Mar 2005 A1
20050066019 Egan Mar 2005 A1
20050076333 Leclair et al. Apr 2005 A1
20050086654 Sumi Apr 2005 A1
20050091651 Curtis et al. Apr 2005 A1
20050102351 Jiang et al. May 2005 A1
20050120346 Sprigg Jun 2005 A1
20050147130 Hurwitz et al. Jul 2005 A1
20050177827 Fong et al. Aug 2005 A1
20050188369 Evers Aug 2005 A1
20050210459 Henderson et al. Sep 2005 A1
20050257214 Moshir et al. Nov 2005 A1
20060020938 Elcock et al. Jan 2006 A1
20060026304 Price Feb 2006 A1
20060030891 Saltzstein et al. Feb 2006 A1
20060046706 Lin et al. Mar 2006 A1
20060047775 Bruck et al. Mar 2006 A1
20060067502 Bamrah et al. Mar 2006 A1
20060069753 Hu Mar 2006 A1
20060069769 Dacosta Mar 2006 A1
20060073812 Punaganti Venkata et al. Apr 2006 A1
20060080656 Cain Apr 2006 A1
20060084450 Dam Nielsen et al. Apr 2006 A1
20060089152 Mahonen Apr 2006 A1
20060106806 Sperling et al. May 2006 A1
20060112380 Heller et al. May 2006 A1
20060130035 Shih et al. Jun 2006 A1
20060130053 Buljore et al. Jun 2006 A1
20060155785 Berry et al. Jul 2006 A1
20060184927 Deblaquiere et al. Aug 2006 A1
20060218294 Rosenberg Sep 2006 A1
20060230398 Yokota Oct 2006 A1
20060271618 Kokubo et al. Nov 2006 A1
20070019793 Cheng Jan 2007 A1
20070021116 Okita Jan 2007 A1
20070060206 Dam Nielsen et al. Mar 2007 A1
20070066283 Haar et al. Mar 2007 A1
20070073665 Naganuma et al. Mar 2007 A1
20070079291 Roth Apr 2007 A1
20070080954 Griffin et al. Apr 2007 A1
20070087756 Hoffberg Apr 2007 A1
20070094655 Rostampour Apr 2007 A1
20070101328 Baron et al. May 2007 A1
20070104158 Liang et al. May 2007 A1
20070106979 Felts May 2007 A1
20070118617 Lee et al. May 2007 A1
20070136264 Tran Jun 2007 A1
20070156706 Hayes Jul 2007 A1
20070157192 Hoefler Jul 2007 A1
20070173268 Le Bodic et al. Jul 2007 A1
20070174445 Kim Jul 2007 A1
20070184820 Marshall Aug 2007 A1
20070192763 Helvick Aug 2007 A1
20070198698 Boyd et al. Aug 2007 A1
20070198981 Jacobs Aug 2007 A1
20070201502 Abramson Aug 2007 A1
20070220510 Bell Sep 2007 A1
20070229462 Huynh et al. Oct 2007 A1
20070242619 Murakami Oct 2007 A1
20070265025 Commarford et al. Nov 2007 A1
20070277028 Cates et al. Nov 2007 A1
20070294380 Natarajan et al. Dec 2007 A1
20070294640 Eskelinen et al. Dec 2007 A1
20070300265 Karkkainen Dec 2007 A1
20080005732 Coon Jan 2008 A1
20080027669 Escott Jan 2008 A1
20080049714 Commarford et al. Feb 2008 A1
20080052701 Abernethy et al. Feb 2008 A1
20080066113 Skelly Mar 2008 A1
20080092156 Ferrone Apr 2008 A1
20080127088 Harmsen et al. May 2008 A1
20080132254 Graham et al. Jun 2008 A1
20080134145 Halcrow Jun 2008 A1
20080134211 Cui Jun 2008 A1
20080141261 Machida Jun 2008 A1
20080154805 Gurumoorthy et al. Jun 2008 A1
20080159457 Nelson Jul 2008 A1
20080162649 Lee et al. Jul 2008 A1
20080168391 Robbin et al. Jul 2008 A1
20080201702 Bunn Aug 2008 A1
20080201717 Kapadi Aug 2008 A1
20080209317 SanGiovanni et al. Aug 2008 A1
20080216022 Lorch et al. Sep 2008 A1
20080274723 Hook et al. Nov 2008 A1
20080320050 Chan Dec 2008 A1
20090031299 Karstens Jan 2009 A1
20090042599 Scott Feb 2009 A1
20090055683 Wells et al. Feb 2009 A1
20090089777 Fuller Apr 2009 A1
20090094107 Torkelson et al. Apr 2009 A1
20090100419 Childress et al. Apr 2009 A1
20090138477 Piira et al. May 2009 A1
20100099441 Agarwal et al. Apr 2010 A1
20100113072 Gibson et al. May 2010 A1
20120207098 Cooley et al. Aug 2012 A1
20120208568 Cooley Aug 2012 A1
20120210306 Tucker et al. Aug 2012 A1
20120210310 Cooley et al. Aug 2012 A1
20120210313 Cooley et al. Aug 2012 A1
20140051423 Marsden et al. Feb 2014 A1
20150095901 Cooley et al. Apr 2015 A1
Foreign Referenced Citations (2)
Number Date Country
1 672 512 Jun 2006 EP
WO 2006132514 Dec 2006 WO
Non-Patent Literature Citations (52)
Entry
Jan Lindstrom, Dynamic Adjustment of Serialization Order using Timestamp Intervals in Real-Time Databases, 1999, pp. 1-8. https://www.cs.helsinki.fi/u/jplindst/papers/rtcsa1999.pdf (Year: 1999).
Jie Yang, A Tool for Belief Updating over Time in Bayesian Networks, 2002, pp. 1-6. https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1180816 (Year: 2002).
M. Najibi, Dynamic Voltage and Frequency Management Based on Variable Update Intervals for Frequency Setting, 2006, pp. 755-760. https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4110118 (Year: 2006).
Wei Da, Dynamic Policy Updating Based on One-Point Coverage Random Sets Theory, 2008, pp. 639-643. https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4470475 (Year: 2008).
Afonso, “Dynamic Channels: a New Development Methodology for Mobile Computer Applications,” Department of Information, Mar. 1998, 22 pages.
Alcala, UbiLoc: A System for Locating Mobile Devices using Mobile Devices, Otto-von-Guericke-University of Magdeburg, Department of Computer Science Institute of Technical and Business Information Systems, Mar. 1, 2004, 6 pages.
Alefeld, “Interval analysis: theory and applications,” Journal of Computational and Applied Mathematics, Aug. 1999, 44 pages.
Cowling, “Dynamic Location Management in Heterogeneous Cellular Networks,” Advanced Networks Research Group, University of Sydney, Australia, Oct. 2004, 155 pages.
Gkantsidis et al., “Planet Scale Software Updates,” Microsoft Research, Cambridge, UK, Sep. 11-15, 2006, 12 pages.
Mills, “Adaptive Hybrid Clock Discipline Algorithm for the Network Time Protocol,” IEEE/ACM Trans. Networking, Oct. 1988, 12 pages.
Wang, et al., “IPTV STB Software Update Scheme Based on SNMP,” IEEE, May 7, 2006, 4 pages.
Yang, et al., “The Design and Implementation of Koreasat DBS Set-Top-Box Software,” International Conference on Information, Communications and Signal Processing, ICICS '97, Sep. 9-12, 1997, 5 pages.
Office Action, dated Aug. 2, 2012, received in U.S. Appl. No. 11/690,582, 17 pages.
Final Office Action, dated Jan. 18, 2013, received in U.S. Appl. No. 11/690,582, 22 pages.
Office Action, dated Feb. 26, 2014, received in U.S. Appl. No. 11/690,582, 22 pages.
Final Office Action, dated Oct. 21, 2014, received in U.S. Appl. No. 11/690,582, 26 pages.
Office Action, dated Apr. 9, 2015, received in U.S. Appl. No. 11/690,582, 15 pages.
Office Action, dated Sep. 9, 2011, received in U.S. Appl. No. 11/690,591, 21 pages.
Final Office Action, dated Feb. 24, 2012, received in U.S. Appl. No. 11/690,591, 24 pages.
Office Action, dated Apr. 11, 2013, received in eceived in U.S. Appl. No. 11/690,591, 24 pages.
Final Office Action, dated Dec. 10, 2013, received in U.S. Appl. No. 11/690,591, 32 pages.
Office Action, dated Jul. 3, 2014, received in eceived in U.S. Appl. No. 11/690,591, 28 pages.
Final Office Action, dated Feb. 17, 2015, received in U.S. Appl. No. 11/690,591, 27 pages.
Office Action, dated Oct. 14, 2009, received in U.S. Appl. No. 11/690,602, 13 pages.
Office Action, dated Nov. 15, 2010, received in U.S. Appl. No. 11/690,602, 11 pages.
Office Action, dated Apr. 22, 2011, received in U.S. Appl. No. 11/690,602, 11 pages.
Final Office Action, dated Mar. 18, 2010, received in U.S. Appl. No. 11/690,602, 11 pages.
Notice of Allowance, dated Oct. 3, 2011, received in U.S. Appl. 11/690,602, 12 pages.
Office Action, dated Apr. 13, 2012, received in U.S. Appl. No. 12/327,690, 24 pages.
Final Office Action, dated Jan. 18, 2013, received in U.S. Appl. No. 12/327,690, 25 pages.
Office Action, dated Feb. 12, 2014, received in U.S. Appl. No. 12/327,690, 12 pages.
Final Office Action, dated Oct. 28, 2014, received in U.S. Appl. No. 12/327,690, 13 pages.
Office Action, dated Aug. 5, 2011, received in U.S. Appl. No. 12/327,684, 17 pages.
Office Action, dated Feb. 2, 2012, received in U.S. Appl. No. 12/327,684, 15 pages.
Final Office Action, dated Dec. 6, 2012, received in U.S. Appl. No. 12/327,684, 16 pages.
Notice of Allowance, dated May 23, 2013, received in U.S. Appl. No. 12/327,684, 15 pages.
Office Action, dated Jun. 9, 2010, received in U.S. Appl. No. 11/681,164, 19 pages.
Final Office Action, dated Nov. 29, 2010, received in U.S. Appl. No. 11/681,164, 17 pages.
Office Action, dated Mar. 14, 2014, received in U.S. Appl. No. 11/681,164, 19 pages.
Final Office Action, dated Dec. 4, 2014, received in U.S. Appl. No. 11/681,164, 20 pages.
Office Action, dated Jun. 9, 2011, received in U.S. Appl. No. 11/956,253, 15 pages.
Final Office Action, dated Dec. 22, 2011, received in U.S. Appl. No. 11/956,253, 19 pages.
Office Action, dated May 14, 2012, received in U.S. Appl. No. 11/956,253, 18 pages.
Final Office Action, dated Dec. 17, 2012, received in U.S. Appl. No. 11/956,253, 21 pages.
Office Action, dated May 3, 2013, received in U.S. Appl. No. 11/956,253, 24 pages.
Final Office Action, dated Nov. 22, 2013, received in U.S. Appl. No. 11/956,253, 24 pages.
Notice of Allowance, dated Aug. 8, 2014, received in U.S. Appl. No. 11/956,253, 16 pages.
Office Action, dated May 21, 2015, received in U.S. Appl. No. 14/563,487, 19 pages.
Final Office Action, dated Mar. 2, 2016, received in U.S. Appl. No. 14/563,487, 22 pages.
Notice of Allowance, dated Jul. 28, 2016, received in U.S. Appl. No. 14/563,487, 9 pages.
International Search Report and Written Opinion, dated Jul. 23, 2008, received in International Patent Application No. PCT/US2008/053119, which corresponds with U.S. Appl. No. 11/681,164, 9 pages.
International Preliminary Report on Patentability, dated Aug. 26, 2009, received in International Patent Application No. PCT/US2008/053119, which corresponds with U.S. Appl. No. 11/681,164, 7 pages.
Related Publications (1)
Number Date Country
20170075680 A1 Mar 2017 US
Continuations (2)
Number Date Country
Parent 14563487 Dec 2014 US
Child 15344415 US
Parent 11956253 Dec 2007 US
Child 14563487 US