Domain Boundaries
charter-ietf-dbound-00-01

The information below is for an old version of the document
Document Proposed charter Domain Boundaries WG (dbound) Snapshot
Title Domain Boundaries
Last updated 2015-01-13
State Internal review
WG State Concluded
IESG Responsible AD Alexey Melnikov
Charter Edit AD Barry Leiba
Send notices to dbound@ietf.org

Charter
charter-ietf-dbound-00-01

Various Internet protocols and applications require some mechanism for
determining whether two domain names are related. The DBOUND working
group will develop one or more solutions to this family of problems.

For example, it is often necessary or useful to determine whether
example.com and foo.example.com, or even example.net, are subject to the
same administrative control.  To humans, the answer to this may be
obvious.  However, the Domain Name System (DNS), which is the service
that handles domain name queries, does not provide the ability to mark
these sorts of relationships.  This makes it impossible to discern
relationships algorithmically. The right answer is not always "compare
the rightmost two labels".

The particular issue is that applications and organizations impose
policies and procedures that create additional structure in their use of
domain names.  This creates many possible relationships that are not
evident in the names themselves or in the operational, public
representation of the names.

A related problem is known as the "equivalence problem", which is a
desire to express that two domains are equivalent, without using
existing facilities like CNAME or DNAME that necessitate one of the
names being authoritative over the other.

Prior solutions for identifying relationships between domain names have
sought to use the DNS namespace and protocol to extract that information
when it isn't actually there.  See the "Additional Background
Information" section, below, for more details.

For the purpose of this work, domain names are identifiers used by
organizations and services, independent of underlying protocols or
mechanisms.  We define an "organizational domain" to be a name that is
at the top of an administrative hierarchy, defining transition from one
"outside" administrative authority to another that is "inside" the
organization.

The DBOUND working group will develop a unified solution, if possible,
for determining organizational domain boundaries.  However, the working
group may discover that different solutions are needed to solve different
usage requirements.  Should that happen, the working group will
develop those different solutions, using as many common pieces as it can.

Solutions will not involve the proposal of any changes to the DNS
protocol.  They might involve the creation of new resource record types.

This working group will not seek to amend the consuming protocols
themselves (standards for any web, email, or other such protocols)
without rechartering, and such rechartering will only be considered after
completion of the base work.

The working group has a pre-IETF draft to consider as a possible
starting point:  draft-sullivan-dbound-problem-statement

Milestones:
- TBD

Additional Background Information
---------------------------------

The concept of an administrative boundary is by definition not present
in the DNS.  Relying on the DNS to divine administrative structure thus
renders such solutions unreliable and unnecessarily constrained.  For
example, confirming or dismissing a relationship between two domain
names based on the existence of a zone cut or common ancestry is often
unfounded, and the notion of an upward "tree walk" as a search mechanism
is, therefore, unacceptable.

Currently, the most well known solution in existence is the Public
Suffix List (PSL).  The PSL is maintained by a web browser producer and
is kept current by volunteers on a best-effort basis.  It contains a
list of points in the hierarchical namespace at which registrations take
place, and is used to identify the boundary between so-called "public"
names (below which registrations can occur, such as ".com" or ".org.uk") and
the private names (organizational names) that domain registrars create within
them.  When this list is inaccurate, it exposes a deviation from reality that
degrades service to some and can be exploited by others.  As the PSL is the
de-facto resource, and as there is not a more comprehensive, alternative
solution for relationship identification, the PSL has often been misused
to accomplish things beyond its capabilities.  For example, there is no way
to confirm the relationship between two domain names -- the PSL may only
signal that there is or is not a public boundary between the two.
Additionally, there are questions about the scalability, central management,
and third-party management of the PSL as it currently exists.

In terms of specific use cases, within the realm of email there is a
desire to link an arbitrary fully-qualified domain name (FQDN) to the
organizational domain name (at some point in the namespace above it), in
order to identify a deterministic location where some sort of statement
of policy regarding that FQDN can be found.  With respect to the web,
there is a similar need to identify relationships between different
FQDNs, currently accomplished by comparing ancestries.  However, there
is also desire to reliably identify relationships outside of the realm
and constraints of the namespace tree.

Work such as DMARC (draft-kucherawy-dmarc-base), will certainly benefit
from having this capability.