Electric-field screening: Difference between revisions

From formulasearchengine
Jump to navigation Jump to search
en>Tesi1700
 
en>Nanite
some refs
Line 1: Line 1:
Have you been wondering "how do I accelerate my computer" lately? Well odds are should you are reading this article; then you are experiencing one of various computer issues that thousands of individuals discover that they face on a regular basis.<br><br>If it is very not because big of a issue because you think it's, it will probably be solved easily by running a Startup Repair or by System Restore Utility. Again it may be as easy as running an anti-virus check or cleaning the registry.<br><br>With RegCure you are able to easily boost the start plus shut down of your computer. The program shows the scan progress and we shouldn't worry where it really is functioning at which time. It shows we what happens. Dynamic link library section of the registry could cause severe application failures. RegCure restores plus repairs the registry and keeps you out of DLL. RegCure can create individual corrections, so it will works for a needs.<br><br>Check a Windows taskbar, that is found on the lower right hand corner of the computer screen. This taskbar consist of programs you have running in the background. If you have too various of them, they will steal a computer's resources.<br><br>Many [http://bestregistrycleanerfix.com/system-mechanic system mechanic] s allow you to download their product for free, to scan the computer yourself. That means you are able to see how numerous mistakes it finds, where it finds them, plus how it may fix them. A terrific registry cleaner usually remove a registry problems, and optimize and speed up the PC, with small effort on your part.<br><br>Let's begin with all the bad sides first. The initial price of the product is truly cheap. However, it just comes with 1 year of updates. After which you need to register to monthly updates. The advantage of which is that perfect optimizer has enough cash and resources to research errors. This technique, you may be ensured of secure fixes.<br><br>By restoring the state of the system to an earlier date, error 1721 could not appear inside Windows 7, Vista and XP. There is a tool called System Restore that we have to employ inside this process.<br><br>So in summary, whenever comparing registry cleaning, make sure the 1 we choose provides we the following.A backup and restore center, swiftly procedure, automatic deletion center, start-up management, an easy method of contact and a income back guarantee.
A '''distributed hash table''' ('''DHT''') is a class of a decentralized [[Distributed computing|distributed system]] that provides a lookup service similar to a [[hash table]]; (''key'', ''value'') pairs are stored in a DHT, and any participating [[node (networking)|node]] can efficiently retrieve the value associated with a given key. Responsibility for maintaining the mapping from keys to values is distributed among the nodes, in such a way that a change in the set of participants causes a minimal amount of disruption. This allows a DHT to [[scale (computing)|scale]] to extremely large numbers of nodes and to handle continual node arrivals, departures, and failures.
 
DHTs form an infrastructure that can be used to build more complex services, such as [[anycast]], cooperative [[Web cache|Web caching]], [[distributed file system]]s, [[Domain name system|domain name services]], [[instant messaging]], [[multicast]], and also [[peer-to-peer]] [[file sharing]] and [[content distribution]] systems. Notable distributed networks that use DHTs include [[BitTorrent (protocol)|BitTorrent]]'s distributed tracker, the [[Coral Content Distribution Network]], the [[Kad network]], the [[Storm botnet]], [[Freenet]] and the [[YaCy]] search engine.
 
[[File:DHT en.svg|500px|right|thumb|Distributed hash tables]]
 
== History ==
DHT research was originally motivated, in part, by [[peer-to-peer]] systems such as [[Freenet]], [[gnutella]], [[BitTorrent (software)|BitTorrent]] and [[Napster]], which took advantage of resources distributed across the Internet to provide a single useful application. In particular, they took advantage of increased [[Bandwidth (computing)|bandwidth]] and [[hard disk]] capacity to provide a file-sharing service.
 
These systems differed in how they ''found'' the data their peers contained:
* Napster, the first large-scale P2P content delivery system to exist, had a central index server: each node, upon joining, would send a list of locally held files to the server, which would perform searches and refer the querier to the nodes that held the results. This central component left the system vulnerable to attacks and lawsuits.{{cn|date=January 2014}}
* Gnutella and similar networks moved to a flooding query model{{spaced ndash}} in essence, each search would result in a message being broadcast to every other machine in the network. While avoiding a [[single point of failure]], this method was significantly less efficient than Napster.  Later versions of Gnutella clients moved to a dynamic querying model which vastly improved efficiency.{{cn|date=January 2014}}
* Finally, [[Freenet]] is fully distributed, but employs a heuristic [[key-based routing]] in which each file is associated with a key, and files with similar keys tend to cluster on a similar set of nodes. Queries are likely to be routed through the network to such a cluster without needing to visit many peers.<ref>{{citation |url=https://freenetproject.org/papers/lic.pdf |title=Searching in a Small World Chapters 1 & 2 |accessdate=2012-01-10}}</ref> However, Freenet does not guarantee that data will be found.
 
Distributed hash tables use a more structured key-based routing in order to attain both the decentralization of Freenet and gnutella, and the efficiency and guaranteed results of Napster. One drawback is that, like Freenet, DHTs only directly support exact-match search, rather than keyword search, although Freenet's routing algorithm can be generalized to any key type where a closeness operation can be defined.<ref>{{citation |url=https://freenetproject.org/papers/ddisrs.pdf |title=A Distributed Decentralized Information Storage and Retrieval System |chapter=Section 5.2.2 |accessdate=2012-01-10}}</ref>
 
In 2001, four systems&mdash;[[Content addressable network|CAN]], [[Chord (peer-to-peer)|Chord]],<ref>[[Hari Balakrishnan]], [[M. Frans Kaashoek]], David Karger, [[Robert Tappan Morris|Robert Morris]], and Ion Stoica. [http://www.cs.berkeley.edu/~istoica/papers/2003/cacm03.pdf Looking up data in P2P systems]. In [[Communications of the ACM]], February 2003.</ref> [[Pastry (DHT)|Pastry]], and [[Tapestry (DHT)|Tapestry]]&mdash;ignited DHTs as a popular research topic.
A project called the Infrastructure for Resilient Internet Systems (Iris) was funded by a $12 million grant from the US [[National Science Foundation]] in 2002.<ref>{{Cite news |title= New P2P network funded by US government |author= David Cohen |work= New Scientist |date= October 1, 2002 |url= http://www.newscientist.com/article.ns?id=dn2861 |accessdate= November 10, 2013 }}</ref>
Researchers included [[Hari Balakrishnan]] and [[Scott Shenker]].<ref>{{Cite news |title= MIT, Berkeley, ICSI, NYU, and Rice Launch the IRIS Project |work= Press release |publisher= MIT |date= September 25, 2002  |url= http://project-iris.net/MITPressRelease1.doc |accessdate= November 10, 2013 }}</ref>
Outside academia, DHT technology has been adopted as a component of [[BitTorrent (protocol)|BitTorrent]] and in the [[Coral Content Distribution Network]].
 
== Properties ==
DHTs characteristically emphasize the following properties:
 
* [[Decentralized computing|Autonomy and Decentralization]]: the nodes collectively form the system without any central coordination.
* [[Fault tolerance]]: the system should be reliable (in some sense) even with nodes continuously joining, leaving, and failing.
* [[scale (computing)|Scalability]]: the system should function efficiently even with thousands or millions of nodes.
 
A key technique used to achieve these goals is that any one node needs to coordinate with only a few other nodes in the system – most commonly, [[Big O notation|O]](log ''n'') of the <math>n</math> participants (see below) – so that only a limited amount of work needs to be done for each change in membership.
 
Some DHT designs seek to be [[secure]] against malicious participants<ref>Guido Urdaneta, Guillaume Pierre and Maarten van Steen. [http://www.globule.org/publi/SDST_acmcs2009.html A Survey of DHT Security Techniques]. ACM Computing Surveys 43(2), January 2011.</ref> and to allow participants to remain [[anonymity|anonymous]], though this is less common than in many other [[peer-to-peer]] (especially [[file sharing]]) systems; see [[anonymous P2P]].
 
Finally, DHTs must deal with more traditional distributed systems issues such as [[Load balancing (computing)|load balancing]], [[data integrity]], and performance (in particular, ensuring that operations such as routing and data storage or retrieval complete quickly).
 
== Structure ==
The structure of a DHT can be decomposed into several main components.<ref>Moni Naor and Udi Wieder. [http://www.wisdom.weizmann.ac.il/~naor/PAPERS/dh.pdf Novel Architectures for P2P Applications: the Continuous-Discrete Approach]. Proc. SPAA, 2003.</ref><ref>Gurmeet Singh Manku. [http://www-db.stanford.edu/~manku/phd/index.html Dipsea: A Modular Distributed Hash Table]. Ph. D. Thesis (Stanford University), August 2004.</ref>  The foundation is an abstract '''keyspace''', such as the set of 160-bit [[string (computer science)|string]]s. A '''keyspace partitioning''' scheme splits ownership of this keyspace among the participating nodes. An '''overlay network''' then connects the nodes, allowing them to find the owner of any given key in the keyspace.
 
Once these components are in place, a typical use of the DHT for storage and retrieval might proceed as follows. Suppose the keyspace is the set of 160-bit strings. To store a file with given <math>filename</math> and <math>data</math> in the DHT, the [[SHA-1]] hash of <math>filename</math> is generated, producing a 160-bit key <math>k</math>, and a message <math>put(k, data)</math> is sent to any node participating in the DHT. The message is forwarded from node to node through the overlay network until it reaches the single node responsible for key <math>k</math> as specified by the keyspace partitioning. That node then stores the key and the data. Any other client can then retrieve the contents of the file by again hashing <math>filename</math> to produce <math>k</math> and asking any DHT node to find the data associated with <math>k</math> with a message <math>get(k)</math>. The message will again be routed through the overlay to the node responsible for <math>k</math>, which will reply with the stored <math>data</math>.
 
The keyspace partitioning and overlay network components are described below with the goal of capturing the principal ideas common to most DHTs; many designs differ in the details.
 
=== Keyspace partitioning ===
Most DHTs use some variant of [[consistent hashing]] to map keys to nodes. This technique employs a function <math>\delta(k_1, k_2)</math> that defines an abstract notion of the ''distance'' between the keys <math>k_1</math> and <math>k_2</math>, which is unrelated to geographical [[distance]] or network [[Latency (engineering)|latency]]. Each node is assigned a single key called its ''identifier'' (ID). A node with ID <math>i_x</math> owns all the keys <math>k_m</math> for which <math>i_x</math> is the closest ID, measured according to <math>\delta(k_m, i_x)</math>.
 
<blockquote>
'''Example.''' The [[Chord (peer-to-peer)|Chord DHT]] treats keys as points on a circle, and <math>\delta(k_1, k_2)</math> is the distance traveling clockwise around the circle from <math>k_1</math> to <math>k_2</math>. Thus, the circular keyspace is split into contiguous segments whose endpoints are the node identifiers. If <math>i_1</math> and <math>i_2</math> are two adjacent IDs, with a shorter clockwise distance from <math>i_1</math> to <math>i_2</math>, then the node with ID <math>i_2</math> owns all the keys that fall between <math>i_1</math> and <math>i_2</math>.
</blockquote>
 
Consistent hashing has the essential property that removal or addition of one node changes only the set of keys owned by the nodes with adjacent IDs, and leaves all other nodes unaffected. Contrast this with a traditional [[hash table]] in which addition or removal of one bucket causes nearly the entire keyspace to be remapped. Since any change in ownership typically corresponds to [[Bandwidth (computing)|bandwidth]]-intensive movement of objects stored in the DHT from one node to another, minimizing such reorganization is required to efficiently support high rates of churn (node arrival and failure).
 
[[Locality-preserving hashing]] ensures that similar keys are assigned to similar objects. This can enable a more efficient execution of range queries.
Self-Chord <ref>Agostino Forestiero, Emilio Leonardi, Carlo Mastroianni and Michela Meo. [http://dx.doi.org/10.1109/TNET.2010.2046745 Self-Chord: a Bio-Inspired P2P Framework for Self-Organizing Distributed Systems]. IEEE/ACM Transactions on Networking, 2010.</ref> decouples object keys from peer IDs and sorts keys along the ring with a statistical approach based on the [[swarm intelligence]] paradigm. Sorting ensures that similar keys are stored by neighbour nodes and that discovery procedures, including range queries, can be performed in logarithmic time.
 
=== Overlay network ===
Each node maintains a set of [[Data link|link]]s to other nodes (its ''neighbors'' or [[routing table]]) . Together, these links form the [[overlay network]]. A node picks its neighbors according to a certain structure, called the [[network topology|network's topology]].
 
All DHT topologies share some variant of the most essential property: for any key <math>k</math>, each node either has a node ID that owns <math>k</math> or has a link to a node whose node ID is ''closer'' to <math>k</math>, in terms of the keyspace distance defined above. It is then easy to route a message to the owner of any key <math>k</math> using the following [[greedy algorithm]] (that is not necessarily globally optimal): at each step, forward the message to the neighbor whose ID is closest to <math>k</math>. When there is no such neighbor, then we must have arrived at the closest node, which is the owner of <math>k</math> as defined above. This style of routing is sometimes called [[key-based routing]].
 
Beyond basic routing correctness, two important constraints on the topology are to guarantee that the maximum number of [[Hop (networking)|hops]] in any route (route length) is low, so that requests complete quickly; and that the maximum number of neighbors of any node (maximum node [[Degree (graph theory)|degree]]) is low, so that maintenance overhead is not excessive. Of course, having shorter routes requires higher [[maximum degree]]. Some common choices for maximum degree and route length are as follows, where <math>n</math> is the number of nodes in the DHT, using [[Big O notation]]:
 
{| class="wikitable"
|-
! Degree !! Route length !! Used in !! Note
|-
| <math>O(1)</math> || <math>O(n)</math> ||  ||
|-
| <math>O(\log n)</math> || <math>O(\log n/\log (\log n))</math> || [[Koorde]] ||
|-
| <math>O(\log n)</math> || <math>O(\log n)</math> || [[Chord (peer-to-peer)|Chord]] || most common, but not optimal (degree/route length)
|-
| <math>O(k)</math> || <math> O(\frac{\log^2 n}{k}) </math> || [[Symphony (peer-to-peer)|Symphony]]||
|-
| <math>O(1)</math> || <math>O(\log n)</math> ||  ||
|-
| <math>O(\sqrt{n})</math> || <math>O(1)</math> ||  ||
|}
 
The most common choice, <math>O(\log n)</math> degree/route length, is not optimal in terms of degree/route length tradeoff, as such topologies typically allow more flexibility in choice of neighbors. Many DHTs use that flexibility to pick neighbors that are close in terms of latency in the physical underlying network.
 
Maximum route length is closely related to [[Diameter (graph theory)|diameter]]: the maximum number of hops in any shortest path between nodes. Clearly, the network's worst case route length is at least as large as its diameter, so DHTs are limited by the degree/diameter tradeoff<ref>{{citation |url=http://maite71.upc.es/grup_de_grafs/table_g.html |title=The (Degree,Diameter) Problem for Graphs |publisher=Maite71.upc.es |date= |accessdate=2012-01-10}}</ref> that is fundamental in [[graph theory]]. Route length can be greater than diameter, since the greedy routing algorithm may not find shortest paths.<ref>Gurmeet Singh Manku, Moni Naor, and Udi Wieder. [http://citeseer.ist.psu.edu/naor04know.html Know thy Neighbor's Neighbor: the Power of Lookahead in Randomized P2P Networks]. Proc. STOC, 2004.</ref>
 
=== Algorithms for overlay networks ===
Aside from routing, there exist many algorithms that exploit the structure of the overlay network for sending a message to all nodes, or a subset of nodes, in a DHT.<ref>Ali Ghodsi. [http://www.sics.se/~ali/thesis/ Distributed k-ary System: Algorithms for Distributed Hash Tables]. KTH-Royal Institute of Technology, 2006.</ref> These algorithms are used by applications to do [[overlay multicast]], range queries, or to collect statistics. Two systems that are based on this approach are Structella,<ref>Miguel Castro, Manuel Costa, and Antony Rowstron. [http://dx.doi.org/10.1145/972374.972397 Should we build Gnutella on a structured overlay?]. Computer Communication Review, 2004.</ref> which implements flooding and random walks on a Pastry overlay, and DQ-DHT,<ref>Domenico Talia and Paolo Trunfio. [http://dx.doi.org/10.1016/j.jpdc.2010.08.012 Enabling Dynamic Querying over Distributed Hash Tables]. Journal of Parallel and Distributed Computing, 2010.</ref> which implements a dynamic querying search algorithm over a Chord network.
 
== DHT implementations ==
Most notable differences encountered in practical instances of DHT implementations include at least the following:
* The address space is a parameter of DHT. Several real world DHTs use 128-bit or 160-bit key space
* Some real-world DHTs use hash functions other than SHA-1.
* In the real world the key <math>k</math> could be a hash of a file's ''content'' rather than a hash of a file's ''name'' to provide [[content-addressable storage]], so that renaming of the file does not prevent users from finding it.
* Some DHTs may also publish objects of different types. For example, key <math>k</math> could be the node <math>ID</math> and associated data could describe how to contact this node. This allows publication-of-presence information and often used in IM applications, etc. In the simplest case, <math>ID</math> is just a random number that is directly used as key <math>k</math> (so in a 160-bit DHT <math>ID</math> will be a 160-bit number, usually randomly chosen). In some DHTs, publishing of nodes IDs is also used to optimize DHT operations.
* Redundancy can be added to improve reliability.  The <math>(k, data)</math> key pair can be stored in more than one node corresponding to the key. Usually, rather than selecting just one node, real world DHT algorithms select <math>i</math> suitable nodes, with <math>i</math> being an implementation-specific parameter of the DHT. In some DHT designs, nodes agree to handle a certain keyspace range, the size of which may be chosen dynamically, rather than hard-coded.
* Some advanced DHTs like [[Kademlia]] perform iterative lookups through the DHT first in order to select a set of suitable nodes and send <math>put(k, data)</math> messages only to those nodes, thus drastically reducing useless traffic, since published messages are only sent to nodes that seem suitable for storing the key <math>k</math>; and iterative lookups cover just a small set of nodes rather than the entire DHT, reducing useless forwarding. In such DHTs, forwarding of <math>put(k, data)</math> messages may only occur as part of a self-healing algorithm: if a target node receives a <math>put(k, data)</math> message, but believes that <math>k</math> is out of its handled range and a closer node (in terms of DHT keyspace) is known, the message is forwarded to that node. Otherwise, data are indexed locally. This leads to a somewhat self-balancing DHT behavior. Of course, such an algorithm requires nodes to publish their presence data in the DHT so the iterative lookups can be performed.
 
== Examples ==
 
=== DHT protocols and implementations ===
* [[Apache Cassandra]]
* [[BATON Overlay]]
* [[Mainline DHT]] - Standard DHT used by BitTorrent (based on [[Kademlia]] as provided by Khashmir<ref>[http://www.tribler.org/trac/wiki/Khashmir Tribler wiki] retrieved January 2010.</ref>)
* [[Content Addressable Network|CAN]] (Content Addressable Network)
* [[Chord (DHT)|Chord]]
* [[Koorde]]
* [[Kademlia]]
* [[Pastry (DHT)|Pastry]]
* [[P-Grid]]
* [[Tapestry (DHT)|Tapestry]]
* [[TomP2P]]
 
=== Applications employing DHTs ===
<!-- NOTE ABOUT ADDING ITEMS TO THIS SECTION: Please provide a reference so the editors know that (1) the application actually uses a DHT, and (2) the project is notable as opposed to just someone's project from networking class. You can do this by providing a wikilink here or putting a note or external link on the Talk page. PLEASE DO NOT ADD BITTORRENT CLIENTS as these are already covered via the link to "Comparison of BitTorrent clients"; there's no reason to duplicate that list here. -->
* [[BTDigg]]: [[BitTorrent (protocol)|BitTorrent]] DHT search engine
* [[cjdns]]: routing engine for mesh-based networks
* [[CloudSNAP]]: a decentralized web application deployment platform
* [[Codeen]]: web caching
* [[Coral Content Distribution Network]]
* [[Dijjer]]: Freenet-like distribution network
* [[FAROO]]: peer-to-peer Web search engine
* [[Freenet]]: a censorship-resistant anonymous network
* [[GlusterFS]]: a distributed file system used for storage virtualization
* [[GNUnet]]: Freenet-like distribution network including a DHT implementation
*[[i2p-Bote]]: decentralised email service which stores encrypted messages in a DHT.
* [[JXTA]]: open-source P2P platform
* [[maidsafe]]: C++ implementation of Kademlia, with NAT traversal and crypto libraries. On its home page listed as "Available as a technology licence and a software solution written in cross platform C++."<ref>{{citation |url=http://code.google.com/p/maidsafe-dht/ |title=maidsafe-dht |publisher=Code.google.com |date= |accessdate=2012-01-10}}</ref>
* [http://code.google.com/p/openkad/ openkad] - Java implementation of Kademlia with distributed caching (GNU GPL v3 license)
* [[Oracle Coherence]]: an [[In Memory Data Grid]] built on a Java DHT implementation
* [[Retroshare]]: a [[Friend-to-friend]] network<ref>[http://retroshare.sourceforge.net/wiki/index.php/Frequently_Asked_Questions#4-1_How_does_RetroShare_know_my_friend.27s_IP_address_and_port.3F_Why_don.27t_I_need_a_static_IP_address.3F_What_is_DHT_for.3F Retroshare FAQ] retrieved December 2011</ref>
* [[WebSphere eXtreme Scale]]: a proprietary DHT implementation by IBM,<ref>[http://www.devwebsphere.com/devwebsphere/2010/01/implementing-global-indexes-on-websphere-extreme-scale.html Billy Newport, IBM Distinguished Engineer] retrieved October 2010.</ref> used for object caching
* [[YaCy]]: a distributed [[Web search engine|search engine]]
* [[Twister (software)|Twister]]: a [[microblogging]] [[peer-to-peer]] platform
 
== See also ==
{{Portal|Computer Science}}
* [[Couchbase Server]]: a persistent, replicated, clustered distributed object storage system compatible with memcached protocol.
* [[Memcached]]: a high-performance, distributed memory object caching system.
* [[Prefix hash tree]]: sophisticated querying over DHTs.
* [[Merkle tree]]: tree having every non-leaf node labelled with the hash of the labels of its children nodes.
* Most [[distributed data store]]s employ some form of DHT for lookup.
 
== References ==
{{Reflist|30em}}
 
== External links ==
* [http://linuxjournal.com/article/6797 Distributed Hash Tables, Part 1] by Brandon Wiley.
* [http://deim.urv.cat/~cpairot/dhts.html Distributed Hash Tables links] Carles Pairot's Page on DHT and P2P research
* [http://web.archive.org/web/*/http://kademlia.scs.cs.nyu.edu/ kademlia.scs.cs.nyu.edu] Archive.org snapshots of kademlia.scs.cs.nyu.edu
* {{Google Code|hazelcast|Hazelcast}}: open source DHT implementation
* {{cite paper | id = {{citeseerx|10.1.1.111.4197}} | title = IEEE Survey on overlay network schemes | author1 = Eng-Keong Lua | first2 = Jon | last2 = Crowcroft | first3 = Marcelo | last3 = Pias | first4 = Ravi | last4 = Sharma | first5 = Steve | last5 = Lim | postscript = : }} covering unstructured and structured decentralized overlay networks including DHTs (Chord, Pastry, Tapestry and others).
* [http://www.cs.helsinki.fi/u/jakangas/MLDHT/ Mainline DHT Measurement] at Department of Computer Science, University of Helsinki, Finland.
 
{{DEFAULTSORT:Distributed Hash Table}}
[[Category:Distributed data storage]]
[[Category:File sharing]]

Revision as of 22:07, 1 February 2014

A distributed hash table (DHT) is a class of a decentralized distributed system that provides a lookup service similar to a hash table; (key, value) pairs are stored in a DHT, and any participating node can efficiently retrieve the value associated with a given key. Responsibility for maintaining the mapping from keys to values is distributed among the nodes, in such a way that a change in the set of participants causes a minimal amount of disruption. This allows a DHT to scale to extremely large numbers of nodes and to handle continual node arrivals, departures, and failures.

DHTs form an infrastructure that can be used to build more complex services, such as anycast, cooperative Web caching, distributed file systems, domain name services, instant messaging, multicast, and also peer-to-peer file sharing and content distribution systems. Notable distributed networks that use DHTs include BitTorrent's distributed tracker, the Coral Content Distribution Network, the Kad network, the Storm botnet, Freenet and the YaCy search engine.

Distributed hash tables

History

DHT research was originally motivated, in part, by peer-to-peer systems such as Freenet, gnutella, BitTorrent and Napster, which took advantage of resources distributed across the Internet to provide a single useful application. In particular, they took advantage of increased bandwidth and hard disk capacity to provide a file-sharing service.

These systems differed in how they found the data their peers contained:

  • Napster, the first large-scale P2P content delivery system to exist, had a central index server: each node, upon joining, would send a list of locally held files to the server, which would perform searches and refer the querier to the nodes that held the results. This central component left the system vulnerable to attacks and lawsuits.Template:Cn
  • Gnutella and similar networks moved to a flooding query modelTemplate:Spaced ndash in essence, each search would result in a message being broadcast to every other machine in the network. While avoiding a single point of failure, this method was significantly less efficient than Napster. Later versions of Gnutella clients moved to a dynamic querying model which vastly improved efficiency.Template:Cn
  • Finally, Freenet is fully distributed, but employs a heuristic key-based routing in which each file is associated with a key, and files with similar keys tend to cluster on a similar set of nodes. Queries are likely to be routed through the network to such a cluster without needing to visit many peers.[1] However, Freenet does not guarantee that data will be found.

Distributed hash tables use a more structured key-based routing in order to attain both the decentralization of Freenet and gnutella, and the efficiency and guaranteed results of Napster. One drawback is that, like Freenet, DHTs only directly support exact-match search, rather than keyword search, although Freenet's routing algorithm can be generalized to any key type where a closeness operation can be defined.[2]

In 2001, four systems—CAN, Chord,[3] Pastry, and Tapestry—ignited DHTs as a popular research topic. A project called the Infrastructure for Resilient Internet Systems (Iris) was funded by a $12 million grant from the US National Science Foundation in 2002.[4] Researchers included Hari Balakrishnan and Scott Shenker.[5] Outside academia, DHT technology has been adopted as a component of BitTorrent and in the Coral Content Distribution Network.

Properties

DHTs characteristically emphasize the following properties:

  • Autonomy and Decentralization: the nodes collectively form the system without any central coordination.
  • Fault tolerance: the system should be reliable (in some sense) even with nodes continuously joining, leaving, and failing.
  • Scalability: the system should function efficiently even with thousands or millions of nodes.

A key technique used to achieve these goals is that any one node needs to coordinate with only a few other nodes in the system – most commonly, O(log n) of the participants (see below) – so that only a limited amount of work needs to be done for each change in membership.

Some DHT designs seek to be secure against malicious participants[6] and to allow participants to remain anonymous, though this is less common than in many other peer-to-peer (especially file sharing) systems; see anonymous P2P.

Finally, DHTs must deal with more traditional distributed systems issues such as load balancing, data integrity, and performance (in particular, ensuring that operations such as routing and data storage or retrieval complete quickly).

Structure

The structure of a DHT can be decomposed into several main components.[7][8] The foundation is an abstract keyspace, such as the set of 160-bit strings. A keyspace partitioning scheme splits ownership of this keyspace among the participating nodes. An overlay network then connects the nodes, allowing them to find the owner of any given key in the keyspace.

Once these components are in place, a typical use of the DHT for storage and retrieval might proceed as follows. Suppose the keyspace is the set of 160-bit strings. To store a file with given and in the DHT, the SHA-1 hash of is generated, producing a 160-bit key , and a message is sent to any node participating in the DHT. The message is forwarded from node to node through the overlay network until it reaches the single node responsible for key as specified by the keyspace partitioning. That node then stores the key and the data. Any other client can then retrieve the contents of the file by again hashing to produce and asking any DHT node to find the data associated with with a message . The message will again be routed through the overlay to the node responsible for , which will reply with the stored .

The keyspace partitioning and overlay network components are described below with the goal of capturing the principal ideas common to most DHTs; many designs differ in the details.

Keyspace partitioning

Most DHTs use some variant of consistent hashing to map keys to nodes. This technique employs a function that defines an abstract notion of the distance between the keys and , which is unrelated to geographical distance or network latency. Each node is assigned a single key called its identifier (ID). A node with ID owns all the keys for which is the closest ID, measured according to .

Example. The Chord DHT treats keys as points on a circle, and is the distance traveling clockwise around the circle from to . Thus, the circular keyspace is split into contiguous segments whose endpoints are the node identifiers. If and are two adjacent IDs, with a shorter clockwise distance from to , then the node with ID owns all the keys that fall between and .

Consistent hashing has the essential property that removal or addition of one node changes only the set of keys owned by the nodes with adjacent IDs, and leaves all other nodes unaffected. Contrast this with a traditional hash table in which addition or removal of one bucket causes nearly the entire keyspace to be remapped. Since any change in ownership typically corresponds to bandwidth-intensive movement of objects stored in the DHT from one node to another, minimizing such reorganization is required to efficiently support high rates of churn (node arrival and failure).

Locality-preserving hashing ensures that similar keys are assigned to similar objects. This can enable a more efficient execution of range queries. Self-Chord [9] decouples object keys from peer IDs and sorts keys along the ring with a statistical approach based on the swarm intelligence paradigm. Sorting ensures that similar keys are stored by neighbour nodes and that discovery procedures, including range queries, can be performed in logarithmic time.

Overlay network

Each node maintains a set of links to other nodes (its neighbors or routing table) . Together, these links form the overlay network. A node picks its neighbors according to a certain structure, called the network's topology.

All DHT topologies share some variant of the most essential property: for any key , each node either has a node ID that owns or has a link to a node whose node ID is closer to , in terms of the keyspace distance defined above. It is then easy to route a message to the owner of any key using the following greedy algorithm (that is not necessarily globally optimal): at each step, forward the message to the neighbor whose ID is closest to . When there is no such neighbor, then we must have arrived at the closest node, which is the owner of as defined above. This style of routing is sometimes called key-based routing.

Beyond basic routing correctness, two important constraints on the topology are to guarantee that the maximum number of hops in any route (route length) is low, so that requests complete quickly; and that the maximum number of neighbors of any node (maximum node degree) is low, so that maintenance overhead is not excessive. Of course, having shorter routes requires higher maximum degree. Some common choices for maximum degree and route length are as follows, where is the number of nodes in the DHT, using Big O notation:

Degree Route length Used in Note
Koorde
Chord most common, but not optimal (degree/route length)
Symphony

The most common choice, degree/route length, is not optimal in terms of degree/route length tradeoff, as such topologies typically allow more flexibility in choice of neighbors. Many DHTs use that flexibility to pick neighbors that are close in terms of latency in the physical underlying network.

Maximum route length is closely related to diameter: the maximum number of hops in any shortest path between nodes. Clearly, the network's worst case route length is at least as large as its diameter, so DHTs are limited by the degree/diameter tradeoff[10] that is fundamental in graph theory. Route length can be greater than diameter, since the greedy routing algorithm may not find shortest paths.[11]

Algorithms for overlay networks

Aside from routing, there exist many algorithms that exploit the structure of the overlay network for sending a message to all nodes, or a subset of nodes, in a DHT.[12] These algorithms are used by applications to do overlay multicast, range queries, or to collect statistics. Two systems that are based on this approach are Structella,[13] which implements flooding and random walks on a Pastry overlay, and DQ-DHT,[14] which implements a dynamic querying search algorithm over a Chord network.

DHT implementations

Most notable differences encountered in practical instances of DHT implementations include at least the following:

  • The address space is a parameter of DHT. Several real world DHTs use 128-bit or 160-bit key space
  • Some real-world DHTs use hash functions other than SHA-1.
  • In the real world the key could be a hash of a file's content rather than a hash of a file's name to provide content-addressable storage, so that renaming of the file does not prevent users from finding it.
  • Some DHTs may also publish objects of different types. For example, key could be the node and associated data could describe how to contact this node. This allows publication-of-presence information and often used in IM applications, etc. In the simplest case, is just a random number that is directly used as key (so in a 160-bit DHT will be a 160-bit number, usually randomly chosen). In some DHTs, publishing of nodes IDs is also used to optimize DHT operations.
  • Redundancy can be added to improve reliability. The key pair can be stored in more than one node corresponding to the key. Usually, rather than selecting just one node, real world DHT algorithms select suitable nodes, with being an implementation-specific parameter of the DHT. In some DHT designs, nodes agree to handle a certain keyspace range, the size of which may be chosen dynamically, rather than hard-coded.
  • Some advanced DHTs like Kademlia perform iterative lookups through the DHT first in order to select a set of suitable nodes and send messages only to those nodes, thus drastically reducing useless traffic, since published messages are only sent to nodes that seem suitable for storing the key ; and iterative lookups cover just a small set of nodes rather than the entire DHT, reducing useless forwarding. In such DHTs, forwarding of messages may only occur as part of a self-healing algorithm: if a target node receives a message, but believes that is out of its handled range and a closer node (in terms of DHT keyspace) is known, the message is forwarded to that node. Otherwise, data are indexed locally. This leads to a somewhat self-balancing DHT behavior. Of course, such an algorithm requires nodes to publish their presence data in the DHT so the iterative lookups can be performed.

Examples

DHT protocols and implementations

Applications employing DHTs

See also

Sportspersons Hyslop from Nicolet, usually spends time with pastimes for example martial arts, property developers condominium in singapore singapore and hot rods. Maintains a trip site and has lots to write about after touring Gulf of Porto: Calanche of Piana.

  • Couchbase Server: a persistent, replicated, clustered distributed object storage system compatible with memcached protocol.
  • Memcached: a high-performance, distributed memory object caching system.
  • Prefix hash tree: sophisticated querying over DHTs.
  • Merkle tree: tree having every non-leaf node labelled with the hash of the labels of its children nodes.
  • Most distributed data stores employ some form of DHT for lookup.

References

43 year old Petroleum Engineer Harry from Deep River, usually spends time with hobbies and interests like renting movies, property developers in singapore new condominium and vehicle racing. Constantly enjoys going to destinations like Camino Real de Tierra Adentro.

External links

  1. Many property agents need to declare for the PIC grant in Singapore. However, not all of them know find out how to do the correct process for getting this PIC scheme from the IRAS. There are a number of steps that you need to do before your software can be approved.

    Naturally, you will have to pay a safety deposit and that is usually one month rent for annually of the settlement. That is the place your good religion deposit will likely be taken into account and will kind part or all of your security deposit. Anticipate to have a proportionate amount deducted out of your deposit if something is discovered to be damaged if you move out. It's best to you'll want to test the inventory drawn up by the owner, which can detail all objects in the property and their condition. If you happen to fail to notice any harm not already mentioned within the inventory before transferring in, you danger having to pay for it yourself.

    In case you are in search of an actual estate or Singapore property agent on-line, you simply should belief your intuition. It's because you do not know which agent is nice and which agent will not be. Carry out research on several brokers by looking out the internet. As soon as if you end up positive that a selected agent is dependable and reliable, you can choose to utilize his partnerise in finding you a home in Singapore. Most of the time, a property agent is taken into account to be good if he or she locations the contact data on his website. This may mean that the agent does not mind you calling them and asking them any questions relating to new properties in singapore in Singapore. After chatting with them you too can see them in their office after taking an appointment.

    Have handed an trade examination i.e Widespread Examination for House Brokers (CEHA) or Actual Property Agency (REA) examination, or equal; Exclusive brokers are extra keen to share listing information thus making certain the widest doable coverage inside the real estate community via Multiple Listings and Networking. Accepting a severe provide is simpler since your agent is totally conscious of all advertising activity related with your property. This reduces your having to check with a number of agents for some other offers. Price control is easily achieved. Paint work in good restore-discuss with your Property Marketing consultant if main works are still to be done. Softening in residential property prices proceed, led by 2.8 per cent decline within the index for Remainder of Central Region

    Once you place down the one per cent choice price to carry down a non-public property, it's important to accept its situation as it is whenever you move in – faulty air-con, choked rest room and all. Get round this by asking your agent to incorporate a ultimate inspection clause within the possibility-to-buy letter. HDB flat patrons routinely take pleasure in this security net. "There's a ultimate inspection of the property two days before the completion of all HDB transactions. If the air-con is defective, you can request the seller to repair it," says Kelvin.

    15.6.1 As the agent is an intermediary, generally, as soon as the principal and third party are introduced right into a contractual relationship, the agent drops out of the image, subject to any problems with remuneration or indemnification that he could have against the principal, and extra exceptionally, against the third occasion. Generally, agents are entitled to be indemnified for all liabilities reasonably incurred within the execution of the brokers´ authority.

    To achieve the very best outcomes, you must be always updated on market situations, including past transaction information and reliable projections. You could review and examine comparable homes that are currently available in the market, especially these which have been sold or not bought up to now six months. You'll be able to see a pattern of such report by clicking here It's essential to defend yourself in opposition to unscrupulous patrons. They are often very skilled in using highly unethical and manipulative techniques to try and lure you into a lure. That you must also protect your self, your loved ones, and personal belongings as you'll be serving many strangers in your home. Sign a listing itemizing of all of the objects provided by the proprietor, together with their situation. HSR Prime Recruiter 2010
  2. Many property agents need to declare for the PIC grant in Singapore. However, not all of them know find out how to do the correct process for getting this PIC scheme from the IRAS. There are a number of steps that you need to do before your software can be approved.

    Naturally, you will have to pay a safety deposit and that is usually one month rent for annually of the settlement. That is the place your good religion deposit will likely be taken into account and will kind part or all of your security deposit. Anticipate to have a proportionate amount deducted out of your deposit if something is discovered to be damaged if you move out. It's best to you'll want to test the inventory drawn up by the owner, which can detail all objects in the property and their condition. If you happen to fail to notice any harm not already mentioned within the inventory before transferring in, you danger having to pay for it yourself.

    In case you are in search of an actual estate or Singapore property agent on-line, you simply should belief your intuition. It's because you do not know which agent is nice and which agent will not be. Carry out research on several brokers by looking out the internet. As soon as if you end up positive that a selected agent is dependable and reliable, you can choose to utilize his partnerise in finding you a home in Singapore. Most of the time, a property agent is taken into account to be good if he or she locations the contact data on his website. This may mean that the agent does not mind you calling them and asking them any questions relating to new properties in singapore in Singapore. After chatting with them you too can see them in their office after taking an appointment.

    Have handed an trade examination i.e Widespread Examination for House Brokers (CEHA) or Actual Property Agency (REA) examination, or equal; Exclusive brokers are extra keen to share listing information thus making certain the widest doable coverage inside the real estate community via Multiple Listings and Networking. Accepting a severe provide is simpler since your agent is totally conscious of all advertising activity related with your property. This reduces your having to check with a number of agents for some other offers. Price control is easily achieved. Paint work in good restore-discuss with your Property Marketing consultant if main works are still to be done. Softening in residential property prices proceed, led by 2.8 per cent decline within the index for Remainder of Central Region

    Once you place down the one per cent choice price to carry down a non-public property, it's important to accept its situation as it is whenever you move in – faulty air-con, choked rest room and all. Get round this by asking your agent to incorporate a ultimate inspection clause within the possibility-to-buy letter. HDB flat patrons routinely take pleasure in this security net. "There's a ultimate inspection of the property two days before the completion of all HDB transactions. If the air-con is defective, you can request the seller to repair it," says Kelvin.

    15.6.1 As the agent is an intermediary, generally, as soon as the principal and third party are introduced right into a contractual relationship, the agent drops out of the image, subject to any problems with remuneration or indemnification that he could have against the principal, and extra exceptionally, against the third occasion. Generally, agents are entitled to be indemnified for all liabilities reasonably incurred within the execution of the brokers´ authority.

    To achieve the very best outcomes, you must be always updated on market situations, including past transaction information and reliable projections. You could review and examine comparable homes that are currently available in the market, especially these which have been sold or not bought up to now six months. You'll be able to see a pattern of such report by clicking here It's essential to defend yourself in opposition to unscrupulous patrons. They are often very skilled in using highly unethical and manipulative techniques to try and lure you into a lure. That you must also protect your self, your loved ones, and personal belongings as you'll be serving many strangers in your home. Sign a listing itemizing of all of the objects provided by the proprietor, together with their situation. HSR Prime Recruiter 2010
  3. Hari Balakrishnan, M. Frans Kaashoek, David Karger, Robert Morris, and Ion Stoica. Looking up data in P2P systems. In Communications of the ACM, February 2003.
  4. Template:Cite news
  5. Template:Cite news
  6. Guido Urdaneta, Guillaume Pierre and Maarten van Steen. A Survey of DHT Security Techniques. ACM Computing Surveys 43(2), January 2011.
  7. Moni Naor and Udi Wieder. Novel Architectures for P2P Applications: the Continuous-Discrete Approach. Proc. SPAA, 2003.
  8. Gurmeet Singh Manku. Dipsea: A Modular Distributed Hash Table. Ph. D. Thesis (Stanford University), August 2004.
  9. Agostino Forestiero, Emilio Leonardi, Carlo Mastroianni and Michela Meo. Self-Chord: a Bio-Inspired P2P Framework for Self-Organizing Distributed Systems. IEEE/ACM Transactions on Networking, 2010.
  10. Many property agents need to declare for the PIC grant in Singapore. However, not all of them know find out how to do the correct process for getting this PIC scheme from the IRAS. There are a number of steps that you need to do before your software can be approved.

    Naturally, you will have to pay a safety deposit and that is usually one month rent for annually of the settlement. That is the place your good religion deposit will likely be taken into account and will kind part or all of your security deposit. Anticipate to have a proportionate amount deducted out of your deposit if something is discovered to be damaged if you move out. It's best to you'll want to test the inventory drawn up by the owner, which can detail all objects in the property and their condition. If you happen to fail to notice any harm not already mentioned within the inventory before transferring in, you danger having to pay for it yourself.

    In case you are in search of an actual estate or Singapore property agent on-line, you simply should belief your intuition. It's because you do not know which agent is nice and which agent will not be. Carry out research on several brokers by looking out the internet. As soon as if you end up positive that a selected agent is dependable and reliable, you can choose to utilize his partnerise in finding you a home in Singapore. Most of the time, a property agent is taken into account to be good if he or she locations the contact data on his website. This may mean that the agent does not mind you calling them and asking them any questions relating to new properties in singapore in Singapore. After chatting with them you too can see them in their office after taking an appointment.

    Have handed an trade examination i.e Widespread Examination for House Brokers (CEHA) or Actual Property Agency (REA) examination, or equal; Exclusive brokers are extra keen to share listing information thus making certain the widest doable coverage inside the real estate community via Multiple Listings and Networking. Accepting a severe provide is simpler since your agent is totally conscious of all advertising activity related with your property. This reduces your having to check with a number of agents for some other offers. Price control is easily achieved. Paint work in good restore-discuss with your Property Marketing consultant if main works are still to be done. Softening in residential property prices proceed, led by 2.8 per cent decline within the index for Remainder of Central Region

    Once you place down the one per cent choice price to carry down a non-public property, it's important to accept its situation as it is whenever you move in – faulty air-con, choked rest room and all. Get round this by asking your agent to incorporate a ultimate inspection clause within the possibility-to-buy letter. HDB flat patrons routinely take pleasure in this security net. "There's a ultimate inspection of the property two days before the completion of all HDB transactions. If the air-con is defective, you can request the seller to repair it," says Kelvin.

    15.6.1 As the agent is an intermediary, generally, as soon as the principal and third party are introduced right into a contractual relationship, the agent drops out of the image, subject to any problems with remuneration or indemnification that he could have against the principal, and extra exceptionally, against the third occasion. Generally, agents are entitled to be indemnified for all liabilities reasonably incurred within the execution of the brokers´ authority.

    To achieve the very best outcomes, you must be always updated on market situations, including past transaction information and reliable projections. You could review and examine comparable homes that are currently available in the market, especially these which have been sold or not bought up to now six months. You'll be able to see a pattern of such report by clicking here It's essential to defend yourself in opposition to unscrupulous patrons. They are often very skilled in using highly unethical and manipulative techniques to try and lure you into a lure. That you must also protect your self, your loved ones, and personal belongings as you'll be serving many strangers in your home. Sign a listing itemizing of all of the objects provided by the proprietor, together with their situation. HSR Prime Recruiter 2010
  11. Gurmeet Singh Manku, Moni Naor, and Udi Wieder. Know thy Neighbor's Neighbor: the Power of Lookahead in Randomized P2P Networks. Proc. STOC, 2004.
  12. Ali Ghodsi. Distributed k-ary System: Algorithms for Distributed Hash Tables. KTH-Royal Institute of Technology, 2006.
  13. Miguel Castro, Manuel Costa, and Antony Rowstron. Should we build Gnutella on a structured overlay?. Computer Communication Review, 2004.
  14. Domenico Talia and Paolo Trunfio. Enabling Dynamic Querying over Distributed Hash Tables. Journal of Parallel and Distributed Computing, 2010.
  15. Tribler wiki retrieved January 2010.
  16. Many property agents need to declare for the PIC grant in Singapore. However, not all of them know find out how to do the correct process for getting this PIC scheme from the IRAS. There are a number of steps that you need to do before your software can be approved.

    Naturally, you will have to pay a safety deposit and that is usually one month rent for annually of the settlement. That is the place your good religion deposit will likely be taken into account and will kind part or all of your security deposit. Anticipate to have a proportionate amount deducted out of your deposit if something is discovered to be damaged if you move out. It's best to you'll want to test the inventory drawn up by the owner, which can detail all objects in the property and their condition. If you happen to fail to notice any harm not already mentioned within the inventory before transferring in, you danger having to pay for it yourself.

    In case you are in search of an actual estate or Singapore property agent on-line, you simply should belief your intuition. It's because you do not know which agent is nice and which agent will not be. Carry out research on several brokers by looking out the internet. As soon as if you end up positive that a selected agent is dependable and reliable, you can choose to utilize his partnerise in finding you a home in Singapore. Most of the time, a property agent is taken into account to be good if he or she locations the contact data on his website. This may mean that the agent does not mind you calling them and asking them any questions relating to new properties in singapore in Singapore. After chatting with them you too can see them in their office after taking an appointment.

    Have handed an trade examination i.e Widespread Examination for House Brokers (CEHA) or Actual Property Agency (REA) examination, or equal; Exclusive brokers are extra keen to share listing information thus making certain the widest doable coverage inside the real estate community via Multiple Listings and Networking. Accepting a severe provide is simpler since your agent is totally conscious of all advertising activity related with your property. This reduces your having to check with a number of agents for some other offers. Price control is easily achieved. Paint work in good restore-discuss with your Property Marketing consultant if main works are still to be done. Softening in residential property prices proceed, led by 2.8 per cent decline within the index for Remainder of Central Region

    Once you place down the one per cent choice price to carry down a non-public property, it's important to accept its situation as it is whenever you move in – faulty air-con, choked rest room and all. Get round this by asking your agent to incorporate a ultimate inspection clause within the possibility-to-buy letter. HDB flat patrons routinely take pleasure in this security net. "There's a ultimate inspection of the property two days before the completion of all HDB transactions. If the air-con is defective, you can request the seller to repair it," says Kelvin.

    15.6.1 As the agent is an intermediary, generally, as soon as the principal and third party are introduced right into a contractual relationship, the agent drops out of the image, subject to any problems with remuneration or indemnification that he could have against the principal, and extra exceptionally, against the third occasion. Generally, agents are entitled to be indemnified for all liabilities reasonably incurred within the execution of the brokers´ authority.

    To achieve the very best outcomes, you must be always updated on market situations, including past transaction information and reliable projections. You could review and examine comparable homes that are currently available in the market, especially these which have been sold or not bought up to now six months. You'll be able to see a pattern of such report by clicking here It's essential to defend yourself in opposition to unscrupulous patrons. They are often very skilled in using highly unethical and manipulative techniques to try and lure you into a lure. That you must also protect your self, your loved ones, and personal belongings as you'll be serving many strangers in your home. Sign a listing itemizing of all of the objects provided by the proprietor, together with their situation. HSR Prime Recruiter 2010
  17. Retroshare FAQ retrieved December 2011
  18. Billy Newport, IBM Distinguished Engineer retrieved October 2010.