Towards a Kademlia DHT-based n-tuple store
Pages 23 - 27
Abstract
In this paper, we describe our work towards a novel n-tuple store based on the Kademlia DHT that supports multidimensional storage and multi_get(pattern) query operation. We present our algorithm behind multi_get along with preliminary results on its performance.
References
[1]
The official website of Apache Cassandra project http://cassandra.apache.org/, viewed May. 2011.
[2]
The official website of Basho Riak Project. http://wiki.basho.com//, viewed May. 2011.
[3]
Ahmed, R., and Boutaba, R. Plexus: A scalable Peer-to-Peer protocol enabling efficient subset search. IEEE/ACM Transactions on Networking (TON) 17, 1 (2009), 130--143.
[4]
Ahmed, R., and Boutaba, R. Distributed Search and Pattern Matching. Handbook of Peer-to-Peer Networking (2010), 427--461.
[5]
Baumgart, I., Heep, B., and Krause, S. OverSim: A flexible overlay network simulation framework. In Proc. of IEEE Global Internet Symposium, 2007 (2007), IEEE, pp. 79--84.
[6]
Cai, M., and Frank, M. RDFPeers: a scalable distributed RDF repository based on a structured peer-to-peer network. In Proc. of the 13th int. conf. on World Wide Web (2004), p. 657.
[7]
Cai, M., Frank, M., Chen, J., and Szekely, P. MAAN: a multi-attribute addressable network for grid information services. Journal of Grid Computing 2, 1 (2004), 3--14.
[8]
DeCandia, G., Hastorun, D., et al. Dynamo: amazon's highly available key-value store. ACM SIGOPS Operating Systems Review 41, 6 (2007), 220.
[9]
Harren, M., Hellerstein, J., Huebsch, R., Loo, B., Shenker, S., and Stoica, I. Complex queries in DHT-based peer-to-peer networks. Peer-to-Peer Systems (2002), 242--250.
[10]
Maymounkov, P., and Mazieres, D. Kademlia: A peer-to-peer information system based on the xor metric. In Proc. of IPTPS02, Cambridge, USA (2002), vol. 1, pp. 2--2.
[11]
Ott, M., and Shvartzshnaider, Y. A Case for a Global Information Network. ArXiv e-prints (Apr. 2011).
[12]
Pujol-Ahullo, J., Garcia-Lopez, P., and Gomez-Skarmeta, A. F. Towards a lightweight content-based publish/subscribe services for peer-to-peer systems. Int. Journal of Grid and Utility Computing 1, 3 (2009), 239--251.
[13]
Ratnasamy, S., Francis, P., et al. A Scalable Content-Addressable Network. In Proc. the 2001 conf. on Applications, technologies, architectures, and protocols for computer communications (2001), ACM, pp. 161--172.
[14]
Rowstron, A., and Druschel, P. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In Proc. of IFIP/ACM int. conf. on Distributed Systems Platforms (Middleware) (2001), vol. 11, pp. 329--350.
[15]
Sagan, H., and Holbrook, J. Space-filling curves, vol. 2. Springer-Verlag New York, 1994.
[16]
Schmidt, C., and Parashar, M. Squid: Enabling search in DHT-based systems. Journal of Parallel and Distributed Computing 68, 7 (2008), 962--975.
[17]
Stoica, I., et al. Chord: a scalable peer-to-peer lookup protocol for internet applications. IEEE/ACM Transactions on Networking (TON) 11, 1 (2003), 32.
[18]
Vastag, B. Exabytes: Documenting the 'digital age' and huge growth in computing capacity. Washington Post (2010).
Index Terms
- Towards a Kademlia DHT-based n-tuple store
Recommendations
Towards a fully distributed n-tuple store
SIGCOMM '11We present our work towards building a novel distributed n-tuple store by extending the Kademlia DHT [1] algorithm to support n dimensional keys as well as an multi get operator, where some of the dimensions of the "query" key can be left unspecified.
Performance evaluation of a Kademlia-based communication-oriented P2P system under churn
The phenomenon of churn has a significant effect on the performance of Peer-to-Peer (P2P) networks, especially in mobile environments that are characterized by intermittent connections and unguaranteed network bandwidths. A number of proposals have been ...
Improving Lookup Performance Based on Kademlia
NSWCTC '10: Proceedings of the 2010 Second International Conference on Networks Security, Wireless Communications and Trusted Computing - Volume 01According to the P2P network based on Distributed Hash Table (DHT), Flooding will be combined with the DHT system, the physical proximity of nodes in the network will be used to reduce the latency and optimize routing before the formation of the logical ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
September 2011
33 pages
Copyright © 2011 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 19 September 2011
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
TADDS '11
TADDS '11: Workshop on Theoretical Aspects on Dynamic Distributed Systems
September 19, 2011
Rome, Italy
Acceptance Rates
Overall Acceptance Rate 5 of 8 submissions, 63%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 153Total Downloads
- Downloads (Last 12 months)1
- Downloads (Last 6 weeks)0
Reflects downloads up to 30 Nov 2024
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in