Abstract-Various network monitoring and performance evaluation schemes generate considerable amount of traflic, which afIeets network performance. In this paper we describe a method for minimizing network monitoring overhead based on Shortest Path Tree (SJTJ protocol. We describe two different variations of the problem: the A-Problem and the E-Problem, and show that them is a significant difference between them. We prove that tinding optimal solutions is NP-hard for both variations, and propose a theoretically best possible heuristic far the A-Problem and three different heurktics for the E-Problem, one of them being also theoretically best possible. We show that one on compute in polynomial time an O(lnlVI)-appmrimate solution far each of these problems. Then, we analyze the performance of our heuristics on large graph generated using W-an and Power-Law models as well as on real ISP topolow maps. Experiment results show more than 80% improvement when using our heuristics on real topologies over the naive approaches.
Breitbart et al. REF described a method for minimizing network monitoring overhead based on Shortest Path Tree (SPT) protocol.
Effective network monitoring
Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)
Proceedings. 13th International Conference on Computer Communications and Networks (IEEE Cat. No.04EX969)
Computer Science