Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Koorde> ?p ?o }
Showing triples 1 to 37 of
37
with 100 triples per page.
- Koorde abstract "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 O(log n/ log log n) hops per lookup request with O(log n) neighbors per node.The Chord concept is based on a wide range of identifiers (e.g. 2^160) 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.".
- Koorde thumbnail De_bruijn_graph-for_binary_sequence_of_order_4.svg?width=300.
- Koorde wikiPageExternalLink koorde.ps.
- Koorde wikiPageExternalLink DynamicTopologies-2.pdf.
- Koorde wikiPageExternalLink lecture_10.pdf.
- Koorde wikiPageID "14947011".
- Koorde wikiPageLength "3659".
- Koorde wikiPageOutDegree "13".
- Koorde wikiPageRevisionID "568905267".
- Koorde wikiPageWikiLink Category:Distributed_data_storage.
- Koorde wikiPageWikiLink Category:File_sharing_networks.
- Koorde wikiPageWikiLink Category:Hashing.
- Koorde wikiPageWikiLink Chord_(peer-to-peer).
- Koorde wikiPageWikiLink De_Bruijn_graph.
- Koorde wikiPageWikiLink De_Bruijn_sequence.
- Koorde wikiPageWikiLink Distributed_hash_table.
- Koorde wikiPageWikiLink File:Koorde_lookup_code.JPG.
- Koorde wikiPageWikiLink File:Koorde_lookup_routing.JPG.
- Koorde wikiPageWikiLink Peer-to-peer.
- Koorde wikiPageWikiLink File:De_bruijn_graph-for_binary_sequence_of_order_4.svg.
- Koorde wikiPageWikiLinkText "Koorde".
- Koorde subject Category:Distributed_data_storage.
- Koorde subject Category:File_sharing_networks.
- Koorde subject Category:Hashing.
- Koorde hypernym System.
- Koorde type Algorithm.
- Koorde type Network.
- Koorde type Protocol.
- Koorde type Structure.
- Koorde comment "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 O(log n/ log log n) hops per lookup request with O(log n) neighbors per node.The Chord concept is based on a wide range of identifiers (e.g. 2^160) in a structure of a ring where an identifier can stand for both node and data.".
- Koorde label "Koorde".
- Koorde sameAs Q6430747.
- Koorde sameAs m.03h2q6m.
- Koorde sameAs Q6430747.
- Koorde wasDerivedFrom Koorde?oldid=568905267.
- Koorde depiction De_bruijn_graph-for_binary_sequence_of_order_4.svg.
- Koorde isPrimaryTopicOf Koorde.