Abstract
Service function chaining (SFC) refers to as an order set composed of multiple service functions (SFs) that specific flows should be processed. In this paper, we formulate an optimization problem to efficiently utilize the network resource in SFC-enabled networks by determining the amount of flows assigned to each link and SF instance. Simulation results demonstrate that the proposed optimal solution can reduce the network resource usage and thus accommodate more flows compared with non-optimal solutions.
| Original language | English |
|---|---|
| Title of host publication | IEEE NETSOFT 2016 - 2016 IEEE NetSoft Conference and Workshops: Software-Defined Infrastructure for Networks, Clouds, IoT and Services |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| Pages | 11-14 |
| Number of pages | 4 |
| ISBN (Electronic) | 9781467394864 |
| DOIs | |
| Publication status | Published - 2016 Jun 30 |
| Event | 2nd IEEE International Conference on Network Softwarization, NetSoft 2016 - Seoul, Korea, Republic of Duration: 2016 Jun 6 → 2016 Jun 10 |
Other
| Other | 2nd IEEE International Conference on Network Softwarization, NetSoft 2016 |
|---|---|
| Country/Territory | Korea, Republic of |
| City | Seoul |
| Period | 16/6/6 → 16/6/10 |
Keywords
- network resource utilization
- Service function chaining
ASJC Scopus subject areas
- Computer Networks and Communications
- Hardware and Architecture