完整後設資料紀錄
DC 欄位語言
dc.contributor.authorHuang, Po-Hanen_US
dc.contributor.authorLi, Kuan-Weien_US
dc.contributor.authorWen, Charles H. -P.en_US
dc.date.accessioned2017-04-21T06:49:48Z-
dc.date.available2017-04-21T06:49:48Z-
dc.date.issued2015en_US
dc.identifier.isbn978-1-4673-9501-4en_US
dc.identifier.issn2374-3239en_US
dc.identifier.urihttp://hdl.handle.net/11536/135501-
dc.description.abstractNetwork function virtualization (NFV) provides the flexibility for service providers to scale up their service systems and also enhances the possibility to satisfy user demand with limited resources by enabling network functions on commodity servers, as well as by allowing multiple identical network functions existing in the service networks. On the other hand, to accommodate various user demands, multiple service chains need to be applied in this network. However, due to the flow mingling problem in network service chaining, the system throughput can hardly be evaluated, and determining multiple service chains becomes a challenge. In this work, we identify two types of flow-mingling problems: intra-chains link contention and inter-chains link contention, and propose an algorithm named NACHOS to facilitate selection of multiple service chains. As a result, NACHOS can result in the optimality with maximum available bandwidth in a datacenter network, and can select service chains in polynomial time.en_US
dc.language.isoen_USen_US
dc.titleNACHOS: Network-Aware CHains Orchestration Selection for NFV in SDN Datacenteren_US
dc.typeProceedings Paperen_US
dc.identifier.journal2015 IEEE 4TH INTERNATIONAL CONFERENCE ON CLOUD NETWORKING (CLOUDNET)en_US
dc.citation.spage205en_US
dc.citation.epage208en_US
dc.contributor.department電機學院zh_TW
dc.contributor.departmentCollege of Electrical and Computer Engineeringen_US
dc.identifier.wosnumberWOS:000377207000037en_US
dc.citation.woscount0en_US
顯示於類別:會議論文