RISS 학술연구정보서비스

검색
다국어 입력

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

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

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

    RISS 인기검색어

      SCIE SCOPUS KCI등재

      Virtual Machine Placement in Cloudlet Mesh

      한글로보기

      https://www.riss.kr/link?id=A105591063

      • 0

        상세조회
      • 0

        다운로드
      서지정보 열기
      • 내보내기
      • 내책장담기
      • 공유하기
      • 오류접수

      부가정보

      다국어 초록 (Multilingual Abstract)

      In the era of Internet of Things (IoT), the concept of "cloudlet" was proposed, which can be considered as a "micro data center in a box" deployed at the edge of the mobile networks. The integration of cloudlet and wireless mesh networks gives rise to...

      In the era of Internet of Things (IoT), the concept of "cloudlet" was proposed, which can be considered as a "micro data center in a box" deployed at the edge of the mobile networks. The integration of cloudlet and wireless mesh networks gives rise to the idea of "cloudlet mesh", which offers services to a large number of IoT applications simultaneously. With virtualized servers in each cloudlet, users issue networked VMs to run their applications, and then the broker or orchestrator of the cloudlet mesh infrastructure decides the resource allocation. This process is known as the VM placement. With the network topology reconfigurability and the adaptive bandwidth provided by the Software Defined Networking (SDN) technologies, new opportunities arise to optimize the VM placement problem. In this paper, we address some of these opportunities. Firstly, we propose two optimal algorithms to determine the maximum number of accepted VMs into the cloudlet mesh under both homogeneous and heterogeneous cases, respectively. Secondly, we design another two optimal algorithms to minimize the total inter-cloudlet communication traffic in both homogeneous and heterogeneous cloudlet mesh, respectively. Thirdly, we study the VM placement problem under the multi-tenant scenario, which we prove to be NP-hard. A heuristic algorithm is proposed to give an efficient solution. The evaluation results validate the efficiency of our algorithm.

      더보기

      동일학술지(권/호) 다른 논문

      동일학술지 더보기

      더보기

      분석정보

      View

      상세정보조회

      0

      Usage

      원문다운로드

      0

      대출신청

      0

      복사신청

      0

      EDDS신청

      0

      동일 주제 내 활용도 TOP

      더보기

      주제

      연도별 연구동향

      연도별 활용동향

      연관논문

      연구자 네트워크맵

      공동연구자 (7)

      유사연구자 (20) 활용도상위20명

      이 자료와 함께 이용한 RISS 자료

      나만을 위한 추천자료

      해외이동버튼