| The Distributed Network Monitoring Model with BoundedDelay Constraints |
| |
| 引用本文： | LIUXiang-hui YINJian-ping LUXi-cheng CAIZhi-ping ZHAOJian-min. The Distributed Network Monitoring Model with BoundedDelay Constraints[J]. 武汉大学学报:自然科学英文版, 2004, 9(4): 429-434. DOI: 10.1007/BF02830437 |
| |
| 作者姓名： | LIUXiang-hui YINJian-ping LUXi-cheng CAIZhi-ping ZHAOJian-min |
| |
| 作者单位： | [1]SchoolofComputerScience,NationalUniversityofDefenseTechnology,Changsha410073,Hunan,China [2]SchoolofComputerScience,ZhejiangNormalUniversity,Jinhua321004,Zhejiang,China |
| |
| 基金项目： | SupportedbytheNationalNaturalScienceFoundationofChina (60 3730 2 3) |
| |
| 摘 要： | 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 In m 1, where is the number of monitoring nodes. At last we extend our modal with more constraint of bounded delay variation.
|
| 关 键 词： | 分布网络监测模型 边界延迟约束 计算机网络 NP-难 简单网络控制协议 |
| 收稿时间： | 2004-03-10 |
The distributed network monitoring model with bounded delay constraints |
| |
| Liu Xiang-hui,Yin Jian-ping,Lu Xi-cheng,Cai Zhi-ping,Zhai Jian-min. The distributed network monitoring model with bounded delay constraints[J]. Wuhan University Journal of Natural Sciences, 2004, 9(4): 429-434. DOI: 10.1007/BF02830437 |
| |
| Authors: | Liu Xiang-hui Yin Jian-ping Lu Xi-cheng Cai Zhi-ping Zhai Jian-min |
| |
| Affiliation: | (1) School of Computer Science, National University of Defense Technology, 410073 Changsha, Hunan, China;(2) School of Computer Science, Zhejiang Normal University, 321004 Jinhua, Zhejiang, China |
| |
| Abstract: | 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 ln m +1, where is the number of monitoring nodes. At last we extend our modal with more constraint of bounded delay variation. |
| |
| Keywords: | network distributed monitoring delay constraint NP-hard |
| 本文献已被 CNKI 维普 万方数据 SpringerLink 等数据库收录！ |
