Please use this identifier to cite or link to this item: http://hdl.handle.net/1959.3/3628

Download PDF (Published version) (Adobe Acrobat PDF, -1 bytes)

Title

Dynamic performance limits of the Benko-Veres Passive TCP packet loss estimation algorithm

Author(s)

Armitage, Grenville;  Favi, Claudio

Abstract

In this paper we evaluate and discuss the performance of a passive TCP packet loss estimation algorithm described by Benko and Veres. Our analysis is motivated by recent work modeling web traffic patterns and the network conditions experienced by TCP sessions carrying web traffic. We experimentally determine the dynamic characteristics of the Benko-Veres estimation algorithm, focusing on how quickly the algorithm converges to a reasonable estimate of packet loss rate for a given TCP session and path. The Benko-Veres algorithm is stimulated in a small IP network testbed, using repeated TCP sessions over a path with variable and controlled packet loss rates. Our results show that the Benko-Veres algorithm requires many packets and loss events before it converges to reasonably accurate loss rate estimates. Finally we identify and discuss the limited real-world scenarios where this method of passive, external estimation of packet loss rates can be applied.

Publication type

Conference paper

Research centre

Swinburne University of Technology. Faculty of Information and Communication Technologies

Source

Proceedings of the Australian Telecommunications Networks and Applications Conference 2004 (ATNAC2004), Sydney, New South Wales, Australia, 08-10 December 2004

Publication year

2004

Publisher

Australian Telecommunications Networks and Applications Conference

Copyright

Copyright © 2004, ATNAC Australia and the authors. Published version of this paper reproduced with the kind permission of the publisher.

Full text

Peer reviewed