Modeling a transport layer protocol using first-order logic
SIGCOMM '86 Proceedings of the ACM SIGCOMM conference on Communications architectures & protocols
ACM Computing Surveys (CSUR)
Trade-off results for connection management
Theoretical Computer Science
Formal specification and verification of a connection establishment protocol
SIGCOMM '81 Proceedings of the seventh symposium on Data communications
Validating TCP connection management
CRPIT '02 Proceedings of the conference on Application and theory of petri nets: formal methods in software engineering and defence systems - Volume 12
Development of communication protocols using algebraic and temporal specifications
Computer Networks: The International Journal of Computer and Telecommunications Networking
The level of handshake required for managing a connection
Distributed Computing
IEEE Annals of the History of Computing
10 papers for the Ph.D. student in networking
ACM SIGCOMM Computer Communication Review
Structured streams: a new transport abstraction
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
A Diagnosis Algorithm for Distributed Computing Systems with Dynamic Failure and Repair
IEEE Transactions on Computers
Termination properties of TCP's connection management procedures
ICATPN'05 Proceedings of the 26th international conference on Applications and Theory of Petri Nets
A case for event-driven distributed objects
ODBASE'06/OTM'06 Proceedings of the 2006 Confederated international conference on On the Move to Meaningful Internet Systems: CoopIS, DOA, GADA, and ODBASE - Volume Part II
| Hi-index | 0.00 |
This paper discusses techniques for selecting and synchronizing sequence numbers such that no errors will occur if certain network characteristics can be bounded and if adequate data error detection measures are taken. The discussion specifically focuses on the protocol described by Cerf and Kahn, (1) but the ideas are applicable to other similar protocols.