Network monitoring: probe-subset selection using the constrained coverage problem

Huseyin C. Ozmutlu; Russell Barton; Natarajan Gautam; William J. Hery

doi:10.1117/12.360375

18 August 1999 Network monitoring: probe-subset selection using the constrained coverage problem

Huseyin C. Ozmutlu, Russell Barton, Natarajan Gautam, William J. Hery

Proceedings Volume 3841, Performance and Control of Network Systems III; (1999) https://doi.org/10.1117/12.360375
Event: Photonics East '99, 1999, Boston, MA, United States

Abstract

To predict the delay between a source and destination as well as to identify anomalies in a network, it is crucial to continuously monitor the network by sending probes between all sources and destinations. It is of prime importance to reduce the number of probes drastically and yet be able to reasonably predict the delays and identify anomalies. In this paper we state and solve a graph-theoretic problem to optimally select a subset of traceroute-type probes to monitor networks.

Citation Download Citation

Huseyin C. Ozmutlu, Russell Barton, Natarajan Gautam, and William J. Hery "Network monitoring: probe-subset selection using the constrained coverage problem", Proc. SPIE 3841, Performance and Control of Network Systems III, (18 August 1999); https://doi.org/10.1117/12.360375

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available