文件名称:Peersim-Pht-master
- 所属分类：
- 软件工程
- 资源属性：
- [Java] [源码]
- 上传时间：
- 2016-02-15
- 文件大小：
- 670kb
- 下载次数：
- 0次
- 提 供 者：
- moshaver*********
- 相关连接：
- 无
- 下载说明：
- 别用迅雷下载，失败请重下，重下不扣分！
介绍说明－－下载内容均来自于网络，请自行研究使用
Distributed Hash Tables are scalable, robust, and
self-organizing peer-to-peer systems that support
exact match lookups. This paper describes the design and implementation of a Prefix Hash Tree -
a distributed data structure that enables more sophisticated queries over a DHT. The Prefix Hash
Tree uses the lookup interface of a DHT to construct a trie-based structure that is both efficient
(updates are doubly logarithmic in the size of the
domain being indexed), and resilient (the failure
of any given node in the Prefix Hash Tree does
not affect the availability of data stored at other
nodes).
moshaverprozhe.ir
09308766416
ا ن ج ا م پ ر و ژ ه -Distributed Hash Tables are scalable, robust, and
self-organizing peer-to-peer systems that support
exact match lookups. This paper describes the design and implementation of a Prefix Hash Tree -
a distributed data structure that enables more sophisticated queries over a DHT. The Prefix Hash
Tree uses the lookup interface of a DHT to construct a trie-based structure that is both efficient
(updates are doubly logarithmic in the size of the
domain being indexed), and resilient (the failure
of any given node in the Prefix Hash Tree does
not affect the availability of data stored at other
nodes).
moshaverprozhe.ir
09308766416
ا ن ج ا م پ ر و ژ ه
self-organizing peer-to-peer systems that support
exact match lookups. This paper describes the design and implementation of a Prefix Hash Tree -
a distributed data structure that enables more sophisticated queries over a DHT. The Prefix Hash
Tree uses the lookup interface of a DHT to construct a trie-based structure that is both efficient
(updates are doubly logarithmic in the size of the
domain being indexed), and resilient (the failure
of any given node in the Prefix Hash Tree does
not affect the availability of data stored at other
nodes).
moshaverprozhe.ir
09308766416
ا ن ج ا م پ ر و ژ ه -Distributed Hash Tables are scalable, robust, and
self-organizing peer-to-peer systems that support
exact match lookups. This paper describes the design and implementation of a Prefix Hash Tree -
a distributed data structure that enables more sophisticated queries over a DHT. The Prefix Hash
Tree uses the lookup interface of a DHT to construct a trie-based structure that is both efficient
(updates are doubly logarithmic in the size of the
domain being indexed), and resilient (the failure
of any given node in the Prefix Hash Tree does
not affect the availability of data stored at other
nodes).
moshaverprozhe.ir
09308766416
ا ن ج ا م پ ر و ژ ه
(系统自动生成,下载前可以参看下载内容)
下载文件列表
Peersim-Pht-master
..................\README.md
..................\pht
..................\...\Makefile
..................\...\examplePHT.cfg
..................\...\lib
..................\...\...\commons-codec-1.10.jar
..................\...\...\djep-1.0.0.jar
..................\...\...\jep-2.3.0.jar
..................\...\...\mspastry.jar
..................\...\...\peersim-1.0.5.jar
..................\...\src
..................\...\...\peersim
..................\...\...\.......\pht
..................\...\...\.......\...\Client.java
..................\...\...\.......\...\NodeInfo.java
..................\...\...\.......\...\PhtData.java
..................\...\...\.......\...\PhtNode.java
..................\...\...\.......\...\PhtProtocol.java
..................\...\...\.......\...\PhtUtil.java
..................\...\...\.......\...\dht
..................\...\...\.......\...\...\DhtInterface.java
..................\...\...\.......\...\...\mspastry
..................\...\...\.......\...\...\........\MSPInit.java
..................\...\...\.......\...\...\........\MSPastry.java
..................\...\...\.......\...\...\........\MSPastryListener.java
..................\...\...\.......\...\example
..................\...\...\.......\...\.......\MSPClientEx.java
..................\...\...\.......\...\exceptions
..................\...\...\.......\...\..........\BadAckException.java
..................\...\...\.......\...\..........\InitiatorException.java
..................\...\...\.......\...\..........\PhtException.java
..................\...\...\.......\...\..........\PhtNodeNotFoundException.java
..................\...\...\.......\...\..........\SplitMergeException.java
..................\...\...\.......\...\..........\WrongStateException.java
..................\...\...\.......\...\messages
..................\...\...\.......\...\........\PMLookup.java
..................\...\...\.......\...\........\PMRangeQuery.java
..................\...\...\.......\...\........\PhtMessage.java
..................\...\...\.......\...\state
..................\...\...\.......\...\.....\PhtNodeState.java
..................\...\...\.......\...\statistics
..................\...\...\.......\...\..........\AsciiStats.java
..................\...\...\.......\...\..........\NodeStats.java
..................\...\...\.......\...\..........\PMRQueryHolder.java
..................\...\...\.......\...\..........\PhaseStats.java
..................\...\...\.......\...\..........\PhtNodeInfo.java
..................\...\...\.......\...\..........\PhtNodeStats.java
..................\...\...\.......\...\..........\RQueryStats.java
..................\...\...\.......\...\..........\Stats.java