DocumentCode :
789053
Title :
Robust Monitoring of Link Delays and Faults in IP Networks
Author :
Bejerano, Yigal ; Rastogi, Rajeev
Author_Institution :
Networking Res. Center, Bell Labs., Murray Hill, NJ
Volume :
14
Issue :
5
fYear :
2006
Firstpage :
1092
Lastpage :
1103
Abstract :
In this paper, we develop failure-resilient techniques for monitoring link delays and faults in a Service Provider or Enterprise IP network. Our two-phased approach attempts to minimize both the monitoring infrastructure costs as well as the additional traffic due to probe messages. In the first phase, we compute the locations of a minimal set of monitoring stations such that all network links are covered, even in the presence of several link failures. Subsequently, in the second phase, we compute a minimal set of probe messages that are transmitted by the stations to measure link delays and isolate network faults. We show that both the station selection problem as well as the probe assignment problem are NP-hard. We then propose greedy approximation algorithms that achieve a logarithmic approximation factor for the station selection problem and a constant factor for the probe assignment problem. These approximation ratios are provably very close to the best possible bounds for any algorithm
Keywords :
IP networks; approximation theory; computer network reliability; failure analysis; greedy algorithms; NP-hard; enterprise IP networks; failure-resilient techniques; greedy approximation algorithms; link delays monitoring; logarithmic approximation factor; service provider; Computer networks; Condition monitoring; Costs; Delay; IP networks; Intelligent networks; Probes; Quality of service; Robustness; Telecommunication traffic; Approximation algorithms; latency and fault monitoring; network failures; set cover problem;
fLanguage :
English
Journal_Title :
Networking, IEEE/ACM Transactions on
Publisher :
ieee
ISSN :
1063-6692
Type :
jour
DOI :
10.1109/TNET.2006.882907
Filename :
1709960
Link To Document :
بازگشت