Nothing Special   »   [go: up one dir, main page]

skip to main content
research-article

VINEA: An Architecture for Virtual Network Embedding Policy Programmability

Published: 01 November 2016 Publication History

Abstract

Network virtualization has enabled new business models by allowing infrastructure providers to lease or share their physical network. A fundamental management problem that cloud providers face to support customized virtual network (VN) services is the virtual network embedding. This requires solving the (NP-hard) problem of matching constrained virtual networks onto the physical network. In this paper we present VINEA, a policy-based virtual network embedding architecture, and its system implementation. VINEA leverages our previous results on VN embedding optimality and convergence guarantees, and it is based on a network utility maximization approach that separates policies (i.e., high-level goals) from underlying embedding mechanisms: resource discovery, virtual network mapping, and allocation on the physical infrastructure. We show how VINEA can subsume existing embedding approaches, and how it can be used to design novel solutions that adapt to different scenarios, by merely instantiating different policies. We describe the VINEA architecture, as well as our object model: our VINO protocol and the API to program the embedding policies; we then analyze key representative tradeoffs among novel and existing VN embedding policy configurations, via event-driven simulations, and with our prototype implementation. Among our findings, our evaluation shows how, in contrast to existing solutions, simultaneously embedding nodes and links may lead to lower providers’ revenue. We release our implementation on a testbed that uses a Linux system architecture to reserve virtual node and link capacities. Our prototype can be also used to augment existing open-source “Networking as a Service” architectures such as OpenStack Neutron, that currently lacks a VN embedding protocol, and as a policy-programmable solution to the “slice stitching” problem within wide-area virtual network testbeds.

References

[1]
M. Yu, Y. Yi, J. Rexford, and M. Chiang, “ Rethinking virtual network embedding: Substrate support for path splitting and migration,” ACM SIGCOMM Comput. Commun. Rev., vol. Volume 38, no. Issue 2, pp. 17–29, 2008.
[2]
M. Chowdhury, M. R. Rahman, and R. Boutaba, “ ViNEYard: Virtual network embedding algorithms with coordinated node and link mapping,” IEEE/ACM Trans. Netw., vol. Volume 20, no. Issue 1, pp. 206–219, 2012.
[3]
I. Houidi, W. Louati, W. Ben Ameur, and D. Zeghlache, “ Virtual network provisioning across multiple substrate networks,” Comput. Netw., vol. Volume 55, no. Issue 4, pp. 1011–1023, 2011.
[4]
M. Chowdhury, F. Samuel, and R. Boutaba, “ PolyViNE: Policy-based virtual network embedding across multiple domains,” in Proc. 2nd ACM SIGCOMM Workshop Virtualized Infrastruct. Syst. Archit., 2010, pp. 49–56.
[5]
F. Esposito, D. Di Paola, and I. Matta, “ On distributed virtual network embedding with guarantees,” IEEE/ACM Trans. Netw., vol. PP, no. Issue 99, p. 1, Dec. 2014.
[6]
Y. Zhu, R. Zhang-Shen, S. Rangarajan, and J. Rexford, “ Cabernet: Connectivity architecture for better network services,” in Proc. CoNEXT, 2008, p. pp.64.
[7]
J. Lu and J. Turner, “ Efficient mapping of virtual networks onto a shared substrate,” Washington Univ., St. Louis, MO, USA, Tech. Rep. WUCSE2006-35, 2006.
[8]
F. Zaheer, J. Xiao, and R. Boutaba, “ Multi-provider service negotiation and contracting in network virtualization,” in Proc. Netw. Oper. Manage. Symp., 2010, pp. 471–478.
[9]
J. Day, I. Matta, and K. Mattar, “ Networking is IPC: A guiding principle to a better internet,” in Proc. CoNEXT, 2008, pp. 67:1–67:6.
[10]
F. Esposito, Y. Wang, I. Matta, and J. Day, “ Dynamic layer instantiation as a service,” in Proc. 10th USENIX Symp. Netw. Syst. Des. Implementation, 2013, pp. 1–98.
[11]
Y. Wang, I. Matta, F. Esposito, and J. Day, “ Introducing ProtoRINA: A prototype for programming recursive-networking policies,” SIGCOMM Comput. Commun. Rev., vol. Volume 44, no. Issue 3, pp. 129–131, 2014.
[12]
F. Esposito. (2014). The Virtual Network Embedding Architecture (VINEA) Project {Online}. Available: http://csr.bu.edu/vinea
[13]
Open Virtual Switch Community. (2013). Open virtual switch. {Online}. Available: http://openvswitch.org/
[14]
F. Esposito and I. Matta, “ A decomposition-based architecture for distributed virtual network embedding,” in Proc. ACM SIGCOMM Workshop Distrib. Cloud Comput., 2014, pp. 53–58.
[15]
B. Lantz, B. Heller, and N. McKeown, “ A network in a laptop: Rapid prototyping for software-defined networks,” in Proc. 9th ACM SIGCOMM Workshop Hot Topics Netw., 2010, pp. 19:1–19:6.
[16]
(2010). GENI {Online}. Available: http://www.geni.net
[17]
F. Esposito, I. Matta, and V. Ishakian, “ Slice embedding solutions for distributed service architectures,” ACM Comput. Surveys, vol. Volume 46, no. Issue 2, pp. 6:1–6:29, 2014.
[18]
(2013). Neutron {Online}. Available: https://wiki.openstack.org/wiki/Neutron
[19]
(2013). CloudStack {Online}. Available: http://cloudstack.apache.org/
[20]
(2010). OpenStack {Online}. Available: http://openstack.org/
[21]
N. McKeown, T. Anderson, H. Balakrishnan, G. Parulkar, L. Peterson, J. Rexford, S. Shenker, and J. Turner, “ OpenFlow: Enabling innovation in campus networks,” ACM SIGCOMM Comput. Commun. Rev., vol. Volume 38, no. Issue 2, pp. 69–74, 2008.
[22]
Z. A. Qazi, C. Tu, L. Chiang, R. Miao, V. Sekar, and M. Yu, “ SIMPLE-fying middlebox policy enforcement using SDN,” in Proc. SIGCOMM, New York, NY, USA, 2013, pp. 27–38.
[23]
A. Voellmy, J. Wang, R. Yang, B. Ford, and P. Hudak, “ Maple: Simplifying SDN programming using algorithmic policies,” in Proc. SIGCOMM, 2013, pp. 87–98.
[24]
K. Mattar, I. Matta, J. Day, V. Ishakian, and G. Gursun, “ Declarative transport: A customizable transport service for the future internet,” in Proc. 5th Int. Workshop Netw. Meets Databases, 2009, pp. 32–40.
[25]
C. Liu, R. Correa, X. Li, P. Basu, B. Loo, and Y. Mao, “ Declarative policy-based adaptive mobile ad hoc networking,” IEEE/ACM Trans. Netw., vol. Volume 20, no. Issue 3, pp. 770–783, 2012.
[26]
B. T. Loo, J. M. Hellerstein, I. Stoica, and R. Ramakrishnan, “ Declarative routing: Extensible routing with declarative queries,” in Proc. Conf. Appl., Technol., Archit., Protocols Comput. Commun., 2005, pp. 289–300.
[27]
G. Schaffrath, C. Werle, P. Papadimitriou, A. Feldmann, R. Bless, A. Greenhalgh, A. Wundsam, M. Kind, O. Maennel, and L. Mathy, “ Network virtualization architecture: Proposal and initial prototype,” in Proc. 1st ACM Workshop Virtualized Infrastructure Syst. Archit., 2009, pp. 63–72.
[28]
C. Guo, et al., “ SecondNet: A data center network virtualization architecture with bandwidth guarantees,” in Proc. 6th Int. Conf., 2010, pp. 15:1–15:12. {Online}. Available:
[29]
F. Esposito, “ A policy-based architecture for virtual network embedding,” Ph.D. dissertation, Comput. Sci. Dept., Boston Univ., Boston, MA, USA, 2013.
[30]
I. Houidi, W. Louati, and D. Zeghlache, “ A distributed virtual network mapping algorithm,” in Proc. IEEE Int. Conf. Commun., 2008, pp. 5634–5640.
[31]
R. Sherwood, G. Gibb, K.-K. Yap, G. Appenzeller, M. Casado, N. McKeown, and G. Parulkar, “ Can the production network be the testbed?” in Proc. 9th USENIX Conf. Oper. Syst. Des. Implementation, 2010, pp. 1–6.
[32]
Y. Xin, I. Baldine, A. Mandal, C. Heermann, J. Chase, and A. Yumerefendi, “ Embedding virtual topologies in networked clouds,” in Proc. 6th Int. Conf. Future Internet Technol., 2011, pp. 26–29.
[33]
B. Chun and A. Vahdat, “ Workload and failure characterization on a large-scale federated testbed,” Intel Research Berkeley, Tech. Rep. IRB-TR-03-040, 2003.
[34]
J. Lischka and H. Karl, “ A virtual network mapping algorithm based on subgraph isomorphism detection,” in Proc. 1st ACM Workshop Virtualized Infrastruct. Syst. Archit., 2009, pp. 81–88.
[35]
Y. Fu, J. Chase, B. Chun, S. Schwab, and A. Vahdat, “ SHARP: An architecture for secure resource peering,” SIGOPS Oper. Syst. Rev., vol. Volume 37, no. Issue 5, pp. 133–148, 2003.
[36]
J. Albrecht, D. Oppenheimer, D. Patterson, and A. Vahdat, “ Design and implementation trade-offs for wide-area resource discovery,” ACM Trans. Internet Technol., vol. Volume 8, no. Issue 4, pp. 1–44, 2008.
[37]
N. A. Lynch, Distributed Algorithms, 1st ed. San Mateo, CA, USA: Morgan, 1996.
[38]
D. Eppstein, “ Finding the k shortest paths,” SIAM J. Comput., vol. Volume 28, no. Issue 2, pp. 652–673, 1999.
[39]
K. McCloghrie and M. Rose. (1990). Management information base for network management of TCP/IP-based internets {Online}. Available: http://www.ietf.org/rfc/rfc1156.txt
[40]
A. AuYoung, B. Chun, A. Snoeren, and A. Vahdat, “ Resource allocation in federated distributed computing infrastructures,” in Proc. 1st Workshop Oper. Syst. Archit. Support Ondemand IT InfraStruct., 2004, pp. 23–32.
[41]
K. Beck, M. Beedle, A. Bennekum, A. Cockburn, W. Cunningham, M. Fowler, R. Martin, S. Mellor, D. Thomas, J. G. J. Highsmith, A. Hunt, R. Jeffries, J. Kern, B. Marick, K. Schwaber, and J. Sutherland, “ Manifesto for agile software development,” Agile Alliance, 2010, http://www.agilemanifesto.org/
[42]
Google Protocol Buffers. (2013). Developer Guide {Online}. Available: http://code.google.com/apis/protocolbuffers
[43]
B. Lucier, R. P. Leme, and É. Tardos, “ On revenue in the generalized second price auction,” in Proc. 21st Int. Conf. World Wide Web, 2012, pp. 361–370.
[44]
A. B. J. Londono and S. Teng, “ Collocation games and their application to distributed resource management,” in Proc. Workshop Hot Topics Cloud Comput., San Diego, CA, USA, 2009, pp. 101–113.
[45]
Y. Wang, F. Esposito, I. Matta, and J. Day, “ Recursive InterNetworking architecture (RINA) Boston university prototype programming manual,” Boston Univ., Boston, MA, USA, Tech. Rep. BUCS-TR-2013-013, 2013.
[46]
S. Boyd and L. Vandenberghe. (2004). Convex Optimization {Online}. Available: http://www.stanford.edu/people/boyd/cvxbook.html
[47]
B. White, J. Lepreau, L. Stoller, R. Ricci, S. Guruprasad, M. Newbold, M. Hibler, C. Barb, and A. Joglekar, “ An integrated experimental environment for distributed systems and networks,” SIGOPS Oper. Syst. Rev., vol. Volume 36, pp. 255–270, 2002.
[48]
A. Medina, A. Lakhina, I. Matta, and J. Byers, “ BRITE: An approach to universal topology generation,” in Proc. 9th Int. Symp. Modeling, Anal. Simul. Comput. Telecommun. Syst., 2001, p. pp.346.
[49]
M. Grant and S. Boyd. (2014, ). CVX: Matlab software for disciplined convex programming, version 2.1 {Online}. Available: http://cvxr.com/cvx

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems  Volume 27, Issue 11
November 2016
309 pages

Publisher

IEEE Press

Publication History

Published: 01 November 2016

Qualifiers

  • Research-article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 0
    Total Downloads
  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 21 Nov 2024

Other Metrics

Citations

View Options

View options

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media