Abstract
Link-bandwidth utilization and flow information are obviously critical for numerous network management tasks. The problem of efficiently monitoring the network flowing based on flow-conservation could be reduced to Weak Vertex Cover problem, which is NP-hard. In this paper, using the primal-dual method, we give an approximation algorithm with approximation ratio 2 to solve the problem. It is a near-optimal algorithm as it is very difficult to get an approximation algorithm with approximation ratio lower than 2 for Weak Vertex Cover problem. The effectiveness of our monitoring algorithm is validated by simulations evaluation over a wide range of network topologies. The practices indicate that our work is valuable to solve Weak Vertex Cover problem and its application in network management.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Stallings, W.: SNMP, SNMPv2, SNMPv3, and RMON 1 and 2. Addison-Wesley Longman, Inc., Amsterdam (1999)
Cisco Systems: NetFlow Services and Applications, White Paper (1999)
Francis, P., Jamin, S., Paxson, V., Zhang, L., Gryniewicz, D.F., Jin, Y.: An Architecture for a Global Internet Host Distance Estimation Service. In: Proc. IEEE INFOCOM (1999)
Jamin, S., Jin, C., Jin, Y., Raz, Y., Shavitt, Y., Zhang, L.: On the Placement of Internet Instrumentation. In: Proc. IEEE INFOCOM (2000)
Bolot, J.C.: End-to-End Packet Delay and Loss Behavior in the Internet. In: Proc. ACM SIGCOMM (1993)
Lai, K., Baker, M.: Measuring Bandwidth. In: Proc. IEEE INFOCOM (1999)
Breitbart, Y., Chan, C.Y., Garofalakis, M., Rastogi, R., Siberschatz, A.: Efficiently Monitoring Bandwidth and Latency in IP Networks. In: Proc. IEEE INFOCOM (2001)
Suh, K., Guo, Y., Kurose, J., Towsley, D.: Locating Network Monitors: Complexity, Heuristics, and Coverage. In: Proc. IEEE INFOCOM 2005 (2005)
Liu, X., Yin, J., Tang, L.: Analysis of Efficient Monitoring Method for the Network Flow. Journal of Software 14(2), 300–304 (2003) (in Chinese with English abstract)
Liu, X., Yin, J., Lu, X.: A Monitoring Model for Link Bandwidth Usage of Network Based on Weak Vertex Cover. Journal of Software 15(4), 545–549 (2004) (in Chinese with English abstract)
Zhang, Y., Zhu, H.: Approximation Algorithm for Weighted Weak Vertex Cover. Journal of Computer Science and Technology 19(6), 782–786 (2004)
Cai, Z., Yin, J., Liu, X.: Approximation Preserving Reduction between Weak Vertex Cover Problem and Other NP-hard Problems (2005) (Manuscript)
Hochbaum, D.S.: Approximation Algorithm for NP-Hard Problems. PWS Publishing Company (1997)
Becker, A., Geiger, D.: Approximation Algorithms for the Loop Cutest Problem. In: Proc. 10th Conference on Uncertainty in Artificial Intelligence
Chudak, F.A., Goemans, M.X., Hochbaumn, D.S., Williamson, D.P.: A Primal-Dual Interpretation of Two 2-Approximation Algorithms for the Feedback Vertex Set Problem in Undirected Graphs. Operations Research Letters 22, 111–118 (1998)
Waxman, B.M.: Routing of Multipoint Connections. IEEE Journal on Selected Areas in Communications 6(9), 1617–1622 (1988)
Cai, Z., Zhao, W., Yin, J., Liu, X.: Using Passive Measuring to Calibrate Active Measuring Latency. In: Kim, C. (ed.) ICOIN 2005. LNCS, vol. 3391, pp. 198–206. Springer, Heidelberg (2005)
Yin, J., Cai, Z., Zhao, W., Liu, X.: Passive calibration of active measuring latency. In: Lorenz, P., Dini, P. (eds.) ICN 2005. LNCS, vol. 3421, pp. 746–753. Springer, Heidelberg (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cai, Z., Yin, J., Liu, X., Lv, S. (2005). An Approximation Algorithm for Weak Vertex Cover Problem in Network Management. In: Megiddo, N., Xu, Y., Zhu, B. (eds) Algorithmic Applications in Management. AAIM 2005. Lecture Notes in Computer Science, vol 3521. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11496199_27
Download citation
DOI: https://doi.org/10.1007/11496199_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26224-4
Online ISBN: 978-3-540-32440-9
eBook Packages: Computer ScienceComputer Science (R0)