The distributed network monitoring model with bounded delay constraints

We address the problem of optimizing a distributed monitoring system and the goal of the optimization is to reduce the cost of deployment of the monitoring infrastructure by identifying a minimum aggregating set subject to delay constraint on the aggregating path. We show that this problem is NP-har...

Full description

Saved in:
Bibliographic Details
Published in:Wuhan University journal of natural sciences 2004-07, Vol.9 (4), p.429-434
Main Authors: Liu, Xiang-hui, Yin, Jian-ping, Lu, Xi-cheng, Cai, Zhi-ping, Zhao, Jian-min
Format: Article
Language:English
Subjects:
Algorithms
Approximation
Computer networks
Constraint modelling
Delay
Mathematical analysis
Monitoring
Optimization
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We address the problem of optimizing a distributed monitoring system and the goal of the optimization is to reduce the cost of deployment of the monitoring infrastructure by identifying a minimum aggregating set subject to delay constraint on the aggregating path. We show that this problem is NP-hard and propose approximation algorithm proving the approximation ratio with lnm+1, where is the number of monitoring nodes. At last we extend our modal with more constraint of bounded delay variation.
ISSN:1007-1202
1993-4998
DOI:10.1007/bf02830437