ETRI-Knowledge Sharing Plaform

ENGLISH

성과물

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

상세정보

학술지 Optimal Service Placement using Pseudo Service Chaining Mechanism for Cloud-based Multimedia Services
Cited 1 time in scopus Download 28 time Share share facebook twitter linkedin kakaostory
저자
나태흠, 박평구, 류호용, 김태연, 김진술, 박재형
발행일
202111
출처
Multimedia Tools and Applications, v.80 no.26-27, pp.34731-34749
ISSN
1380-7501
출판사
Springer
DOI
https://dx.doi.org/10.1007/s11042-020-09083-2
협약과제
19HH2100, 인공지능 기반 지능형 에지 네트워킹 기술개발, 김태연
초록
Network function virtualization based service chaining has recently received significant attention. In cloud environment, virtual machine typically be scheduled to load balancing among computing nodes. Therefore, the relation between virtual machines is not considered when it is scheduled. However, the location of virtual machines be able to affects network performance for intra virtual machines. Video/image processing and transmission are key processes for cloud-based over-the-top content provider. In this paper, we propose a pseudo service chaining mechanism for efficiently allocating computing nodes in a service chain to guarantee quality of services. The mechanism defines a pseudo service chain to reduce the network overhead which mainly causes performance degradation and places highly correlated virtual machines on the nearest computing node. The performance of proposed mechanism was evaluated on real cloud testbed.
KSP 제안 키워드
Cloud-based, Computing Node, Content provider, Load balancing, Multimedia Service, Network Function Virtualization, Network overhead, Network performance, Over-the-top content, Service Chaining, Virtual machine(VM)