DETERMINING LOAD STATE OF REMOTE SYSTEMS USING DELAY AND PACKET LOSS RATE
Systems and methods are provided for managing workloads across multiple resources in a distributed computing system. A data traffic flow between a source device and each of a plurality of target devices within the distributed computing system is monitored. A load state of each of the plurality of target devices is determined based on the monitored data traffic flow. Upon detecting a resource constraint for at least one of the plurality of target devices, at least a portion of the data traffic flow between the source device and the resource-constrained target device is adjusted such that the device operates at a reduced load state. The data traffic flow to the particular target device may be readjusted so as to restore its load state to a default or predetermined operating level once the resource constrained has been resolved.
1 - 20 . (canceled)
21 . A computer-implemented method for signaling a resource constraint, the method implemented using a target device, wherein the target device is one of a plurality of target devices in communication with a source device, the method comprising:
receiving, via an electronic network, a data packet from the source device;
adding the received data packet to an end position of a data buffer, wherein the data buffer includes a plurality of data packets scheduled for processing;
determining whether the data buffer is full, wherein upon determining that the data buffer is not full:
determining a waiting time of an earliest data packet of the plurality of data packets in the data buffer, wherein the earliest data packet is at a starting position of the data buffer;
comparing the determined waiting time to a threshold waiting time; and
automatically removing the earliest data packet from the data buffer if the determined waiting time exceeds the threshold waiting time.
22 . The method of claim 21 , wherein if the determined waiting time is below the threshold waiting time, the method further comprises waiting to receive a subsequent data packet from the source device.
23 . The method of claim 21 , wherein prior to adding the received data packet to the end of the data buffer, the method further comprises determining that the received data packet cannot be processed at a time of receipt.
24 . The method of claim 21 , wherein upon determining that the data buffer is full, the method further comprises removing one of the plurality of data packets from the data buffer.
25 . The method of claim 21 , wherein determining the waiting time of the earliest data packet further comprises calculating a difference between a current time and a time of receipt associated with the earliest data packet.
26 . The method of claim 21 , wherein the plurality of data packets are sequentially ordered based on a respective time of receipt, and wherein each of the plurality of data packets in the data buffer are processed on a first-in-first-out (FIFO) basis.
27 . The method of claim 21 , wherein if the determined waiting time exceeds the threshold waiting time, the method further comprises transmitting, to the source device, a notification associated with the removed data packet to enable the source device to reallocate new data packets to one or more other target devices of the plurality of target devices.
28 . A system comprising a target device and a source device, wherein the target device is one of a plurality of target devices in communication with the source device, the target device configured to:
receive, via an electronic network, a data packet from the source device;
add the received data packet to an end position of a data buffer, wherein the data buffer includes a plurality of data packets scheduled for processing;
determine whether the data buffer is full, wherein upon determining that the data buffer is not full:
determine a waiting time of an earliest data packet of the plurality of data packets in the data buffer, wherein the earliest data packet is at a starting position of the data buffer;
compare the determined waiting time to a threshold waiting time; and
automatically remove the earliest data packet from the data buffer if the determined waiting time exceeds the threshold waiting time.
29 . The system of claim 28 , wherein if the determined waiting time is below the threshold waiting time, the target device is further configured to wait to receive a subsequent data packet from the source device.
30 . The system of claim 28 , wherein prior to adding the received data packet to the end of the data buffer, the target device is further configured to determine that the received data packet cannot be processed at a time of receipt.
31 . The system of claim 28 , wherein upon determining that the data buffer is full, the target device is further configured to remove one of the plurality of data packets from the data buffer.
32 . The system of claim 28 , wherein the target device is further configured to determine the waiting time of the earliest data packet by calculating a difference between a current time and a time of receipt associated with the earliest data packet.
33 . The system of claim 28 , wherein the plurality of data packets are sequentially ordered based on a respective time of receipt, and wherein each of the plurality of data packets in the data buffer are processed on a first-in-first-out (FIFO) basis.
34 . The system of claim 28 , wherein if the determined waiting time exceeds the threshold waiting time, the target device is further configured to alert the source device of the removed data packet to enable the source device to reallocate new data packets to one or more other target devices of the plurality of target devices.
35 . A non-transitory computer-readable medium storing computer-executable instructions which, when executed by a target device in communication with a source device, wherein the target device is one of a plurality of target devices in communication with the source device, cause the target device to perform operations comprising:
receiving, via an electronic network, a data packet from the source device;
adding the received data packet to an end position of a data buffer, wherein the data buffer includes a plurality of data packets scheduled for processing;
determining whether the data buffer is full, wherein upon determining that the data buffer is not full:
determining a waiting time of an earliest data packet of the plurality of data packets in the data buffer, wherein the earliest data packet is at a starting position of the data buffer;
comparing the determined waiting time to a threshold waiting time; and
automatically removing the earliest data packet from the data buffer if the determined waiting time exceeds the threshold waiting time.
36 . The computer-readable medium of claim 35 , wherein the operations further comprise waiting to receive a subsequent data packet from the source device if the determined waiting time is below the threshold waiting time.
37 . The computer-readable medium of claim 35 , wherein prior to adding the received data packet to the end of the data buffer, the operations further comprise determining that the received data packet cannot be processed at a time of receipt.
38 . The computer-readable medium of claim 35 , wherein upon determining that the data buffer is full, the operations further comprise removing one of the plurality of data packets from the data buffer.
39 . The computer-readable medium of claim 35 , wherein determining the waiting time of the earliest data packet further comprises calculating a difference between a current time and a time of receipt associated with the earliest data packet.
40 . The computer-readable medium of claim 35 , wherein the plurality of data packets are sequentially ordered based on a respective time of receipt, and wherein each of the plurality of data packets in the data buffer are processed on a first-in-first-out (FIFO) basis.