	US 12,155,554 B2
	Network traffic control using estimated maximum gap
Behnaz Arzani, Redmond, WA (US); Pooria Namyar, Los Angeles, CA (US); Ryan Andrew Beckett, Redmond, WA (US); Srikanth Kandula, Redmond, WA (US); Santiago Martin Segarra, Houston, TX (US); and Himanshu Raj, Cupertino, CA (US)
Assigned to Microsoft Technology Licensing, LLC, Redmond, WA (US)
Filed by Microsoft Technology Licensing, LLC, Redmond, WA (US)
Filed on Sep. 2, 2022, as Appl. No. 17/929,503.
Prior Publication US 2024/0080255 A1, Mar. 7, 2024
Int. Cl. H04L 45/02 (2022.01)

CPC H04L 45/08 (2013.01)

20 Claims

1. A computing device comprising:

a processor that:

receives a network graph;

receives a specification of a network traffic control heuristic for a network traffic routing problem over the network graph;

constructs a gap maximization problem that has, as a maximization target, a difference between an exact solution to the network traffic routing problem and a heuristic solution generated using the network traffic control heuristic;

generates a Lagrange multiplier formulation of the gap maximization problem based on the difference;

at a convex solver, computes an estimated maximum gap as an estimated solution to the Lagrange multiplier formulation of the gap maximization problem; and

performs a network traffic control action based at least in part on the estimated maximum gap.