Integer and combinatorial optimization
Integer and combinatorial optimization
Linear programming and network flows (2nd ed.)
Linear programming and network flows (2nd ed.)
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Wide area traffic: the failure of Poisson modeling
IEEE/ACM Transactions on Networking (TON)
End-to-end routing behavior in the Internet
IEEE/ACM Transactions on Networking (TON)
vBNS: not your father's Internet
IEEE Spectrum
Small worlds: the dynamics of networks between order and randomness
Small worlds: the dynamics of networks between order and randomness
An Analysis of Internet Inter-Domain Topology and Route Stability
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
Impact of Network Dynamics on End-to-End Protocols: Case Studies in Reliable Multicast
ISCC '98 Proceedings of the Third IEEE Symposium on Computers & Communications
Wide-area Internet traffic patterns and characteristics
IEEE Network: The Magazine of Global Internetworking
Tomography-based overlay network monitoring
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
An algebraic approach to practical and scalable overlay network monitoring
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Topology-aware overlay path probing
Computer Communications
Algebra-based scalable overlay network monitoring: algorithms, evaluation, and applications
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
To predict the delay between a source and a destination as well as to identify anomalies in a network, it is useful to continuously monitor the network by sending probes between all sources and destinations. Some of the problems of such probing strategies are: (1) there is a very large amount of information to analyze in real time; and (2) the probes themselves could add to the congestion. Therefore it is of prime importance to reduce the number of probes drastically and yet be able to reasonably predict delays and identify anomalies. In this paper we formulate a graph-theoretic problem called the Constrained Coverage Problem to optimally select a subset to traceroute-type probes to monitor networks where the topology is known. To solve this problem, we develop a heuristic algorithm called the Constrained Coverage Heuristic (CCH) algorithm, which works in polynomial time, as an alternative to the standard exponential-time integer programming solution available in commercial software. The application of the Constrained Coverage Problem to randomly generated topologies yielded an 88.1% reduction in the number of monitored traceroute-type probes on average. In other words, networks can be successfully monitored using only 11.9% of all possible probes. For these examples, the polynomial time CCH algorithm performed remarkably well in comparison to the standard exponential time integer programming algorithm and obtained the optimal (in 24 of 30 examples) or near optimal (second best solution in the remaining examples) solutions in a comparatively negligible amount of time.