Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,168,524 papers from all fields of science
Search
Sign In
Create Free Account
Koorde
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
4 relations
De Bruijn graph
Distributed hash table
List of data structures
Peer-to-peer
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
An Efficient Koorde Model Based on Delay
Wang Yong-xia
2009
Corpus ID: 63518852
Koorde is a new distributed hash table(DHT).But its routing mechanism should be improved. Moreover, the underlying topology…
Expand
2009
2009
An Effi cient Routing Algorithm of Koorde Based on Latency
Zhang Zhen-yu
2009
Corpus ID: 64456466
Koorde is a new distributed hash table(DHT). It maps nodes and data objects to a random ID. The choice of next hop is fi xed and…
Expand
2007
2007
A Large-scale and Decentralized Infrastructure for Content-based Publish/Subscribe Services
Xiaoyu Yang
,
Yingwu Zhu
,
Yimin Hu
International Conference on Parallel Processing
2007
Corpus ID: 5876277
Publish/subscribe model has become a prevalent paradigm for building distributed event delivering systems. Content-based publish…
Expand
2007
2007
A novel constant degree and constant congestion DHT scheme for peer-to-peer networks
Dongsheng Li
,
Xicheng Lu
Science in China Series F: Information Sciences
2007
Corpus ID: 35229502
Degree, diameter and congestion are important measures of distributed hash table (DHT) schemes for peer-to-peer networks. Many…
Expand
2006
2006
Survive Under High Churn in Structured P2P Systems: Evaluation and Strategy
Zhiyu Liu
,
Ruifeng Yuan
,
Zhenhua Li
,
Hongxing Li
,
Guihai Chen
International Conference on Conceptual Structures
2006
Corpus ID: 2344149
In Peer to Peer (P2P) systems, peers can join and leave the network whenever they want. Such “freedom” causes unpredictable…
Expand
2006
2006
A formal framework for the performance analysis of P2P networks protocols
A. Spognardi
,
R. D. Pietro
Proceedings 20th IEEE International Parallel…
2006
Corpus ID: 9950557
In this paper, we propose a formal framework based on the Markov chains to prove the performance of P2P protocols. Despite the…
Expand
2004
2004
Family trees: an ordered dictionary with optimal congestion, locality, degree, and search time
K. Zatloukal
,
Nicholas J. A. Harvey
ACM-SIAM Symposium on Discrete Algorithms
2004
Corpus ID: 15717644
We consider the problem of storing an ordered dictionary data structure over a distributed set of nodes. In contrast to…
Expand
2004
2004
De ontknoping van de zilveren koorde: de geschiedenis van de rijkstraktementen in de Nederlandse Hervormde Kerk
W. Ouden
2004
Corpus ID: 160067779
De zilveren koorde is een bijbelse uitdrukking voor de financiele relatie tussen kerk en staat: pensioenen, salarissen…
Expand
2004
2004
Fault Resilience of Structured P2P Systems
Zhiyu Liu
,
Guihai Chen
,
Chunfeng Yuan
,
Sanglu Lu
,
Chengzhong Xu
WISE
2004
Corpus ID: 2821203
A fundamental problem that confronts structured peer-to-peer system that use DHT technologies to map data onto nodes is the…
Expand
2003
2003
P2P Overlay Networks of Constant Degree
Guihai Chen
,
Chengzhong Xu
,
Haiying Shen
,
Daoxu Chen
International Conference on Grid and Cooperative…
2003
Corpus ID: 15151633
This paper proposes an abstract and generic topological model that captures the essence of P2P architecture. Such model should in…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE