Jump to content

Dynamic Delegation Discovery System

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Kbrose (talk | contribs) at 01:25, 18 June 2020 (hat note not needed anymore, it is a stub anyways). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

The Dynamic Delegation Discovery System (DDDS) is an algorithm for applying string transformation rules to application-unique strings to extract specific syntax elements. It is used for finding information, such as authoritative domain name servers, for Uniform Resource Identifiers and Uniform Resource Names. An earlier specification applied only to URNs, and was called the Resolver Discovery Service (RDS).

DDDS defines a mechanism for using the Domain Name System (DNS) as the database for arbitrary identifier schemes. The primary logical DNS container used to hold DDDS information is the NAPTR record.

DDDS is defined in RFC 3401, RFC 3402, RFC 3403, RFC 3404, and RFC 3405.

RFC 3401 expresses the system as follows:[1]

The Dynamic Delegation Discovery System is used to implement lazy binding of strings to data, in order to support dynamically configured delegation systems. The DDDS functions by mapping some unique string to data stored within a DDDS Database by iteratively applying string transformation rules until a terminal condition is reached.

Telephone Number Mapping (ENUM), specified in RFC 6116, is defined as a DDDS application to resolve telephone numbers into DNS data.

References

  1. ^ RFC 3401, M. Mealling, Dynamic Delegation Discovery System (DDDS), IETF (October 2002)