scispace - formally typeset
Open Access

A Scalable Method for Estimating Network Traffic Matrices from Link Counts

TLDR
A scalable algorithm for statistically estimating a traffic matrix from the readily available link counts that relies on a divide-andconquer strategy to lower the computational cost without losing estimation accuracy.
Abstract
Traffic matrices are extremely useful for network configuration, management, engineering, and pricing Direct measurement is, however, expensive in general and impossible in some cases This paper proposes a scalable algorithm for statistically estimating a traffic matrix from the readily available link counts It relies on a divide-andconquer strategy to lower the computational cost without losing estimation accuracy The proposed algorithm is tested on a real network with 18 nodes The estimates are comparable to the direct estimates but require dramatically less computation Keywords—divide-and-conquer, MLE, link counts, scalability, statistical estimation, traffic matrix

read more

Citations
More filters
Journal ArticleDOI

Estimating point-to-point and point-to-multipoint traffic matrices: an information-theoretic approach

TL;DR: This paper presents a new approach to traffic matrix estimation using a regularization based on "entropy penalization", and chooses the traffic matrix consistent with the measured data that is information-theoretically closest to a model in which source/destination pairs are stochastically independent.
Proceedings ArticleDOI

Network Tomography: Identifiability and Fourier Domain Estimation

TL;DR: A unifying theory on the identifiability of the distribution of X is developed and a novel mixture model for link delays is proposed and a fast algorithm for estimation based on the General Method of Moments is developed.
Proceedings ArticleDOI

Stochastic traffic engineering for demand uncertainty and risk-aware network revenue management

TL;DR: The carrier's tolerance to risk is shown to have a strong influence on traffic engineering and revenue management decisions and the entire set of Pareto optimal pairs of mean revenue and revenue risk is developed to aid the carrier in selecting an appropriate operating point.
Journal ArticleDOI

Estimating Latent Processes on a Network From Indirect Measurements

TL;DR: In this article, the problem of estimating point-to-point traffic volumes from aggregate traffic volumes is formulated as finding the solutions to a sequence of ill-posed linear inverse problems, where the number of origin-destination routes of interest is higher than the aggregate measurements available.
Posted Content

Estimating latent processes on a network from indirect measurements

TL;DR: A novel multilevel state-space model (SSM) of aggregate traffic volumes with realistic features is introduced and a more efficient two-stage inference strategy that relies on model-based regularization is developed that outperforms existing approaches and scales to larger networks.
References
More filters
Journal ArticleDOI

Network Tomography: Estimating Source-Destination Traffic Intensities from Link Data

TL;DR: In this article, the problem of estimating the node-to-node traffic intensity from repeated measurements of traffic on the links of a network is formulated and discussed under Poisson assumptions and two types of traffic-routing regimens: deterministic (a fixed known path between each directed pair of nodes) and Markovian (a random path between a pair of vertices, determined according to a known Markov chain fixed for that pair).
Journal ArticleDOI

Deriving traffic demands for operational IP networks: methodology and experience

TL;DR: This paper presents a model of traffic demands to support traffic engineering and performance debugging of large Internet Service Provider networks, and shows how to infer interdomain traffic demands using measurements collected at a smaller number of edge links-the peering links connecting the neighboring providers.
Journal ArticleDOI

Multicast-based inference of network-internal loss characteristics

TL;DR: In this paper, the authors introduce the use of end-to-end measurements of multicast traffic to infer network-internal characteristics and develop a maximum-likelihood estimator for loss rates on internal links based on losses observed by multicast receivers.
Journal ArticleDOI

Contingency tables with given marginals

TL;DR: It is shown that the estimates are BAN, and that the iterative procedure is convergent, for a four-way contingency table for which the marginal probabilities pi and p j are known and fixed.
Journal ArticleDOI

Time-Varying Network Tomography: Router Link Data

TL;DR: This work studies the inference of OD byte counts from link byte counts measured at router interfaces under a fixed routing scheme and deals with the time-varying nature of the counts by fitting the basic iid model locally using a moving data window.
Related Papers (5)