TIME-SENSITIVE DATA DELIVERY

• US 20140324959A1
• Filed: 11/20/2012
• Published: 10/30/2014
• Est. Priority Date: 11/21/2011
• Status: Abandoned Application

• Current Assignee: Diffusiondata Limited
• Original Assignee: Push Technology Limited
• Inventors: Hudson, Darren
• Application Number:
  US14/359,450
• Publication Number:
  US 20140324959A1
• Time in Patent Office: Days
• US Class Current: 709/203
• CPC Class Codes: H04L 47/6215 Individual queue per QOS, rate or priority
• CPC Class Codes: H04L 47/623 Weighted service order
• CPC Class Codes: H04L 47/6275 based on priority
• CPC Class Codes: H04L 47/628 based on packet size, e.g. shortest packet first
• CPC Class Codes: H04L 67/61 taking into account QoS or priority requirements

Abstract

Time-sensitive data delivery is described. In one example, time-sensitive data is transmitted from a server to a plurality of client terminals using a separate queue for each client terminal and at least one queue serving engine for serving the queues. Requests are received from the client terminals to subscribe to a topic, and, when a data message relating to the topic is received, the message is stored and a reference to the message added to the client terminal queues. Each queue is independently served by its associated queue serving engine. The queue serving engine determines when to transmit the message to the queue'"'"'s associated client terminal independence on the queue contents. For example, each queue comprises a low-priority and a higher-priority sub-queue. Low-priority messages are only transmitted when no higher-priority messages are pending, and low-priority messages are divided into fragments such that their transmission does not impede incoming higher-priority messages.

Claims

1. A method of transmitting time-sensitive data from a server to a plurality of client terminals, comprising:

constructing a separate queue for the each of the client terminals at the server;

instantiating at least one queue serving engine for serving the queues;

receiving requests from the plurality of client terminals to subscribe to a topic;

receiving a data message relating to the topic;

storing the data message and adding a reference to the data message to the queue for each of the client terminals; and

independently serving each queue with the associated queue serving engine, wherein the queue serving engine determines in dependence on the queue contents when to transmit the data message to the queue'"'"'s associated client terminal.

2. A method according to claim 1, wherein the queue for each of the client terminals is divided into at least two sub-queues associated with data of differing time-sensitivity.

3. A method according to claim 2, wherein the queue for each of the client terminals comprises a low-priority sub-queue associated with data of low time-sensitivity, and a normal-priority sub-queue associated with data of a higher time-sensitivity.

4. A method according to claim 3, wherein the queue for each of the client terminals further comprises a high-priority sub-queue associated with data of a yet higher time-sensitivity.

5. A method according to claim 3, further comprising the step of determining that the received data message is a low time-sensitivity message.

6. A method according to claim 5, wherein the step of determining that the received data message is a low time-sensitivity message comprises at least one of:

determining that the received data message is greater than a predetermined size; and

determining that the received data message comprises a low-priority flag.

7. A method according to claim 5, wherein the step of storing the data message comprises dividing the message into a plurality of fragments and storing each fragment, and the step of adding a reference to the data message comprises adding a separate reference to each fragment to the low-priority sub-queue for each of the client terminals.

8. A method according to claim 7, wherein the step of independently serving each queue comprises transmitting one of the fragments from the low-priority sub-queue if no data messages are waiting in the normal-priority sub-queue.

9. A method according to claim 8, wherein the step of independently serving each queue further comprises:

determining that one of the fragments cannot be transmitted due to data messages waiting in the normal-priority sub-queue, that at least one previous fragment from the data message has previously been transmitted, and that the elapsed time since the at least one previous fragment was transmitted is greater than a predefined value; and

if greater than a first proportion of the plurality of fragments have previously been transmitted, moving the remaining fragments to the normal-priority sub-queue, and

if less than a second proportion of the plurality of fragments have previously been transmitted, removing the remaining fragments from the queue and adding a message to the associated client terminal to delete the previously transmitted fragments.

10. A method according to claim 8, wherein the step of transmitting one of the fragments comprises selecting which one of the plurality of fragments to transmit in dependence on a portion of the data message content requested by the associated client terminal.

11. A method according to claim 1, wherein the step of independently serving each queue further comprises:

batching the data message with other pending data for transmission to form a batched message of sufficient size to fill a network socket buffer associated with the queue serving engine; and

determining whether the socket buffer is available to receive the batched message.

12. A method according to claim 11, wherein, if the socket buffer is available to receive the batched message, writing the batched message to the socket buffer.

13. A method according to claim 11, wherein, if the socket buffer is not available to receive the batched message, allocating a thread from a thread pool to the batched message and allowing the thread to manage writing of the batched message to the socket buffer.

14. A method according to claim 13, further comprising returning the thread to the thread pool after the batched message is written to the socket buffer.

15. A computer program product comprising computer program code means adapted to perform all the steps of claim 1 when said program is run on a computer.

16. A computer program as claimed in claim 15 embodied on a computer readable medium.

17. A computing device, comprising:

a network interface arranged to connect to a network and configured to receive requests from a plurality of client terminals to subscribe to a topic, and transmit topic data from the computing device to the plurality of client terminals;

a storage device arranged to store a separate queue for the each of the client terminals;

an input interface arranged to receive a data message relating to the topic; and

a processor configured to instantiate a at least one queue serving engine for serving the queues, add a reference to the data message to the queue for each of the client terminals, and independently serve each queue with the associated queue serving engine, wherein the queue serving engine determines in dependence on the queue contents when to transmit the data message to its associated client terminal.

18. A computing device according to claim 17, wherein the processor is configured to create a network socket for each of the plurality of client terminals, each network socket having a socket buffer stored on the storage device, and the processor is further configured to determine whether the data message can be written to the socket buffer, and, if not, the processor allocates an execution thread from a thread pool to manage writing of the data message to the socket buffer.

19. A computing device according to claim 18, wherein the socket buffer is a transport control protocol transmit window.

20. A computing device according to claim 17, wherein each queue comprises at least a low-priority sub-queue and a higher-priority sub-queue to accommodate data messages having different time-sensitivity, and the processor is further configured to determine a priority for the data message, and, in the case that the data message is a low-priority message, divide the data message into a plurality of fragments and add a separate reference to each fragment to each low-priority sub-queue.