Effect of Sequence Number Wrap on DCCP Connection Establishment

This paper investigates the connection establishment procedures of the Datagram Congestion Control Protocol (DCCP) when sequence numbers wrap. A formal executable specification of DCCP connection management is obtained using Coloured Petri Nets. The model includes the synchronization procedure, sequence number wrapping and the algorithm for extending short sequence numbers. We discover that during connection establishment if sequence numbers wrap, it is possible that the attempt to set up the connection fails.

[1]  Jon Postel,et al.  User Datagram Protocol , 1980, RFC.

[2]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[3]  Jonathan Billington,et al.  Application of Petri Nets to Communication Networks: Advances in Petri Nets , 1999 .

[4]  Jonathan Billington,et al.  Checking safety properties on-the-fly with the sweep-line method , 2007, International Journal on Software Tools for Technology Transfer.

[5]  Jonathan Billington,et al.  A Coloured Petri Net Approach to Protocol Verification , 2003, Lectures on Concurrency and Petri Nets.

[7]  Kurt Jensen,et al.  Coloured Petri Nets: Basic Concepts, Analysis Methods and Practical Use. Vol. 2, Analysis Methods , 1992 .

[8]  Eddie Kohler,et al.  Profile for Datagram Congestion Control Protocol (DCCP) Congestion Control ID 3: TCP-Friendly Rate Control (TFRC) , 2006, RFC.

[9]  Jonathan Billington,et al.  Termination Properties of TCP's Connection Management Procedures , 2005, ICATPN.

[10]  Jon Postel,et al.  Transmission Control Protocol , 1981, RFC.

[11]  Mark Handley,et al.  Datagram Congestion Control Protocol (DCCP) , 2006, RFC.

[12]  Aaas News,et al.  Book Reviews , 1893, Buffalo Medical and Surgical Journal.

[13]  Jonathan Billington,et al.  Discovering Chatter and Incompleteness in the Datagram Congestion Control Protocol , 2005, FORTE.

[14]  Lixia Zhang,et al.  Stream Control Transmission Protocol , 2000, RFC.

[15]  Eddie Kohler,et al.  Profile for Datagram Congestion Control Protocol (DCCP) Congestion Control ID 2: TCP-like Congestion Control , 2006, RFC.

[16]  August 29-September.  8th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems , 2000, Proceedings 8th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (Cat. No.PR00728).

[17]  Jonathan Billington,et al.  Validating TCP connection management , 2002, FME 2002.

[18]  Mark Handley,et al.  Problem Statement for the Datagram Congestion Control Protocol (DCCP) , 2006, RFC.

[19]  Jonathan Billington,et al.  Application of Petri Nets to Communication Networks , 1999, Lecture Notes in Computer Science.