RISS 학술연구정보서비스

검색
다국어 입력

http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.

변환된 중국어를 복사하여 사용하시면 됩니다.

예시)
  • 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
  • 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
닫기
    인기검색어 순위 펼치기

    RISS 인기검색어

      검색결과 좁혀 보기

      선택해제

      오늘 본 자료

      • 오늘 본 자료가 없습니다.
      더보기
      • 무료
      • 기관 내 무료
      • 유료
      • KCI등재

        Dynamic service function chain placement with instance reuse in Fog–Cloud​ Computing

        Li Xueqiang,Su Cai,Ghobaei-Arani Mostafa,Albaghdadi Mustafa Fahem 한국통신학회 2023 ICT Express Vol.9 No.5

        The advent of Network Function Virtualization (NFV) technology has brought flexible provisioning to Fog–Cloud Computing-based Networks (FCCNs) for enterprises to outsource their network functions to data center networks. Service Function Chaining (SFC) is a networking concept in NFV by which traffic is steered through an ordered set of Virtual Network Functions (VNFs) composing an end-to-end service. When hundreds of users outsource their network functions to FCCN, the optimal placement of VNFs in the network becomes important for assembling SFCs with the aim of resource utilization efficiency. Motivated by the scalability shortcomings of existing schemes, we propose Deep Reinforcement Learning (DRL)-based approaches by simultaneously considering parallelized SFC and reuse of VNFs to solve this problem, i.e., Asynchronous Advantage Actor–Critic (A3C). A parallelized SFC consists of several sub-SFCs, which can reduce delay and guarantee availability. Also, reuse of preliminary VNFs in SFC placement can improve computation acceleration. The proposed scheme pursues the maximization of the long-term cumulative reward for the trade-off between Quality of Service (QoS) and service cost. The results of the experiments show that the proposed scheme performs better than the state-of-the-art methods.

      연관 검색어 추천

      이 검색어로 많이 본 자료

      활용도 높은 자료

      해외이동버튼