@@ Page 11, Section 2 @@
All operations on DCCP sequence numbers, and comparisons such as
"greater" and "greatest", use circular arithmetic modulo 2**48.
This form of arithmetic preserves the relationships between sequence
- numbers as they roll over from 2**48 - 1 to 0. Note that the common
+ numbers as they roll over from 2**48 - 1 to 0. Implementation
+ strategies for DCCP sequence numbers will resemble those for other
+ circular arithmetic spaces, including TCP's sequence numbers [RFC
+ 793] and DNS's serial numbers [RFC 1982]. Note that the common
technique for implementing circular comparison using two's-
complement arithmetic, whereby A < B using circular arithmetic if
and only if (A - B) < 0 using conventional two's-complement
@@ Page 125, Informative References @@
[RFC 1948] S. Bellovin. Defending Against Sequence Number Attacks.
RFC 1948.
+ [RFC 1982] R. Elz and R. Bush. Serial Number Arithmetic. RFC 1982.
[RFC 2018] M. Mathis, J. Mahdavi, S. Floyd, and A. Romanow. TCP
Selective Acknowledgement Options. RFC 2018.