An approximation algorithm for weak vertex cover problem in network management

Lecture Notes in Computer Science

Volumn 3521, Issue , 2005, Pages 243-251

  Cai, Zhiping ^a   Yin, Jianping ^a   Liu, Xianghui ^a   Lv, Shaohe ^a  

^a NATIONAL UNIVERSITY OF DEFENSE TECHNOLOGY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; BANDWIDTH; COMPUTER NETWORKS; COMPUTER SIMULATION; MATHEMATICAL MODELS; MONITORING; PROBLEM SOLVING; TOPOLOGY;

FLOW CONSERVATION; NETWORK FLOW; NETWORK MANAGEMENT; VORTEX COVER PROBLEM;

ALGORITHMS;

EID: 25144475374     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11496199_27     Document Type: Article

References (18)

1. W. Stallings: SNMP, SNMPv2, SNMPvS, and RMON 1 and 2. Addison-Wesley Longman, Inc., 1999.
2. Cisco Systems: NetFlow Services and Applications, White Paper, 1999
3. P. Francis, S. Jamin, V. Paxson, L. Zhang, D.F.Gryniewicz, and Y. Jin: An Architecture for a Global Internet Host Distance Estimation Service. In Proc. IEEE INFOCOM 1999.
4. S. Jamin, C. Jin, Y. Jin, Y. Raz, Y. Shavitt, and L. Zhang: On the Placement of Internet Instrumentation. In Proc. IEEE INFOCOM 2000.
5. J.C.Bolot: End-to-End Packet Delay and Loss Behavior in the Internet. In. Proc. ACM SIGCOMM 1993.
6. K. Lai and M. Baker: Measuring Bandwidth. In Proc. IEEE INFOCOM 1999.
7. Breitbart Y., Chan CY., Garofalakis M., Rastogi R., Siberschatz A.: Efficiently Monitoring Bandwidth and Latency in IP Networks. In Proc. IEEE INFOCOM 2001.
8. Kyoungwon Suh, Yang Guo, Jim Kurose, and Don Towsley. Locating Network Monitors: Complexity, Heuristics, and Coverage. In Proc. IEEE INFOCOM 2005.
9. Xianghui Liu, Jianping Yin, Lele Tang: Analysis of Efficient Monitoring Method for the Network Flow. Journal of Software, 2003,14(2): 300-304(in Chinese with English abstract).
10. Xianghui Liu, Jianping Yin, Xicheng Lu: A Monitoring Model for Link Bandwidth Usage of Network Based on Weak Vertex Cover. Journal of Software, 2004,15(4): 545-549(in Chinese with English abstract).
11. Yong Zhang and Hong Zhu: Approximation Algorithm for Weighted Weak Vertex Cover. Journal of Computer Science and Technology, 2004,19(6): 782-786.
12. Zhiping Cai, Jianping Yin, Xianghui Liu: Approximation Preserving Reduction between Weak Vertex Cover Problem and Other NP-hard Problems, Manuscript, 2005
13. Dorit S. Hochbaum: Approximation Algorithm for NP-Hard Problems. PWS Publishing Company,1997.
14. th Conference on Uncertainty in Artificial Intelligence.
15. F. A. Chudak, M. X. Goemans, D. S. Hochbaumn, and D. P. Williamson: A Primal-Dual Interpretation of Two 2-Approximation Algorithms for the Feedback Vertex Set Problem in Undirected Graphs. Operations Research Letters, 1998, 22 :111-118.
16. B.M.Waxman: Routing of Multipoint Connections. IEEE Journal on Selected Areas in Communications, 1988, 6(9):1617-1622.
17. Zhiping Cai, Wentao Zhao, Jianping Yin and Xianghui Liu: Using Passive Measuring to Calibrate Active Measuring Latency. In Proc. ICOIN2005, Lecture Notes in Computer Science 3391, C.Kim(eds.), Springer-Verlag, 2005.
18. Jianping Yin, Zhiping Cai, Wentao Zhao and Xianghui Liu: Passive Calibration of Active Measuring Latency. In Proc. ICN2005, Lecture Notes in Computer Science 3421, P.Lorenz and P.Dini(eds.), Springer-Verlag, 2005.