Minimizing probing cost and achieving identifiability in network link monitoring

Qiang Zheng, Guohong Cao

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

Abstract

Continuously monitoring the link performance is important to network diagnosis. Recently, active probes sent between end systems are widely used to monitor the link performance. In this paper, we address the problem of minimizing the probing cost and achieving identifiability in link monitoring. Given a set of links to monitor, our objective is to select as few probing paths as possible to cover all of them, and the selected probing paths can uniquely identify all identifiable links being monitored. We propose an algorithm based on the linear system model to find out all sets of probing paths that can uniquely identify an identifiable link. We extend the bipartite model to reflect the relation between a set of probing paths and the link that can be uniquely identified. Through the extended bipartite model, our optimization problem is transformed into the classic set cover problem, which is NP-hard. Therefore, we propose a heuristic based algorithm to greedily select the probing paths. Our method eliminates two types of redundant probing paths, i.e., those that can be replaced by others and those that cannot be used to achieving identifiability. Simulations based on real network topologies show that our approach can achieve identifiability with very low probing cost. Compared with prior work, our method is more general and has better performance.

Original languageEnglish (US)
Title of host publicationICDCS 2010 - 2010 International Conference on Distributed Computing Systems
Pages675-684
Number of pages10
DOIs
StatePublished - Aug 27 2010
Event30th IEEE International Conference on Distributed Computing Systems, ICDCS 2010 - Genova, Italy
Duration: Jun 21 2010Jun 25 2010

Publication series

NameProceedings - International Conference on Distributed Computing Systems

Other

Other30th IEEE International Conference on Distributed Computing Systems, ICDCS 2010
CountryItaly
CityGenova
Period6/21/106/25/10

Fingerprint

Monitoring
Costs
Linear systems
Topology

All Science Journal Classification (ASJC) codes

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Cite this

Zheng, Q., & Cao, G. (2010). Minimizing probing cost and achieving identifiability in network link monitoring. In ICDCS 2010 - 2010 International Conference on Distributed Computing Systems (pp. 675-684). [5541634] (Proceedings - International Conference on Distributed Computing Systems). https://doi.org/10.1109/ICDCS.2010.18
Zheng, Qiang ; Cao, Guohong. / Minimizing probing cost and achieving identifiability in network link monitoring. ICDCS 2010 - 2010 International Conference on Distributed Computing Systems. 2010. pp. 675-684 (Proceedings - International Conference on Distributed Computing Systems).
@inproceedings{5229e9125e0c42b0bcaf8c5259fa1b64,
title = "Minimizing probing cost and achieving identifiability in network link monitoring",
abstract = "Continuously monitoring the link performance is important to network diagnosis. Recently, active probes sent between end systems are widely used to monitor the link performance. In this paper, we address the problem of minimizing the probing cost and achieving identifiability in link monitoring. Given a set of links to monitor, our objective is to select as few probing paths as possible to cover all of them, and the selected probing paths can uniquely identify all identifiable links being monitored. We propose an algorithm based on the linear system model to find out all sets of probing paths that can uniquely identify an identifiable link. We extend the bipartite model to reflect the relation between a set of probing paths and the link that can be uniquely identified. Through the extended bipartite model, our optimization problem is transformed into the classic set cover problem, which is NP-hard. Therefore, we propose a heuristic based algorithm to greedily select the probing paths. Our method eliminates two types of redundant probing paths, i.e., those that can be replaced by others and those that cannot be used to achieving identifiability. Simulations based on real network topologies show that our approach can achieve identifiability with very low probing cost. Compared with prior work, our method is more general and has better performance.",
author = "Qiang Zheng and Guohong Cao",
year = "2010",
month = "8",
day = "27",
doi = "10.1109/ICDCS.2010.18",
language = "English (US)",
isbn = "9780769540597",
series = "Proceedings - International Conference on Distributed Computing Systems",
pages = "675--684",
booktitle = "ICDCS 2010 - 2010 International Conference on Distributed Computing Systems",

}

Zheng, Q & Cao, G 2010, Minimizing probing cost and achieving identifiability in network link monitoring. in ICDCS 2010 - 2010 International Conference on Distributed Computing Systems., 5541634, Proceedings - International Conference on Distributed Computing Systems, pp. 675-684, 30th IEEE International Conference on Distributed Computing Systems, ICDCS 2010, Genova, Italy, 6/21/10. https://doi.org/10.1109/ICDCS.2010.18

Minimizing probing cost and achieving identifiability in network link monitoring. / Zheng, Qiang; Cao, Guohong.

ICDCS 2010 - 2010 International Conference on Distributed Computing Systems. 2010. p. 675-684 5541634 (Proceedings - International Conference on Distributed Computing Systems).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Minimizing probing cost and achieving identifiability in network link monitoring

AU - Zheng, Qiang

AU - Cao, Guohong

PY - 2010/8/27

Y1 - 2010/8/27

N2 - Continuously monitoring the link performance is important to network diagnosis. Recently, active probes sent between end systems are widely used to monitor the link performance. In this paper, we address the problem of minimizing the probing cost and achieving identifiability in link monitoring. Given a set of links to monitor, our objective is to select as few probing paths as possible to cover all of them, and the selected probing paths can uniquely identify all identifiable links being monitored. We propose an algorithm based on the linear system model to find out all sets of probing paths that can uniquely identify an identifiable link. We extend the bipartite model to reflect the relation between a set of probing paths and the link that can be uniquely identified. Through the extended bipartite model, our optimization problem is transformed into the classic set cover problem, which is NP-hard. Therefore, we propose a heuristic based algorithm to greedily select the probing paths. Our method eliminates two types of redundant probing paths, i.e., those that can be replaced by others and those that cannot be used to achieving identifiability. Simulations based on real network topologies show that our approach can achieve identifiability with very low probing cost. Compared with prior work, our method is more general and has better performance.

AB - Continuously monitoring the link performance is important to network diagnosis. Recently, active probes sent between end systems are widely used to monitor the link performance. In this paper, we address the problem of minimizing the probing cost and achieving identifiability in link monitoring. Given a set of links to monitor, our objective is to select as few probing paths as possible to cover all of them, and the selected probing paths can uniquely identify all identifiable links being monitored. We propose an algorithm based on the linear system model to find out all sets of probing paths that can uniquely identify an identifiable link. We extend the bipartite model to reflect the relation between a set of probing paths and the link that can be uniquely identified. Through the extended bipartite model, our optimization problem is transformed into the classic set cover problem, which is NP-hard. Therefore, we propose a heuristic based algorithm to greedily select the probing paths. Our method eliminates two types of redundant probing paths, i.e., those that can be replaced by others and those that cannot be used to achieving identifiability. Simulations based on real network topologies show that our approach can achieve identifiability with very low probing cost. Compared with prior work, our method is more general and has better performance.

UR - http://www.scopus.com/inward/record.url?scp=77955914911&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77955914911&partnerID=8YFLogxK

U2 - 10.1109/ICDCS.2010.18

DO - 10.1109/ICDCS.2010.18

M3 - Conference contribution

SN - 9780769540597

T3 - Proceedings - International Conference on Distributed Computing Systems

SP - 675

EP - 684

BT - ICDCS 2010 - 2010 International Conference on Distributed Computing Systems

ER -

Zheng Q, Cao G. Minimizing probing cost and achieving identifiability in network link monitoring. In ICDCS 2010 - 2010 International Conference on Distributed Computing Systems. 2010. p. 675-684. 5541634. (Proceedings - International Conference on Distributed Computing Systems). https://doi.org/10.1109/ICDCS.2010.18