End-to-end packet delay and loss behavior in the internet
SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
A hierarchical multicast monitoring scheme
COMM '00 Proceedings of NGC 2000 on Networked group communication
SNMP,SNMPV2,Snmpv3,and RMON 1 and 2
SNMP,SNMPV2,Snmpv3,and RMON 1 and 2
Measuring ISP topologies with rocketfuel
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Tree Layout for Internal Network Characterizations in Multicast Networks
NGC '01 Proceedings of the Third International COST264 Workshop on Networked Group Communication
On the number of distributed measurement points for network tomography
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
Efficient beacon placement for network tomography
Proceedings of the 4th ACM SIGCOMM conference on Internet measurement
Using passive measuring to calibrate active measuring latency
ICOIN'05 Proceedings of the 2005 international conference on Information Networking: convergence in broadband and mobile networking
Bandwidth estimation: metrics, measurement techniques, and tools
IEEE Network: The Magazine of Global Internetworking
Hi-index | 0.00 |
Link bandwidth is obviously critical for numerous network management tasks. Taking into account the issues of measuring costs and network-wide view for large IP network, a distributed measuring system would be an ideal monitoring architecture for active measuring link bandwidth. In this paper, we address the problem of efficiently measure assignment, which optimizing goal is to reduce the cost of measuring all links bandwidth. We show that this problem is NP-hard and propose an approximation algorithm with approximation ratio 2. The effectiveness of our measuring algorithm is validated by simulations evaluation over a wide range of network topologies.