A Parametric State Space for the Analysis of the Infinite Class of Stop-and-Wait Protocols

Gallasch, Guy Edward; Billington, Jonathan

doi:10.1007/11691617_12

Cited by 11 publications

(10 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…When MaxBufSize= 1, the results presented here should be the same as those for the Stop-and-Wait protocol investigated in [7] where it was proved that the channel bounds were given by 2MaxRetrans + 1. If we substitute W=1 in equations (7) and (8) we obtain the same results:…”

Section: Channel Boundssupporting

confidence: 62%

See 1 more Smart Citation

An investigation of credit-based flow control protocols

Billington¹,

Saboo²

2008

Proceedings of the First International ICST Conference on Simulation Tools and Techniques for Communications Networks and Syste

Self Cite

View full text Add to dashboard Cite

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.

show abstract

Section: Channel Boundssupporting

confidence: 62%

“…Figure 1: Credit-based flow control scenario quence number) [6,7]. All the work mentioned above uses acknowledgements for both flow control and error control.…”

Section: Retransmission Timer Expiresmentioning

confidence: 99%

An investigation of credit-based flow control protocols

Billington¹,

Saboo²

2008

Proceedings of the First International ICST Conference on Simulation Tools and Techniques for Communications Networks and Syste

Self Cite

View full text Add to dashboard Cite

show abstract

“…Fig. 6(c) illustrates case 1c, where 6 there is no direct transition nor a candidate sequence of F SA l−1 . From v 1 to v 9 , there is no direct transition and only one candidate sequence in F SA l−1 but its last transition is labelled by t 2 , rather than t 3 , so it is not a corresponding candidate sequence.…”

Section: Proving the Sufficient Conditionmentioning

confidence: 99%

Recursive Parametric Automata and ε-Removal

Liu¹,

Billington

2009

Formal Techniques for Distributed Systems

Self Cite

View full text Add to dashboard Cite

This work is motivated by and arose from the parametric verification of communication protocols over unbounded channels, where the channel capacity is the parameter. Verification required the use of finite state automata (FSA) reduction, including-removal, for a specific infinite family of FSA. This paper generalises this work by introducing Recursive Parametric FSA (RP-FSA), an infinite family of FSA that can be represented recursively in a single parameter. Further, the paper states and proves a necessary and sufficient condition regarding the transformation of a RP-FSA to its language equivalent-removed family of FSA that is also a RP-FSA in the same parameter. This condition also guarantees a further structural property regarding the RP-FSA and its-removed family.

show abstract

“…Several examples of the TCP protocol verification are in [8,13,18,23,[35][36][37]. As regards parametric verification, the Bounded Retransmission Protocol (BRP) for manually derived constraints has been checked by parametric model-checking in [19], the Stop-and-Wait Protocol (SWP) has been targeted in [15] for all possible values of the maximum sequence number and the maximum number of retransmissions parameters. We are not aware of any formal verification method that would address the bifurcations of the protocol behaviour.…”

Section: Introductionmentioning

confidence: 99%

Digital Bifurcation Analysis of TCP Dynamics

Beneš

Brim

Pastva

et al. 2019

Tools and Algorithms for the Construction and Analysis of Systems

View full text Add to dashboard Cite

Digital bifurcation analysis is a new algorithmic method for exploring how the behaviour of a parameter-dependent computer system varies with a change in its parameters and, in particular, for identification of bifurcation points where such variation becomes dramatic. We have developed the method in an analogy with the traditional bifurcation theory and have it successfully applied to models taken from systems biology. In this case study paper, we demonstrate the appropriateness and usefulness of the digital bifurcation analysis as a push-button alternative to the classical approaches as traditionally used for analysing the stability of TCP/IP protocols. We consider two typical examples (congestion control and buffer sizes throughput influence) and show that the method provides the same results as obtained with classical non-automatic analytical and numerical methods.

show abstract

A Parametric State Space for the Analysis of the Infinite Class of Stop-and-Wait Protocols

Cited by 11 publications

References 11 publications

An investigation of credit-based flow control protocols

An investigation of credit-based flow control protocols

Recursive Parametric Automata and ε-Removal

Digital Bifurcation Analysis of TCP Dynamics

Contact Info

Product

Resources

About