Virtual network mapping with traffic matrices

Wang, Cong; Shanbhag, Shashank; Wolf, Tilman

doi:10.1109/icc.2012.6364255

Cited by 20 publications

(17 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Mosharaf Chowdhury et al [8] designed a collection of VNE algorithms with better coordination between node mapping and link mapping, which improves the acceptance ratio and revenue. Cong Wang et al [9] proposed an alternate formulation of virtual network embedding that represents virtual network requests as traffic matrices, which improves the efficient use of network resources in virtual networks. Up to now, most of the works focus on improving the utilization of network resources and revenue while few studies are carried out on the efficiency of virtual network embedding.…”

Section: Related Workmentioning

confidence: 99%

An efficient Virtual Network embedding algorithm based on subgraph

Lan

Chen

Huang

et al. 2014

2014 International Symposium on Wireless Personal Multimedia Communications (WPMC)

View full text Add to dashboard Cite

Network virtualization, known as a promising technique, has emerged as an effective method to overcome the ossification of the Internet. By enabling the co-existence of multiple heterogeneous Virtual Networks (VNs) over a shared infrastructure, network virtualization exhibits better flexibility. A crucial problem is Virtual Network Embedding (VNE), namely embedding the virtual networks to the substrate network efficiently. Because it is an NP-hard problem, many heuristic algorithms have been developed. However, their efficiency is not high, which makes them unsuitable for real-time multimedia services. Thus, we propose an efficient virtual network embedding algorithm based on subgraph, which takes the load status of substrate links and the network connectivity into consideration. With the proposed algorithm, the computation complexity is reduced and the processing time for each request is shortened. Our simulation results reveal the better efficiency of the proposed algorithm compared to the existing ones.

show abstract

Section: Related Workmentioning

confidence: 99%

An efficient Virtual Network embedding algorithm based on subgraph

Lan

Chen

Huang

et al. 2014

2014 International Symposium on Wireless Personal Multimedia Communications (WPMC)

View full text Add to dashboard Cite

show abstract

“…Authors in [14] - [15] propose different approaches to one-shot VNE assuming that all VN requests are known in advance (offline solutions), while those in [16] - [17] make simplifying assumptions with regard to the capacity of the SN and do not consider constraints on virtual nodes locations. While most VNE proposals use topologies to represent VN requests, [18] proposes the use of traffic matrices. However, the embedding is achieved by alleviating constraints on VN resources, such as node location.…”

Section: B One-shot Embeddingmentioning

confidence: 99%

A Path Generation Approach to Embedding of Virtual Networks

Mijumbi

Serrat

Gorricho

et al. 2015

IEEE Trans. Netw. Serv. Manage.

View full text Add to dashboard Cite

As the virtualization of networks continues to attract attention from both industry and academia, the Virtual Network Embedding (VNE) problem remains a focus of researchers. This paper proposes a one-shot, unsplittable flow VNE solution based on column generation. We start by formulating the problem as a path-based mathematical program called the primal, for which we derive the corresponding dual problem. We then propose an initial solution which is used, first, by the dual problem and then by the primal problem to obtain a final solution. Unlike most approaches, our focus is not only on embedding accuracy but also on the scalability of the solution. In particular, the one-shot nature of our formulation ensures embedding accuracy, while the use of column generation is aimed at enhancing the computation time to make the approach more scalable. In order to assess the performance of the proposed solution, we compare it against four state of the art approaches as well as the optimal link-based formulation of the one-shot embedding problem. Experiments on a large mix of Virtual Network (VN) requests show that our solution is near optimal (achieving about 95% of the acceptance ratio of the optimal solution), with a clear improvement over existing approaches in terms of VN acceptance ratio and average Substrate Network (SN) resource utilization, and a considerable improvement (92% for a SN of 50 nodes) in time complexity compared to the optimal solution.Comment: 14 Pages in IEEE Transactions on Network and Service Management, September 201

show abstract

“…VN topologies introduce unnecessary constraints in the VN embedding problem [21]. In particular, the efficiency of VN embedding depends on the VN topology specification, which in return may require detailed knowledge of the substrate network topology and resource availability.…”

Section: B Vn Request Specificationmentioning

confidence: 99%

Multi-Provider Virtual Network Embedding With Limited Information Disclosure

Dietrich

Rizk

Papadimitriou

2015

IEEE Trans. Netw. Serv. Manage.

View full text Add to dashboard Cite

Abstract-The ever-increasing need to diversify the Internet has recently revived the interest in network virtualization. Network virtualization carries a significant benefit to Service Providers, as it enables the deployment of network services within customized virtual networks (VN) that offer performance and reliability guarantees. VN embedding across multiple substrate providers creates the need for a layer of indirection which is fulfilled by VN Providers. VN Providers are expected to have very limited knowledge of the physical infrastructure, since substrate providers do not disclose their network topology and resource information. This entails significant implications on resource discovery and assignment.In this paper, we study the challenging problem of multidomain VN embedding with limited information disclosure (LID). In this context, we discuss the visibility of VN Providers on substrate network resources and question the suitability of topologies for VN request specifications. Our main contributions are as follows: (i) we present a traffic matrix based VN embedding framework that enables VN request partitioning under LID, and (ii) we conduct a feasibility study on VN embedding with LID compared to a "best-case" scenario where all information is available to VN Providers.

show abstract

Virtual network mapping with traffic matrices

Cited by 20 publications

References 9 publications

An efficient Virtual Network embedding algorithm based on subgraph

An efficient Virtual Network embedding algorithm based on subgraph

A Path Generation Approach to Embedding of Virtual Networks

Multi-Provider Virtual Network Embedding With Limited Information Disclosure

Contact Info

Product

Resources

About