MORSA: A multi-objective resource scheduling algorithm for NFV infrastructure

Yoshida, Masahiro; Shen, Wei; Kawabata, Taichi; Minato, Kenji; Imajuku, Wataru

doi:10.1109/apnoms.2014.6996545

Cited by 63 publications

(38 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Yoshida et al propose a multi-objective resource scheduling algorithm simultaneously optimizing possibly conflicting objectives with multifaceted constraints [27]. Vaishnavi et al tackle the problem of inter-domain virtual network provisioning by abstracting the resources of a domain to appear as a single node [28].…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Semantically Enhanced Mapping Algorithm for Affinity-Constrained Service Function Chain Requests

Bouten

Mijumbi

Serrat

et al. 2017

IEEE Trans. Netw. Serv. Manage.

View full text Add to dashboard Cite

Abstract-Network Function Virtualization (NFV) and Software Defined Networking (SDN) have been proposed to increase the cost-efficiency, flexibility and innovation in network service provisioning. This is achieved by leveraging IT virtualization techniques and combining them with programmable networks. By doing so, NFV and SDN are able to decouple the network functionality from the physical devices on which they are deployed. Service Function Chains (SFCs) composed out of Virtual Network Functions (VNFs) can now be deployed on top of the virtualized infrastructure to create new value-added services. Current NFV approaches are limited to mapping the different VNFs to the physical substrate subject to resource capacity constraints. They do not provide the possibility to define location requirements with a certain granularity and constraints on the colocation of VNFs and virtual edges. Nevertheless, many scenarios can be envisioned in which a Service Provider (SP) would like to attach placement constraints for efficiency, resilience, legislative, privacy and economic reasons. Therefore, we propose a set of affinity and anti-affinity constraints, which can be used by SPs to define such placement restrictions. Furthermore, a semantic SFC validation framework is proposed that allows the Virtual Network Function Infrastructure Provider (VNFInP) to check the validity of a set of constraints and provide feedback to the SPs. This allows the VNFInP to filter out any non-valid SFC requests before sending them to the mapping algorithm, significantly reducing the mapping time.

show abstract

Section: Related Workmentioning

confidence: 99%

“…Equation (26) prevents two virtual edge mappings of sharing a link. Furthermore, none of the endpoints of these respective virtual edges should be colocated at the same host (Equation (27))…”

Section: E Affinity and Anti-affinity Constraintsmentioning

confidence: 99%

Semantically Enhanced Mapping Algorithm for Affinity-Constrained Service Function Chain Requests

Bouten

Mijumbi

Serrat

et al. 2017

IEEE Trans. Netw. Serv. Manage.

View full text Add to dashboard Cite

show abstract

“…The solution provided by the authors employs MDP as well. In [7], joint optimization of NFVI resources under multiple constraints results in approximate algorithm which aims at improving the capability of NFV management and orchestration. This work provides static placement of NFVrelated resource.…”

Section: A Related Workmentioning

confidence: 99%

Optimal control of VNF deployment and scheduling

Shifrin

Biton

Gurewitz

2016

2016 IEEE International Conference on the Science of Electrical Engineering (ICSEE)

View full text Add to dashboard Cite

Abstract-Managing network-related resources involves sophisticated trade-off between flexibility, high performance standards, latency demands which adhere to service level agreements (SLAs) and cost constraints. Network functioning virtualization (NFV) opens new challenges to the remote network management which combines activation and control of virtual machines (VMs) according to variable demand. Currently, this functionality is being handled by harnessing the traditional orchestration algorithms using suboptimal heuristics. We model the problem of virtual network function (VNF) allocation by queuing system with flexible number of queues, which captures variety of constraints including queue deployment and displacement, delay cost, holding cost, scheduling reward and fine. Next, we model the system by Markov decision process (MDP) and numerically solve it to find the optimal policy. We show analytically and by simulations that the optimal policy possesses decision thresholds which depend on several parameters.

show abstract

“…This calls for heuristics such as those proposed in [163], [164], [165], [132]. For example, Xia et.…”

Section: Resource Allocationmentioning

confidence: 99%

Algorithms for advance bandwidth reservation in media production networks

Barshan

Moens

Famaey

et al. 2015

2015 IFIP/IEEE International Symposium on Integrated Network Management (IM)

View full text Add to dashboard Cite

Abstract-Network Function Virtualization (NFV) has drawn significant attention from both industry and academia as an important shift in telecommunication service provisioning. By decoupling Network Functions (NFs) from the physical devices on which they run, NFV has the potential to lead to significant reductions in Operating Expenses (OPEX) and Capital Expenses (CAPEX) and facilitate the deployment of new services with increased agility and faster time-to-value. The NFV paradigm is still in its infancy and there is a large spectrum of opportunities for the research community to develop new architectures, systems and applications, and to evaluate alternatives and trade-offs in developing technologies for its successful deployment. In this paper, after discussing NFV and its relationship with complementary fields of Software Defined Networking (SDN) and cloud computing, we survey the state-of-the-art in NFV, and identify promising research directions in this area. We also overview key NFV projects, standardization efforts, early implementations, use cases and commercial products.

show abstract

MORSA: A multi-objective resource scheduling algorithm for NFV infrastructure

Cited by 63 publications

References 17 publications

Semantically Enhanced Mapping Algorithm for Affinity-Constrained Service Function Chain Requests

Semantically Enhanced Mapping Algorithm for Affinity-Constrained Service Function Chain Requests

Optimal control of VNF deployment and scheduling

Algorithms for advance bandwidth reservation in media production networks

Contact Info

Product

Resources

About