US 12,294,520 B1
Systems and methods for optimizing data transmission in a capacity constrained data communication network
Hoai Xuan Vu, Westminster, CA (US); Can Xuan Vu, Westminster, CA (US); and Dao Ngoc Vu, Westminster, CA (US)
Assigned to KBR WYLE SERVICES, LLC, Houston, TX (US)
Filed by KBR Wyle Services, LLC, Houston, TX (US)
Filed on Nov. 1, 2023, as Appl. No. 18/499,659.
Int. Cl. H04L 47/12 (2022.01); H04L 47/24 (2022.01)
CPC H04L 47/12 (2013.01) [H04L 47/24 (2013.01)] 26 Claims
OG exemplary drawing
 
1. A method for managing data transmissions of a communication network comprising:
receiving requests from a plurality of data transmission requestors requesting data transmissions via a communication pathway of a communication network, the communication pathway having at least one data transmission constraint that is exceeded by an aggregate of at least one corresponding demand of the requests; and
determining which requests to accept such that the at least one data transmission constraint is not exceeded, wherein determining which requests to accept comprises:
selecting a set of requests to accept based on value densities of the requests such that the at least one data transmission constraint is not exceeded, wherein the value densities are each a function of a value associated with at least one characteristic of a respective request and the at least one demand of the respective request, and wherein a total of the at least one demand of the selected set of requests to accept is less than the at least one data transmission constraint by at least one residual amount,
determining a first non-selected request for which the at least one demand of the first non-selected request does not exceed the at least one residual amount,
determining whether a second non-selected request exists for which: (1) a value density of the second non-selected request is greater than a combined value density of the first non-selected request and a request of the selected set of requests that has a lowest value density, and (2) a demand of the second non-selected request is the largest demand among all non-selected requests meeting requirement (1) that is no larger than a sum of the at least one residual amount and a demand of the request of the selected set of requests that has the lowest value density,
in accordance with determining that the second non-selected request exists, updating the selected set of requests to accept by replacing the selected request having the lowest value density of the selected set of requests with the second non-selected request, and
in accordance with determining that the second non-selected request does not exist, updating the selected set of requests to accept to include the first non-selected request.