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

Harsh Singhal

dblp:33/302 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 2011
—ORCID · none

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

Systems, architecture and hardware · 1 · 1 first-authorSoftware engineering, systems software and programming languages · 1 · 1 first-authorHuman-computer interaction and ubiquitous computing · 1Theory of computation · 1 · 1 first-author

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 networks
2 papers
Network measurement and analytics · 73% Network management and operations · 21% Physical-layer communications · 6%

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

TopicWeightPapersLastEvidence papers
Network measurement and analytics
network tomography
0.112011
Structural Models for Dual Modality Data With Application to Network Tomography · IEEE Trans. Inf. Theory 2011
Network management and operations
network monitoring
0.112008
Optimal sampling in state space models with applications to network monitoring · SIGMETRICS 2008
Network measurement and analytics
sampling
0.112008
Optimal sampling in state space models with applications to network monitoring · SIGMETRICS 2008
Network measurement and analytics
traffic estimation
0.112008
Optimal sampling in state space models with applications to network monitoring · SIGMETRICS 2008
Physical-layer communications
state-space model
0.012008
Optimal sampling in state space models with applications to network monitoring · SIGMETRICS 2008

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

linear inverse problem · 0.1identifiability analysis · 0.1generative model · 0.1state-space model · 0.1experiment design · 0.1convex optimization · 0.1
YearPublicationVenuePosition
2011 Structural Models for Dual Modality Data With Application to Network Tomography
abstract
We propose models for the joint distribution of two modalities for network flow volumes. While these models are motivated by computer network applications, the underlying structural assumptions are more generally applicable. In the case of computer network flow volumes, this corresponds to joint modeling for packet and byte volumes and enables computer network tomography, whose goal is to estimate characteristics of source-destination flows based on aggregate link measurements. Network tomography is a prototypical example of a linear inverse problem on graphs. We introduce two generative models for the relation between packet and byte volumes, establish identifiability of their parameters, and discuss different estimating procedures. The proposed estimators of the flow characteristics are evaluated using both simulated and emulated data. Finally, the proposed models allow us to estimate parameters of the packet size distribution, thus providing additional insights into the composition of network traffic.
Harsh Singhal, George Michailidis
IEEE Trans. Inf. Theory1
2010 Master Defect Record Retrieval Using Network-Based Feature Association
abstract
As electronic records (e.g., medical records and technical defect records) accumulate, the retrieval of a record from a past instance with the same or similar circumstances, has become extremely valuable. This is because a past record may contain the correct diagnosis or correct solution to the current circumstance. We refer to the two records of the same or similar circumstances asmasterandduplicaterecords. Current record retrieval techniques are lacking when applied to this special master defect record retrieval problem. In this study, we propose a new paradigm for master defect record retrieval using network-based feature association (NBFA). We train the master record retrieval process by constructing feature associations to limit the search space. The retrieval paradigm was employed and tested on a real-world large-scale defect record database from a telecommunications company. The empirical results suggest that the NBFA was able to significantly improve the performance of master record retrieval, and should be implemented in practice. This paper presents an overview of technical aspects of the master defect record retrieval problem, describes general methodologies for retrieval of master defect records, proposes a new feature association paradigm, provides performance assessments on real data from a telecommunications company, and highlights difficulties and challenges in this line of research that should be addressed in the future.
Andrew Rodriguez, W. Art Chaovalitwongse, Zhe Liang, Harsh Singhal
IEEE Trans. Syst. Man Cybern. Part C4
2008 Optimal sampling in state space models with applications to network monitoring
abstract
Advances in networking technology have enabled network engineers to use sampled data from routers to estimate network flow volumes and track them over time. However, low sampling rates result in large noise in traffic volume estimates. We propose to combine data on individual flows obtained from sampling with highly aggregate data obtained from SNMP measurements (similar to those used in network tomography) for the tracking problem at hand. Specifically, we introduce a linearized state space model for the estimation of network traffic flow volumes from combined SNMP and sampled data. Further, we formulate the problem of obtaining optimal sampling rates under router resource constraints as an experiment design problem. Theoretically it corresponds to the problem of optimal design for estimation of conditional means for state space models and we present the associated convex programs for a simple approach to it. The usefulness of the approach in the context of network monitoring is illustrated through an extensive numerical study.
Harsh Singhal, George Michailidis
SIGMETRICS1