콘텐츠 기반의 Publish/Subscribe 서비스를 위한 structured P2P 기반 피어들 간의 효율적인 협력기법
DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | 강경란 | - |
dc.contributor.author | 권화나 | - |
dc.date.accessioned | 2019-10-21T07:11:33Z | - |
dc.date.available | 2019-10-21T07:11:33Z | - |
dc.date.issued | 2009-02 | - |
dc.identifier.other | 9945 | - |
dc.identifier.uri | https://dspace.ajou.ac.kr/handle/2018.oak/17090 | - |
dc.description | 학위논문(석사)----아주대학교 정보통신전문대학원 :정보통신공학과,2009. 2 | - |
dc.description.tableofcontents | 1. Introduction 1 2. Motivation 3 3. ECOOP scheme 7 3.1 Underlying Distributed Hash Table overlay structure 9 3.1.1 How to make certain the level of nodes 10 3.1.2 How to construct and update routing table 11 3.1.3 How to keep correct routing table 13 3.2 Rendezvous nodes (RN) selection 15 3.3 Subscription management 16 3.4 Event Publication & delivery 17 4. Evaluation 19 4.1 Lifetime-based dynamic churn model 20 4.2 Analysis 23 4.2.1 Event delivery ratio 23 4.2.2 The transferring traffic overhead 27 5. Conclusion 29 Reference 30 | - |
dc.language.iso | eng | - |
dc.publisher | The Graduate School, Ajou University | - |
dc.rights | 아주대학교 논문은 저작권에 의해 보호받습니다. | - |
dc.title | 콘텐츠 기반의 Publish/Subscribe 서비스를 위한 structured P2P 기반 피어들 간의 효율적인 협력기법 | - |
dc.title.alternative | Quan Hua Na | - |
dc.type | Thesis | - |
dc.contributor.affiliation | 아주대학교 정보통신전문대학원 | - |
dc.contributor.alternativeName | Quan Hua Na | - |
dc.contributor.department | 정보통신전문대학원 정보통신공학과 | - |
dc.date.awarded | 2009. 2 | - |
dc.description.degree | Master | - |
dc.identifier.localId | 567858 | - |
dc.identifier.url | http://dcoll.ajou.ac.kr:9080/dcollection/jsp/common/DcLoOrgPer.jsp?sItemId=000000009945 | - |
dc.subject.keyword | structured P2P | - |
dc.subject.keyword | event delivery | - |
dc.subject.keyword | stable peer | - |
dc.description.alternativeAbstract | In content-based publish/subscribe(CBPS) system, the efficient cooperation to obtain CBPS services among peer nodes is a fundamental issue over structured P2P network. Moreover, the peer nodes change their status freely that makes efficient cooperation an intricate task to achieve. In this paper, we present ECOOP which is a novel solution to address this problem in Distributed Hash Table (DHT) based CBPS systems. We also present the new underlying DHT overlay network as Stable-Chord. The main objective of this paper is to ensure the overlay nodes are stable, i.e., stable Rendezvous Nodes (RN) and intermediate nodes. All the participating unstable nodes in CBPS systems only work either subscriber or publisher. Furthermore, our scheme, ECOOP, maintains stable event delivery paths on overlay network and is based on three main contributions: Rendezvous nodes selection, subscription management, and event publication & delivery. Eventually, our scheme maximizes the event delivery ratio and minimizes the transfer traffic overhead, | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.