Virtual Data Center Embedding: A Survey

Correa, Eder Samir; Fletscher, Luis Alejandro; Botero, Juan Felipe

doi:10.1109/tla.2015.7112029

Cited by 18 publications

(10 citation statements)

References 16 publications

(38 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To the best of our knowledge, there are only a few proposals for VN resource allocation in cloud data centers. Sivaranjini et al and Correa et al give surveys on the existing virtual data center embedding algorithms. Oktopus platform for embedding a VN abstraction and SecondNet for placement of VMs with bandwidth requirements are significant contributions in this area.…”

Section: Related Workmentioning

confidence: 99%

Resource availability–aware adaptive provisioning of virtual data center networks

Gilesh¹,

Kumar

Jacob

2019

Int J Network Mgmt

View full text Add to dashboard Cite

Optimal provisioning of virtual networks with varying topologies on their physical counterpart is a major challenge in cloud data centers. Embedding the virtual network on the shared physical infrastructure poses a multitude of challenges to the infrastructure provider. This paper proposes a hybrid approach which adapts to the availability and fragmentation level of residual resources for near-optimal mapping of multiple virtual data center networks on a substrate data center network. The proposed technique uses coordinated static and dynamic embedding phases, adaptively, to maximize the density of embedding which increases the revenue of the cloud service provider. Also, it judiciously modifies the existing mappings for efficient utilization of resources. Empirical results show that the proposed hybrid approach can attain ∼10% higher acceptance ratio compared with the existing exact and heuristic techniques in the literature. With the proposed mixed integer programming model for static embedding, the average path length is reduced by 20% compared with the existing techniques.Int J Network Mgmt. 2019;29:e2066.wileyonlinelibrary.com/journal/nem

show abstract

Section: Related Workmentioning

confidence: 99%

Resource availability–aware adaptive provisioning of virtual data center networks

Gilesh¹,

Kumar

Jacob

2019

Int J Network Mgmt

View full text Add to dashboard Cite

show abstract

“…By utilizing the flexibility of NFV platform, operators can dynamically design SFC topologies for further deployment to achieve particular objectives such as minimizing network delay, maximizing total revenue, and rate of acceptance. Many researches have been proposed to improve the above objectives [8][9][10]. However, most existing methods consider SFC as a fixed graph wherein all VNFs are executed according to a predefined and fixed sequence.…”

Section: Sfc Compositionmentioning

confidence: 99%

“…First, an initial lower bound for the bandwidth of each VNF pair is given in (10). This lower bound ensures that the minimum bandwidth should not exceed the traffic demand can thus be fully used.…”

Section: Nash Bargaining Solutionmentioning

confidence: 99%

“…Based on the experimental data in [24], we set up our network latency parameter. The elements of the processing time matrix P v×m are generated randomly in an area of [2,10] ms. We uniformly initiated the base bandwidth of the links between VNFs to 2 Mbps and set the total throughput of a VM is set to 20 Gbps. Here, we consider two situations in the bandwidth demand matrix F s×v .…”

Section: Parameter Configurationmentioning

confidence: 99%

See 1 more Smart Citation

Virtual network function scheduling via multilayer encoding genetic algorithm with distributed bandwidth allocation

Yuan

Tang

You

et al. 2018

Sci. China Inf. Sci.

View full text Add to dashboard Cite

Utility-based bandwidth allocation algorithm for heterogeneous wireless networks SCIENCE CHINA Information Sciences 56, 022313 (2013); Adaptive joint bandwidth and power allocation in heterogeneous wireless access environment SCIENCE CHINA Information Sciences 57, 062308 (2014); Storage and repair bandwidth tradeoff for heterogeneous cluster distributed storage systems SCIENCE CHINA Information Sciences 63, 122301 (2020); A suboptimal joint bandwidth and power allocation for cooperative relay networks: a cooperative game theoretic approach SCIENCE CHINA Information Sciences 56, 072304 (2013); SCIENCE CHINA Information Sciences

show abstract

“…To achieve this, several placement algorithms have been proposed in the related fields of Virtual Network Embedding (VNE) [6] and Virtual Data Center Network Embedding (VDCNE) [18], [19], as well as for NFV [9].…”

Section: Related Workmentioning

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

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

Virtual Data Center Embedding: A Survey

Cited by 18 publications

References 16 publications

Resource availability–aware adaptive provisioning of virtual data center networks

Resource availability–aware adaptive provisioning of virtual data center networks

Virtual network function scheduling via multilayer encoding genetic algorithm with distributed bandwidth allocation

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

Contact Info

Product

Resources

About