Optimal Flow Distribution Algorithm for Efficient Service Function Chaining 


Vol. 40,  No. 6, pp. 1032-1039, Jun.  2015


PDF
  Abstract

Service function chaining(SFC) defines the creation of network services that consist of an ordered set of service function. A multiple service function instances should be deployed across networks for scalable and fault-tolerant SFC services. Therefore, an incoming flows should be distributed to multiple service function instances appropriately. In this paper, we formulate the flow distribution problem in SFC aiming at minimizing the end-to-end flow latency under resource constraints. Then, we 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.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

M. Kim, G. Lee, S. Choo, S. Pack, Y. Kim, "Optimal Flow Distribution Algorithm for Efficient Service Function Chaining," The Journal of Korean Institute of Communications and Information Sciences, vol. 40, no. 6, pp. 1032-1039, 2015. DOI: .

[ACM Style]

Myeongsu Kim, Giwon Lee, Sukjin Choo, Sangheon Pack, and Younghwa Kim. 2015. Optimal Flow Distribution Algorithm for Efficient Service Function Chaining. The Journal of Korean Institute of Communications and Information Sciences, 40, 6, (2015), 1032-1039. DOI: .

[KICS Style]

Myeongsu Kim, Giwon Lee, Sukjin Choo, Sangheon Pack, Younghwa Kim, "Optimal Flow Distribution Algorithm for Efficient Service Function Chaining," The Journal of Korean Institute of Communications and Information Sciences, vol. 40, no. 6, pp. 1032-1039, 6. 2015.