k-node Scoped Broadcast in DHT-based Structured P2P Network
碩士 === 國立清華大學 === 資訊工程學系 === 93 === DHT-based structured P2P networks could not support complex queries, such as range query and wild-card matching, due to their reliance on hashing to name the objects to be managed. A workaround is to broadcast the query to all nodes in the network, where the query...
Main Authors: | Min-Yen Lue, 呂旻燕 |
---|---|
Other Authors: | Chung-Ta King |
Format: | Others |
Language: | en_US |
Published: |
2005
|
Online Access: | http://ndltd.ncl.edu.tw/handle/11217855449116141481 |
Similar Items
-
Broadcast networks on 2p-1 nodes and minimum broadcast network on 127 nodes
by: Xu, Xiangyang
Published: (2004) -
Routing performance of structured overlay in distributed hash tables (DHT) for P2P
by: Ahmad, R.B, et al.
Published: (2019) -
Hierarchical Resource Classification Overlay Network (HRCON) with Efficient Search in DHT-based Structure P2P Networks
by: Chuan-Chi Weng, et al.
Published: (2006) -
Secure Routing in Structured P2P Overlay : Simulating Secure Routing on Chord DHT
by: Kassahun, Mebratu
Published: (2015) -
Approaches to Improving Locality and Efficiency on DHT based P2P Systems
by: Yung-Yu Zhuang, et al.
Published: (2004)