Rethinking virtual network embedding

Computer Communication Review - Tập 38 Số 2 - Trang 17-29 - 2008
Minlan Yu1, Yung Yi1, Jennifer Rexford1, Mung Chiang1
1Princeton University, Princeton, NJ

Tóm tắt

Network virtualization is a powerful way to run multiple architectures or experiments simultaneously on a shared infrastructure. However, making efficient use of the underlying resources requires effective techniques for virtual network embedding--mapping each virtual network to specific nodes and links in the substrate network. Since the general embedding problem is computationally intractable, past research restricted the problem space to allow efficient solutions, or focused on designing heuristic algorithms. In this paper, we advocate a different approach: rethinking the design of the substrate network to enable simpler embedding algorithms and more efficient use of resources, without restricting the problem space. In particular, we simplify virtual link embedding by: i) allowing the substrate network to split a virtual link over multiple substrate paths and ii) employing path migration to periodically re-optimize the utilization of the substrate network. We also explore node-mapping algorithms that are customized to common classes of virtual-network topologies. Our simulation experiments show that path splitting, path migration,and customized embedding algorithms enable a substrate network to satisfy a much larger mix of virtual networks

Từ khóa


Tài liệu tham khảo

Akamai content distribution network. http://www.akamai.com/. Akamai content distribution network. http://www.akamai.com/.

GENI.http://www.geni.net/. GENI.http://www.geni.net/.

Planetlab.https://www.planet-lab.org/. Planetlab.https://www.planet-lab.org/.

Virtual Network Embedding Simulator. http://www.cs.princeton.edu/~minlanyu/embed.tar.gz Virtual Network Embedding Simulator. http://www.cs.princeton.edu/~minlanyu/embed.tar.gz

R.K. Ahuja T.L. Magnanti and J.B. Orlin. Network Flows: Theory Algorithms and Applications Prentice Hall 1993. R.K. Ahuja T.L. Magnanti and J.B. Orlin. Network Flows: Theory Algorithms and Applications Prentice Hall 1993.

D.G. Andersen. Theoretical approaches to node assignment. Unpublished Manuscript http://www.cs.cmu.edu/~dga/papers/andersen-assign.ps 2002. D.G. Andersen. Theoretical approaches to node assignment. Unpublished Manuscript http://www.cs.cmu.edu/~dga/papers/andersen-assign.ps 2002.

10.1109/MC.2005.136

10.1145/1177080.1177100

10.1145/1159913.1159916

10.1109/TNET.2002.803918

Eppstein D., 1994, Proc. IEEE Symposium on Foundations of Computer Science

10.1109/INFOCOM.2006.139

10.1145/1198255.1198265

10.1109/65.826367

10.1145/380752.380830

10.1145/263326.263344

10.1109/MNET.2008.4476066

10.1109/INFCOM.2007.25

Kirkpatrick S., 1983, Optimization by simulated annealing. Science, Number, 4598, 220

Kleinberg J., 1996, MIT

10.5555/795663.796365

10.1109/71.963420

10.1145/1028788.1028836

10.1145/956981.956988

10.1109/GLOCOM.2005.1577741

Webb K., 2004, Workshop on Real, Large Distributed Systems (WORLDS)

Wood T., 2007, Proc. Networked Systems Design and Implementation

10.5555/1895868.1895900

10.1109/INFOCOM.2006.322

Thông tin
Thông tin xuất bản

Computer Communication Review

Tập 38 Số 2

17-29

Thông tin tác giả