Browse Prior Art Database

Dynamic Delegation Discovery System (DDDS) Part One: The Comprehensive DDDS (RFC3401)

IP.com Disclosure Number: IPCOM000010076D
Original Publication Date: 2002-Oct-01
Included in the Prior Art Database: 2002-Oct-17
Document File: 7 page(s) / 10K

Publishing Venue

Internet Society Requests For Comment (RFCs)

Related People

M. Mealling: AUTHOR

Abstract

This document specifies the exact documents that make up the complete Dynamic Delegation Discovery System (DDDS). DDDS is an abstract algorithm for applying dynamically retrieved string transformation rules to an application-unique string.

This text was extracted from an ASCII text file.
This is the abbreviated version, containing approximately 28% of the total text.

Network Working Group                                        M. Mealling

Request for Comments: 3401                                      VeriSign

Updates: 2276                                               October 2002

Obsoletes: 2915, 2168

Category: Informational

              Dynamic Delegation Discovery System (DDDS)

                    Part One: The Comprehensive DDDS

Status of this Memo

   This memo provides information for the Internet community.  It does

   not specify an Internet standard of any kind.  Distribution of this

   memo is unlimited.

Copyright Notice

   Copyright (C) The Internet Society (2002).  All Rights Reserved.

Abstract

   This document specifies the exact documents that make up the complete

   Dynamic Delegation Discovery System (DDDS).  DDDS is an abstract

   algorithm for applying dynamically retrieved string transformation

   rules to an application-unique string.

   This document along with RFC 3402, RFC 3403 and RFC 3404 obsolete RFC

   2168 and RFC 2915, as well as updates RFC 2276.

1. Intended Audience

   This document and the documents that it references are intended for

   anyone attempting to implement or understand the generic DDDS

   algorithm, URI Resolution, ENUM telephone number to URI resolution,

   and the NAPTR DNS resource record.  The reader is warned that reading

   one of the documents in this series without reading the others will

   probably lead to misunderstandings and interoperability problems.

2. Introduction

   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.  This document defines the entire DDDS by listing the

   documents that make up the complete specification at this time.

Mealling                     Informational                      [Page 1]

RFC 3401             DDDS - The Comprehensive DDDS          October 2002

   This document along with RFC 3402, RFC 3403 and RFC 3404 obsoletes

   RFC 2168 [8] and RFC 2915 [6], as well as updates RFC 2276 [5].  This

   document will be updated and or obsoleted when changes are made to

   the DDDS specifications.  Thus the reader is strongly encouraged to

   check the IETF RFC repository for any documents that obsoletes or

   updates this one.

3. The Algorithm

   The DDDS algorithm is defined by RFC 3402 [1].  That document defines

   the following DDDS concepts:

   o  The basic DDDS vocabulary.

   o  The algorithm.

   o  The requirements on applications using the algorithm.

   o  The requirements on databases...