Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Conferences, Workshops, Symposiums, and Seminars
  4. Active measurement for multiple link failure diganosis in IP networks
 
conference paper

Active measurement for multiple link failure diganosis in IP networks

Nguyen, Hung Xuan  
•
Thiran, Patrick  
2004
Passive and active measurment workshop
Passive and active measurment workshop

Simultaneous link failures are common in IP networks \cite{Markopoulou04}. In this paper, we develop a technique for locating multiple failures in Service Provider or Enterprise IP networks using active measurement. We propose a two-phased approach that minimizes both the additional traffic due to probe messages and the measurement infrastructure costs. In the first phase, using elements from max-plus algebra theory, we show that the optimal set of probes can be determined in polynomial time, and we provide an algorithm to find this optimal set of probes. In the second phase, given the optimal set of probes, we compute the location of a minimal set of measurement points (beacons) that can generate these probes. We show that the beacon placement problem is NP-hard and propose a constant factor approximation algorithm for this problem. We then apply our algorithms to existing ISP networks using topologies inferred by the Rocketfuel tool \cite{Spring02:1}. We study in particular the difference between the number of probes and beacons that are required for multiple and single failure(s) diagnosis.

  • Files
  • Details
  • Metrics
Loading...
Thumbnail Image
Name

NguyenT04.pdf

Access type

openaccess

Size

164.65 KB

Format

Adobe PDF

Checksum (MD5)

9c8bb221532741dda1e1113bb67546dd

Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés