saneax
Jan 3 2007, 05:32 AM
| | Hi folks,
DHT for short is used in decentralized archival of certain data, which can be accessed in a deentralized manner. say we have certain files we want to share. however, there is no central archival.. so what happens, is the files are hashed and stored internally and boradcasted request or searches from other clients are tallied with hash we store.
I am looking for some good description on DHT and some free implementation to study for, as from above you can see its a partial understanding.
regards
saneax |
Reply
Recent Queries:--
hash table algorithm - 7.34 hr back. (1)
-
hash table - 8.69 hr back. (1)
-
distributed hash table algroithm - 34.90 hr back. (1)
-
php distributive table - 72.84 hr back. (1)
-
distributed hash - 93.63 hr back. (1)
-
hashtable.php - 95.39 hr back. (2)
-
distributed hashtable - 143.03 hr back. (1)
-
php distributed hash table - 195.29 hr back. (1)
-
distributed hash function algorithm - 237.79 hr back. (1)
-
php distributed hash function - 279.59 hr back. (1)
-
php hash table - 367.34 hr back. (1)
-
distribute hash table alogrithm - 383.03 hr back. (1)
-
php hashtable - 47.04 hr back. (2)
-
algorithm for hashtable - 386.88 hr back. (1)
Similar Topics
Keywords :
distributed hash algorithm- The Problem With #
- Algorithm problem (1)
- Collision Check Algorithm
- Seeing if two objects are overlapping (2)
I have been looking around for a bit, and have not been able to find a solution to my problem. I was
hoping someone here might know an algorithm for checking if two objects are overlapping. For
example, I have two objects, each with an image. The objects have an x and y, but they have more
than just a width and height - they have a shape. I'm not talking about rectangular collision,
but actual (reasonably) precise measurements that don't take a huge amount of load or run-time
processing. The best possible solution I could come up with would be to draw a blank o...
Algorithm I Developed For Solving Any Given Maze
- (2)
It basically uses a breadth first search of the maze, while removing backwards paths if its a tree.
We represent a place (square) in the maze by its x and y coordinates: > type Place = (Int, Int) A
direction, corresponding to a compass point > data Direction = N | S | E | W Geographic functions
opposite and move will be useful throughout the course of investigating the mazes. Their definitions
are given below: > opposite :: Direction -> Direction > opposite N = S > opposite S = N > opposite
E = W > opposite W = E > move :: Direction -> Place -> Place > move N (i,j...
Looking for distributed, hash, table, algorithm
