PeriScope: An active measurement API

|Growing interest in inference and prediction of network characteristics is justi ed by its importance for a variety of network-aware applications. One widely adopted strategy to characterize network conditions relies on active, end-to-end probing of the network. Active end-to-end probing techniques di er in (1) the structural composition of the probes they use (e.g., number and size of packets, the destination of various packets, the protocols used, etc.), (2) the entity making the measurements (e.g. sender vs. receiver), and (3) the techniques used to combine measurements in order to infer speci c metrics of interest. In this paper, we present Periscope: a Linux API that enables the de nition of new probing structures and inference techniques from user space through a exible interface. PeriScope requires no support from clients beyond the ability to respond to ICMP ECHO REQUESTs and is designed to minimize user/kernel crossings and to ensure various constraints (e.g., back-to-back packet transmissions, ne-grained timing measurements) We show how to use Periscope for two di erent probing purposes, namely the measurement of shared packet losses between pairs of endpoints and for the measurement of subpath bandwidth. Results from Internet experiments for both of these goals are also presented. Keywords| End-to-end measurement; loss rate; bottleneck bandwidth; Bayesian probing; Cartouche probing; network-aware applications.

[1]  Donald F. Towsley,et al.  Measurement and modelling of the temporal dependence in packet loss , 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).

[2]  Jussi Kangasharju,et al.  Object replication strategies in content distribution networks , 2002, Comput. Commun..

[3]  Mor Harchol-Balter,et al.  Connection Scheduling in Web Servers , 1999, USENIX Symposium on Internet Technologies and Systems.

[4]  Steven McCanne,et al.  Inference of multicast routing trees and bottleneck bandwidths using end-to-end measurements , 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).

[5]  Srinivasan Keshav.  Congestion control in computer networks , 1991 .

[6]  Mary Baker,et al.  Nettimer: A Tool for Measuring Bottleneck Link Bandwidth , 2001, USITS.

[7]  Srinivasan Seshan,et al.  An integrated congestion management architecture for Internet hosts , 1999, SIGCOMM '99.

[8]  Ibrahim Matta,et al.  BU/NSF Workshop on Internet Measurement Instrumentation and Characterization , 1999 .

[9]  Vern Paxson,et al.  End-to-end routing behavior in the Internet , 1996, TNET.

[10]  Donald F. Towsley,et al.  Inferring link loss using striped unicast probes , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

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

[12]  Jean-Chrysotome Bolot.  End-to-end packet delay and loss behavior in the internet , 1993, SIGCOMM 1993.

[13]  Vern Paxson,et al.  End-to-end Internet packet dynamics , 1997, SIGCOMM '97.

[14]  Srinivasan Seshan,et al.  A case for end system multicast , 2002, IEEE J. Sel. Areas Commun..

[15]  Pavlin Radoslavov,et al.  Topology-informed Internet replica placement , 2002, Comput. Commun..

[16]  R. Caceres,et al.  Inference of internal loss rates in the MBone , 1999, Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042).

[17]  Fred Douglis,et al.  Known CDN Request-Routing Mechanisms , 2002 .

[18]  Azer Bestavros,et al.  Robust Identi ation of Shared Losses Using End-to-End Uni ast Probes , 2000 .

[19]  Kirk L. Johnson,et al.  Overcast: reliable multicasting with on overlay network , 2000, OSDI.

[20]  David R. Karger,et al.  Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.

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

[22]  Hari Balakrishnan,et al.  Resilient overlay networks , 2001, SOSP.

[23]  Vern Paxson,et al.  Measurements and analysis of end-to-end Internet dynamics , 1997 .