1 Apr 02:30
RE: conformance requirements for matching
Addison Phillips <addison <at> yahoo-inc.com>
2006-04-01 00:30:04 GMT
2006-04-01 00:30:04 GMT
> This issue has been around for a while (as Harald's message attests).
> It's better to get the comment from me, now, than from an AD, the IESG,
> or in IETF last call.
Yes, I hear you. And I don't disagree with your reasoning. If the point is to generally describe some
matching schemes, I think we long ago achieved our purposes. If our goal is a thorough specification, then
your comments are probably correct. The problem is being specific about implementation details
(particularly in lookup) in areas in which the choice is not clear cut.
I've posted a new editor's copy, mid-stream in a rewrite of the extended filtering section, but with a
number of your suggested changes (plus some additional editing to remove waffle from the Lookup and
"choosing" sections). I have not dealt with the last two paras of Section 4.1 yet. Specific advice on
wording is most appreciated.
Of particular concern if we go down this track:
1. In Section 3.1 (Choosing a Type of Matching), we permit implementations to not enforce
validity/well-formedness on tags or ranges. My first inclination was to require this ("MUST NOT depend
on valid/well-formed") for ranges, but the following text provides problems for this:
2. In the following paragraph, we permit implementations to canonicalize ranges/tags and to use external
information ('nb'->'no', for example) to "inform" the choices made in matching. This is the exact
opposite of #1, since canonicalization requires the registry and presumably a validating processor. I
think the answer here is:
a. MUST NOT depend on valid/well-formed ranges
b. if validity checking is done, MUST canonicalize
c. whether or not validity checking is done, MAY use external information (RFC2616 already suggests that
this is permitted)
(Continue reading)
RSS Feed