Analysis of the Datagram Congestion Control Protocol’s connection management procedures using the sweep-line method

  • Authors:

  • Somsak Vanit-Anunchai;Jonathan Billington;Guy Edward Gallasch

  • Affiliations:

  • University of South Australia, Computer Systems Engineering Centre, School of Electrical and Information Engineering, 5095, Mawson Lakes Campus, SA, Australia;University of South Australia, Computer Systems Engineering Centre, School of Electrical and Information Engineering, 5095, Mawson Lakes Campus, SA, Australia;University of South Australia, Computer Systems Engineering Centre, School of Electrical and Information Engineering, 5095, Mawson Lakes Campus, SA, Australia

  • Venue:
  • International Journal on Software Tools for Technology Transfer (STTT)
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

State space explosion is a key problem in the analysis of finite state systems. The sweep-line method is a state exploration method which uses a notion of progress to allow states to be deleted from memory when they are no longer required. This reduces the peak number of states that need to be stored, while still exploring the full state space. The technique shows promise but has never achieved reductions greater than about a factor of 10 in the number of states stored in memory for industrially relevant examples. This paper discusses sweep-line analysis of the connection management procedures of a new Internet standard, the Datagram Congestion Control Protocol (DCCP). As the intuitive approaches to sweep-line analysis are not effective, we introduce new variables to track progress. This creates further state explosion. However, when used with the sweep-line, the peak number of states is reduced by over two orders of magnitude compared with the original. Importantly, this allows DCCP to be analysed for larger parameter values.