RFC2295 2.2 抜粋
- remote variant selection algorithm
- A standardized algorithm by which a server can sometimes choose a best variant on behalf of a negotiating user agent. The algorithm typically computes whether the Accept- headers in the request contain sufficient information to allow a choice, and if so, which variant is the best variant. The use of a remote algorithm can speed up the negotiation process.
A remote variant selection algorithm is a standardized algorithm by which a server can choose a best variant on behalf of a negotiating user agent. The use of a remote algorithm can speed up the negotiation process by eliminating a request-response round trip.
A remote algorithm typically computes whether the Accept- headers in the request contain sufficient information to allow a choice, and if so, which variant is the best variant. This specification does not define any remote algorithms, but does define a mechanism to negotiate on the use of such algorithms.
A version numbering scheme is used to distinguish between different remote variant selection algorithms.
版番号付け方式は異なる遠隔変種選択算法同士を区別するのに使います。
- rvsa-version = major "." minor
- major = 1*4DIGIT
- minor = 1*4DIGIT
An algorithm with the version number X.Y, with Y>0, MUST be downwards compatible with all algorithms from X.0 up to X.Y. Downwards compatibility means that, if supplied with the same information, the newer algorithm MUST make the same choice, or a better choice, as the old algorithm. There are no compatibility requirements between algorithms with different major version numbers.
版番号 X.y (Y > 0)
の算法は X.0 から X.Y
までのすべての算法と互換でなければなりません。
下方互換性とは、同じ情報が供給された場合、新しい方の算法は古い算法と同じ選択かより良い選択を行わなければならないことを意味します。
異なる大版番号の算法間での互換性はありません。