SYSTEMS AND METHODS FOR ADAPTIVE LOAD BALANCED COMMUNICATIONS, ROUTING, FILTERING, AND ACCESS CONTROL IN DISTRIBUTED NETWORKS

• US 20150271255A1
• Filed: 03/30/2015
• Published: 09/24/2015
• Est. Priority Date: 10/03/2012
• Status: Abandoned Application

• Current Assignee: Distrix Networks Ltd.
• Original Assignee: Distrix Networks Ltd.
• Inventors: Trytten, Chad D., Mackay, Kenneth J.
• Application Number:
  US14/672,739
• Publication Number:
  US 20150271255A1
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: H04L 45/121 by minimising delays
• CPC Class Codes: H04L 45/125 based on throughput or bandwidth
• CPC Class Codes: H04L 47/6275 based on priority
• CPC Class Codes: H04L 67/101 based on network conditions

Abstract

The disclosure provides examples of systems and methods for adaptive load balancing, prioritization, bandwidth reservation, and/or routing in a network communication system. In various embodiments, the disclosed methods can provide reliable multi-path load-balancing, overflow, and/or failover services for routing over a variety of network types. In some embodiments, disconnected routes can be rebuilt by selecting feasible connections. The disclosure also provides examples of methods for filtering information in peer-to-peer network connections and assigning permission levels to nodes in peer-to-peer network connections. Certain embodiments described herein may be applicable to mobile, low-powered, and/or complex sensor systems.

Claims

1. A digital network communication system, the system comprising:

a communication layer component that is configured to manage transmission of data packets among a plurality of computing nodes, at least some of the plurality of computing nodes comprising physical computing devices, the communication layer component comprising a physical computing device configured to;

receive, from a computing node, one or more data packets to be transmitted via one or more network data links;

estimate a latency value for at least one of the one or more network data links;

estimate a bandwidth value for at least one of the one or more network data links;

determine an order of transmitting the data packets;

identify at least one of the one or more network data links for transmitting the data packets based at least partly on the estimated latency value or the estimated bandwidth value; and

send the data packets over the identified at least one of the network data links based at least partly on the determined order.

2. The system of claim 1, wherein the communication layer component is further configured to calculate the estimated latency value and the estimated bandwidth value periodically.

3. The system of claim 1, wherein the communication layer component is further configured to restrict a rate at which the data packets are sent over the at least one of the network data links, wherein the rate is configured to be lower than the estimated bandwidth value.

4. The system of claim 3, wherein the communication layer component is further configured to determine whether a data packet can be sent over the at least one of the network data links without exceeding the estimated bandwidth value using a burst bucket.

5. The system of claim 1, wherein the communication layer component is further configured to aggregate two or more of the network data links into a single connection to a computing node.

6. The system of claim 5, wherein the two or more of the network data links are configured to implement different transmission protocols.

7. The system of claim 5, wherein the communication layer component is further configured to:

divide at least one of the data packets to be transmitted to the computing node into one or more segments; and

transmit the one or more segments for the at least one of the data packets over the single connection, wherein the single connection comprises the two or more network data links.

8. The system of claim 7, wherein the communication layer component is further configured to:

receive the one or more segments; and

assemble the one or more segments into the at least one of the data packets.

9. The system of claim 5, wherein the communication layer component is further configured to:

sort the two or more network data links in the single connection based at least partly on an overflow priority associated with each of the network data links; and

send the data packets over a first network data link upon determining that there is no network data link that is associated with an overflow priority that is lower than the overflow priority of the first network data links.

10. The system of claim 5, wherein the communication layer component is further configured to:

upon creation of a new network data link, automatically aggregate the new network data link into the single connection to the computing node; and

upon termination of the new network data link, automatically remove the new network data link from the single connection to the computing node.

11. The system of claim 5, wherein the communication layer component is further configured to:

calculate an expected arrival time for at least one of the data packets for each of the network data links; and

send all or part of the at least one of the data packets via one of the network data links with an expected arrival time that is lower than all other network data links.

12. The system of claim 11, wherein the communication layer component is further configured to:

upon determining that all or part of the at least one of the data packets cannot be sent immediately via the one of the network data links with the expected arrival time that is lower than all the other network data links, wherein the expected arrival time is less than an estimated latency value that is higher than all other estimated latency values of the network data links, insert the data packet into a queue;

remove the data packet from the queue; and

send the data packet via one of the network data links with the expected arrival time that is lower than all the other network data links.

13. The system of claim 11, wherein the communication layer component is further configured to calculate the expected arrival time of the data packet based at least partly on the estimated latency value and an estimated amount of time the data packet stays in the queue before being sent via one of the network data links.

14. The system of claim 1, wherein the communication layer component is further configured to:

set a start time to a current time, and a data amount to zero;

determine whether a data packet of the one or more data packets is a member of a subset of data packets;

upon determining that a data packet of the one or more data packets is a member of the subset, calculate an interval as (the current time−

the start time);

upon determining that the interval is larger than an averaging period, set an updated data amount to (size of the data packet+(the data amount*the averaging period)/(the interval)), and an updated start time to (the current time−

the averaging period); and

calculate an estimated data rate for the subset as (the updated data amount)/(the current time−

the start time).

15. The system of claim 1, wherein the communication layer component is further configured to:

provide a plurality of reserved bandwidth streams, wherein each of the reserved bandwidth streams further comprises a bandwidth allocation;

assign each data packet of the one or more data packets to a reserved bandwidth stream; and

determine the order of transmitting each data packet of the one or more data packets based at least in part on a determination that the data rate of a reserved bandwidth stream for which a data packet is assigned to does not exceeded the bandwidth allocation for the reserved bandwidth stream.

16. A digital network communication system, the system comprising:

a communication layer component that is configured to manage transmission of data packets among a plurality of computing nodes, at least some of the plurality of computing nodes comprising physical computing devices, the communication layer component comprising a physical computing device configured to;

assign a priority value to each of the data packets;

calculate an estimated amount of time a data packet will stay in a queue for a network data link by accumulating a wait time associated with each data packet in the queue with a priority value higher than or equal to the priority value of the data packet that will stay in the queue; and

calculate an estimated wait time for the priority value,

wherein the estimated wait time is based at least partly on an amount of queued data packets of the priority value and an effective bandwidth for the priority value,

wherein the effective bandwidth for the priority value is based at least partly on a current bandwidth estimate for the network data link and a rate with which data packets associated with a priority value that is higher than the priority value are being inserted to the queue.

17. The system of claim 16, wherein the estimated wait time for the priority value is (the amount of queued data packets of the priority value)/(the effective bandwidth for the priority value), and the effective bandwidth for the priority value is (the current bandwidth estimate for the network data link minus the rate with which data packets associated with a priority value that is higher than the priority value is being inserted to the queue).

18. The system of claim 16, wherein the communication layer component is further configured to:

set a start time to a current time, and a data amount to zero;

determine whether a data packet is a member of a subset of data packets;

upon determining that a data packet is a member of the subset, calculate an interval as (the current time−

the start time);

upon determining that the interval is larger than an averaging period, set an updated data amount to (size of the data packet+(the data amount*the averaging period)/(the interval)), and an updated start time to (the current time−

the averaging period); and

calculate an estimated data rate for the subset as (the updated data amount)/(the current time−

the start time).

19. The system of claim 16, wherein the communication layer component is further configured to:

provide a plurality of reserved bandwidth streams, wherein each of the reserved bandwidth streams further comprises a bandwidth allocation;

assign each data packet to a reserved bandwidth stream; and

determine the order of transmitting each data packet based at least in part on a determination that the data rate of a reserved bandwidth stream for which a packet is assigned to does not exceeded the bandwidth allocation for the reserved bandwidth stream.er

20. The system of claim 19, wherein the communication layer component is further configured to:

assign a priority to each reserved bandwidth stream; and

upon determining that the data rate for a reserved bandwidth stream has not exceeded the bandwidth allocation for that stream, transmit data packets assigned to a stream with a higher priority before transmitting data packets assigned to a stream with a lower priority.

21. A digital network communication system, the system comprising:

a communication layer component that is configured to manage transmission of data packets among a plurality of computing nodes, at least some of the plurality of computing nodes comprising physical computing devices, the communication layer component comprising a physical computing device configured to;

create a queue for each of a plurality of reserved bandwidth streams;

add data packets that cannot be transmitted immediately and are assigned to a reserved bandwidth stream to the queue for the stream;

create a ready-to-send priority queue for ready-to-send queues;

create a waiting-for-bandwidth priority queue for waiting-for-bandwidth queues;

move all queues in the waiting for bandwidth priority queue with a ready-time less than a current time into the ready to send priority queue;

select a queue with higher priority than all other queues in the ready to send priority queue; and

remove and transmit a first data packet in the queue with higher priority than all other queues in the ready to send priority queue.

22. The system of claim 21, wherein the communication layer component is further configured to create the queue for the plurality of reserved bandwidth streams on-demand upon receiving a first data packet assigned to one of the plurality of reserved bandwidth streams.

23. A method for managing a queue of data items for processing, the method comprising:

under control of a physical computing device having a communication layer that provides communication control for a plurality of computing nodes, at least some of the plurality of computing nodes comprising physical computing devices;

determining whether the queue of data items is empty;

adding a new data item to the queue of data items;

removing a data item from the queue for processing; and

removing a data item from the queue without processing the data item, wherein removing the data item from the queue without processing further comprises selecting the data item based at least partly on a probability function of time.

24. The method of claim 23, wherein the probability function of time is configured to have a value of zero for a period of time and increased values after the period of time.

25. The method of claim 24, wherein the probability function further comprises a quadratic function for the increased values.

26. The method of claim 23, the method further comprising:

upon determining that the queue changes from being empty to non-empty, setting a start time based at least in part on a current time minus a time when a last data item is inserted to the queue or a time when a last data item is removed from the queue without processing.

27. The method of claim 26, the method further comprising:

setting an decay end time to zero;

upon determining that the queue is empty and a data item is being inserted to the queue, setting the start time based on the current time and the decay end time, wherein the start time is set to the current time if the current time is greater than or equal to the decay end time, and is set to (the current time−

(the decay end time−

the current time)) if the current time is less than the decay end time; and

upon determining that the queue is not empty and a data item is being inserted to the queue or removed from the queue, updating the decay end time based at least partly on the interval between the current time and the start time.

28. The method of claim 27, the method further comprising:

calculating an interval between the current time and the start time;

calculating a saturation time;

upon determining the interval is smaller than the saturation time, setting the decay end time to the current time plus the interval; and

upon determining that the interval is larger than or equal to the saturation time, setting the decay end time to the current time plus the saturation time.