ETRI-Knowledge Sharing Plaform

ENGLISH

성과물

논문 검색
구분 SCI
연도 ~ 키워드

상세정보

학술대회 Optimal Flow Distribution in Service Function Chaining
Cited 21 time in scopus Download 0 time Share share facebook twitter linkedin kakaostory
저자
이기원, 김명수, 주석진, 백상헌, 김영화
발행일
201506
출처
International Conference on Future Internet Technologies (CFI) 2015, pp.17-20
DOI
https://dx.doi.org/10.1145/2775088.2775103
협약과제
15MI2200, (통합)스마트 네트워킹 핵심 기술 개발, 양선희
초록
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.
키워드
Flow distribution, Integer linear programming, Service function chaining
KSP 제안 키워드
Composite network, Distribution problem, Fault-tolerant, Integer linear programming(ILP), Network service, Network topology, Optimal Solution, Resource constraints, Topology generator, flow distribution, ordered set