Repository logo
  • English
  • 中文
Log In
Have you forgotten your password?
  1. Home
  2. College of Management / 管理學院
  3. Information Management / 資訊管理學系
  4. A Proximity-Aware and Group-Based Peer-to-Peer System for Range Queries
 
  • Details

A Proximity-Aware and Group-Based Peer-to-Peer System for Range Queries

Date Issued
2007
Date
2007
Author(s)
Wong, Wing-Tat
DOI
en-US
URI
http://ntur.lib.ntu.edu.tw//handle/246246/54401
Abstract
Peer-to-peer (P2P) systems have emerged promptly as a powerful platform for large-scale distributed information systems in recent years; important functionalities, such as searching, have been added to improve the system's lookup capability. In particular, range query is exceptionally demanded when a user does not know exactly what he/she is looking for, however, the efficient support of range queries in a P2P system is still a challenging problem. To resolve this problem, some other related issues must first be addressed, such as high communication overheads, load imbalance among peers and preservation of object availability. Several techniques have been proposed in each aspect, but it is difficult to incorporate all of them in a single range queries system due to the conflict among these techniques. In this thesis, we propose a fault-tolerable P2P system which guarantees object availability and supports range queries effectively. The system exploits proximity and cooperative caching to tackle the high communication overhead. By introducing the concept of grouping, the conflict between proximity and load balance can be resolved. Within a grouping environment, peers are divided into several groups to provide the flexibility of proximity and feasibility of load balance in a range queries system. Therefore, objects are evenly distributed among groups. Our results show that our platform is fault-tolerable in a highly dynamic environment. The impact of proximity is effective in reducing the communication overhead. Moreover, the cooperative cache scheme can improve search performance, decrease the query scope significantly and avoid redundancy. The load balance mechanism can quickly balance the load among peers under object ordering constraint environment with a low cost.
Subjects
點對點網路
範圍查詢
鄰近性
群組化
負載平衡
Peer-to-Peer
Range Queries
Proximity
Grouping
Load Balance
SDGs

[SDGs]SDG16

Type
other
File(s)
Loading...
Thumbnail Image
Name

ntu-96-R94725007-1.pdf

Size

23.31 KB

Format

Adobe PDF

Checksum

(MD5):d0dd01e58154f0f7030ba9abd934d7d2

臺大位居世界頂尖大學之列,為永久珍藏及向國際展現本校豐碩的研究成果及學術能量,圖書館整合機構典藏(NTUR)與學術庫(AH)不同功能平台,成為臺大學術典藏NTU scholars。期能整合研究能量、促進交流合作、保存學術產出、推廣研究成果。

To permanently archive and promote researcher profiles and scholarly works, Library integrates the services of “NTU Repository” with “Academic Hub” to form NTU Scholars.

總館學科館員 (Main Library)
醫學圖書館學科館員 (Medical Library)
社會科學院辜振甫紀念圖書館學科館員 (Social Sciences Library)

開放取用是從使用者角度提升資訊取用性的社會運動,應用在學術研究上是透過將研究著作公開供使用者自由取閱,以促進學術傳播及因應期刊訂購費用逐年攀升。同時可加速研究發展、提升研究影響力,NTU Scholars即為本校的開放取用典藏(OA Archive)平台。(點選深入了解OA)

  • 請確認所上傳的全文是原創的內容,若該文件包含部分內容的版權非匯入者所有,或由第三方贊助與合作完成,請確認該版權所有者及第三方同意提供此授權。
    Please represent that the submission is your original work, and that you have the right to grant the rights to upload.
  • 若欲上傳已出版的全文電子檔,可使用Open policy finder網站查詢,以確認出版單位之版權政策。
    Please use Open policy finder to find a summary of permissions that are normally given as part of each publisher's copyright transfer agreement.
  • 網站簡介 (Quickstart Guide)
  • 使用手冊 (Instruction Manual)
  • 線上預約服務 (Booking Service)
  • 方案一:臺灣大學計算機中心帳號登入
    (With C&INC Email Account)
  • 方案二:ORCID帳號登入 (With ORCID)
  • 方案一:定期更新ORCID者,以ID匯入 (Search for identifier (ORCID))
  • 方案二:自行建檔 (Default mode Submission)
  • 方案三:學科館員協助匯入 (Email worklist to subject librarians)

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science