Efficient Design of End-to-End Probes for Source-Routed Networks

Migration to a converged network has caused service providers to deploy real time applications such as voice over an IP (VoIP) network. From the provider's perspective, the success of such emerging multimedia services over IP networks depend on mechanisms which help understand the network-wide end-to-end performance dynamics. In this work, we present a mechanism to design efficient probes for measuring end-to-end performance impairments such as network delay and loss for a specific service in the provider network. We address two main issues related to deploying network probes: (1) the need for correlating the topology data with the measured values and (2) reducing the amount of probe traffic. We use explicitly routed probe packets to alleviate the need for correlation with topology measurements. We also present a 3.5-approximation algorithm for designing probe-sets which cover all the edges in the network. Further, we explore techniques for using observed performance degradations in a given set of probes to isolate the miscreant-edge which caused the degradations. We state a precise characterization for probe-sets which isolate miscreant edges in the network; this also suggests a natural heuristic for miscreant-edge detection. Simulations on ISP topologies obtained from the RocketFuel project show that our algorithms perform much better than the analytically guaranteed bounds and are near-optimal in practice with respect to probe costs.

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

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

[3]  Van Jacobson,et al.  Congestion avoidance and control , 1988, SIGCOMM '88.

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

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

[6]  Avishai Wool,et al.  Computing the unmeasured: an algebraic approach to Internet mapping , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

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

[8]  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).

[9]  F. Marmor.  PROTOCOLS , 1950 .

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

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

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

[13]  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).

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

[15]  Ratul Mahajan,et al.  Measuring ISP topologies with rocketfuel , 2002, TNET.

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

[17]  William Stallings,et al.  SNMP and SNMPv2: the infrastructure for network management , 1998, IEEE Commun. Mag..

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

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

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

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