Please use this identifier to cite or link to this item:
|Title:||Defragmenting DHT-based distributed file systems|
|Source:||Pang, J.,Gibbons, P.B.,Kaminsky, M.,Seshan, S.,Yu, H. (2007). Defragmenting DHT-based distributed file systems. Proceedings - International Conference on Distributed Computing Systems. ScholarBank@NUS Repository. https://doi.org/10.1109/ICDCS.2007.97|
|Abstract:||Existing DHT-based file systems use consistent hashing to assign file blocks to random machines. As a result, a user task accessing an entire file or multiple files needs to retrieve blocks from many different machines. This paper demonstrates that significant availability and performance gains can be achieved if, instead, users are able to retrieve all the data needed for a given task from only a few DHT nodes. We explore the design and implications of such a "defragmented" DHT-based distributed file system, called D2, that also maintains important DHTproperties like storage load balance. We show using real-world file system traces that a simple key encoding scheme is sufficient to maintain good defragmentation for most user tasks. Using both simulation and an actual 1,000 node deployment, we show that D2 increases availability by over an order of magnitude and improves user-perceived latency by 30-100% compared to a traditional design. © 2007 IEEE.|
|Source Title:||Proceedings - International Conference on Distributed Computing Systems|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jan 16, 2018
checked on Jan 21, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.