@@ Page 31, Section 5.6 @@
         12.3.
 
     12-127, Reserved
-        Receivers should treat these codes like Reset Code 0,
+        Receivers should treat these codes as they do Reset Code 0,
         "Unspecified".
 
     128-255, CCID-specific codes
         Semantics depend on the connection's CCIDs.  See Section 10.3.
-        Receivers should treat unknown CCID-specific Reset Codes like
-        Reset Code 0, "Unspecified".
+        Receivers should treat unknown CCID-specific Reset Codes as they
+        do Reset Code 0, "Unspecified".
 
     The following table summarizes this information.
 
@@ Page 62, Section 8.1.2 @@
     discretion, be associated with more than one Service Code; this
     might let multiple applications, or multiple versions of the same
     application, listen on the same port, differentiated by Service
-    Code.  If the DCCP-Request's Service Code doesn't match any of the
+    Code.  If the DCCP-Request's Service Code doesn't equal any of the
     server's Service Codes for the given port, the server MUST reject
     the request by sending a DCCP-Reset packet with Reset Code 8, "Bad
     Service Code".  A middlebox MAY also send such a DCCP-Reset in
@@ Page 63, Section 8.1.2 @@
     o  Service Code 0 represents the absence of a meaningful Service
        Code, and MUST NOT be allocated.
 
-    o  The value 4294967295 is an invalid Service Code, and MUST NOT
-       appear in the Service Code field of a DCCP-Request or DCCP-
-       Response packet.
+    o  The value 4294967295 is an invalid Service Code.  Servers MUST
+       reject any DCCP-Request with this Service Code value by sending a
+       DCCP-Reset packet with Reset Code 8, "Bad Service Code".
 
     This design for Service Code allocation is based on the allocation
     of 4-byte identifiers for Macintosh resources, PNG chunks, and
@@ Page 71, Section 8.5 @@
              return
 
     Step 2: Check ports and process TIMEWAIT state
+       /* Flow ID is <src addr, src port, dst addr, dst port> 4-tuple */
        Look up flow ID in table and get corresponding socket
        If no socket, or S.state == TIMEWAIT,
           Generate Reset(No Connection) unless P.type == Reset
@@ Page 110, Section 17.2 @@
     Since DCCP doesn't provide reliable, ordered delivery, multiple
     application sub-flows may be multiplexed over a single DCCP
     connection with no inherent performance penalty.  Thus, there is no
-    need for DCCP to provide built-in, SCTP-style support for multiple
-    sub-flows.
+    need for DCCP to provide built-in support for multiple sub-flows.
+    This differs from SCTP [RFC 2960].
 
     Some applications might want to share congestion control state among
     multiple DCCP flows that share the same source and destination
@@ Page 115, Section 19.9 @@
 
     o  The port number that is requested to be registered.
 
-    o  A short English phrase describing the port's purpose.  This
-       SHOULD include one or more space-separated textual Service Code
+    o  A short English phrase describing the port's purpose.  This MUST
+       include one or more space-separated textual Service Code
        descriptors naming the port's corresponding Service Codes (see
        Section 8.1.2).
 
@@ Page 116, Section 19.9 @@
        indicate a contact person.
 
     Registrants are encouraged to follow these guidelines when
-    submitting a registration:
+    submitting a registration.  The guidelines may be violated at IANA's
+    discretion.
 
     o  A port name SHOULD NOT be registered for more than one DCCP port
        number.
@@ Page 118, Appendix A @@
 
                 <=== buf_head and buf_tail move this way <===
 
-    Each `S,L' represents a State/Run length byte.  We will draw these
+    Each "S,L" represents a State/Run length byte.  We will draw these
     buffers showing only their live portion, and will add an annotation
     showing the Acknowledgement Number for the last live byte in the
     buffer.  For example:
@@ Page 128, Section 20 @@
 
 Full Copyright Statement
 
-    Copyright (C) The Internet Society (2005).  This document is subject
+    Copyright (C) The Internet Society 2005.  This document is subject
     to the rights, licenses and restrictions contained in BCP 78, and
     except as set forth therein, the authors retain all their rights.