<link rel="stylesheet" href="styles.cf390c6bfbe7555f.css"> Skip to main content

Optimizing The Service Capacity of SDN-based Cellular Networks with Service Chaining and NFV

dc.citation.epage2482en_US
dc.citation.spage2477en_US
dc.citation.woscount0en_US
dc.contributor.authorGau, Rung-Hungen_US
dc.contributor.authorChiu, Hsiao-Tingen_US
dc.contributor.authorTsai, Pei-Kanen_US
dc.contributor.department電機工程學系zh_TW
dc.contributor.departmentDepartment of Electrical and Computer Engineeringen_US
dc.date.accessioned2017-04-21T06:48:52Z
dc.date.available2017-04-21T06:48:52Z
dc.date.issued2016en_US
dc.description.abstractIn this paper, we investigate the service capacity of SDN-based cellular networks with service chaining and network function virtualization. Due to service chaining requirements, the service capacity is different from the well-known maximum flow-minimum-cut capacity. To maximize the service capacity, we take a novel approach of traffic engineering. In particular, we formulate and solve a linear optimization problem to obtain optimal service paths for flows and an optimal bandwidth allocation for virtual machines. We also include numerical results that justify the usage of the proposed approach.en_US
dc.identifier.isbn978-1-5090-3254-9en_US
dc.identifier.journal2016 IEEE 27TH ANNUAL INTERNATIONAL SYMPOSIUM ON PERSONAL, INDOOR, AND MOBILE RADIO COMMUNICATIONS (PIMRC)en_US
dc.identifier.urihttps://ir.lib.nycu.edu.tw/handle/11536/134656
dc.identifier.wosnumberWOS:000391598800420en_US
dc.language.isoen_USen_US
dc.subjectcellular networken_US
dc.subjectsoftware-defined networken_US
dc.subjecttraffic engineeringen_US
dc.subjectservice chainingen_US
dc.subjectnetwork function virtualizationen_US
dc.subjectnetwork optimizationen_US
dc.titleOptimizing The Service Capacity of SDN-based Cellular Networks with Service Chaining and NFVen_US
dc.typeProceedings Paperen_US

Files

License bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed to upon submission
Description: