US 11,811,646 B2
Decentralized wide-area network traffic engineering
Umesh Krishnaswamy, San Jose, CA (US); Rachee Singh, Redmond, WA (US); Nikolaj Bjorner, Woodinville, WA (US); and Himanshu Raj, Mountain View, CA (US)
Assigned to MICROSOFT TECHNOLOGY LICENSING, LLC, Redmond, WA (US)
Filed by MICROSOFT TECHNOLOGY LICENSING, LLC, Redmond, WA (US)
Filed on May 28, 2022, as Appl. No. 17/827,675.
Claims priority of provisional application 63/315,048, filed on Feb. 28, 2022.
Prior Publication US 2023/0275828 A1, Aug. 31, 2023
Int. Cl. H04L 41/0893 (2022.01); H04L 12/46 (2006.01); H04L 45/125 (2022.01); H04L 45/50 (2022.01); H04L 45/18 (2022.01)
CPC H04L 45/125 (2013.01) [H04L 45/18 (2013.01); H04L 45/50 (2013.01)] 20 Claims
OG exemplary drawing
 
1. A method for managing network traffic in a distributed computing system comprising a plurality of network devices that are configured to send or receive network traffic between the plurality of network devices, the method comprising:
dividing the plurality of network devices in the distributed computing system into a plurality of network slices, wherein each of the plurality of network slices include a subset of the plurality of network devices such that there is no overlap of network devices between the network slices;
associating individual network slices of the plurality of network slices with individual slice controllers, wherein an individual slice controller is configured to manage network routing of an individual network slice; and
routing, by each of the individual slice controllers, the network traffic within each of the respective individual network slices, wherein the network traffic is independently routed based on expected network conditions for each of the respective individual network slices, and wherein data defining routing decisions is contained within each network slice to limit fault effects between the network slices.