Modelling and analysing the functional behaviour of TCP’s connection management procedures

Authors:
Jonathan Billington;Bing Han
Affiliations:
University of South Australia, Computer Systems Engineering Centre, School of Electrical and Information Engineering, Mawson Lakes Campus, 5095, Mawson Lakes, SA, Australia;bogus, bogus, 224, Leicester Street, 3053, Carlton, Victoria, Australia
Venue:
International Journal on Software Tools for Technology Transfer (STTT)
Year:
2007

Citing 0
Cited 7

Formalising TCP's Data Transfer Service Language: A Symbolic Automaton and its Properties

Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Formal Specification and Validation of Secure Connection Establishment in a Generic Access Network Scenario

PETRI NETS '08 Proceedings of the 29th international conference on Applications and Theory of Petri Nets
Coloured Petri Net Modelling of an Evolving Internet Standard: the Datagram Congestion Control Protocol

Fundamenta Informaticae - PETRI NETS 2007
Modelling and Validation of Secure Connection Establishment in a Generic Access Network Scenario

Fundamenta Informaticae - Petri Nets 2008
Modelling and Validation of Secure Connection Establishment in a Generic Access Network Scenario

Fundamenta Informaticae - Petri Nets 2008
Coloured Petri Net Modelling of an Evolving Internet Standard: the Datagram Congestion Control Protocol

Fundamenta Informaticae - PETRI NETS 2007
Formalising TCP's Data Transfer Service Language: A Symbolic Automaton and its Properties

Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz

Quantified Score

Hi-index	0.00

Visualization

Abstract

The transmission control protocol (TCP) is the most widely used transport protocol in the Internet. It provides a reliable data transfer service to many applications. In this paper, Coloured Petri Nets are used to model TCP’s connection management procedures. The model is created to verify TCP’s functional correctness (e.g. the absence of deadlocks and livelocks). We discuss different modelling approaches to motivate the approach taken. The paper defines the termination property of TCP’s connection management procedures, including the notions of desired and acceptable terminal states. Finally, we analyse TCP’s connection management procedures operating over re-ordering non-lossy and lossy channels. This is done incrementally and considers 11 different configurations. The analysis provides some insights into TCP’s behaviour where in certain circumstances the protocol fails to establish or terminate successfully.