RFC 142
Time-Out Mechanism in the Host-Host Protocol
Time-out Mechanism in the Host-Host Protocol π¦
- Network Working Group πΈ Β· Request for Comments #142 Β· NIC #6727
- Authors: Charley Kline and Johnny Wong, UCLA (NMC) π
- Categories: C.1, C.2, C.3, C.5
- Date: 3 May 71
- Updates: none
- Obsoletes: none
So what can actually happen? π
Okay bestie, when you send a message to a foreign site, one of four things can happen:
- Destination IMP down - a Type 7 message comes back π
- Destination IMP up but destination IMP-HOST interface down - a Type 7 message comes back π
- Destination IMP and IMP-HOST interface up, but the IMP-HOST interface is not taking messages - a Type 9 message comes back after the IMP time-out (ask BBN for time) π
- Destination IMP and IMP-HOST interface up, and the IMP-HOST interface is taking messages - a Type 5 (rfnm) message comes back β¨
A suggestion for handling Type 7 and Type 9 messages was already made in NWG/RFC #117 π§. This doc is about the next question, and it's a big one: what's supposed to happen to the HOST-HOST protocol when a rfnm comes back? π€
The wait-match drama π
When an NCP sends out a STR or RTS control command on a pair of sockets and gets a rfnm back, that pair of sockets is now in a wait-match state π¦. Everything is fine if a matching RTS or STR, or a CLS, comes back after a reasonable amount of delay. The trouble starts when nothing comes back after a long time π©.
This can happen if the NCP isn't running at all but its host is still taking in messages (e.g. UCLA's host will receive messages even if the NCP is not running), or if the NCP is running very slowly. Same problem if you send out a CLS control command and a matching CLS never comes back. The real issue is that resources stay tied up (sockets, links, and table space in the NCP), and we'd really like to release them π§Ή.
In our implementation, when a user does a CLOSE, we can't release the sockets until the matching CLS comes back. This protects us from getting confused if a second request is made for the same pair of sockets π‘οΈ. The fix for all this is a time-out mechanism in the Host-Host protocol, and it works like this:
ne 5 (the stray text you'll see here is a page-break leftover from the original, so we're keeping it as a little souvenir π
)
a. On sending out a STR or RTS, if you do not get back a matching RTS or STR, or a CLS, in T time units, a CLS will be sent. After sending the time-out CLS, the race condition can be avoided by ignoring the matching RTS or STR that arrives before the matching CLS π ββοΈ.
b. On sending out a CLS (any kind, including the time-out CLS), and if you do not get back a matching CLS in T time units, the matching CLS is assumed to have returned. However, if an RTS or STR is sent on the same pair of sockets anytime after the time-out and before a CLS is returned, and then we receive the CLS, there is no way to determine whether this returning CLS is for matching the previous CLS or for refusing the RTS or STR. (See the figure for detail.) π So far we could not solve this race condition except by assigning a sequence number to connections throughout the Network, which we don't think is a good solution at all π¬. Hence, we would like to bring the attention of the Host-Host Protocol Glitch Cleaning Committe to this problem. The time limit T should be a Network Standard and its value should be decided also β°.
Here's the figure, bestie. It's giving chaos πͺοΈ:
Reason Our NCP
------ -------
1. User requests connection 1. RTS ->
2. User gets tired requests CLS
(or NCP timeout) 2. CLS ->
3. No matching CLS returned in
T time units 3. CLS assumed returned
free socket and other
resources
4. User requests another connection
over same socket pair 4. RTS ->
5. CLS received ?? does it belong to
2 or 4?
Figure
[ This RFC was put into machine readable form for entry ] [ into the online RFC archives by Gert Doering 4/97]
π¦ where this page comes from
- ietf: rfc142 1971-05
- π girlified by claude-haiku-5-5 on : a language model's rewrite of the original, under its terms