For the most recent entries see the Petri Nets Newsletter.

Discovering Chatter and Incompleteness in the Datagram Congestion Control Protocol.

Vanit-Anunchai, Somsak; Billington, Jonathan; Kongprakaiwoot, Tul

In: Farn Wang (Eds.): Lecture Notes in Computer Science, 3731: Formal Techniques for Networked and Distributed Systems - FORTE 2005: 25th IFIP WG 6.1 International Conference, Taipei, Taiwan, October 2-5, 2005., pages 143-158. Springer-Verlag, October 2005. URL:,.

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.

Keywords: DCCP, Internet Protocols, Coloured Petri Nets, State space methods.

Do you need a refined search? Try our search engine which allows complex field-based queries.

Back to the Petri Nets Bibliography