Lines Matching +full:two +full:- +full:user
2 .\" Must use -- tbl -- with this one
50 For example, a network file service may be composed of two programs.
51 One program may deal with high-level applications such as file system
52 access control and locking. The other may deal with low-level file
55 the two programs of the service on behalf of some user on the client
62 procedure in some well-specified location (such as a result
65 procedure are extracted from the well-specified location, and the
69 logically winds through two processes\(emone is the caller's process,
82 Note that in this model, only one of the two processes is active at
105 is own retransmission and time-out policy as the RPC layer does not
113 application retransmits RPC messages after short time-outs, the only
120 execute-at-most-once semantics. A server can do this by taking
128 execute-at-most-once semantics. The server is not allowed to examine
135 connection-oriented protocol like TCP is used, an application still
136 needs time-outs and reconnection to handle server crashes.
138 There are other possibilities for transports besides datagram- or
139 connection-oriented protocols. For example, a request-reply protocol
151 is left up to some higher-level software. (The software may use RPC
154 Implementors should think of the RPC protocol as the jump-subroutine
163 identify itself to a service and vice-versa. Security and access
181 Provisions for authenticating the caller to service and vice-versa.
184 worth supporting because of protocol roll-over errors, implementation
185 bugs, user error, and network administration:
220 equal to two for the version of RPC described here.
243 Provisions for authentication of caller to service and vice-versa are
244 provided as a part of the RPC protocol. The call message has two
294 0 - 1fffffff&Defined by Sun
295 20000000 - 3fffffff&Defined by user
296 40000000 - 5fffffff&Transient
297 60000000 - 7fffffff&Reserved
298 80000000 - 9fffffff&Reserved
299 a0000000 - bfffffff&Reserved
300 c0000000 - dfffffff&Reserved
301 e0000000 - ffffffff&Reserved
317 However, the protocol itself is a message-passing protocol with which
318 other (non-RPC) protocols can be implemented. Sun currently uses, or
319 perhaps abuses, the RPC message protocol for the following two
320 (non-RPC) protocols: batching (or pipelining) and broadcast RPC.
321 These two protocols are discussed but not defined below.
335 In broadcast RPC-based protocols, the client sends a broadcast packet
337 unreliable, packet-based protocols (like UDP/IP) as its transports.
348 description language. The message is defined in a top-down style.
359 * A reply to a call message can take on two forms:
414 * followed by a two-armed discriminated union. The union's
415 * discriminant is a msg_type which switches to one of the two
442 * the remote program to be called. After these fields are two
444 * and verf (authentication verifier). The two authentication
451 unsigned int rpcvers; /* \fImust be equal to two (2) \fP*/
496 /* \fIprocedure-specific results start here\fP */
518 * The request can be rejected for two reasons: either the
541 open-ended to the rest of the RPC protocol. This section defines
582 is the caller's effective user ID. The
621 UNIX authentication suffers from two major problems:
623 The naming is too UNIX-system oriented.
627 DES authentication attempts to fix these two problems.
645 For example, a UNIX user at Sun with a user ID of 515 might be
649 internet. Within this domain, there is only one UNIX user with
650 user ID 515. However, there may be another user on another
652 that, by coincidence, happens to have the same user ID. To insure
653 that these two users can be distinguished we add the operating
654 system name. So one user is "unix.515@sun.com" and the other is
659 a one-to-one correspondence between naming methods and operating
669 vice-versa). The contents of this verifier is primarily an
681 authentication is Diffie-Hellman [3] with 192-bit keys. The
692 server just checks for two things:
752 * There are two kinds of credentials: one in which the client uses
769 * A 64-bit block of encrypted DES data
776 * Maximum length of a network user's name
831 * \f(CWadv_timestamp; \fP-- one DES block
832 * \f(CWadc_fullname.window; \fP-- one half DES block
833 * \f(CWadv_winverf; \fP-- one half DES block
860 \&Diffie-Hellman Encryption
862 In this scheme, there are two constants,
878 there are two people "A" and "B" who want to send encrypted
908 These two can be shown to be equivalent:
944 short-lived.
946 The conversation key is encrypted using 56-bit DES keys, yet the
948 selected from the common key as follows. The middle-most 8-bytes
950 lower order bit of each byte, producing a 56-bit key with 8 bits of
959 user protocol errors. This is called record marking (RM). Sun uses
964 fragment is a four-byte header followed by 0 to (2**31) - 1 bytes of
967 encodes two values\(ema boolean which indicates whether the fragment
969 is the last fragment) and a 31-bit unsigned binary value which is the
971 highest-order bit of the header; the length is the 31 low-order bits.
978 Just as there was a need to describe the XDR data-types in a formal
980 on these XDR data-types in a formal language as well. We use the RPC
1004 * Ping the caller, return the round-trip time
1005 * (in microseconds). Returns -1 if the operation
1031 with two procedures,
1037 computing round-trip times from the client to the server and back
1056 .I program-def
1060 program-def:
1062 version-def
1063 version-def *
1066 version-def:
1068 procedure-def
1069 procedure-def *
1072 procedure-def:
1073 type-specifier identifier "(" type-specifier ")"
1100 transport-specific port numbers. This program makes dynamic binding
1218 The portmapper program currently supports two protocols (UDP/IP and
1257 via the well-known port mapper's port. The parameters "prog",
1279 Procedure Calls"; XEROX CSL-83-7, October 1983.
1285 Transactions on Information Theory IT-22, November 1976.
1293 [6] Postel, J.; "Transmission Control Protocol - DARPA Internet
1297 [7] Postel, J.; "User Datagram Protocol", RFC 768; Information Sciences