| http://dbpedia.org/ontology/abstract
|
In peer-to-peer networks, Koorde is a dist … In peer-to-peer networks, Koorde is a distributed hash table (DHT) system based on the Chord DHT and the De Bruijn graph (De Bruijn sequence). Inheriting the simplicity of Chord, Koorde meets O(log n) hops per node (where n is the number of nodes in the DHT), and hops per lookup request with O(log n) neighbors per node. The Chord concept is based on a wide range of identifiers (e.g. 2160) in a structure of a ring where an identifier can stand for both node and data. Node-successor is responsible for the whole range of IDs between itself and its predecessor.of IDs between itself and its predecessor.
|
| http://dbpedia.org/ontology/thumbnail
|
http://commons.wikimedia.org/wiki/Special:FilePath/De_bruijn_graph-for_binary_sequence_of_order_4.svg?width=300 +
|
| http://dbpedia.org/ontology/wikiPageExternalLink
|
http://www.cs.jhu.edu/~scheideler/courses/600.348_F03/lecture_10.pdf +
, https://web.archive.org/web/20040929211835/http:/www.cs.utexas.edu/users/plaxton/c/395t/slides/DynamicTopologies-2.pdf +
, http://iptps03.cs.berkeley.edu/final-papers/koorde.ps +
|
| http://dbpedia.org/ontology/wikiPageID
|
14947011
|
| http://dbpedia.org/ontology/wikiPageLength
|
5104
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
1114119517
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Network_address +
, http://dbpedia.org/resource/Peer-to-peer +
, http://dbpedia.org/resource/Distributed_hash_table +
, http://dbpedia.org/resource/Category:File_sharing_networks +
, http://dbpedia.org/resource/Category:Distributed_data_storage +
, http://dbpedia.org/resource/Distance_%28graph_theory%29 +
, http://dbpedia.org/resource/Big_O_notation +
, http://dbpedia.org/resource/Ring_network +
, http://dbpedia.org/resource/Vertex_%28graph_theory%29 +
, http://dbpedia.org/resource/Pointer_%28computer_programming%29 +
, http://dbpedia.org/resource/De_Bruijn_sequence +
, http://dbpedia.org/resource/Node_%28networking%29 +
, http://dbpedia.org/resource/Modular_arithmetic +
, http://dbpedia.org/resource/Radix +
, http://dbpedia.org/resource/De_Bruijn_graph +
, http://dbpedia.org/resource/Routing_algorithm +
, http://dbpedia.org/resource/Pseudocode +
, http://dbpedia.org/resource/File:Figura1koorde.jpg +
, http://dbpedia.org/resource/Chord_%28DHT%29 +
, http://dbpedia.org/resource/Bitwise_operation +
, http://dbpedia.org/resource/File:De_bruijn_graph-for_binary_sequence_of_order_4.svg +
, http://dbpedia.org/resource/Bit +
, http://dbpedia.org/resource/Category:Hash_based_data_structures +
, http://dbpedia.org/resource/Category:Hashing +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Math +
, http://dbpedia.org/resource/Template:Short_description +
, http://dbpedia.org/resource/Template:Sub +
, http://dbpedia.org/resource/Template:Tmath +
, http://dbpedia.org/resource/Template:Code +
, http://dbpedia.org/resource/Template:Mvar +
, http://dbpedia.org/resource/Template:Sup +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Hash_based_data_structures +
, http://dbpedia.org/resource/Category:Hashing +
, http://dbpedia.org/resource/Category:Distributed_data_storage +
, http://dbpedia.org/resource/Category:File_sharing_networks +
|
| http://purl.org/linguistics/gold/hypernym
|
http://dbpedia.org/resource/System +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Koorde?oldid=1114119517&ns=0 +
|
| http://xmlns.com/foaf/0.1/depiction
|
http://commons.wikimedia.org/wiki/Special:FilePath/De_bruijn_graph-for_binary_sequence_of_order_4.svg +
, http://commons.wikimedia.org/wiki/Special:FilePath/Figura1koorde.jpg +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Koorde +
|
| owl:sameAs |
http://rdf.freebase.com/ns/m.03h2q6m +
, http://dbpedia.org/resource/Koorde +
, https://global.dbpedia.org/id/4pe1b +
, http://www.wikidata.org/entity/Q6430747 +
|
| rdfs:comment |
In peer-to-peer networks, Koorde is a dist … In peer-to-peer networks, Koorde is a distributed hash table (DHT) system based on the Chord DHT and the De Bruijn graph (De Bruijn sequence). Inheriting the simplicity of Chord, Koorde meets O(log n) hops per node (where n is the number of nodes in the DHT), and hops per lookup request with O(log n) neighbors per node. The Chord concept is based on a wide range of identifiers (e.g. 2160) in a structure of a ring where an identifier can stand for both node and data. Node-successor is responsible for the whole range of IDs between itself and its predecessor.of IDs between itself and its predecessor.
|
| rdfs:label |
Koorde
|
