Traffic matrix estimation in non stationary environments
This presentation is the property of its rightful owner.
Sponsored Links
1 / 28

Traffic Matrix Estimation in Non-Stationary Environments PowerPoint PPT Presentation


  • 111 Views
  • Uploaded on
  • Presentation posted in: General

Traffic Matrix Estimation in Non-Stationary Environments. Presented by R. L. Cruz Department of Electrical & Computer Engineering University of California, San Diego Joint work with Antonio Nucci Nina Taft Christophe Diot NISS Affiliates Technology Day on Internet Tomography

Download Presentation

Traffic Matrix Estimation in Non-Stationary Environments

An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -

Presentation Transcript


Traffic matrix estimation in non stationary environments

Traffic Matrix Estimation in Non-Stationary Environments

Presented by

R. L. Cruz

Department of Electrical & Computer Engineering

University of California, San Diego

Joint work with

Antonio Nucci

Nina Taft

Christophe Diot

NISS Affiliates Technology Day on Internet Tomography

March 28, 2003


The traffic matrix estimation problem

The Traffic Matrix Estimation Problem

  • Formulated in Y. Vardi, “Network Tomography: Estimating Source-Destination Traffic From Link Data,” JASA, March 1995, Vol. 91, No. 433, Theory & Methods


The traffic matrix estimation problem1

The Traffic Matrix Estimation Problem

Xj

Yi

ingress

egress

Xj

PoP (Point of Presence)

Y = A X

“Traffic Matrix”

Link Measurement Vector

Routing Matrix


The traffic matrix estimation problem2

The Traffic Matrix Estimation Problem

  • Importance of Problem: capacity planning, routing protocol configuration, load balancing policies, failover strategies, etc.

  • Difficulties in Practice

    • missing data

    • synchronization of measurements (SNMP)

    • Non-Stationarity (our focus here)

      • long convergence time needed to obtain estimates


What is non stationary

What is Non-Stationary?

  • Traffic Itself is Non-Stationary


What is non stationary1

What is Non-Stationary?

  • Also, Routing is Non-Stationary

    • e.g. Due to Link Failures

    • Essence of Our Approach

      • Purposely reconfigure routing in order to help estimate traffic matrix

        • More information leads to more accurate estimates

      • Effectively increases rank of A

      • We have developed algorithms to reconfigure the routing for this purpose (beyond the scope of this talk)


Outline of remainder of talk

Outline of Remainder of Talk

  • Describe the “Stationary” Method

    • Stationary traffic, non-stationary routing

    • Stationary traffic assumption is reasonable if we always measure traffic at the same time of day (e.g. “peak period” of a work day)

  • Briefly Describe the “Non-Stationary” Method

    • Both non-stationary traffic and non-stationary routing

    • More complex but allows estimates to be obtained much faster


Network and measurement model

Network and Measurement Model

  • Network with L links, N nodes, P=N(N-1) OD pair flows

    • K measurement intervals, 1 ≤ k ≤ K

    • Y(k) is the link count vector at time k: (L x 1)

    • A(k) is the routing matrix at time k: (L x P)

    • X(k) is the O-D pair traffic vector at time k: (P x 1)

      • X(k) = (x1(k) , x2(k) , … xP(k))T

  • Y(k) = A(k) X(k)

Y(k) and A(k) can be truncated to reflect missing and redundant data


Traffic model stationary case

Traffic Model: Stationary Case

  • X(k) is the O-D pair traffic vector at time k: (P x 1)

    X(k) = (x1(k) , x2(k) , … xP(k))T

X(k) = X + W(k)

  • W(k) : “Traffic Fluctuation Vector

    • Zero mean, covariance matrix B

    • B = diag(X)


Matrix notation

Matrix Notation

Linear system of equations:

where:

[LK]

[LK][P]

[LK][KP]

[P]

[KP]

Choose Routing Configurations such that

Rank(A) = P


Traffic matrix estimation stationary case

Traffic matrix Estimation-Stationary Case

Y = AX + CW

  • Initial Estimate: Use Psuedo-Inverse of A:- does not require statistics of W (covariance B)

  • Gauss-Markov Theorem: Assume B is known

  • - Unbiased, minimum variance estimate- Coincides with Maximum Likelihood Estimate

  • if W is Gaussian


Traffic matrix estimation stationary case1

Traffic matrix Estimation-Stationary Case

Y = AX + CW

  • Minimum Estimation Error: (assumes B is known)


Traffic matrix estimation stationary case2

Traffic matrix Estimation-Stationary Case

  • Recall we assume B = cov(W) satisfiesB = diag(X)

  • Set

  • Recursion for Estimates:


Traffic matrix estimation stationary case3

Traffic matrix Estimation-Stationary Case

  • Our estimate is a solution to the equation:

  • Open questions for fixed point equation:

    • Existence of Solution?- Uniqueness?

    • Is solution an un-biased estimate?


Numerical example stationary case

N=10 nodes, L=24 links and P=90 connections.

Three set of OD pairs with mean x equal to:

500 Mbps, 2 Gbps and 4 Gbps.

Gaussian Traffic Fluctuations:

Numerical Example-Stationary case


Stationary case b 1 samples snapshot 1

Stationary case: b=1 Samples/Snapshot=1


Stationary case b 1 samples snapshot 11

Stationary case: b=1 Samples/Snapshot=1


Stationary case b 1 samples snapshot 15

Stationary case: b=1 Samples/Snapshot=15


Stationary case b 1 samples snapshot 151

Stationary case: b=1 Samples/Snapshot=15


Stationary case b 1 4 samples snapshot 1

Stationary case: b=1.4 Samples/Snapshot=1


Stationary case b 1 4 samples snapshot 11

Stationary case: b=1.4 Samples/Snapshot=1


Stationary case b 1 4 samples snapshot 15

Stationary case: b=1.4 Samples/Snapshot=15


Stationary case b 1 4 samples snapshot 151

Stationary case: b=1.4 Samples/Snapshot=15


Stationary and non stationary traffic

Stationary and Non-Stationary traffic

  • 20 snapshots / 4 samples per snapshot / 5 min per sample

  • Stationary Approach: 20 min per day (same time) / 20 days

  • Non-Stationary Approach: aggregate all the samples in

  • one window time large 400 min (7 hours)


Traffic model non stationary case

Traffic Model: Non-Stationary Case

  • Each OD pair is cyclo-stationary:

  • Each OD pair is modeled as:

  • Fourier series expansion:


Mean estimation results non stationary case

Mean estimation Results-Non Stationary case

  • Three set of OD pairs

  • where are linear independent Gaussian variables with:


Non stationary case b 1 link count

Non Stationary case: b=1 Link Count


Non stationary case b 1 mean estimation

Non Stationary case: b=1 Mean estimation


  • Login