Electrical Engineering
      and Computer Sciences

Electrical Engineering and Computer Sciences

COLLEGE OF ENGINEERING

UC Berkeley

Calculating Timeouts for Minimum Cost RPC

Peter B. Danzig

EECS Department
University of California, Berkeley
Technical Report No. UCB/CSD-88-488
December 1988

http://www.eecs.berkeley.edu/Pubs/TechRpts/1988/CSD-88-488.pdf

We derive expressions for remote procedure call (RPC) retransmission timeout values that minimize the weighted sort of total elapsed time, operating system kernel costs, and network charges. Currently we select RPC retransmission timeouts to minimize network utilization, an operating point chosen with our networks' low bandwidth in mind. When public utilities provided digital service becomes popular, we will routinely make requests to servers across town and across nation and we will pay for each message that we send. These networks may offer various grades of service, each with different loss and delay characteristics. In such an environment, choosing the retransmission timeout and grade of service that minimize our costs is not obvious. Our approach, illustrated with a simple RPC algorithm, can be applied to other remote invocation mechanisms. We can incorporate the expression for the optimal retransmission timeout that our approach generates into the communication's software of distributed operating systems.


BibTeX citation:

@techreport{Danzig:CSD-88-488,
    Author = {Danzig, Peter B.},
    Title = {Calculating Timeouts for Minimum Cost RPC},
    Institution = {EECS Department, University of California, Berkeley},
    Year = {1988},
    Month = {Dec},
    URL = {http://www.eecs.berkeley.edu/Pubs/TechRpts/1988/6150.html},
    Number = {UCB/CSD-88-488},
    Abstract = {We derive expressions for remote procedure call (RPC) retransmission timeout values that minimize the weighted sort of total elapsed time, operating system kernel costs, and network charges. Currently we select RPC retransmission timeouts to minimize network utilization, an operating point chosen with our networks' low bandwidth in mind. When public utilities provided digital service becomes popular, we will routinely make requests to servers across town and across nation and we will pay for each message that we send. These networks may offer various grades of service, each with different loss and delay characteristics. In such an environment, choosing the retransmission timeout and grade of service that minimize our costs is not obvious. Our approach, illustrated with a simple RPC algorithm, can be applied to other remote invocation mechanisms. We can incorporate the expression for the optimal retransmission timeout that our approach generates into the communication's software of distributed operating systems.}
}

EndNote citation:

%0 Report
%A Danzig, Peter B.
%T Calculating Timeouts for Minimum Cost RPC
%I EECS Department, University of California, Berkeley
%D 1988
%@ UCB/CSD-88-488
%U http://www.eecs.berkeley.edu/Pubs/TechRpts/1988/6150.html
%F Danzig:CSD-88-488