메뉴 건너뛰기
.. 내서재 .. 알림
소속 기관/학교 인증
인증하면 논문, 학술자료 등을  무료로 열람할 수 있어요.
한국대학교, 누리자동차, 시립도서관 등 나의 기관을 확인해보세요
(국내 대학 90% 이상 구독 중)
로그인 회원가입 고객센터 ENG
주제분류

추천
검색
질문

논문 기본 정보

자료유형
학술대회자료
저자정보
Tomoya Tanaka (Kobe University) Tomio Kamada (Kobe University) Chikara Ohta (Kobe University)
저널정보
한국통신학회 한국통신학회 APNOMS 한국통신학회 APNOMS 2020
발행연도
2020.9
수록면
85 - 90 (6page)

이용수

표지
📌
연구주제
📖
연구배경
🔬
연구방법
🏆
연구결과
AI에게 요청하기
추천
검색
질문

초록· 키워드

오류제보하기
The importance of real-time notification has been growing for social services and Intelligent Transporting System (ITS). As an advanced version of Pub/Sub systems, publish-process- subscribe systems, where published messages are spooled and processed on edge servers, have been proposed to achieve data-driven intelligent notifications. In this paper, we present a system that allows a topic to be managed on multiple edge servers so that messages are processed near publishers and subscribers, even when publishers are spread over a wide area. However, permitting a topic to use multiple edge servers can cause exhaustion of resources as the number of topics and consumed resources by each topic increase. We formulate the delay caused by the depletion of edge server resources to find the optimal allocation of topics on limited edge server resources. As the optimization problem is NP-hard, we propose heuristics leveraging the given locality and the pub/sub relationships observed between clients to use the edge server resources efficiently while delivering real-time notifications. The experimental results demonstrate that the proposed method reduces the delay to deliver notifications and the effectiveness of the strategy exploiting the relationships between clients.

목차

Abstract
I. INTRODUCTION
II. RELATED WORK
III. SYSTEM MODEL AND PROBLEM FORMULATION
IV. RELOC ALGORITHM
V. PERFORMANCE EVALUATION
VI. CONCLUSION
REFERENCES

참고문헌 (0)

참고문헌 신청

함께 읽어보면 좋을 논문

논문 유사도에 따라 DBpia 가 추천하는 논문입니다. 함께 보면 좋을 연관 논문을 확인해보세요!

이 논문의 저자 정보

최근 본 자료

전체보기

댓글(0)

0

UCI(KEPA) : I410-ECN-0101-2021-567-001678282