19
UNKNOWN
Two protocol suggestions to reduce congestion at swap bound nodes
Authors: J.E. Kreznar
Date: October 1969
Stream: Legacy
RFC 19
UNKNOWN
Network Working Group John E. Kreznar
Request For Comments: 19 SDC
7 October 1969
Two Protocol Suggestions to Reduce Congestion at Swap-Bound Nodes
There is a wide variance in swap rates between core and auxiliary store
among the HOST systems to be nodes in the ARPA IMP network. The slower
of these, of which our 360/50 system with 2303 drump swap store is an
example, might improve the utility of the network not only for
themselves but for all nodes if the two protocol suggestions of this
note were to be adopted.
<span class="h2"><a class="selflink" id="section-1" href="#section-1">1</a>. HOST control of ordering of IMP-to-HOST traffic. </span>IMP-HOST protocol
now calls for delivery of messages from IMP to HOST in the order in
which the IMP received them. This may lead to wasted swapping if,
for example, the IMP has messages for its HOST's timeshare users A
and B, in that order, at a time when user B is in HOST core. B
would have to be swapped out, A in, and the first message accepted--
only to discover that now A must be swapped out and B back in again.
If the HOST could a) read the IMP's queue of waiting messages and b)
accept them in the order it found most effective, then a new
mechanism for improvement of network efficiency would be at hand.
Clearly this change would have an impact on BBN's IMP software.
<span class="h2"><a class="selflink" id="section-2" href="#section-2">2</a>. Core-to-core transfers between HOSTS. </span>At another level, perhaps not
involving HOST-IMP protocol or IMP software changes, is a HOST-HOST
protocol wherein cooperating HOSTS agree to lock appropriate
programs in core for the duration of a multi-message file transfer
on an auxiliary connection. This could greatly reduce the time to
transfer such a file to and from a swap-bound HOST. Unfortunately,
the numbers mitigate possible advantages of this approach to some
extent: if we assume a 50 kilobit/sec line and support further that
it is dedicated at 100% efficiency to this transfer (which may
require slightly different handling of RFNMs in this case) this
comes out to just over 6 8-kilobit messages per second. It may be
impolitic in a timeshare environment to lock a single program in
core for more than about 2 seconds. If this is the case, then the
method would be applicable only for the rather limited range of file
sizes of 2-16 messages. Nevertheless, the time to move a large file
could be so greatly enhanced by this approach that I think it
deserves consideration.
<span class="h2"><a class="selflink" id="section-1" href="#section-1">1</a>. Abhi Bhushan, Proj. MAC </span> 10. Jerry Cole, SDC
<span class="h2"><a class="selflink" id="section-2" href="#section-2">2</a>. Steve Crocker, UCLA </span> 11. John Kreznar, "
<span class="h2"><a class="selflink" id="section-3" href="#section-3">3</a>. Ron Stoughton, UCSB </span> 12. Dick Linde, "
<span class="h2"><a class="selflink" id="section-4" href="#section-4">4</a>. Elmer Shapiro, SRI </span> 13. Bob Long, "
<span class="grey"> [Page 1]</span><span id="page-2" ></span>
<span class="grey">5. Steve Carr, Utah 14. Reg Martin, "</span>
<span class="h2"><a class="selflink" id="section-6" href="#section-6">6</a>. John Haefner, RAND </span> 15. Hal Sackman, "
<span class="h2"><a class="selflink" id="section-7" href="#section-7">7</a>. Paul Rovner, LL </span> 16. C. Weissman, "
<span class="h2"><a class="selflink" id="section-8" href="#section-8">8</a>. Bob Khan, BB & N </span> 17. Marty Bleier, "
<span class="h2"><a class="selflink" id="section-9" href="#section-9">9</a>. Larry Roberts, ARPA</span>
[ This RFC was put into machine readable form for entry ]
[ into the online RFC archives by Alex Portnoy 1/97 ]
[Page 2]
Annotations
Select text to annotate