摘要
在扩展网络或网络拓扑发生变化时,需要用最小的代价重新布置网络监测体系,以保证能收集到所有必需的网络信息.更新网络监测体系包括新增和重新配置收集节点两方面的代价,求解总代价最小的更新方案的问题是NP难的.提出了一种基于贪婪策略的近似算法,并分析了算法的时间复杂性和近似比.
Monitoring infrastructure should be reconfigured at a minimum cost to obtain up-to-date status information as the network evolves. This paper addresses the problem of optimally upgrading the existing monitoring infrastructure. It tries to minimize the total cost of upgrading the monitoring infrastructure, including adding new pollers and reconfiguring the existing pollers. It is shown that this problem is NP-hard. An approximation algorithm is proposed, and its time complexity and approximation ratio are analyzed.
出处
《软件学报》
EI
CSCD
北大核心
2006年第1期117-123,共7页
Journal of Software
基金
国家自然科学基金~~
关键词
分布式监测
演化网络
延迟约束
NP难
近似算法
distributed monitoring
evolving network
delay constraint
NP-hard
approximation algorithm