Discovering chatter and incompleteness in the datagram congestion control protocol

Authors:
Somsak Vanit-Anunchai;Jonathan Billington;Tul Kongprakaiwoot
Affiliations:
Computer Systems Engineering Centre, University of South Australia, Mawson Lakes Campus, SA, Australia;Computer Systems Engineering Centre, University of South Australia, Mawson Lakes Campus, SA, Australia;TextMe Co., Ltd., Bangkok, Thailand
Venue:
FORTE'05 Proceedings of the 25th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
Year:
2005

Citing 3
Cited 5

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

Coloured Petri nets: basic concepts, analysis methods and practical use, volume 3
Application of Petri Nets to Communication Networks, Advances in Petri Nets

Application of Petri Nets to Communication Networks, Advances in Petri Nets
Validating TCP connection management

CRPIT '02 Proceedings of the conference on Application and theory of petri nets: formal methods in software engineering and defence systems - Volume 12

Designing DCCP: congestion control without reliability

Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Coloured Petri Net Modelling of an Evolving Internet Standard: the Datagram Congestion Control Protocol

Fundamenta Informaticae - PETRI NETS 2007
A novel congestion control algorithm based on adaptive traffic delay

WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Modelling the datagram congestion control protocol's connection management and synchronization procedures

ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
Coloured Petri Net Modelling of an Evolving Internet Standard: the Datagram Congestion Control Protocol

Fundamenta Informaticae - PETRI NETS 2007

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new protocol designed for real-time applications, the Datagram Congestion Control Protocol (DCCP), is specified informally in a final Internet Draft that has been approved as an RFC (Request For Comment). This paper analyses DCCP’s connection management procedures modelled using Coloured Petri Nets (CPNs). The protocol has been modelled at a sufficient level of detail to obtain interesting results including pinpointing areas where the specification is incomplete. Our analysis discovers scenarios where the client and server repeatedly and needlessly exchange packets. This creates a lot of unnecessary traffic, inducing more congestion in the Internet. We suggest a modification to the protocol that we believe solves this problem.