US 9,813,301 B2
Optimization framework for multi-tenant data centers
Qiang Xu, East Windsor, NJ (US); Cristian Lumezanu, East Windsor, NJ (US); Zhuotao Liu, Urbana, IL (US); Nipun Arora, Plainsboro, NJ (US); Abhishek Sharma, Philadelphia, PA (US); Hui Zhang, Princeton Junction, NJ (US); and Guofei Jiang, Princeton, NJ (US)
Assigned to NEC Corporation, Tokyo (JP)
Filed by NEC Laboratories America, Inc., Princeton, NJ (US)
Filed on Aug. 19, 2015, as Appl. No. 14/830,303.
Claims priority of provisional application 62/039,502, filed on Aug. 20, 2014.
Prior Publication US 2016/0057018 A1, Feb. 25, 2016
Int. Cl. H04L 12/28 (2006.01); H04L 12/24 (2006.01); H04L 12/727 (2013.01); H04L 12/721 (2013.01); H04L 12/751 (2013.01); H04L 12/26 (2006.01); G06F 9/455 (2006.01)
CPC H04L 41/12 (2013.01) [H04L 41/083 (2013.01); H04L 45/02 (2013.01); H04L 45/121 (2013.01); H04L 45/123 (2013.01); H04L 45/124 (2013.01); G06F 9/45533 (2013.01); H04L 43/087 (2013.01)] 15 Claims
OG exemplary drawing
1. A computer implemented method for decoupled searching and optimization for one or more data centers, comprising:
determining a network topology for one or more networks of interconnected computer systems embedded in the one or more data centers;
searching for routing candidates based on a network topology determined;
refining a search space for the searching for routing candidates using a scaled exhaustive search, the scaled exhaustive search comprising searching only selected switches and/or hypervisors for all spanning trees that satisfy a pre-determined size constraint specified during the refining a search space; and
updating and applying one or more objective functions to the routing candidates to determine an optimal routing candidate to satisfy embedding goals based on tenant requests, and to embed the optimal routing candidate in the one or more data centers.