Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Vinay Venkatesh

dblp:00/9804 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2013
0009-0000-7824-4820ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1Computer networks · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 87% Cloud and datacenter computing · 13%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Distributed systems › observability
distributed monitoring
0.212013
Resilient Self-Compressive Monitoring for Large-Scale Hosting Infrastructures · IEEE Trans. Parallel Distributed Syst. 2013
Distributed systems
fault tolerance
0.212013
Resilient Self-Compressive Monitoring for Large-Scale Hosting Infrastructures · IEEE Trans. Parallel Distributed Syst. 2013
Cloud and datacenter computing › datacenter operations
datacenter monitoring
0.012013
Resilient Self-Compressive Monitoring for Large-Scale Hosting Infrastructures · IEEE Trans. Parallel Distributed Syst. 2013

Methods — techniques the papers use, named apart from their topics

online data compression · 0.2
YearPublicationVenuePosition
2013 Resilient Self-Compressive Monitoring for Large-Scale Hosting Infrastructures
abstract
Large-scale hosting infrastructures have become the fundamental platforms for many real-world systems such as cloud computing infrastructures, enterprise data centers, and massive data processing systems. However, it is a challenging task to achieve both scalability and high precision while monitoring a large number of intranode and internode attributes (e.g., CPU usage, free memory, free disk, internode network delay). In this paper, we present the design and implementation of a Resilient self-Compressive Monitoring (RCM) system for large-scale hosting infrastructures. RCM achieves scalable distributed monitoring by performing online data compression to reduce remote data collection cost. RCM provides failure resilience to achieve robust monitoring for dynamic distributed systems where host and network failures are common. We have conducted extensive experiments using a set of real monitoring data from NCSU's virtual computing lab (VCL), PlanetLab, a Google cluster, and real Internet traffic matrices. The experimental results show that RCM can achieve up to 200 percent higher compression ratio and several orders of magnitude less overhead than the existing approaches.
Yongmin Tan, Vinay Venkatesh, Xiaohui Gu
IEEE Trans. Parallel Distributed Syst.2
2011 OLIC: OnLine Information Compression for scalable hosting infrastructure monitoring
abstract
Quality-of-service (QoS) management often requires a continuous monitoring service to provide updated information about different hosts and network links in the managed system. However, it is a challenging task to achieve both scalability and precision for monitoring various intra-node and inter-node metrics (e.g., CPU, memory, disk, network delay) in a large-scale hosting infrastructure. In this paper, we present a novel OnLine Information Compression (OLIC) system to achieve scalable fine-grained hosting infrastructure monitoring. OLIC models continuous snapshots of a hosting infrastructure as a sequence of images and performs online monitoring data compression to significantly reduce the monitoring cost. We have implemented a prototype of the OLIC system and deployed it on the PlanetLab and NCSU's virtual computing lab (VCL). We have conducted extensive experiments using a set of real monitoring data from VCL, Planetlab, and a Google cluster as well as a real Internet traffic matrix trace. The experimental results show that OLIC can achieve much higher compression ratios with several orders of magnitude less overhead than previous approaches.
Yongmin Tan, Xiaohui Gu, Vinay Venkatesh
IWQoS3