Balanced Service Chaining in Software-Defined Networks with Network Function Virtualization
Authors:
- 11 November 2016
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Computer
- Vol. 49 (11) , 68-76
Abstract
Balanced Hash Tree (BHT) is a mechanism for service function (SF) chaining, service routing, and traffic steering that enables switches to select SF instances for load balancing without involving the controller. In an experimental evaluation, BHT decreased packet-in message-processing time by 92.5 percent and achieved near-perfect load-balancing performance.Keywords
This publication has 8 references indexed in Scilit:
- Service Function Chaining (SFC) Architecture2015
- Network Function Virtualization: State-of-the-Art and Research ChallengesIEEE Communications Surveys & Tutorials, 2015
- An extended SDN architecture for network function virtualization with a case study on intrusion preventionIEEE Network, 2015
- Problem Statement for Service Function Chaining2015
- A Survey of Software-Defined Networking: Past, Present, and Future of Programmable NetworksIEEE Communications Surveys & Tutorials, 2014
- SIMPLE-fying middlebox policy enforcement using SDNACM SIGCOMM Computer Communication Review, 2013
- Multiple service load-balancing with OpenFlow2012
- A note on two problems in connexion with graphsNumerische Mathematik, 1959