期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
PChord:a distributed hash table for P2P network 被引量:1
1
作者 Haiping HUANG Yan ZHENG +1 位作者 Hongwei CHEN Ruchuan WANG 《Frontiers of Electrical and Electronic Engineering in China》 CSCD 2010年第1期49-58,共10页
As a solution for data storage and information sharing for peer-to-peer(P2P)networks,a novel distributed hash table(DHT)structure called PChord is presented in this paper.PChord adopts a bi-directional searching mecha... As a solution for data storage and information sharing for peer-to-peer(P2P)networks,a novel distributed hash table(DHT)structure called PChord is presented in this paper.PChord adopts a bi-directional searching mechanism superior to Chord and enhances the structure of the finger table.Based on Hilbert space filling curve,PChord realizes the mapping mechanism for multikeyword approximate searching.Compared with the Chord and Kademlia protocols,PChord evidently increases speed on resource searching and message spreading via theoretic proof and simulation results,while maintaining satisfactory load balance. 展开更多
关键词 distributed hash table(dht) peer-to-peer(p2p) bi-directional searching
原文传递
Control DHT maintenance costs with session heterogeneity
2
作者 邹福泰 吴增德 +1 位作者 张亮 马范援 《Journal of Zhejiang University-Science A(Applied Physics & Engineering)》 SCIE EI CAS CSCD 2005年第5期378-386,共9页
The maintaining overheads of Distributed Hash Table (DHT) topology have recently received considerable attention. This paper presents a novel SHT (Session Heterogeneity Topology) model, in which DHT is reconstructed w... The maintaining overheads of Distributed Hash Table (DHT) topology have recently received considerable attention. This paper presents a novel SHT (Session Heterogeneity Topology) model, in which DHT is reconstructed with session hetero- geneity. SHT clusters nodes by means of session heterogeneity among nodes and selects the stable nodes as the participants of DHT. With an evolving process, this model gradually makes DHT stable and reliable. Therefore the high maintaining overheads for DHT are effectively controlled. Simulation with real traces of session distribution showed that the maintaining overheads are reduced dramatically and that the data availability is greatly improved. 展开更多
关键词 peer-to-peer (p2p) distributed hash table (dht) Finite element method Session heterogeneity Topology model
下载PDF
BulkTree: an overlay network architecture for live media streaming
3
作者 GONG An DING Gui-guang DAI Qiong-hai LIN Chuang 《Journal of Zhejiang University-Science A(Applied Physics & Engineering)》 SCIE EI CAS CSCD 2006年第z1期125-130,共6页
Peer-to-peer (P2P) systems are now very popular. Current P2P systems are broadly of two kinds, structured and unstructured. The tree structured P2P systems used technologies such as distributed hash tables (DHT) and h... Peer-to-peer (P2P) systems are now very popular. Current P2P systems are broadly of two kinds, structured and unstructured. The tree structured P2P systems used technologies such as distributed hash tables (DHT) and hierarchical clustering can search the required target quickly, however, in a tree, the internal node has a higher load and its leave or crash often causes a large population of its offspring's problems, so that in the highly dynamic Internet environment the tree structure may still suffer frequent breaks. On the other hand, most widely used unstructured P2P networks rely on central directory servers or massive message flooding, clearly not scalable. So, we consider both of the above systems' advantages and disadvantages and realize that in the P2P systems one node may fail easily, but that when a number of nodes organized as a set, which we call "super node", the set is robust. Super nodes can be created and updated aware of topology-aware, and used with simple protocol such as flooding or "servers" to exchange information. Furthermore the entire robust super node can be organized into exquisite tree structure. By using this overlay network architecture, P2P systems are robust, efficient, scalable and secure. The simulation results demonstrated that our architecture greatly reduces the alteration time of the structure while decreasing the average delay time, compared to the common tree structure. 展开更多
关键词 peer-to-peer (p2p) Overlay networks Scalability LIVE media distributed hash tables (dht) Hierarchical clustering
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部