Full metadata record
DC FieldValueLanguage
dc.contributor.authorLin, Po-Chingen_US
dc.contributor.authorLin, Ying-Daren_US
dc.contributor.authorWu, Cheng-Yingen_US
dc.contributor.authorLai, Yuan-Chengen_US
dc.contributor.authorKao, Yi-Chihen_US
dc.date.accessioned2017-04-21T06:55:57Z-
dc.date.available2017-04-21T06:55:57Z-
dc.date.issued2016-11en_US
dc.identifier.issn0018-9162en_US
dc.identifier.urihttp://hdl.handle.net/11536/132835-
dc.description.abstractBalanced 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.en_US
dc.language.isoen_USen_US
dc.titleBalanced Service Chaining in Software-Defined Networks with Network Function Virtualizationen_US
dc.identifier.journalCOMPUTERen_US
dc.citation.volume49en_US
dc.citation.issue11en_US
dc.citation.spage68en_US
dc.citation.epage76en_US
dc.contributor.department交大名義發表zh_TW
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentNational Chiao Tung Universityen_US
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000388860800010en_US
Appears in Collections:Articles