Vivaldi: a decentralized network coordinate system
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Meridian: a lightweight network location service without virtual coordinates
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Fast maximum margin matrix factorization for collaborative prediction
ICML '05 Proceedings of the 22nd international conference on Machine learning
Estimating network proximity and latency
ACM SIGCOMM Computer Communication Review
Compressed network monitoring for ip and all-optical networks
Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
iPlane: an information plane for distributed services
OSDI '06 Proceedings of the 7th symposium on Operating systems design and implementation
Algebra-based scalable overlay network monitoring: algorithms, evaluation, and applications
IEEE/ACM Transactions on Networking (TON)
ECHOS: edge capacity hosting overlays of nano data centers
ACM SIGCOMM Computer Communication Review
Improving maximum margin matrix factorization
Machine Learning
Relative Network Positioning via CDN Redirections
ICDCS '08 Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems
Queen: Estimating Packet Loss Rate between Arbitrary Internet Hosts
PAM '09 Proceedings of the 10th International Conference on Passive and Active Network Measurement
On the treeness of internet latency and bandwidth
Proceedings of the eleventh international joint conference on Measurement and modeling of computer systems
iPlane Nano: path prediction for peer-to-peer applications
NSDI'09 Proceedings of the 6th USENIX symposium on Networked systems design and implementation
Matchmaking for online games and other latency-sensitive P2P systems
Proceedings of the ACM SIGCOMM 2009 conference on Data communication
Approximate Distributed K-Means Clustering over a Peer-to-Peer Network
IEEE Transactions on Knowledge and Data Engineering
A measurement study of internet delay asymmetry
PAM'08 Proceedings of the 9th international conference on Passive and active network measurement
On the impact of routing matrix inconsistencies on statistical path monitoring in overlay networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Predicting available bandwidth of internet path with ultra metric space-based approaches
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Collaborative measurements of upload speeds in P2P systems
INFOCOM'10 Proceedings of the 29th conference on Information communications
Hybrid Computing-Where HPC meets grid and Cloud Computing
Future Generation Computer Systems
NetICE9: A stable landmark-less network positioning system
LCN '10 Proceedings of the 2010 IEEE 35th Conference on Local Computer Networks
Using the last-mile model as a distributed scheme for available bandwidth prediction
Euro-Par'11 Proceedings of the 17th international conference on Parallel processing - Volume Part I
SOLARE: Self-Organizing Latency-Aware Resource Ensemble
HPCC '11 Proceedings of the 2011 IEEE International Conference on High Performance Computing and Communications
Use of Internet Embedding Tools for Heterogeneous Resources Aggregation
IPDPSW '11 Proceedings of the 2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and PhD Forum
Decentralized Topology Aggregation for QoS Estimation in Large Overlay Networks
NCA '11 Proceedings of the 2011 IEEE 10th International Symposium on Network Computing and Applications
Decentralized prediction of end-to-end network performance classes
Proceedings of the Seventh COnference on emerging Networking EXperiments and Technologies
Measuring bandwidth between planetlab nodes
PAM'05 Proceedings of the 6th international conference on Passive and Active Network Measurement
The Aneka platform and QoS-driven resource provisioning for elastic applications on hybrid Clouds
Future Generation Computer Systems
Network distance prediction based on decentralized matrix factorization
NETWORKING'10 Proceedings of the 9th IFIP TC 6 international conference on Networking
IEEE Transactions on Computers
Deadline-driven provisioning of resources for scientific applications in hybrid clouds with Aneka
Future Generation Computer Systems
Survey of clustering algorithms
IEEE Transactions on Neural Networks
Hi-index | 0.00 |
Hybrid cloud computing combines private clouds with geographically-distributed resources from public clouds, desktop grids or in-house gateways to provide the most flexibility of each kind of cloud platforms. Service provisioning for wide-area applications such as cloud backup or cloud network games is sensitive to wide-area network metrics such as round trip time, bandwidth, or loss rates. In order to optimize the quality of the service provision in hybrid clouds, it is highly valuable for the hybrid clouds to collect detailed network metrics between participating nodes of the hybrid clouds. However, since nodes can be large-scale and dynamic, the network metrics may be diverse for different cloud services, it is challenging to increase the generality, scalability, accuracy, and the robustness of the measurement process. We propose a novel distributed level monitoring method HPM (Hierarchical Performance Measurement) satisfying these requirements. For each kind of network metric, HPM represents the degree of pairwise closeness with discrete level values inspired by the hierarchical clustering tree. HPM maps probed metric to discrete levels based on an existing distributed K-means clustering method that helps maximize the similarity of the network metric in the same level, which therefore optimizes the matching between pairwise levels and the real-world pairwise proximity. Furthermore, for scalability reasons, HPM computes the pairwise levels with decentralized coordinates. Each node independently maintains its low-dimensional coordinate based on a novel decentralized implementation of the Maximum Margin Matrix Factorization method, which optimizes the mapping between the network metrics and the level values. Simulation results for the round trip time, bandwidth, loss, and hop count metric confirm that HPM converges fast, is robust to parameter settings, scales well with increasing levels or system size, and adapts well to diverse metrics. A prototype deployment on the PlanetLab platform shows that HPM not only converges fast, but also incurs modest bandwidth costs. Finally, applying HPM to optimize the service provision of hybrid clouds shows that HPM can achieve close to optimal solutions.