Abstract
In this paper we describe how the completion time distribution for short TCP connections can be computed using Deterministic Stochastic Petri Net (DSPN) models of TCP protocol. A DSPN model of TCP is a representation of the finite state machine description of the TCP transmitter behavior, and provides an accurate description of the TCP dynamics. The DSPN requires as input only the packet loss probability, and the average round trip time for the TCP connections being considered. The proposed model has been validated by comparing it against simulation results in various network scenarios, thus proving that the model is accurate. Numerical results are presented to prove the flexibility and the potentialities of the proposed methodology.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
M. Ajmone Marsan, C. Casetti, R. Gaeta, and M. Meo. Performance analysis of TCP connections sharing a congested internet link. Performance Evaluation, 42(2–3), September 2000.
M. Allman, V. Paxon, and W. Stevens. TCP Congestion Control. Technical report, RFC 2581, April 1999.
N. Cardwell, S. Savage, and T. Anderson. Modeling TCP latency. In Proc. IEEE Infocom 2000, pages 1742–1751, Tel Aviv, Israel, March 2000. IEEE Comp. Soc. Press.
C. Casetti and M. Meo. A New approach to Model the Stationary Behavior of TCP Connections. In Proc. IEEE Infocom 2000, Tel Aviv, Israel, March 2000. IEEE Comp. Soc. Press.
J.C.A. de Figueiredo and L. M. Kristensen. Using Coloured Petri nets to investigate behavioural and performance issues of TCP protocols. In Proc. of the 2nd Workshop on the Practical Use of Coloured Petri Nets and De-sign/CPN, 1999.
S. Floyd and T. Henderson. The NewReno Modification to TCP,s Fast Recovery Algorithm. Technical report, RFC 2582, 1999.
S. Floyd and V. Jacobson. Random Early Detection Gateways for Congestion Avoidance. IEEE/ACM Transaction on Networking, 1(4), August 1997.
M. Garetto, R. Lo Cigno, M. Meo, and M. Ajmone Marsan. A Detailed and Accurate Closed Queueing Network Model of Many Interacting TCP Flows. In Proc. IEEE Infocom 2001, Anchorage, Alaska, USA, 2001. IEEE Comp. Soc. Press.
R. German. Performance Analysis of Communication Systems: Modeling with Non-Markovian Stochastic Petri Nets. John Wiley and Sons, 2000.
M. Gribaudo. Transient Solution Methods for Deterministic Stochastic Petri Nets. Technical report, Università di Torino, 2002. http://www.di.unito.it/~marcog/res.html.
V. Jacobson. Congestion avoidance and control. In Proc. ACM SIGCOMM’ 88, 1988. An updated version is avaliable via ftp://ftp.ee.lbl.gov/papers/congavoid.ps.Z.
E. Király, M. Garetto, R. Lo Cigno, M. Meo, and M. Ajmone Marsan. Computation of the Completion Time Time Distribution of Short-Lived TCP Connections. Technical report, Politecnico di Torino, 2002.
C. Lindemann. Performance Modelling with Deterministic and Stochastic Petri Nets. John Wiley and Sons, 1998.
R. Lo Cigno and M. Gerla. Modelling Window Based Congestion Control Protocols with Many Flows. In Proc. Performance 1999, Istanbul, Turkey, 1999.
S. MCanne and S. Floyd. ns-2 network simulator (ver.2). Technical report, 1997. URL http://www.isi.edu/nsnam/ns/.
A. Ost and B. R. Haverkort. Analysis of Windowing Mechanisms with Infinite-State Stochastic Petri Nets. ACM Performance Evaluation Review, 26(8):38–46, 1998.
J. Padhye, V. Firoiu, D. Towsley, and J. Kurose. Modeling TCP Reno performance: a simple model and its empirical validation. IEEE/ACM Transaction on Networking, 8(2):133–145, 2000.
V. Paxon. End-to-End Internet Packet Dynamics. IEEE/ACM Transaction on Networking, 7(3), June 1999.
J. Postel. Transmission Control Protocol. Technical report, RFC 793, September 1981.
W. Stevens. TCP Slow Start, Fast retransmit, and Fast Recovery Algorithms. Technical report, RFC 2001, IETF, Jan 1997.
K. Thompson, G. Miller, and R. Wilder. Wide-area internet traffic patterns and charateristics. IEEE Network, 11(6), Nov–Dec 1997.
A. Wolman, G. Voelker, N. Sharma, N. Cardwell, M. Brown, T. Landray, D. Pinnel, A. Karlin, and H. Levy. Organization-Based Analysis of Web-Object Sharing and Caching. In Proceedings of USENIX Symposium on Internet Technologies and Systems, October 1999.
Y. Zhang, V. Paxson, and S. Shenker. The Stationarity of Internet Path Properties: Routing, Loss, and Throughput. Technical report, AT&T Center for Internet Research at ICSI, http://www.aciri.org/, May 2000.
Y. Zhou, T. Murata, and T.A. DeFanti. Modeling and performance analysis using extended fuzzy-timing Petri nets for networked virtual environments. IEEE Trans. on Systems, Man, and Cybernetics; B: Cybernetics, 30(5):737–756, 2000.
A. Zimmermann, R. German, J. Freiheit, and G. Hommel. TimeNET 3.0 Tool Description. In 8th Intern. Workshop on Petri Nets and Performance Models, Zaragoza, Spain, Sep 1999. IEEE-CS Press.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gaeta, R., Gribaudo, M., Manini, D., Sereno, M. (2003). On the Use of Petri Nets for the Computation of Completion Time Distribution for Short TCP Transfers. In: van der Aalst, W.M.P., Best, E. (eds) Applications and Theory of Petri Nets 2003. ICATPN 2003. Lecture Notes in Computer Science, vol 2679. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44919-1_14
Download citation
DOI: https://doi.org/10.1007/3-540-44919-1_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40334-0
Online ISBN: 978-3-540-44919-5
eBook Packages: Springer Book Archive