Optimal flow distribution in service function chaining

Giwon Lee, Myeongsu Kim, Sukjin Choo, Sangheon Pack, Younghwa Kim

Research output: Chapter in Book/Report/Conference proceedingConference contribution

13 Citations (Scopus)

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 languageEnglish
Title of host publicationACM International Conference Proceeding Series
PublisherAssociation for Computing Machinery
Pages17-20
Number of pages4
Volume08-10-June-2015
ISBN (Print)9781450335645
DOIs
Publication statusPublished - 2015 Jun 8
Event10th International Conference on Future Internet, CFI 2015 - Seoul, Korea, Republic of
Duration: 2015 Jun 82015 Jun 10

Other

Other10th International Conference on Future Internet, CFI 2015
CountryKorea, Republic of
CitySeoul
Period15/6/815/6/10

    Fingerprint

Keywords

  • Flow distribution
  • Integer linear programming
  • Service function chaining

ASJC Scopus subject areas

  • Human-Computer Interaction
  • Computer Networks and Communications
  • Computer Vision and Pattern Recognition
  • Software

Cite this

Lee, G., Kim, M., Choo, S., Pack, S., & Kim, Y. (2015). Optimal flow distribution in service function chaining. In ACM International Conference Proceeding Series (Vol. 08-10-June-2015, pp. 17-20). Association for Computing Machinery. https://doi.org/10.1145/2775088.2775103