End-to-End Service Quality Measurement Using Source-Routed Probes

The need to monitor real time network services has prompted service providers to use new measurement technologies, such as service-specific probes. Service-specific probes are active probes that closely mimic the service traffic so that it receives the same treatment from the network as the actual service traffic. These probes are end-to-end and their deployment depends on solutions that address questions such as minimizing probe traffic, while still obtaining maximum coverage of all the links in the network. In this paper, we provide a polynomial-time probe-path computation algorithm, as well as a -approximate solution for merging probe paths when the number of probes exceed a required bound . Our algorithms are evaluated using ISP topologies generated via Rocketfuel. We find that for most topologies, it is possible to cover more than of the edges using just of the nodes as terminals. Our work also suggests that the deployment strategy for active probes is dependent on cost issues, such as probe installation, probe set-up, and maintenance costs.

[1]  David S. Johnson,et al.  Approximation Algorithms for Bin-Packing — An Updated Survey , 1984 .

[2]  Randy H. Katz,et al.  An algebraic approach to practical and scalable overlay network monitoring , 2004, SIGCOMM '04.

[3]  Dieter Jungnickel,et al.  Graphs, Networks, and Algorithms , 1980 .

[4]  Darryl Veitch,et al.  Active probing using packet quartets , 2002, IMW '02.

[5]  Mary Baker,et al.  Measuring link bandwidths using a deterministic model of packet delay , 2000, SIGCOMM.

[6]  William Stallings,et al.  SNMP, SNMPv2, SNMPv3, and RMON 1 and 2 , 1999 .

[7]  Rajeev Rastogi,et al.  Robust Monitoring of Link Delays and Faults in IP Networks , 2003, IEEE/ACM Transactions on Networking.

[8]  Edward G. Coffman,et al.  Approximation algorithms for bin packing: a survey , 1996 .

[9]  David B. Shmoys,et al.  Using dual approximation algorithms for scheduling problems: Theoretical and practical results , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[10]  R. Graham,et al.  Handbook of Combinatorics , 1995 .

[11]  G. S. Lueker,et al.  Bin packing can be solved within 1 + ε in linear time , 1981 .

[12]  Avishai Wool,et al.  Computing the unmeasured: an algebraic approach to Internet mapping , 2004, IEEE Journal on Selected Areas in Communications.

[13]  Marina Thottan,et al.  Oss architecture and requirements for VoIP networks , 2005, Bell Labs Technical Journal.

[14]  Rajeev Rastogi,et al.  Efficiently monitoring bandwidth and latency in IP networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[15]  Gerhard Reinelt,et al.  New Heuristics and Lower Bounds for the Min-Max k -Chinese Postman Problem , 2002, ESA.

[16]  Alejandro López-Ortiz,et al.  On the number of distributed measurement points for network tomography , 2003, IMC '03.

[17]  Giorgio Gambosi,et al.  Complexity and Approximation , 1999, Springer Berlin Heidelberg.

[18]  Ratul Mahajan,et al.  User-level internet path diagnosis , 2003, SOSP '03.

[19]  Marina Thottan,et al.  Efficient Design of End-to-End Probes for Source-Routed Networks , 2007, 2007 2nd International Conference on Communication Systems Software and Middleware.

[20]  Chen-Nee Chuah,et al.  Analysis of link failures in an IP backbone , 2002, IMW '02.

[21]  Deborah Estrin,et al.  Fault isolation in multicast trees , 2000, SIGCOMM.

[22]  Daniel R. Simon,et al.  Secure traceroute to detect faulty or malicious routing , 2003, CCRV.

[23]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[24]  Donald F. Towsley,et al.  Network tomography on general topologies , 2002, SIGMETRICS '02.

[25]  Marina Thottan,et al.  VoIP service quality monitoring using active and passive probes , 2006, 2006 1st International Conference on Communication Systems Software & Middleware.

[26]  V. Jacobson,et al.  Congestion avoidance and control , 1988, CCRV.

[27]  Donald F. Towsley,et al.  Tree Layout for Internal Network Characterizations in Multicast Networks , 2001, Networked Group Communication.

[28]  Parameswaran Ramanathan,et al.  What do packet dispersion techniques measure? , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[29]  Approximation Algorithm , 2008, Encyclopedia of Algorithms.

[30]  Richard M. Karp,et al.  An efficient approximation scheme for the one-dimensional bin-packing problem , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[31]  Mark Crovella,et al.  Measuring Bottleneck Link Speed in Packet-Switched Networks , 1996, Perform. Evaluation.

[32]  Paul Francis,et al.  An architecture for a global Internet host distance estimation service , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[33]  Ratul Mahajan,et al.  Measuring ISP topologies with rocketfuel , 2002, SIGCOMM 2002.

[34]  Ritesh Kumar,et al.  Efficient beacon placement for network tomography , 2004, IMC '04.

[35]  Matthew J. Luckie,et al.  Towards improving packet probing techniques , 2001, IMW '01.

[36]  Ratul Mahajan,et al.  Measuring ISP topologies with Rocketfuel , 2004, IEEE/ACM Transactions on Networking.

[37]  Chul E. Kim,et al.  Approximation algorithms for some routing problems , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[38]  Ronald L. Graham,et al.  Bounds for certain multiprocessing anomalies , 1966 .

[39]  Kathryn Fraughnaugh,et al.  Introduction to graph theory , 1973, Mathematical Gazette.