An investigation of credit-based flow control protocols

Authors:
Jonathan Billington;Smit Saboo
Affiliations:
University of South Australia, SA, Australia;University of South Australia, SA, Australia
Venue:
Proceedings of the 1st international conference on Simulation tools and techniques for communications, networks and systems & workshops
Year:
2008

Citing 7
Cited 2

Coloured Petri nets: basic concepts, analysis methods and practical use, volume 3

Coloured Petri nets: basic concepts, analysis methods and practical use, volume 3
Computer Networks

Computer Networks
Verification of a Sliding Window Protocol Using IOA and MONA

FORTE/PSTV 2000 Proceedings of the FIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE XIII) and Protocol Specification, Testing and Verification (PSTV XX)
Coloured Petri Nets and CPN Tools for modelling and validation of concurrent systems

International Journal on Software Tools for Technology Transfer (STTT)
Verification and improvement of the sliding window protocol

TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Using parametric automata for the verification of the stop-and-wait class of protocols

ATVA'05 Proceedings of the Third international conference on Automated Technology for Verification and Analysis
A parametric state space for the analysis of the infinite class of stop-and-wait protocols

SPIN'06 Proceedings of the 13th international conference on Model Checking Software

Parametric Language Analysis of the Class of Stop-and-Wait Protocols

PETRI NETS '08 Proceedings of the 29th international conference on Applications and Theory of Petri Nets
A latency simulator for many-core systems

Proceedings of the 44th Annual Simulation Symposium

Quantified Score

Hi-index	0.01

Visualization

Abstract

Credit-based flow control mechanisms, such as those used in the Transmission Control Protocol, allow flow control and error control procedures of data transfer protocols to operate independently. We create a Coloured Petri Net model of a class of data transfer protocols, which uses retransmissions and acknowledgements for error control and "credits" for flow control. This model is characterized by 3 parameters: the maximum sequence number, the maximum number of retransmissions and the maximum receiver buffer size. From the analysis results, we derive expressions in these parameters for the channel bounds and the number of terminal states. These expressions are verified for a range of values of the parameters.