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.
Chapter PDF
Similar content being viewed by others
References
Billington, J., Díaz, M., Rozenberg, G. (eds.): APN 1999. LNCS, vol. 1605. Springer, Heidelberg (1999)
Billington, J., Gallasch, G.E., Han, B.: A coloured petri net approach to protocol verification. In: Desel, J., Reisig, W., Rozenberg, G. (eds.) Lectures on Concurrency and Petri Nets. LNCS, vol. 3098, pp. 210–290. Springer, Heidelberg (2004)
Han, B., Billington, J.: Validating TCP connection management. In: Workshop on Software Engineering and Formal Methods, Conferences in Research and Practice in Information Technology, ACS, vol. 12, pp. 47–55 (2002)
Jensen, K.: Coloured Petri Nets: Basic Concepts, Analysis Methods and Practical Use. Monographs in Theoretical Computer Science, vol. 1-3. Springer, Berlin (1997)
Kohler, E., Floyd, S.: Datagram Congestion Control Protocol (DCCP) overview (2003), http://www.icir.org/kohler/dcp/summary.pdf
Kohler, E., Floyd, S. Datagram Congestion Control Protocol, Internet- Draft version 5. draft-ietf-dccp-spec-05.ps (October 2003), http://www.icir.org/kohler/dcp/
Kohler, E., Floyd, S.: Datagram Congestion Control Protocol, Internet- Draft version 6. draft-ietf-dccp-spec-06.ps (February 2004), http://www.icir.org/kohler/dcp/
Kohler, E., Floyd, S.: Datagram Congestion Control Protocol, Internet- Draft version 11. draft-ietf-dccp-spec-11.ps (March 2005), http://www.icir.org/kohler/dcp/
Kongprakaiwoot, T.: Verification of the Datagram Congestion Control Protocol Using Coloured Petri Nets. Master of Engineering Minor Thesis, Computer Systems Engineering Centre, University of South Australia (2004)
University of Aarhus (2004), Design/CPN Online, http://www.daimi.au.dk/~designCPN/
Vanit-Anunchai, S., Billington, J.: Initial Result of a Formal Analysis of DCCP Connection Management. In: Proc. Fourth International Network Conference, Plymouth, UK, July 2004, vol. 6-9, pp. 63–70 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 IFIP International Federation for Information Processing
About this paper
Cite this paper
Vanit-Anunchai, S., Billington, J., Kongprakaiwoot, T. (2005). Discovering Chatter and Incompleteness in the Datagram Congestion Control Protocol. In: Wang, F. (eds) Formal Techniques for Networked and Distributed Systems - FORTE 2005. FORTE 2005. Lecture Notes in Computer Science, vol 3731. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11562436_12
Download citation
DOI: https://doi.org/10.1007/11562436_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29189-3
Online ISBN: 978-3-540-32084-5
eBook Packages: Computer ScienceComputer Science (R0)