Abstract
To predict the delay between a source and a destination as well as to identify anomalies in a network, it is possible to continuously monitor the network by sending probes between all sources and destinations. However, it is of prime importance to keep the number of probes to a minimum and yet be able to reasonably predict the delays and identify anomalies. In this paper we state and solve a mathematical programming problem, namely the Zone Recovery Methodology (ZRM), to optimally select a subset of ping-like probes to monitor networks where the topology and routing information are not known. A polynomial-time heuristic is developed. The application of ZRM on randomly generated topologies yielded 73.55% reduction in the number of monitored paths on average. In other words, networks can be successfully monitored using only 26.45% of the available probes. Moreover, the performance of ZRM increases (percentage of the monitored paths decreases) as the size of the topology increases.
Original language | English (US) |
---|---|
Pages | 451-464 |
Number of pages | 14 |
State | Published - 2002 |
Externally published | Yes |
Event | 2002 IEEE/IFIP Network Operations and Management Symposium - Florence, Italy Duration: Apr 15 2002 → Apr 19 2002 |
Conference
Conference | 2002 IEEE/IFIP Network Operations and Management Symposium |
---|---|
Country/Territory | Italy |
City | Florence |
Period | 4/15/02 → 4/19/02 |
Keywords
- Anomaly detection
- End-to-end delay
- Monitoring
- Network management
- Quality of service
ASJC Scopus subject areas
- Hardware and Architecture
- Electrical and Electronic Engineering