Skip to main content

Modelling the Datagram Congestion Control Protocol’s Connection Management and Synchronization Procedures

  • Conference paper

Part of the Lecture Notes in Computer Science book series (LNTCS,volume 4546)

Abstract

The Datagram Congestion Control Protocol (DCCP) is a new transport protocol standardised by the Internet Engineering Task Force in March 2006. This paper specifies the connection management and synchronisation procedures of DCCP using Coloured Petri nets (CPNs). After introducing the protocol, we describe how the CPN model has evolved as DCCP was being developed. We focus on our experience of incremental enhancement and iterative modelling in the hope that this will provide guidance to those attempting to build complex protocol models. In particular we discuss how the architecture, data structures and specification style of the model have evolved as DCCP was developed. The impact of this work on the DCCP standard is also briefly discussed.

Keywords

  • Internet Protocols
  • DCCP
  • Coloured Petri Nets
  • Formal Specification

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/978-3-540-73094-1_25
  • Chapter length: 22 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   89.00
Price excludes VAT (USA)
  • ISBN: 978-3-540-73094-1
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   119.99
Price excludes VAT (USA)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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, Advances in Petri Nets. LNCS, vol. 3098, pp. 210–290. Springer, Heidelberg (2004)

    Google Scholar 

  2. Floyd, S., Handley, M., Kohler, E.: Problem Statement for the Datagram Congestion Control Protocol (DCCP), RFC 4336 (March 2006) Available via http://www.rfc-editor.org/rfc/rfc4336.txt

  3. Floyd, S., Kohler, E.: Profile for Datagram Congestion Control Protocol (DCCP) Congestion Control ID 2: TCP-like Congestion Control, RFC 4341 (March 2006) Available via http://www.rfc-editor.org/rfc/rfc4341.txt

  4. Floyd, S., Kohler, E., Padhye, J.: Profile for Datagram Congestion Control Protocol (DCCP) Congestion Control ID 3: TCP-Friendly Rate Control (TFRC), RFC 4342 (March 2006) Available via http://www.rfc-editor.org/rfc/rfc4342.txt

  5. Gallasch, G.E., Billington, J., Vanit-Anunchai, S., Kristensen, L.M.: Checking Safety Properties On-The-Fly with the Sweep-line Method. In: International Journal on Software Tools for Technology Transfer, Springer, Heidelberg (to appear 2007)

    Google Scholar 

  6. Han, B.: Formal Specification of the TCP Service and Verification of TCP Connection Management. PhD thesis, Computer Systems Engineering Centre, School of Electrical and Information Engineering, University of South Australia, South Australia (December 2004)

    Google Scholar 

  7. Jensen, K.: Coloured Petri Nets: Basic Concepts, Analysis Methods and Practical Use. vol. 1, Basic Concepts. Monographs in Theoretical Computer Science. Springer, Heidelberg (2nd edition, 1997)

    Google Scholar 

  8. Kohler, E., Handley, M., Floyd, S.: Designing DCCP: Congestion Control Without Reliability. In: Proceedings of the 2006 ACM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM’06), Pisa, Italy, pp. 27–38 (September 11-15, 2006)

    Google Scholar 

  9. Kohler, E., Handley, M., Floyd, S.: Datagram Congestion Control Protocol, draft-ietf-dccp-spec-6 (February 2004) Available via http://www.read.cs.ucla.edu/dccp/draft-ietf-dccp-spec-06.txt

  10. Kohler, E., Handley, M., Floyd, S.: Datagram Congestion Control Protocol, draft-ietf-dccp-spec-7 (July 2004) Available via http://www.read.cs.ucla.edu/dccp/draft-ietf-dccp-spec-07.txt

  11. Kohler, E., Handley, M., Floyd, S.: Datagram Congestion Control Protocol, draft-ietf-dccp-spec-11 (March 2005) Available via http://www.read.cs.ucla.edu/dccp/draft-ietf-dccp-spec-11.txt

  12. Kohler, E., Handley, M., Floyd, S.: Datagram Congestion Control Protocol, draft-ietf-dccp-spec-13 (December 2005) Available via http://www.read.cs.ucla.edu/dccp/draft-ietf-dccp-spec-13.txt

  13. Kohler, E., Handley, M., Floyd, S.: SUBSTANTIVE DIFFERENCES BETWEEN draft-ietf-dccp-spec-11 AND draft-ietf-dccp-spec-12 (December 2005) Available via http://www.read.cs.ucla.edu/dccp/diff-spec-11-12-explain.txt

  14. Kohler, E., Handley, M., Floyd, S.: Datagram Congestion Control Protocol, RFC 4340 (March 2006) Available via http://www.rfc-editor.org/rfc/rfc4340.txt

  15. Kohler, E., Handley, M., Floyd, S.: SUBSTANTIVE DIFFERENCES BETWEEN draft-ietf-dccp-spec-13 AND RFC 4340 March (2006) Available via http://www.read.cs.ucla.edu/dccp/diff-spec-13-rfc-explain.txt

  16. Kohler, E., Handley, M., Floyd, S., Padhye, J.: Datagram Congestion Control Protocol, draft-ietf-dccp-spec-5 (October 2003) Available via http://www.read.cs.ucla.edu/dccp/draft-ietf-dccp-spec-05.txt

  17. Kongprakaiwoot, T.: Verification of the Datagram Congestion Control Protocol using Coloured Petri Nets. Master’s thesis, Computer Systems Engineering Centre, School of Electrical and Information Engineering, University of South Australia, South Australia (November 2004)

    Google Scholar 

  18. University of Aarhus. Design/CPN Online. Department of Computer Science (2004) Available via http://www.daimi.au.dk/designCPN/

  19. Vanit-Anunchai, S., Billington, J.: Initial Result of a Formal Analysis of DCCP Connection Management. In: Proceedings of Fourth International Network Conference (INC 2004), pp. 63–70, Plymouth, UK, 6-9 July 2004. University of Plymouth (2004)

    Google Scholar 

  20. Vanit-Anunchai, S., Billington, J.: Effect of Sequence Number Wrap on DCCP Connection Establishment. In: Proceedings of the 14th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems (MASCOTS), Monterey, California, USA, 11-13 September 2006, pp. 345–354. IEEE Computer Society Press, Washington (2006)

    Google Scholar 

  21. Vanit-Anunchai, S., Billington, J.: Chattering Behaviour in the Datagram Congestion Control Protocol. IEE Electronics Letters 41(21), 1198–1199 (2005)

    CrossRef  Google Scholar 

  22. Vanit-Anunchai, S., Billington, J., Gallasch, G.E.: Sweep-line Analysis of DCCP Connection Management. In: Proceeding of the Seventh Workshop and Tutorial on Practical Use of Coloured Petri Nets and the CPN Tools, Technical Report, DAIMI PB-579, Aarhus, Denmark, 24-26 October, pp. 157–175, Department of Computer Science, University of Aarhus. ( 2006) Available via http://www.daimi.au.dk/CPnets/workshop06/cpn/papers/

  23. Vanit-Anunchai, S., Billington, J., Kongprakaiwoot, T.: Discovering Chatter and Incompleteness in the Datagram Congestion Control Protocol. In: Wang, F. (ed.) FORTE 2005. LNCS, vol. 3731, pp. 143–158. Springer, Heidelberg (2005)

    CrossRef  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

Vanit-Anunchai, S., Billington, J. (2007). Modelling the Datagram Congestion Control Protocol’s Connection Management and Synchronization Procedures. In: Kleijn, J., Yakovlev, A. (eds) Petri Nets and Other Models of Concurrency – ICATPN 2007. ICATPN 2007. Lecture Notes in Computer Science, vol 4546. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73094-1_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-73094-1_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-73093-4

  • Online ISBN: 978-3-540-73094-1

  • eBook Packages: Computer ScienceComputer Science (R0)