Share Email Print

Proceedings Paper

Analysis of windowing mechanisms with infinite-state stochastic petri nets
Author(s): Alexander Ost; Boudewijn R. Haverkort
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

In this paper we present a performance evaluation of windowing mechanisms in WWW applications. Previously, such mechanisms have been studied by means of measurements only, however, given suitable tool support, we show that such evaluations can also be performed conveniently using infinite-state stochastic Petri nets. We briefly present this class of stochastic Petri nets as well as the approach for solving the underlying infinite-state Markov chain using matrix-geometric methods. We then present a model of the TCP slow-start congestion avoidance mechanisms, subject to a typical WWW workload. The model is parameterized using measurement data for a national connection and an overseas connection. Our study shows how the maximum congestion window size, the connection release timeout and the packet loss probability influence the expected number of buffered segments at the server, the connection setup rate and the connection time. Furthermore, the crucial effect of correctly modeling the bursty nature of the system workload is illustrated by investigating several arrival models.

Paper Details

Date Published: 7 October 1998
PDF: 12 pages
Proc. SPIE 3530, Performance and Control of Network Systems II, (7 October 1998); doi: 10.1117/12.325863
Show Author Affiliations
Alexander Ost, Rheinisch-Westfaelische Technische Hochschule Aachen (Germany)
Boudewijn R. Haverkort, Rheinisch-Westfaelische Technische Hochschule Aachen (Germany)

Published in SPIE Proceedings Vol. 3530:
Performance and Control of Network Systems II
Wai Sum Lai; Robert B. Cooper, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?