Adding Capacity-Aware Storage Indirection to Homogeneous Distributed Hash Tables
P. Wette, K. Graffi, in: Proceedings of the Conference on Networked Systems (NetSys), 2013, pp. 35–42.
Download
559-Adding.Capacity.Aware.Storage.Indirection.to.Homogeneous.Distributed.Hash.Tables.pdf
734.62 KB
Conference Paper
| English
Author
Wette, Philip;
Graffi, Kalman
Department
Abstract
Distributed hash tables are very versatile to use, as distributed storage is a desirable feature for various applications. Typical structured overlays like Chord, Pastry or Kademlia consider only homogeneous nodes with equal capacities, which does not resemble reality. In a practical use case, nodes might get overloaded by storing popular data. In this paper, we present a general approach to enable capacity awareness and load-balancing capability of homogeneous structured overlays. We introduce a hierarchical second structured overlay aside, which allows efficient capacity-based access on the nodes in the system as hosting mirrors. Simulation results show that the structured overlay is able to store various contents, such as of a social network, with only a negligible number of overloaded peers. Content, even if very popular, is hosted by easily findable capable peers. Thus, long-existing and well-evaluated overlays like Chord or Pastry can be used to create attractive DHT-based applications.
Publishing Year
Proceedings Title
Proceedings of the Conference on Networked Systems (NetSys)
Page
35-42
LibreCat-ID
Cite this
Wette P, Graffi K. Adding Capacity-Aware Storage Indirection to Homogeneous Distributed Hash Tables. In: Proceedings of the Conference on Networked Systems (NetSys). ; 2013:35-42. doi:10.1109/NetSys.2013.9
Wette, P., & Graffi, K. (2013). Adding Capacity-Aware Storage Indirection to Homogeneous Distributed Hash Tables. In Proceedings of the Conference on Networked Systems (NetSys) (pp. 35–42). https://doi.org/10.1109/NetSys.2013.9
@inproceedings{Wette_Graffi_2013, title={Adding Capacity-Aware Storage Indirection to Homogeneous Distributed Hash Tables}, DOI={10.1109/NetSys.2013.9}, booktitle={Proceedings of the Conference on Networked Systems (NetSys)}, author={Wette, Philip and Graffi, Kalman}, year={2013}, pages={35–42} }
Wette, Philip, and Kalman Graffi. “Adding Capacity-Aware Storage Indirection to Homogeneous Distributed Hash Tables.” In Proceedings of the Conference on Networked Systems (NetSys), 35–42, 2013. https://doi.org/10.1109/NetSys.2013.9.
P. Wette and K. Graffi, “Adding Capacity-Aware Storage Indirection to Homogeneous Distributed Hash Tables,” in Proceedings of the Conference on Networked Systems (NetSys), 2013, pp. 35–42.
Wette, Philip, and Kalman Graffi. “Adding Capacity-Aware Storage Indirection to Homogeneous Distributed Hash Tables.” Proceedings of the Conference on Networked Systems (NetSys), 2013, pp. 35–42, doi:10.1109/NetSys.2013.9.
Main File(s)
File Name
559-Adding.Capacity.Aware.Storage.Indirection.to.Homogeneous.Distributed.Hash.Tables.pdf
734.62 KB
Access Level
Closed Access
Last Uploaded
2018-03-15T10:27:21Z
Google Scholar