
	Where results make sense

Topic: Distributed hash table

Related Topics

Hash table

In the News (Thu 8 Jan 09)

Brad Pitt

Jennifer Garner

Boston College

Steve Ballmer

Rod Blagojevich

Phil Schiller

Gaza City

Jermain Defoe

Lindsay Lohan

Bill Richardson

	Distributed hash table - Wikipedia
		A distributed hash table (DHT), is a technology based on hash tables enabling identification and retrieving, in distributed systems like some P2P networks, of information.
		The whole table is distributed on the network : each node has a part of it.
		Distributed hash tables are being used in Freenet and Chord.
	wikipedia.findthelinks.com /dh/DHT.html (60 words)

	Distributed hash table - Wikipedia, the free encyclopedia
		Distributed hash tables (DHTs) are a class of decentralized distributed systems that partition ownership of a set of keys among participating nodes, and can efficiently route messages to the unique owner of any given key.
		DHT research was originally motivated, in part, by peer-to-peer systems such as Napster, Gnutella, and Freenet, which took advantage of resources distributed across the Internet to provide a single useful application.
		Contrast this with a traditional hash table in which addition or removal of one bucket causes nearly the entire keyspace to be remapped.
	en.wikipedia.org /wiki/Distributed_hash_table (1519 words)

	Distributed hash table (Site not responding. Last check: 2007-10-18)
		DHTs are named after hash tables because they assign responsibility for a piece of data based on a hash function (often SHA-1); each node acts like a bucket in a hash table.
		A DHT provides an efficient lookup algorithm (or network routing method) that allows one participating node to quickly determine which other machine is responsible for a given piece of data.
		DHT research was originally motivated, in part, by peer-to-peer systems such as Napster and Gnutella.
	distributed-hash-table.kiwiki.homeip.net (804 words)

	2.11.3 Chord - A Distributed Hash Table Example (Site not responding. Last check: 2007-10-18)
		A hash table takes an input key k, calculates the hash function on the key h(k), and uses this as an index into a table.
		In a distributed hash table, the table into which h(k) indexes is distributed across the nodes in the DHT.
		The key is provided, the hash function is calculated h(k), and h(k) is used to route to the node which would hold the object corresponding to the key.
	www.cogs.susx.ac.uk /users/ianw/teach/dist-sys/node187.html (106 words)

	BitTorrent.org » For Developers » DHT Protocol
		A "node" is a client/server listening on a UDP port implementing the distributed hash table protocol.
		The routing table becomes more detailed as IDs get closer to the node's own ID. Nodes know about many other nodes in the DHT that have IDs that are "close" to their own but have only a handful of contacts with IDs that are very far away from their own.
		Many nodes using the DHT are able to send queries and receive responses, but are not able to respond to queries from other nodes.
	www.bittorrent.org /Draft_DHT_protocol.html (2470 words)

	Distributed Hash Tables Links (Site not responding. Last check: 2007-10-18)
		At the core of the Circle is a decentralized hash table, or "Chord".
		Khashmir is a Distributed Hash Table (DHT) based on Kademlia and written in Python.
		SharkyPy is an implementation of a Kademlia Distributed Hash Table.
	www.etse.urv.es /~cpairot/dhts.html (1868 words)

	Distributed hash table - AzureusWiki
		The distributed database in all current Azureus builds (>=2.3.0.0) is based on a UDP based Distributed Hash Table (DHT).
		The DHT acts like a transparent, distributed Hash Table (thus the name) with node IDs based on the SHA-1 hash of the node's IP/Port combination.
		Due to the nature of hash function fuzzy search algorithms required for keyword based searching are hard to implement because a small change in the input will result in a completely different output and thus another key and not a nearby one.
	www.azureuswiki.com /index.php/Distributed_hash_table (318 words)

	ResearchChannel - Distributed Hash Tables for Large-Scale Cooperative Applications
		Distributed hash tables are a way to organize the storage and network resources of many Internet hosts to create a single storage system.
		The promise of DHTs lies in their potential to create a distributed storage infrastructure that, in aggregate, is more robust and offers higher performance than any individual host.
		Because DHTs are likely to be deployed on potentially unreliable volunteer nodes spread around the globe, meeting this goal is challenging: nodes in the system may join or leave at any time and latencies between nodes can be large.
	www.researchchannel.org /prog/displayseries.asp?collid=710 (261 words)

	Shared Memory (Site not responding. Last check: 2007-10-18)
		That means the distributed hashtable implementation will act like a routing table and the nice part is that this routing tables doesn't have to be identical on each JVM.
		For instance, let say you are accessing a data with key y from JVM1 (distributedHashtable.get(y)) and the distributed hashtable instance on JVM1 points to the bucket which happens to be another JVM(JVM2) on another machine (M2), then call is routed to the JVM2 on M2.
		For key y, the distributed hashtable instance on JVM2 points to a different bucket which happens to be the disk on M2.
	jroller.com /page/talipozturk?entry=distributed_hash_tables (1243 words)

	CIS505 Software Systems Spring 2004: Project 2
		You are to design and implement Chord505, a simplified Distributed Hash Table based on Chord.
		Even with such a reference, a real DHT implementation could be complicated: The nodes can join and leave simultaneously or fail silently; The network could be partitioned.
		It is an example of implementing the DHT and using the whole simulator.
	www.seas.upenn.edu /~cis505/spring2004/project2.html (992 words)

	Dipsea A Modular Hash Table -- Gurmeet Singh Manku -- Doctoral Dissertation
		Dipsea is a modular architecture for Distributed Hash Tables.
		An efficient ID management algorithm for DHTs works as follows: upon arrival, a new host sends a random probe, followed by a local probe of size (c log n), and splits the largest manager encountered.
		RANDOM distribution results from each participant choosing a random number in [0, 1) as its ID. BALANCED distribution results from any of the ID management algorithms developed in Chapters 2 and 3.
	www-db.stanford.edu /~manku/phd/index.html (1352 words)

	LCS shares grant to build more secure Internet technologies - MIT News Office
		The Iris project aims to use "distributed hash table" technology to develop a robust common framework and infrastructure for distributed applications without creating central points of vulnerability.
		The project will investigate two conjectures: that a wide variety of distributed applications can be built on a distributed hash table platform (a peer-to-peer network with no central controlling server) with application-independent, unconstrained keys and values; and that these applications can inherit basic levels of security, robustness, ease of operation and scaling from the technology.
		Acting as the cornerstone of the new robust shared infrastructure, distributed hash table technology will securely orchestrate data retrieval and computation on open-ended large-scale networks such as the Internet, even when the individual nodes on the network are insecure or unreliable.
	web.mit.edu /newsoffice/2002/connect-1002.html (704 words)

	JDHT: Java Distributed Hash Table or Java DKS Hash Table
		JDHT is a simple Java based Distributed Hash Table (DHT) which implements java.util.Map.
		DHTs are very scalable distributed data structured originated from research on peer-to-peer (P2P) computing.
		JDHT is developed at KTH/Royal Institute of Technology and the Swedish Institute of Computer Science (SICS) in the context of the european project PEPITO.
	dks.sics.se /jdht (202 words)

	DHT Network in BitComet - BitComet (Site not responding. Last check: 2007-10-18)
		DHT(Distributed Hash Table) is method of a distributed storage for pairs.
		There is no center server in DHT Network, every client take charge of a small range of routing, a small set of data storage, so that in the whole DHT network, data can be found, read and write.
		Please note that the DHT in Azureus is not compatible with BitTorrent Beta and thus also not compatible with BitComet.
	wiki.bitcomet.com /help/DHT_Network_in_BitComet (327 words)

	Frans Kaashoek, UTCS Internet and Grid Computing Lecture Series
		DHTs can be made robust in the face of failures, attacks and unexpectedly high loads.
		Distributed hash tables are a popular way of constructing peer-to-peer systems in the acadamic community.
		This talk discusses how to implement a distributed hash table using Chord, which requires log(N) messages and log(N) state per node to lookup a key (where N is the number of nodes).
	www.cs.utexas.edu /~lasr/igc/Kaashoek.shtml (452 words)

	di: JXTA Distributed Indexing (Site not responding. Last check: 2007-10-18)
		The distributed index can also serve as a notification service, by indexing queries, instead of content, and routing content to query generators when a piece of content which matches the query is published.
		Each peer in the distributed hash-table is assigned a responsibility for indexing a range (zone) of numbers.
		The content ID is mapped to a peer using the global hash function to map the content to a zone.
	di.jxta.org (915 words)

	The Bamboo DHT -- Introduction (Site not responding. Last check: 2007-10-18)
		A distributed hash table, or DHT, is a building block for peer-to-peer applications.
		At the most basic level, it allows a group of distributed hosts to collectively manage a mapping from keys to data values, without any fixed hierarchy, and with very little human assistance.
		Compared to Pastry, the algorithms are more incremental, a difference that allows Bamboo to better withstand large membership changes in the DHT as well as continuous churn in membership, especially in bandwidth-limited environments.
	bamboo-dht.org (344 words)

	Kademlia - Wikipedia, the free encyclopedia
		Kademlia is a distributed hash table designed by Petar Maymounkov and David Mazières, for decentralized peer to peer computer networks.
		Each of these keywords is hashed and stored into the network in the same way as a filehash, together with the corresponding filename and filehash.
		BitTorrent Mainline DHT: BitTorrent client (4.1.0+), µTorrent (1.2+), BitSpirit (3.0+) and BitComet (0.59+): They all share a DHT based on an implementation of the Kademlia algorithm, for trackerless torrents.
	en.wikipedia.org /wiki/Kademlia (894 words)

	Koorde: A simple degree-optimal distributed hash table - Kaashoek, Karger (ResearchIndex) (Site not responding. Last check: 2007-10-18)
		Abstract: Koorde is a new distributed hash table (DHT) based on Chord [15] and the de Bruijn graphs [2].
		While inheriting the simplicity of Chord, Koorde meets various lower bounds, such as O(log n) hops per lookup request with only 2 neighbors per node (where n is the number of nodes in the DHT), and O(log n/ log log n) hops per lookup request with O(log n) neighbors per node.
		Broose: a Practical Distributed Hashtable based on the..
	citeseer.ist.psu.edu /kaashoek03koorde.html (526 words)

	CS511 Project
		With a distributed hash table, data is replicated on multiple nodes in the Sensorium.
		Using the Chord style of distributed hash table each node maintains a finger table which contains O(log(N)) entries (N is the number of nodes participating in the distributed hash table).
		Each entry is a mapping of a key to the node responsible for holding the value associated with that key.
	cs-people.bu.edu /hughesac/cs511.html (244 words)

	Distributed DNS
		This project elaborates the feasibility of a decentralized, distributed DNS (DDNS).
		For that purpose a peer to peer distributed hash table is used which is similar to the Kademlia protocol.
		This MVM is intended to be a scarce resource in the distributed DNS.
	distributeddns.sourceforge.net (1251 words)

	DHT (distributed hash table)
		A technology that can be used to develop a common infrastructure for distributed or peer-to-peer applications, including storage and multicasting.
		DHT is like having a file cabinet distributed over numerous servers, explained Frans Kaashoek, a professor of Computer Science and Engineering at the Massachusetts Institute of Technology (MIT).
		Paper that discusses the use of distributed hash tables in managing distributed data.
	www.networkworld.com /details/805.html (729 words)

	Dynamic Linked Lists Website
		An asynchronous communication library for accessing and managing dynamic hash tables over a network of Symmetric Multiprocessors (SMP) is presented.
		A blocking factor is shown experimentally to reduce the variance of the wall clock time.
		It is also shown that remote accesses to a distributed hash table can be as effective and scalable as the one-sided operations of the low-level communication middleware on an IBM SP.
	csm.pnl.gov /statistics/dll (76 words)

	OpenDHT: A Publicly Accessible DHT Service (Site not responding. Last check: 2007-10-18)
		In contrast to the usual DHT model, clients of OpenDHT do not need to run a DHT node in order to use the service.
		Instead, they can issue put and get operations to any DHT node, which processes the operations on their behalf.
		No credentials or accounts are required to use the service, and the available storage is fairly shared across all active clients.
	opendht.org (182 words)

	IRIS: Infrastructure for Resilient Internet Systems (Site not responding. Last check: 2007-10-18)
		The IRIS project is developing a novel decentralized infrastructure, based on distributed hash tables (DHTs), that will enable a new generation of large-scale distributed applications.
		DHTs are robust in the face of failures, attacks and unexpectedly high loads.
		The IRIS ITR proposal contains more details regarding DHT's and the goals and plans of the IRIS project, including references to the technical literature.
	www.project-iris.net (195 words)

Try your search on: Qwika (all wikis)