學術出版;;Publications
Permanent URI for this communityhdl:11536/1
收集所有交通大學研究人員與學生個人或團體所發表之各項學術著作,涵蓋期刊論文、教師專書、學位論文等項。;;Collections of Publications of NCTU Researchers and Students Like Journal Papers and Thesis.
Browse
2 results
🏛️國立陽明交通大學機構典藏
Search Results
Item type:Item, Hash-based Load Balanced Traffic Steering on Softswitches for Chaining Virtualized Network Functions(2017-01-01) ;Thai, Minh-Tuan ;Lin, Ying-Dar ;Linz, Po-Ching ;Lai, Yuan-Cheng交大名義發表Prior load balancing solutions for chaining virtualized network functions cause significant control and data plane overheads and demand special requirements on network hardware. In this study, we present the design, implementation, and evaluation of Hash-based Traffic Steering on Softswitches (HATS), a load balancing mechanism that aims at mitigating such drawbacks. The method exploits flow hashing technique implemented on softswitches to perform server and network load balancing without triggering the control plane. We have implemented this design using OpenDayLight controller and Open vSwitch platform. The implementation demonstrates that HATS can be readily implemented with commodity network hardware. Furthermore, the experiment results confirm that HATS can reduce the number of flow entries and service chaining time up to 85% and 93%, respectively, when compared with Least Load First (LLF), a controller-based service chaining algorithm.Item type:Item, Towards load-balanced service chaining by Hash-based Traffic Steering on Softswitches(2018-05-01) ;Thai, Minh-Tuan ;Lin, Ying-Dar ;Lin, Po-Ching ;Lai, Yuan-Cheng資訊工程學系In this paper we study Hash-based Traffic Steering on Softswitches (HATS) which is a load balancing scheme for chaining virtualized network functions (VNFs), with the aim of mitigating the control and data plane overheads of existing methods. Our method uses a flow-hashing technique applied to softswitches to carry out server and network load balancing without triggering the controller. By exploiting the advantages of HATS, we then derive two algorithms, HATS with Flowcell-based Multipathing (HATS-Flowcell) and Dynamic Weight Adjustment for HATS (D-HATS), to address hash collision problems which downgrade system performance. The first algorithm divides an elephant flow into various equal-size flowcells, which are distributed over network paths as individual flows. The second algorithm periodically updates the hashing weights of VNFs and network paths according to their current load status. Our implementation demonstrates that HATS can be readily deployed on commodity network hardware. Furthermore, our experimental results show that D-HATS has roughly the same load balancing performance with Least Load First (LLF), a controller-based service chaining algorithm; while significantly reducing the number of flow entries and service chaining time by 54% and 93%.