Efficient orchestration of data centers via comprehensive and application-aware trade-off exploration

Software-defined network (SDN) orchestration, the problem of integrating and deploying multiple network control functions (NCFs) while minimizing suboptimal network states that can result from competing NCF proposals, is a challenging open problem. In this work, we formulate SDN orchestration as a multiobjective optimization problem, present an evolutionary algorithm designed to explore the NCF tradeoff space comprehensively and avoid local optima, and propose a new application-aware approach that explicitly models resource preferences of individual application workloads. Further, we propose a new logical application workload (LAW) abstraction to enable precomputation of the required relative positioning of an application's virtual machines (VMs) and allocation of these VMs in a single atomic step, leading to online algorithms that are one order of magnitude faster than existing solutions for placing data center workloads. For an instance of the SDN orchestration problem subject to four independent NCFs attempting to optimize network survivability, bandwidth efficiency, power conservation, and computational contention, we demonstrate that our approach enumerates a wider range of, and potentially better, solutions than current orchestrators, for data centers with hundreds of switches, thousands of servers, and tens of thousands of VM slots.

Department dc:contributor.department

Computer Science (CS)

Grantor dc:publisher

Monterey, CA; Naval Postgraduate School

Year dc:date.issued

2016

Author dc:creator

• Bairley, Alan M.

Advisor dc:contributor.advisor

• Xie, Geoffrey G.

Statement dc:rights

• This publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.

Handle dc:identifier.uri

https://hdl.handle.net/10945/51606

OAI identifier oai:identifier

oai:calhoun.nps.edu:10945/51606