Design and implementation trade-offs for wide-area resource discovery
ACM Transactions on Internet Technology (TOIT)
Wide-scale data stream management
ATC'08 USENIX 2008 Annual Technical Conference on Annual Technical Conference
Proceedings of the 15th ACM conference on Computer and communications security
Zero-Day Reconciliation of BitTorrent Users with Their ISPs
Euro-Par '09 Proceedings of the 15th International Euro-Par Conference on Parallel Processing
Rhizoma: a runtime for self-deploying, self-managing overlays
Proceedings of the 10th ACM/IFIP/USENIX International Conference on Middleware
Rhizoma: a runtime for self-deploying, self-managing overlays
Middleware'09 Proceedings of the ACM/IFIP/USENIX 10th international conference on Middleware
Scalable service migration in autonomic network environments
IEEE Journal on Selected Areas in Communications
Evaluation of QoS-compliant overlays under denial of service attacks
SpringSim '10 Proceedings of the 2010 Spring Simulation Multiconference
The flexlab approach to realistic evaluation of networked systems
NSDI'07 Proceedings of the 4th USENIX conference on Networked systems design & implementation
Utility driven elastic services
Proceedings of the 11th IFIP WG 6.1 international conference on Distributed applications and interoperable systems
Journal of Parallel and Distributed Computing
Understanding and characterizing PlanetLab resource usage for federated network testbeds
Proceedings of the 2011 ACM SIGCOMM conference on Internet measurement conference
Dynamic service placement in shared service hosting infrastructures
NETWORKING'10 Proceedings of the 9th IFIP TC 6 international conference on Networking
NetDEO: automating network design, evolution, and optimization
Proceedings of the 2012 IEEE 20th International Workshop on Quality of Service
Hi-index | 0.00 |
Emerging federated computing environments offer attractive platforms to test and deploy global-scale distributed applications. When nodes in these platforms are timeshared among competing applications, available resources vary across nodes and over time. Thus, one open architectural question in such systems is how to map applications to available nodes--that is, how to discover and select resources. Using a six-month trace of PlanetLab resource utilization data and of resource demands from three long-running PlanetLab services, we quantitatively characterize resource availability and application usage behavior across nodes and over time, and investigate the potential to mitigate the application impact of resource variability through intelligent service placement and migration. We find that usage of CPU and network resources is heavy and highly variable. We argue that this variability calls for intelligently mapping applications to available nodes. Further, we find that node placement decisions can become ill-suited after about 30 minutes, suggesting that some applications can benefit from migration at that timescale, and that placement and migration decisions can be safely based on data collected at roughly that timescale. We find that inter-node latency is stable and is a good predictor of available bandwidth; this observation argues for collecting latency data at relatively coarse timescales and bandwidth data at even coarser timescales, using the former to predict the latter between measurements. Finally, we find that although the utilization of a particular resource on a particular node is a good predictor of that node's utilization of that resource in the near future, there do not exist correlations to support predicting one resource's availability based on availability of other resources on the same node at the same time, on availability of the same resource on other nodes at the same site, or on time-series forecasts that assume a daily or weekly regression to the mean.