Dynamic scheduling of electronic content updates

• US 8,307,110 B1
• Filed: 07/07/2009
• Issued: 11/06/2012
• Est. Priority Date: 07/07/2009
• Status: Active Grant

• Current Assignee: T-Mobile Innovations LLC (Deutsche Telekom AG)
• Original Assignee: Sprint Communications Company LP (Deutsche Telekom AG)
• Inventors: Katzer, Robin D., Ng, Sei Y., Stone, M. Jeffrey
• Primary Examiner(s): BIAGINI, CHRISTOPHER D
• Application Number:
  US12/498,496
• Time in Patent Office: 1,218 Days
• Field of Search: 709/232
• US Class Current: 709/232
• CPC Class Codes: H04L 12/1859 adapted to provide push services, e.g. data channels
• CPC Class Codes: H04L 12/189 in combination with wireless systems selective distribution or broadcast in wireless communication networks H04W4/06
• CPC Class Codes: H04L 67/01 Protocols
• CPC Class Codes: H04L 67/563 Data redirection of data network streams
• CPC Class Codes: H04L 67/60 Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources admission control or resource allocation H04L47/70

Abstract

A method comprises a server receiving a message from a device requesting content. The server reads a first time record for the previous receipt of content. The server compares the first time record with a second time record for the content stored in cache. When the second time record is newer than the first time record, the server sends the requested content. When time records match, the device is advised of refresh time and to request later. When the message lacks a time record, the requested content is sent. When cache does not contain requested content, a data loader obtains content from a server. A message to the device advises the time to obtain the content and to request again later. When cache does not contain the content and the server is unavailable, the data loader determines the time of network availability. A message sent to the device advises of availability time and to request again later.

Claims

1. A processor-implemented method of retrieving and delivering requested content, comprising:

a feed server receiving a first message from a first electronic device containing a request for content and receiving a second message from a second electronic device containing a request for the same content;

the feed server reading in the first message a first time record associated with a previous update to the content received by the first electronic device;

the feed server reading in the second message a second time record associated with a previous update to the content received by the second electronic device;

the feed server comparing the first time record and the second time record with a cache time record, the cache time record associated with the requested content stored on a cache server;

the feed server determining that the first time record and the second time record match the cache time record;

the feed server sending a first response message to the first electronic device in response to the feed server determining that the first time record matches the cache time record, the first response message advising that the content associated with the first time record is the most currently available content and the first response message further containing advice to resend the request for content at a first scheduled time, wherein the first scheduled time is based on when the requested content is to be updated at the cache server;

the feed server sending a second response message to the second electronic device in response to the feed server determining that the second time record matches the cache time record, the second response message advising that the content associated with the second time record is the most currently available content and the second response message further containing advice to resend the request for content at a second scheduled time, wherein the second scheduled time is based on when the requested content is to be updated at the cache server plus an interval.

2. The method of claim 1, wherein the feed server adding the interval to the second scheduled time promotes staggering of the resending of the request by the second electronic device.

3. The method of claim 2, wherein staggering the first and second scheduled times distributes load of resend requests for content over time.

4. The method of claim 1, wherein staggering the first and second scheduled times is used when the feed server receives at least one of heavy and concentrated requests for content from electronic devices.

5. The method of claim 1, wherein the content comprises at least one of a stock market quotation, a score of a sporting event, a weather forecast, and a flight arrival time.

6. The method of claim 1, wherein the first and second scheduled times for resend requests are staggered by time periods comprising one of milliseconds, seconds, and minutes.

7. The method of claim 1, wherein the feed server sending messages containing advice to resend content requests at the first and second scheduled times promotes electronic devices to terminate their calls and frees up the electronic devices to receive incoming voice calls.