Skip to main content

Network Virtualization in Data Centers: A Data Plane Perspective

  • Chapter
  • First Online:
Handbook on Data Centers

Abstract

In this chapter we discuss two aspects of network virtualization in modern data centers: (1) network link virtualization and (2) network node virtualization. By virtualizing physical network links, each virtual network may obtain a slice of network links and build its own logical topology out of the shared physical topology. In network node virtualization, a physical networking device is logically partitioned so that each virtual network has its own slice of the device. We identify the key challenges on the data plane associated with these two aspects of network virtualization as (1) flexible flow matching and (2) resource consolidation, respectively. We give an overview on the state-of-the-art solutions for the two problems. We also provide our insights on future research in this field.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    The width of the ingress port is determined by the number of ports of the networking device. For example, 6-bit ingress port indicates that the networking device has up to 63 ports.

  2. 2.

    A full trie is defined as a complete binary trie covering all possible prefixes.

References

  1. M. F. Bari, R. Boutaba, R. Esteves, L. Z. Granville, M. Podlesny, M. G. Rabbani, Q. Zhang and M. F. Zhani, “Data Center Network Virtualization: A Survey,” IEEE Communications Surveys & Tutorials, vol. 15, no. 2, pp. 909–928, 2013.

    Article  Google Scholar 

  2. OpenFlow, “Enabling Innovation in Your Network,” [Online]. Available: www.openflow.org.

  3. J. C. Mogul, P. Yalag, J. Tourrilhes, R. Mcgeer, S. Banerjee, T. Connors and P. Sharma, “API design challenges for open router platforms on proprietary hardware,” in Proceedings of the ACM Workshop on Hot Topics in Networks (HotNets), 2008.

    Google Scholar 

  4. W. Jiang and V. K. Prasanna, “Scalable Packet Classification on FPGA,” IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol. 20, no. 9, pp. 1668–1680, 2012.

    Article  Google Scholar 

  5. D. E. Taylor, “Survey and taxonomy of packet classification techniques,” ACM Comput. Surv., vol. 37, no. 3, p. 238–275, 2005.

    Article  Google Scholar 

  6. “Virtex-7 FPGA Family,” Xilinx, [Online]. Available: http://www.xilinx.com/products/silicon-devices/fpga/virtex-7/index.htm.

  7. J. Naous, D. Erickson, G. A. Covington, G. Appenzeller and N. McKeown, “Implementing an OpenFlow Switch on the NetFPGA Platform,” in Proceedings of the 4th ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS08), 2008.

    Google Scholar 

  8. Y. Luo, P. Cascon, E. Murray and J. Ortega, “Accelerating OpenFlow Switching with Network Processors,” in Proceedings of ACM/IEEE ANCS, 2009.

    Google Scholar 

  9. S. Singh, F. Baboescu, G. Varghese and J. Wang, “Packet classification using multidimensional cutting,” in Proceedings of ACM SIGCOMM, 2003.

    Google Scholar 

  10. J. Fong, X. Wang, Y. Qi, J. Li and W. Jiang, “ParaSplit: A Scalable Architecture on FPGA for Terabit Packet Classification,” in Proceedings of IEEE HOTI, 2012.

    Google Scholar 

  11. Cisco Systems, Inc, [Online]. Available: www.cisco.com.

  12. Juniper Networks, Inc., [Online]. Available: www.juniper.net.

  13. H. Song, M. Kodialam, F. Hao and T. V. Lakshman, “Building Scalable Virtual Routers with Trie Braiding,” in Proceedings of IEEE Infocom, 2010.

    Google Scholar 

  14. V. Srinivasan and G. Varghese, “Fast address lookups using controlled prefix expansion,” ACM Trans. Comput. Syst., vol. 17, pp. 1–40, 1999.

    Article  Google Scholar 

  15. J. Fu and J. Rexford, “Efficient IP-Address Lookup with a Shared Forwarding Table for Multiple Virtual Routers,” in Proceedings of ACM CoNext, 2008.

    Google Scholar 

  16. T. Ganegedara, W. Jiang and V. K. Prasanna, “FRuG: A Benchmark for Packet Forwarding in Future Networks,” in Proceedings of IEEE IPCCC, 2010.

    Google Scholar 

  17. Routing Information Service (RIS), [Online]. Available: http://www.ripe.net/ris/.

Download references

Acknowledgement

This work is partly supported by the United States National Science Foundation under grant CCF-1116781. Equipment grant from Xilinx Inc. is gratefully acknowledged.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Weirong Jiang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer Science+Business Media New York

About this chapter

Cite this chapter

Jiang, W., Prasanna, V. (2015). Network Virtualization in Data Centers: A Data Plane Perspective. In: Khan, S., Zomaya, A. (eds) Handbook on Data Centers. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2092-1_10

Download citation

  • DOI: https://doi.org/10.1007/978-1-4939-2092-1_10

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4939-2091-4

  • Online ISBN: 978-1-4939-2092-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics