Name
Abstract | ||
|---|---|---|
We consider the problem of migrating user data between data centers. We introduce distributed storage overlays, a simple abstraction that represents data as stacked layers in different places. Overlays can be readily used to cache data objects, migrate these caches, and migrate the home of data objects.We implement overlays as part of a key-value object store called Nomad, designed to span many data centers. Using Nomad, we compare overlays against commonmigration approaches and show that overlays are more flexible and impose less overhead. To drive migration decisions, we propose policies for predicting the location of future accesses, focusing on a web mail application.We evaluate themigration policies using real traces of user activity from Hotmail. |
Year | Venue | Keywords |
|---|---|---|
2011 | USENIX Annual Technical Conference | migrating user data,key-value object store,real trace,different place,commonmigration approach,data center,future access,migration decision,data object,user activity,online migration,geo-distributed storage system |
Field | DocType | Citations |
Abstraction,Computer science,Cache,Distributed data store,Data objects,Overlay,Distributed computing | Conference | 13 |
PageRank | References | Authors |
0.60 | 23 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Nguyen Tran | 1 | 14 | 6.37 |
| Marcos Kawazoe Aguilera | 2 | 2519 | 153.60 |
| Mahesh Balakrishnan | 3 | 1132 | 57.92 |