Using loss pairs to discover network properties

Accurate estimation of network characteristics based on endpoint measurements is a challenging and important problem. In this paper we propose and evaluate a new tool for the discovery of network charactertics called loss pairs. A loss pair is a pair of packets travelling the same path and close together in time, such that exactly one of the two packets is dropped in the network. Loss pairs provide insight into network conditions close to the time when loss is occuring. Using loss pairs, we show that it is possible to characterize the packet dropping behavior of drop-tail and AQM routers internal to the network, from measurements made at end systems. Furthermore, we show that loss pairs can be used to estimate bottleneck buffer sizes of droptail routers. An attractive feature of loss pairs is that they lend themselves naturally to use in a passive-measurement setting. Using such an approach, we show that loss pairs provide estimates that are generally accurate and robust over a wide range of network conditions.

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

[2]  Matt Mathis.  TReno Bulk Transfer Capacity , 1999 .

[3]  Mary Baker,et al.  Measuring bandwidth , 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).

[4]  QUTdN QeO,et al.  Random early detection gateways for congestion avoidance , 1993, TNET.

[5]  Srinivasan Seshan,et al.  SPAND: Shared Passive Network Performance Discovery , 1997, USENIX Symposium on Internet Technologies and Systems.

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

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

[8]  Srinivasan Keshav.  A control-theoretic approach to flow control , 1991, SIGCOMM 1991.

[9]  Kang G. Shin,et al.  Stochastic fair blue: a queue management algorithm for enforcing fairness , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[10]  Azer Bestavros,et al.  Measuring bottleneck bandwidth of targeted path segments , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[11]  Deborah Estrin,et al.  Recommendations on Queue Management and Congestion Avoidance in the Internet , 1998, RFC.

[12]  Kang G. Shin,et al.  BLUE: an alternative approach to active queue management , 2001, NOSSDAV '01.

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

[14]  Walter Willinger,et al.  Self-similarity through high-variability: statistical analysis of Ethernet LAN traffic at the source level , 1997, TNET.

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

[16]  Donald F. Towsley,et al.  Multicast-based inference of network-internal loss characteristics , 1999, IEEE Trans. Inf. Theory.

[17]  Kihong Park,et al.  On the relationship between file sizes, transport protocols, and self-similar network traffic , 1996, Proceedings of 1996 International Conference on Network Protocols (ICNP-96).

[18]  Vern Paxson,et al.  On estimating end-to-end network path properties , 2001, SIGCOMM LA '01.

[19]  Stefan Savage,et al.  Sting: A TCP-based Network Measurement Tool , 1999, USENIX Symposium on Internet Technologies and Systems.

[20]  Azer Bestavros,et al.  Robust identification of shared losses using end-to-end unicast probes , 2000, Proceedings 2000 International Conference on Network Protocols.

[21]  Jean-Chrysostome Bolot,et al.  Characterizing End-to-End Packet Delay and Loss in the Internet , 1993, J. High Speed Networks.