• Home
  • Search
  • Practical Approach to Identifying Additive Link Metrics with Shortest Path Routing
  • Open Access IconOpen Access
  • Cite Icon1
  • https://doi.org/10.1109/glocom.2015.7417104Copy DOI Icon

Practical Approach to Identifying Additive Link Metrics with Shortest Path Routing

  • Dec 1, 2015
  • Xiong Wang +4 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

We revisit the problem of identifying link metrics from end- to-end path measurements in practical IP networks where shortest path routing is the norm. Previous solutions rely on explicit routing techniques (e.g., source routing or MPLS) to construct independent measurement paths for efficient link metric identification. However, most IP networks still adopt shortest path routing paradigm, while the explicit routing is not supported by most of the routers. Thus, this paper studies the link metric identification problem under shortest path routing constraints. To uniquely identify the link metrics, we need to place sufficient number of monitors into the network such that there exist $m$ (the number of links) linear independent shortest paths between the monitors. In this paper, we first formulate the problem as a mixed integer linear programming problem, and then to make the problem tractable in large networks, we propose a Monitor Placement and Measurement Path Selection (MP-MPS) algorithm that adheres to shortest path routing constraints. Extensive simulations on random and real networks show that the MP- MPS gets near-optimal solutions in small networks, and MP- MPS significantly outperforms a baseline solution in large networks.

Similar Papers
  • Research Article
  • Citations11

Parsimonious Tomography

  • Mar 20, 2018
  • ACM SIGMETRICS Performance Evaluation Review
  • Diman Zad Tootaghaj +2
  • Research Article
  • Citations71

Inferring Link Metrics From End-To-End Path Measurements: Identifiability and Monitor Placement

  • Aug 01, 2014
  • IEEE/ACM Transactions on Networking
  • Liang Ma +4
  • Conference Article
  • Citations8

Autonomous routing algorithms for networks with wide-spread failures

  • Oct 01, 2009
  • Wajahat Khan +2
  • Conference Article
  • Citations29

Optimal-Capacity, Shortest Path Routing in Self-Organizing 5G Networks using Machine Learning

  • Apr 01, 2019
  • Chetana V Murudkar +1
  • Conference Article
  • Citations2

Energy aware routing in high capacity overlays in wireless sensor networks

  • Mar 01, 2008
  • Shariful Hasan Shaikot +1
  • Conference Article
  • Citations6

Dynamic IGP Weight Optimization in IP Networks

  • Nov 01, 2011
  • Olivier Brun +1
  • Research Article
  • Citations35

Robust and Efficient Monitor Placement for Network Tomography in Dynamic Networks

  • Jun 01, 2017
  • IEEE/ACM Transactions on Networking
  • Ting He +5
  • Conference Article
  • Citations5

Shortest Path Algorithm for Pore-scale Simulation of Water-alternating-gas Injection

  • Sep 08, 2008
  • Proceedings
  • M.I.J Van Dijke +2
  • Research Article
  • Citations30

The time-dependent shortest path and vehicle routing problem

  • Aug 28, 2021
  • INFOR: Information Systems and Operational Research
  • Rabie Jaballah +3
  • Conference Article
  • Citations5

Multiperiod Planning with Controlled Shortest Path Routing

  • Dec 01, 2010
  • Clara Kronberger +2
  • Conference Article
  • Citations115

Link stability and route lifetime in ad-hoc wireless networks

  • Aug 18, 2002
  • Geunhwi Lim +4
  • Conference Article
  • Citations1

A comparison of load-distributive path routing and shortest path routing in wireless ad hoc networks

  • Jun 01, 2014
  • Iffat Habib +2
  • Book Chapter
  • Citations19

Optimization of OSPF Routing in IP Networks

  • Jan 01, 2009
  • Andreas Bley +7
  • Conference Article
  • Citations16

Optimal Recovery from Large-Scale Failures in IP Networks

  • Jun 01, 2012
  • Qiang Zheng +3
  • Research Article
  • Citations19

Asymptotic optimality of shortest path routing algorithms

  • Jan 01, 1987
  • IEEE Transactions on Information Theory
  • E Gafni +1
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.