Network Kriging

  title={Network Kriging},
  author={David B. Chua and Eric D. Kolaczyk and Mark Crovella},
  journal={IEEE Journal on Selected Areas in Communications},
Network service providers and customers are often concerned with aggregate performance measures that span multiple network paths. Unfortunately, forming such network-wide measures can be difficult, due to the issues of scale involved. In particular, the number of paths grows too rapidly with the number of endpoints to make exhaustive measurement practical. As a result, it is of interest to explore the feasibility of methods that dramatically reduce the number of paths measured in such… 

Figures from this paper

Network-Wide Statistical Modeling, Prediction, and Monitoring of Computer Traffic

This article explores the problem of using observed traffic measurements on selected links to predict the traffic on other, unobserved links, and introduces an adjusted control chart methodology that shows possible applications of the prediction results in situations where all links may be observed.

Efficient Approximation Algorithms for Optimal Large-scale Network Monitoring

A number of approximation algorithms are presented that are amenable for randomized implementation and execution in parallel or distributed fashion, a process that often yields the exact solution in a well know NP-hard problem.

Fast Algorithms for Optimal Link Selection in Large-Scale Network Monitoring

A number of fast algorithms are developed that improve upon existing algorithms in terms of computational complexity and accuracy and exploit the geometry of principal component analysis, which also leads to new types of theoretical bounds on the prediction error.

Network-wide Statistical Modeling and Prediction of Computer Traffic

It is demonstrated how an expensively obtained set of measurements may be used to develop a network-specific model of the traffic across the network, which may then be used in conjunction with easily obtainable measurements to provide more accurate prediction than is possible with only the inexpensive measurements.

Sampling biases in network path measurements and what to do about it

The Broom toolkit is presented that has three methods to correct for sampling biases in network path measurements and reduces bias for a wide range of path properties, such as latency, hop count and capacity.

Rating Network Paths for Locality-Aware Overlay Construction and Routing

It is shown that such coarse-grained knowledge can improve the performance of peer selection and that finer granularities do not always lead to larger improvements.

Problems in Spatio-Temporal Modelling, Kriging, and Prediction of Computer Network Traffic

This work explores a statistical framework for simultaneously modeling the traffic levels on links across an entire network and using the model to solve a variety of statistical problems, including prediction of traffic on unobserved links and the detection of statistical anomalies.

First Elephants then Mice: A Two-stage Robust Estimation Technique for Traffic Matrix in Large Cloud Networks in Presence of Over Dispersion

This work forms a two step optimization approach in which elephant flows which are more closer to Gaussian approximation are estimate in first step with reasonable accuracy with more estimation error for over-dispersed mice flows, and refined through a second bounded-value optimization step by adding an additional constraint.

Data-Driven Network Analysis and Applications

This thesis studies three specific problems on missing data interpolation in computer networking, and proposes two new algorithms, namely HyperPath and Valley-free HyperPath, which can significantly reduce inter-AS traffic for P2P applications with an improved AS path prediction accuracy.

Network tomography using genetic algorithms

The feasibility on using genetic algorithms for the network tomography problem is investigated and it is found that biologically inspired genetic approaches to solving such optimization problems offers much flexibility in finding an optimal solution.



Efficient monitoring of end-to-end network properties

A general framework for the prediction problem of end-to-end network properties may be accurately predicted in many cases using a significantly smaller set of carefully chosen paths than needed for exact recovery, and it is shown that linear algebraic methods of subset selection may be used to make effective choice of which paths to measure.

Computing the unmeasured: an algebraic approach to Internet mapping

This work presents a novel algorithm, based on algebraic tools, that computes additional distances, which are not explicitly measured, and shows that the algorithm computes up to 50%-200% additional distances beyond the basic tracer-to-tracer measurements.

Finding and evaluating community structure in networks.

  • M. NewmanM. Girvan
  • Computer Science
    Physical review. E, Statistical, nonlinear, and soft matter physics
  • 2004
It is demonstrated that the algorithms proposed are highly effective at discovering community structure in both computer-generated and real-world network data, and can be used to shed light on the sometimes dauntingly complex structure of networked systems.

An algebraic approach to practical and scalable overlay network monitoring

Simulation and Internet experiments demonstrate that highly accurate path loss rate estimation is obtained while adapting to topology changes within seconds and handling topology errors.

Clustering Large Graphs via the Singular Value Decomposition

This paper considers the problem of partitioning a set of m points in the n-dimensional Euclidean space into k clusters, and considers a continuous relaxation of this discrete problem: find the k-dimensional subspace V that minimizes the sum of squared distances to V of the m points, and argues that the relaxation provides a generalized clustering which is useful in its own right.

Active Measurement for Multiple Link Failures Diagnosis in IP Networks

This paper develops a technique for locating multiple failures in Service Provider or Enterprise IP networks using active measurement with a two-phased approach that minimizes both the additional traffic due to probe messages and the measurement infrastructure costs.

Measuring ISP topologies with Rocketfuel

New Internet mapping techniques that have enabled us to measure router-level ISP topologies are presented, finding that these maps are substantially more complete than those of earlier Internet mapping efforts.

Betweenness centrality in large complex networks

The betweenness centrality of nodes in large complex networks is analyzed and it is found that for trees or networks with a small loop density, a larger density of loops leads to $\eta < 2$.

Social Network Analysis: Methods and Applications

This paper presents mathematical representation of social networks in the social and behavioral sciences through the lens of dyadic and triadic interaction models, which provide insights into the structure and dynamics of relationships between actors and groups.

Geršgorin And His Circles

This book studies the original results, and their extensions, of the Russian mathematician, S.A. Gersgorin, who wrote a seminal paper in 1931, on how to easily obtain estimates of all n eigenvalues