Abstract
Service function chaining (SFC) enables the creation of composite network services that consist of an ordered set of service functions. For scalable and fault-tolerant SFC services, multiple service function instances should be deployed across networks and incoming flows should be distributed to multiple service function instances appropriately. In this paper, we formulate the flow distribution problem in SFC under resource constraints and evaluate its optimal solution in a realistic network topology generated by the GT-ITM topology generator. Simulation results reveal that the optimal solution can reduce the total flow latency significantly.
| Original language | English |
|---|---|
| Title of host publication | 10th International Conference on Future Internet, CFI 2015 |
| Publisher | Association for Computing Machinery |
| Pages | 17-20 |
| Number of pages | 4 |
| ISBN (Electronic) | 9781450335645 |
| DOIs | |
| Publication status | Published - 2015 Jun 8 |
| Event | 10th International Conference on Future Internet, CFI 2015 - Seoul, Korea, Republic of Duration: 2015 Jun 8 → 2015 Jun 10 |
Publication series
| Name | ACM International Conference Proceeding Series |
|---|---|
| Volume | 08-10-June-2015 |
Other
| Other | 10th International Conference on Future Internet, CFI 2015 |
|---|---|
| Country/Territory | Korea, Republic of |
| City | Seoul |
| Period | 15/6/8 → 15/6/10 |
Bibliographical note
Publisher Copyright:© 2015 ACM.
Keywords
- Flow distribution
- Integer linear programming
- Service function chaining
ASJC Scopus subject areas
- Software
- Human-Computer Interaction
- Computer Vision and Pattern Recognition
- Computer Networks and Communications
Fingerprint
Dive into the research topics of 'Optimal flow distribution in service function chaining'. Together they form a unique fingerprint.Cite this
- APA
- Standard
- Harvard
- Vancouver
- Author
- BIBTEX
- RIS