| Internet-Draft | Delay-Sensitive Policy | September 2023 |
| Dreibholz & Zhou | Expires 29 March 2024 | [Page] |
This document contains the definition of a delay measurement infrastructure and a delay-sensitive Least-Used policy for Reliable Server Pooling.¶
This Internet-Draft is submitted in full conformance with the provisions of BCP 78 and BCP 79.¶
Internet-Drafts are working documents of the Internet Engineering Task Force (IETF). Note that other groups may also distribute working documents as Internet-Drafts. The list of current Internet-Drafts is at https://datatracker.ietf.org/drafts/current/.¶
Internet-Drafts are draft documents valid for a maximum of six months and may be updated, replaced, or obsoleted by other documents at any time. It is inappropriate to use Internet-Drafts as reference material or to cite them other than as "work in progress."¶
This Internet-Draft will expire on 29 March 2024.¶
Copyright (c) 2023 IETF Trust and the persons identified as the document authors. All rights reserved.¶
This document is subject to BCP 78 and the IETF Trust's Legal Provisions Relating to IETF Documents (https://trustee.ietf.org/license-info) in effect on the date of publication of this document. Please review these documents carefully, as they describe your rights and restrictions with respect to this document. Code Components extracted from this document must include Revised BSD License text as described in Section 4.e of the Trust Legal Provisions and are provided without warranty as described in the Revised BSD License.¶
Reliable Server Pooling defines protocols for providing highly available services. PEs of a pool may be distributed over a large geographical area, in order to provide redundancy in case of localized disasters. But the current pool policies defined in [8] do not incorporate the fact of distances (i.e. delay) between PU and PE. This leads to a low performance for delay-sensitive applications.¶
This draft defines a delay measurement infrastructure for ENRP servers to add delay information into the handlespace. Furthermore, a delay-sensitive Least-Used policy is defined. Performance evaluations can be found in [13].¶
The terms are commonly identified in related work and can be found in the Aggregate Server Access Protocol and Endpoint Handlespace Redundancy Protocol Common Parameters document [6].¶
The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", "SHOULD", "SHOULD NOT", "RECOMMENDED", "MAY", and "OPTIONAL" in this document are to be interpreted as described in [1].¶
This section describes the necessary delay measurement infrastructure for the policy later defined in Section 3. It has to be provided as part of the ENRP servers.¶
Measuring delay for SCTP associations is easy: the SCTP protocol [2] already calculates a smoothed round-trip time (RTT) for the primary path. This RTT only has to be queried via the standard SCTP API as defined in [9]. By default, the calculated RTT has a small restriction: a SCTP endpoint waits up to 200ms before acknowledging a packet, in order to piggyback the acknowledgement chunk with payload data. In this case, the RTT would include this latency. By using the option SCTP_DELAYED_SACK (see [9]), the maximum delay before acknowledging a packet can be set to 0ms (i.e. "acknowledge as soon as possible"). After that, the RTT approximately consists of the network latency only. Then, using the RTT, the end-to-end delay between two associated components is approximately 0.5*RTT.¶
In real networks, there may be negligible delay differences: for example, the delay between a PU and PE #1 is 5ms and the latency between the PU and PE #2 is 6ms. From the service user's perspective, such minor delay differences may be ignored and are furthermore unavoidable in Internet scenarios. Therefore, the distance parameter between two components A and B is defined as follows:¶
Distance = DistanceStep * round( (0.5*RTT) / DistanceStep )¶
That is, the distance parameter is defined as the nearest integer multiple of the constant DistanceStep for the measured delay (i.e. 0.5*RTT).¶
In order to define a distance-aware policy, it is first necessary to define a basic rule: PEs and PUs choose "nearby" ENRP servers. Since the operation scope of RSerPool is restricted to a single organization, this condition can be met easily by appropriately locating ENRP servers.¶
Now, each ENRP server can approximate the distance to every PE in the operation scope using the equation in Section 2.1.¶
Note, that delay changes are propagated to all ENRP servers upon PE re-registrations, i.e. the delay information (and the approximated distance) dynamically adapts to the state of the network.¶
In this section, a distance-sensitive Least Used policy is defined, based on the delay-measurement infrastructure introduced in Section 2.¶
The Least Used with Distance Penalty Factor (LU-DPF) policy uses load information provided by the pool elements to select the lowest-loaded pool elements within the pool. If there are multiple elements having lowest load, the nearest PE should be chosen.¶
The ENRP server SHOULD select at most the requested number of pool elements. Their load values SHOULD be the lowest possible ones within the pool and their distances also SHOULD be lowest. Each element MUST NOT be reported more than once to the pool user. If there is a choice of equal-loaded and equal-distanced pool elements, round robin selection SHOULD be made among these elements. The returned list of pool elements MUST be sorted by load value in ascending order (1st key) and distance in ascending order (2nd key).¶
The pool user should try to use the pool elements returned from the list in the order returned by the ENRP server. A subsequent call for handle resolution may result in the same list. Therefore, it is RECOMMENDED for a pool user to request multiple entries in order to have a sufficient amount of feasible backup entries available.¶
0 1 2 3 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Parameter Type = 0x6 | Length = 0x14 | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Policy Type = 0x40000010 | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Load | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Load DPF | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+ | Distance | +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+¶
Distance: The approximated distance in milliseconds.¶
The RSerPool reference implementation RSPLIB can be found at [15]. It supports the functionalities defined by [3], [4], [5], [6] and [8] as well as the options [10], [11] and of course the option defined by this document. An introduction to this implementation is provided in [12].¶
A large-scale and realistic Internet testbed platform with support for the multi-homing feature of the underlying SCTP protocol is NorNet. A description of NorNet is provided in [14], some further information can be found on the project website [16].¶
Security considerations for RSerPool systems are described by [7].¶
This document does not require additional IANA actions beyond those already identified in the ENRP and ASAP protocol specifications.¶