Optimal Virtual Network Embedding: Node-Link Formulation

Melo, Márcio; Sargento, Susana; Killat, Ulrich; Timm‐Giel, Andreas; Carapinha, Jorge

doi:10.1109/tnsm.2013.092813.130397

Cited by 89 publications

(51 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Due to the computational complexity of MIP, the sizes of SN (15 nodes) and VNRs are set small. While in reference [11], presented by Melo et al, a pure ILP model is proposed to solve VNE problem in a discrete time event. The aims of [11] are to minimize the VNR cost and achieve substrate load balancing.…”

Section: B Representative and Related Exact Vne Algorithmsmentioning

confidence: 99%

“…While in reference [11], presented by Melo et al, a pure ILP model is proposed to solve VNE problem in a discrete time event. The aims of [11] are to minimize the VNR cost and achieve substrate load balancing. Two node-link constraints, node location requirement and virtual link propagation delay, are mentioned.…”

Section: B Representative and Related Exact Vne Algorithmsmentioning

confidence: 99%

“…The meta-heuristic [8] is not talked in our paper. Though VNE exact algorithms enable to ensure an optimal or near-optimal embedding of each given VN in small-scaled network scenarios [9], the computational complexity are very large in a discrete time event [10][11][12], not to mention medium or largesized network scenario in a continuous time event. Other exactlike algorithms [13][14][15] have to relax integer constraints or use column generation approach to achieve a feasible VN embedding in limited time.…”

Section: Introductionmentioning

confidence: 99%

“…Previous researches concentrate on evaluating different algorithms' abilities of batching processing given VNs in a discrete time window / time event (e.g. [10][11]) and finding out the optimal VN mapping of each given VN. However, it is hardly possible to embed proposed VNRs optically in a continuous time event.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

A Novel Optimal Mapping Algorithm With Less Computational Complexity for Virtual Network Embedding

Cao

Zhu

Zheng

et al. 2018

IEEE Trans. Netw. Serv. Manage.

View full text Add to dashboard Cite

A novel optimal mapping algorithm with less computational complexity for virtual network embedding Abstract-Virtual Network Embedding (VNE) problem has been widely accepted as an important aspect in Network Virtualization (NV) area: how to efficiently embed virtual networks, with node and link resource demands, onto the shared substrate network that has finite network resources. Previous VNE heuristic algorithms, only considering single network topology attribute and local resources of each node, may lead to inefficient resource utilization of the substrate network in the long term. To address this issue, a Topology Attribute and Global Resource-Driven VNE algorithm (VNE-TAGRD), adopting a novel node-ranking approach, is proposed in this paper. The novel node-ranking approach, developed from the well-known Google PageRank algorithm, considers three essential topology attributes and global network resources information before conducting the embedding of given virtual network request (VNR). Numerical simulation results reveal that the VNE-TAGRD algorithm outperforms five typical and latest heuristic algorithms that only consider single network topology attribute and local resources of each node, such as long-term average VNR acceptance ratio and average revenue to cost ratio.

show abstract

Section: B Representative and Related Exact Vne Algorithmsmentioning

confidence: 99%

Section: B Representative and Related Exact Vne Algorithmsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

A Novel Optimal Mapping Algorithm With Less Computational Complexity for Virtual Network Embedding

Cao

Zhu

Zheng

et al. 2018

IEEE Trans. Netw. Serv. Manage.

View full text Add to dashboard Cite

show abstract

“…Virtualization network can improve the whole network connectivity [3] and improve the efficiency of resource scheduling [4]. Network virtualization has achieved a series of research results.…”

Section: Introductionmentioning

confidence: 99%

Network overhead crowd management mechanism of virtual mobile Internet

Wang

2016

J Embedded Systems

View full text Add to dashboard Cite

It has become the hot research issue that solves the bottleneck of resource management in the development of Internet through virtualization. However, there are the challenges of mobility management, resource management, and network overhead management in the virtualization of the Internet. First, based on the mobile Internet network construction and management mode, the mobile Internet virtual model was proposed for managing the differences of the port communication between the mobile Internet protocol layer and protocol layer. Secondly, based on the network management cost control and the reconstruction of the Internet virtualization, we designed the network overhead crowd optimization space and management vector. The network overhead crowd management mechanism is proposed, which will transport the mobile virtualization Internet topology to point-to-point structure. Finally, the simulation results verified the advantages of the network overhead management mechanism of the virtual mobile Internet in terms of the cost and real time of the network overhead management.

show abstract

Optimal traffic routing in the network virtualization context

Amri

Meddeb

2021

Int J Communication

View full text Add to dashboard Cite

Network virtualization enables service providers to instantiate virtual networks on a common physical infrastructure. Virtual networks are then allocated to clients in order to deploy or test their services. Thus, clients do not know how their traffic is routed, which server is responding, and which path is crossed. Service providers who own the physical infrastructure aim to share the load among multiple servers for traffic routing. However, those who do not own the infrastructure and want to lease it essay to concentrate all the traffic on one server and exactly the closest server. In this paper, we model the problems of load sharing on multiple servers and traffic concentration on one server as two mathematical programs. The objective functions correspond to service providers' aims under a delay constraint based on the M/D/1/N queue's mean sojourn time's formula. Due to its hardness, we provide an approximation of the delay constraint at low and medium traffic intensities. The approximation is analytically proved by the Taylor series development at a chosen point. Finally, through simulation and analytical models, we compare the performance of programs' optimal solutions. We notice that load sharing decreases the packet loss and jitter values. However, traffic concentration reduces the latency.

show abstract

Optimal Virtual Network Embedding: Node-Link Formulation

Cited by 89 publications

References 17 publications

A Novel Optimal Mapping Algorithm With Less Computational Complexity for Virtual Network Embedding

A Novel Optimal Mapping Algorithm With Less Computational Complexity for Virtual Network Embedding

Network overhead crowd management mechanism of virtual mobile Internet

Optimal traffic routing in the network virtualization context

Contact Info

Product

Resources

About