{"id":{"repo_id":"nps","oai_identifier":"oai:calhoun.nps.edu:10945/51606"},"canonical_url":"https://search.dev.ndltd.org/etd/nps/oai:calhoun.nps.edu:10945/51606","repository":{"repo_id":"nps","name":"Naval Postgraduate School","base_url":"https://calhoun.nps.edu/server/oai/request"},"display":{"title":"Efficient orchestration of data centers via comprehensive and application-aware trade-off exploration","abstract":"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.","abstract_html":"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.","abstract_has_math":false,"creators":["Bairley, Alan M."],"institution":"Monterey, CA; Naval Postgraduate School","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Computer Science (CS)","school":null,"contributors":[],"advisors":["Xie, Geoffrey G."],"committee_chairs":[],"committee_members":[],"year":2016,"date_issued":"2016-12","date_published":"2016-12","updated_at":"2026-07-27T20:26:27Z","subjects":[],"languages":[],"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."],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://hdl.handle.net/10945/51606","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Xie, Geoffrey G."]},{"key":"dc:contributor.department","label":"Department","values":["Computer Science (CS)"]},{"key":"dc:creator","label":"Author","values":["Bairley, Alan M."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2017-02-09T00:02:40Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2017-02-09T00:02:40Z"]},{"key":"dc:date.issued","label":"Date","values":["2016-12"]},{"key":"dc:publisher","label":"Institution","values":["Monterey, CA; Naval Postgraduate School"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:rights","label":"Dc Rights","values":["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."]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://hdl.handle.net/10945/51606"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["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."]},{"key":"dc:title","label":"Title","values":["Efficient orchestration of data centers via comprehensive and application-aware trade-off exploration"]}]}],"canonical_facts":{"dc:contributor.advisor":["Xie, Geoffrey G."],"dc:contributor.department":["Computer Science (CS)"],"dc:creator":["Bairley, Alan M."],"dc:date.accessioned":["2017-02-09T00:02:40Z"],"dc:date.available":["2017-02-09T00:02:40Z"],"dc:date.issued":["2016-12"],"dc:description.abstract":["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."],"dc:identifier.uri":["https://hdl.handle.net/10945/51606"],"dc:publisher":["Monterey, CA; Naval Postgraduate School"],"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."],"dc:title":["Efficient orchestration of data centers via comprehensive and application-aware trade-off exploration"],"dc:type":["Thesis"]},"updated_at":"2026-07-27T20:26:27Z"}