Search Results: 1 - 10 of 100 matches for " "
All listed articles are free for downloading (OA Articles)
Page 1 /100
Display every page Item
Golden Research Thoughts , 2013, DOI: 10.9780/22315063
Abstract: Need for it?A fundamental goal of researches in WSNs is to reduce the communication operations and prolong the total lifetime of sensor networks.Making effective use of the vast amounts of data gathered by large scale sensor networks will require scalable, self-organizing, and energy-efficient data dissemination algorithmsDistributed Hash Tables (DHTs) over WSNs is a new routing paradigm promises severaladvantages over conventional routing protocols
ReCord: A Distributed Hash Table with Recursive Structure  [PDF]
Jianyang Zeng,Wen-Jing Hsu
Computer Science , 2004,
Abstract: We propose a simple distributed hash table called ReCord, which is a generalized version of Randomized-Chord and offers improved tradeoffs in performance and topology maintenance over existing P2P systems. ReCord is scalable and can be easily implemented as an overlay network, and offers a good tradeoff between the node degree and query latency. For instance, an $n$-node ReCord with $O(\log n)$ node degree has an expected latency of $\Theta(\log n)$ hops. Alternatively, it can also offer $\Theta(\frac{\log n}{\log \log n})$ hops latency at a higher cost of $O(\frac{\log^2 n}{\log \log n})$ node degree. Meanwhile, simulations of the dynamic behaviors of ReCord are studied.
Efficient Indexing of the BitTorrent Distributed Hash Table  [PDF]
Aaron Grunthal
Computer Science , 2010,
Abstract: The following paper presents various methods and implementation techniques used to harvest metadata efficiently from a Kademlia Distributed Hashtable (DHT) as used in the BitTorrent P2P network to build an index of publicly available files in the BitTorrent ecosystem. The indexer design makes various tradeoffs between throughput and fairness towards other DHT nodes while also being scaleable in a distributed environment.
Efficient Batch Update of Unique Identifiers in a Distributed Hash Table for Resources in a Mobile Host  [PDF]
Yoo Chung
Computer Science , 2007, DOI: 10.1109/ISPA.2010.73
Abstract: Resources in a distributed system can be identified using identifiers based on random numbers. When using a distributed hash table to resolve such identifiers to network locations, the straightforward approach is to store the network location directly in the hash table entry associated with an identifier. When a mobile host contains a large number of resources, this requires that all of the associated hash table entries must be updated when its network address changes. We propose an alternative approach where we store a host identifier in the entry associated with a resource identifier and the actual network address of the host in a separate host entry. This can drastically reduce the time required for updating the distributed hash table when a mobile host changes its network address. We also investigate under which circumstances our approach should or should not be used. We evaluate and confirm the usefulness of our approach with experiments run on top of OpenDHT.
UnoHop: Efficient Distributed Hash Table with O(1) Lookup Performance  [PDF]
Herry Sitepu,Carmadi Machbub,Armein Z. R. Langi,Suhono H. Supangkat
ITB Journal of Information and Communication Technology , 2008, DOI: 10.5614/itbj.ict.2008.2.1.4
Abstract: Distributed Hash Tables (DHTs) with O(1) lookup performance strive to minimize the maintenance traffic which required for propagating membership changes information (events). These events distribution allows each node in the peer-to-peer network maintains accurate routing tables with complete membership information. We present UnoHop, a novel DHT protocol with O(1) lookup performance. The protocol uses an efficient mechanism to distribute events through a dissemination tree that constructed dynamically rooted at the node that detect the events. Our protocol produces symmetric bandwidth usage at all nodes while decreasing the events propagation delay.
Research on Distributed Hash Table in P2P

YUAN Lin,QIN Zheng,

计算机应用研究 , 2006,
Abstract: This paper first introduces unstructured and structured P2P. Then it induces the characteristics and properties of Distributed Hash Table(DHT) and reviews some existing DHTs. Finally, it points out existing problems on DHT, and discusses some probable solutions.
A Random Structure for Optimum Cache Size Distributed hash table (DHT) Peer-to-Peer design  [PDF]
Nima Sarshar,Vwani Roychowdhury
Computer Science , 2002,
Abstract: We propose a new and easily-realizable distributed hash table (DHT) peer-to-peer structure, incorporating a random caching strategy that allows for {\em polylogarithmic search time} while having only a {\em constant cache} size. We also show that a very large class of deterministic caching strategies, which covers almost all previously proposed DHT systems, can not achieve polylog search time with constant cache size. In general, the new scheme is the first known DHT structure with the following highly-desired properties: (a) Random caching strategy with constant cache size; (b) Average search time of $O(log^{2}(N))$; (c) Guaranteed search time of $O(log^{3}(N))$; (d) Truly local cache dynamics with constant overhead for node deletions and additions; (e) Self-organization from any initial network state towards the desired structure; and (f) Allows a seamless means for various trade-offs, e.g., search speed or anonymity at the expense of larger cache size.
Debt Relationship Based Fair File Exchange in Distributed Hash Table Network

YU Kun,WU Guo-Xin,XU Li-Bo,CHEN Gang,

软件学报 , 2007,
Abstract: The selfishness of nodes degrades the system usability of P2P network. Debt relationship based file exchange network constructs an incentive mechanism which induces cooperation and guarantees fairness in file exchange. The key point of the mechanism is finite neighbors, an inherent characteristic in DHT (distributed hash table) networks and so is the interacting between nodes form a repeated games. DFFE (debt relationship based fair file exchange in DHT network) protocol only needs to maintain a little local interacting information, so the protocol cost is low and scalable for large network. In routing, one-hop information based greedy arithmetic is used. Game among rational nodes exists a Nash equilibrium and the approximate algorithm of strategy selection gradually converges. Simulations indicate the validity of incentive mechanism and the steady performance in dynamic networks.
An effective single-hop distributed hash table with high lookup performance and low traffic overhead  [PDF]
Luiz Monnerat,Claudio L. Amorim
Computer Science , 2014,
Abstract: Distributed Hash Tables (DHTs) have been used in several applications, but most DHTs have opted to solve lookups with multiple hops, to minimize bandwidth costs while sacrificing lookup latency. This paper presents D1HT, an original DHT which has a peer-to-peer and self-organizing architecture and maximizes lookup performance with reasonable maintenance traffic, and a Quarantine mechanism to reduce overheads caused by volatile peers. We implemented both D1HT and a prominent single-hop DHT, and we performed an extensive and highly representative DHT experimental comparison, followed by complementary analytical studies. In comparison with current single-hop DHTs, our results showed that D1HT consistently had the lowest bandwidth requirements, with typical reductions of up to one order of magnitude, and that D1HT could be used even in popular Internet applications with millions of users. In addition, we ran the first latency experiments comparing DHTs to directory servers, which revealed that D1HT can achieve latencies equivalent to or better than a directory server, and confirmed its greater scalability properties. Overall, our extensive set of results allowed us to conclude that D1HT can provide a very effective solution for a broad range of environments, from large-scale corporate datacenters to widely deployed Internet applications.
A Hybrid Peer-to-Peer Lookup Service Algorithm on Distributed Hash Table

YANG Feng,LI Feng-Xia,YU Hong-Liang,ZHAN Shou-Yi,ZHENG Wei-Min,

软件学报 , 2007,
Abstract: 使用分布式哈希表(distributed hash table,简称DHT)的应用系统必须在O(1)发现算法和O(logN)发现算法系列中选择适应的DHT协议.但是,不同网络波动程度的应用场景要求理想的DHT协议根据网络波动率能够自适应地调整.提出一种发现算法ROAD(routing on active and demand),在延时和波动率之间自适应地调整以提供更好的性能.设计ROAD的关键挑战是构建路由表和降低延时的算法.通过构建加速路由表,加快发现服务的速度,降低消息转发的延时,并通过幂次序组播算法
Page 1 /100
Display every page Item

Copyright © 2008-2017 Open Access Library. All rights reserved.