1 / 21

Maximum Likelihood Network Topology Identification

This paper explores inferring network topology based on external measurements in network tomography. It presents a unique approach using sole host-based unicast measurements that measure correlation between receivers. The study introduces the Sandwich Probing novelty and stochastic search methods for topology identification, along with likelihood formulation, Maximum Likelihood Tree, and a Bayesian approach to learning optimal trees. The research also includes simulation results and practical implications for network tomography.

avernon
Download Presentation

Maximum Likelihood Network Topology Identification

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. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Maximum Likelihood Network Topology Identification Mark Coates McGill University Robert Nowak Rui Castro Rice University DYNAMICS May 5th,2003

  2. Network Tomography • Inferring network topology based on “external” end-to-end measurements. • Traceroute requires cooperation of routers:May not be met in practice • This paper assumes no internal network cooperation • Solely host-based unicast measurements

  3. How does it work? The Problem Statement Unique Sender R

  4. How does it work? Information we have • End-to-end measurements that measure the degree of correlation between receivers • Associate metric i,j with pair of receivers i,j  R Monotonicity property: pi,pj,pk : Paths from sender to i,j,k If pi shares more links with pj than with pk, then i,j > i,k

  5. An example Here 18,19 > i,19for all other i Examples ? Simple Bottom-up merging algorithms can be used to identify full, logical topology

  6. Two-fold Contribution • Novel measurement scheme: • Sandwich Probing • Each probe: three packets • Main Idea: Small packets queues behind the large, inducing extra seperation between small packets on shared links • A stochastic search method for topology identification

  7. Sandwich Probing p2 p1 no cross-traffic: 01: queuing delay of p2 on link 01, 35= 01 ij: sum of ’s on the shared links to receiver i and j

  8. Sandwich Probing 34= 01+12 35= 01 more shared queues  larger g

  9. Advantages over loss and delay based metrics • Probe loss is rare on Internet. Large number of measurements required • For measuring delay, clock sync required • Each measurement contributes here.

  10. Multiple measurements CLT Measurement framework Measurement of ij contaminated by cross traffic Cross traffic: zero-mean effect on

  11. Likelihood Formulation • Estimated metrics are randomly distributed according to density p • p parameterized by underlying topology T and set of true metric values • When is viewed as function of T and , it is called the likelihood of T and .

  12. Likelihood Formulation • Maximum Likelihood Tree is given by: F denotes forest of all possible trees G denotes set of all metrics satisfying monotonicity property Maximization involved is formidable Brute Force method: for N = 10, more than 1.8 x 106 trees

  13. Simplifying the problem • Parameters  are chosen to maximize the value for a given tree T • To provide the very best fit T can provide to Data • Log likelihood of T Maximum Likelihood Tree is the one in the forest that has the largest likelihood value

  14. Stochastic Search • Reversible Markov Chain Monte Carlo Method • Using above techniques, authors devise a rapid search method to find optimal trees. • “Learning using Bayesian Statistics” • Prior and Posterior distributions Main Idea: Posterior Distribution gives the region of high likelihood trees in F

  15. Birth Move (insert node) T T 1 2

  16. T T 2 1 Death Move (delete node)

  17. ns-2 Simulations source 9 8 1 7 6 5 2 3 4

  18. Simulation results % Correct 100 MPLT 80 60 DBT 40 20 4000 6000 8000 Number of Probes

  19. MCMC Algorithm true topology MCMC topology Can Layer 2 branching points High speed connections can fool tomography

  20. Summary • Delay-based measurement, no need for clock synchronization • MCMC algorithm to explore forest and identify maximum (penalized) likelihood tree

More Related