Probe Station Placement for Robust Monitoring of Networks

Authors:
Maitreya Natu;Adarshpal S. Sethi
Affiliations:
Tata Research Development and Design Centre, Pune, India 411013;Department of Computer and Information Sciences, University of Delaware, Newark, USA 19716
Venue:
Journal of Network and Systems Management
Year:
2008

Citing 7
Cited 1

End-to-end packet delay and loss behavior in the internet

SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
Using pathchar to estimate Internet link characteristics

Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Fault isolation in multicast trees

Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
SNMP,SNMPV2,Snmpv3,and RMON 1 and 2

SNMP,SNMPV2,Snmpv3,and RMON 1 and 2
Tree Layout for Internal Network Characterizations in Multicast Networks

NGC '01 Proceedings of the Third International COST264 Workshop on Networked Group Communication
On the number of distributed measurement points for network tomography

Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
Efficient beacon placement for network tomography

Proceedings of the 4th ACM SIGCOMM conference on Internet measurement

Flow Monitoring in Wireless MESH Networks

AIMS '09 Proceedings of the 3rd International Conference on Autonomous Infrastructure, Management and Security: Scalability of Networks and Services

Quantified Score

Hi-index	0.01

Visualization

Abstract

We address the problem of selecting probe station locations from where probes can be sent to monitor all the nodes in the network. Probe station placement involves instrumentation overhead. Hence, the number of probe stations should be minimal to reduce the deployment cost. Also, probe station placement should be such that the network can be monitored even in the presence of failures. We present algorithms to select locations of probe stations so that the entire network can be monitored for computing various performance metrics. We aim to find a minimal set of probe station nodes so as to minimize the instrumentation overhead. The algorithm presented provides robust monitoring in presence of node failures. We then present algorithms to make the solution resilient to probe station failures, and to deal with weakly connected nodes. We provide an experimental evaluation of the proposed algorithms through simulation results.