TY - JOUR

T1 - Managing End-to-End Network Performance via Optimized Monitoring Strategies

AU - Ozmutlu, Huseyin Cenk

AU - Gautam, Natarajan

AU - Barton, Russell

N1 - Funding Information:
This work is partially supported by DARPA (Contract number F30602-97-C-0274). We also thank Lucent Technologies for their generous support. We are grateful to all the anonymous reviewers for their comments and suggestions that led to considerable improvements in the content and presentation of this paper.

PY - 2002/3

Y1 - 2002/3

N2 - To predict the delay between a source and a destination as well as to identify anomalies in a network, it is useful to continuously monitor the network by sending probes between all sources and destinations. Some of the problems of such probing strategies are: (1) there is a very large amount of information to analyze in real time; and (2) the probes themselves could add to the congestion. Therefore it is of prime importance to reduce the number of probes drastically and yet be able to reasonably predict delays and identify anomalies. In this paper we formulate a graph-theoretic problem called the Constrained Coverage Problem to optimally select a subset to traceroute-type probes to monitor networks where the topology is known. To solve this problem, we develop a heuristic algorithm called the Constrained Coverage Heuristic (CCH) algorithm, which works in polynomial time, as an alternative to the standard exponential-time integer programming solution available in commercial software. The application of the Constrained Coverage Problem to randomly generated topologies yielded an 88.1% reduction in the number of monitored traceroute-type probes on average. In other words, networks can be successfully monitored using only 11.9% of all possible probes. For these examples, the polynomial time CCH algorithm performed remarkably well in comparison to the standard exponential time integer programming algorithm and obtained the optimal (in 24 of 30 examples) or near optimal (second best solution in the remaining examples) solutions in a comparatively negligible amount of time.

AB - To predict the delay between a source and a destination as well as to identify anomalies in a network, it is useful to continuously monitor the network by sending probes between all sources and destinations. Some of the problems of such probing strategies are: (1) there is a very large amount of information to analyze in real time; and (2) the probes themselves could add to the congestion. Therefore it is of prime importance to reduce the number of probes drastically and yet be able to reasonably predict delays and identify anomalies. In this paper we formulate a graph-theoretic problem called the Constrained Coverage Problem to optimally select a subset to traceroute-type probes to monitor networks where the topology is known. To solve this problem, we develop a heuristic algorithm called the Constrained Coverage Heuristic (CCH) algorithm, which works in polynomial time, as an alternative to the standard exponential-time integer programming solution available in commercial software. The application of the Constrained Coverage Problem to randomly generated topologies yielded an 88.1% reduction in the number of monitored traceroute-type probes on average. In other words, networks can be successfully monitored using only 11.9% of all possible probes. For these examples, the polynomial time CCH algorithm performed remarkably well in comparison to the standard exponential time integer programming algorithm and obtained the optimal (in 24 of 30 examples) or near optimal (second best solution in the remaining examples) solutions in a comparatively negligible amount of time.

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

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

U2 - 10.1023/A:1014457726450

DO - 10.1023/A:1014457726450

M3 - Article

AN - SCOPUS:1942505973

VL - 10

SP - 107

EP - 126

JO - Journal of Network and Systems Management

JF - Journal of Network and Systems Management

SN - 1064-7570

IS - 1

ER -