Link agnostic networking devices can send data across any combination of lines including ISDN, T1, T3, DSL, cable, 3G, 4G, Microwave and satellite. In order to load balance between multiple links of different capacities, link agnostic networking devices must use algorithms to make networking decisions. Commonly used algorithms for link agnostic networking devices include round robin, response time, fastest route and weighted. In order to choose the best algorithm for link agnostic networking device one needs to know whether the links have similar upload speeds. Uplink speeds are generally much slower than download speeds for DSL, cable, 3G, 4G, Microwave and Satellite. Therefore it is important to know the upload speed as opposed to the download speed when choosing the algorithm for link agnostic networking devices.
Round Robin Algorithm for Link Agnostic Networking Devices
Round robin is the most basic algorithm for link agnostic networking devices. When using lines of similar upload speeds on link agnostic networking devices, round robin can be used to simply alternate between lines. Round robin works by sending sessions in rotating order across multiple lines. The round robin algorithm does not require any syn packets to be sent down the line in order to test the response time allowing the link agnostic device to balance the load equally between multiple lines without adding any overhead.
Response Time Algorithm for Link Agnostic Networking Devices
When using link agnostic networking devices between two or more dissimilar lines we can use the algorithm response time. Response time allows the fastest line to be used more often. By testing the line’s average response time, the link agnostic device can send the session down the line with the smallest response time. This allows the link agnostic networking device to send more sessions on the faster lines than on the slower lines without the user having to know anything about the line speeds. The response time algorithm is the most recommended algorithm for link agnostic networking devices that have lines of dissimilar speeds. The response time algorithm does not send syn packets causing unnecessary overhead, but instead measures the response time of existing data packets.
Fastest Route Algorithm for Link Agnostic Networking Devices
Fastest rout algorithms allow link agnostic devices to test the line by sending syn packets at the beginning of each session. Sending syn packets down the line causes a slight amount of overhead. Adding overhead is not desirable because it uses bandwidth that could otherwise be used for sending data packets. This algorithm is not recommended for use on lines that are being used at full capacity. Like the response time algorithm, fastest route can be used on lines of dissimilar speeds without the user needing to know the upload line speeds. Fastest rouet allows the link agnostic networking device to determine which line will reach the destination first before sending the session. This ensures that the link agnostic device sends the session in the fastest way possible.
Weighted Algorithm for Link Agnostic Networking Devices
Weighted algorithms allow link agnostic devices to send sessions down a link based on a predefined weight. For example if a link agnostic device is connected to several T1 lines and a T3 line, the T1 lines can be given the weight of 1 and a T3 line can be given a weight of 28, because a T3 line has 28 times the capacity of a T1 line. This would cause the link agnostic device to send 28 sessions down the T3 line for every session sent down each of the T1 lines. When using the weighted algorithm in a link agnostic device, it is important to base the weight on the uplink speed not the download speed when using DSL, cable, 3G, 4G, Microwave and Satellite.
Summary of Algorithms for Link Agnostic Networking Devices
When installing a link agnostic device it is important to choose the algorithm best suited to the lines. Round robin is great for lines of similar speed however response time is recommended for lines of dissimilar speeds. Fastest route insures the data will be sent the fastest way possible however, the syn packets create overhead that is undesirable. Weighted algorithms require knowledge of the upload speed of the lines being used and do not take into consideration the amount of traffic being sent.
