RFC 3402:Dynamic Delegation Discovery System (DDDS...
RFC-Ref

delegation


Click on the red underlined text to get to the source

... The Dynamic Delegation Discovery System (DDDS) is used to implement lazy binding ...
... 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 ...
... DDDS algorithm, not any particular application or usage scenario. The entire series of documents is specified in "Dynamic Delegation Discovery System (DDDS) Part One: The Comprehensive DDDS ...


... A string that is the initial input to a DDDS application. The lexical structure of this string must imply a unique delegation path, which is analyzed and traced by the repeated selection and application of Rewrite Rules. ...
... Database Any store of Rules such that a unique key can identify a set of Rules that specify the delegation step used when that particular Key is used. ...


... DDDS that the lexical element used to make a delegation decision is simple enough to be contained within the Application Unique String itself. The DDDS does not solve the ...
... the Application Unique String itself. The DDDS does not solve the case where a delegation decision is made using knowledge contained outside the AUS and the Rule (time of day, financial transactions, ...
... may have precedence. This allows the database to express rules that may offer roughly the same results but one delegation path may be faster, better, cheaper than the other. ...
... Services are used to specify semantic attributes of a particular delegation branch. There are many cases where two delegation branches are identical except that one delegates down to a result ...
... semantic attributes of a particular delegation branch. There are many cases where two delegation branches are identical except that one delegates down to a result that provides one set of features while another provides some ...
... backwardly compatible functions for older clients, etc. For example, two rules may equally apply to a specific delegation decision for a string. One rule can lead to a terminal rule that ...


... between hosts that are identical to each other where as DDDS is concerned with delegation paths that have some particular feature set or administrative domain ...


... kept very close to the author (usually on their desktop). Thus there is the probability that the number of delegations can be very deep. Also, in order to keep from having a large flat space of authors, the authors are organized by organizations and departments. ...


... Database and an Application that security considerations can be known well enough to enumerate them beyond simply saying that dynamic delegation points are a possible point of attack. ...


... Mealling, M., "Dynamic Delegation Discovery System (DDDS) Part One: The Comprehensive DDDS", RFC 3401 ...
... Mealling, M., "Dynamic Delegation Discovery System (DDDS) Part Two: The Algorithm", . ...
... Mealling, M., "Dynamic Delegation Discovery System (DDDS) Part Three: The Domain Name System (DNS ...
... Mealling, M., "Dynamic Delegation Discovery System (DDDS) Part Four: The Uniform Resource Identifiers (URI ...
... Mealling, M., "Dynamic Delegation Discovery System (DDDS) Part Five: URI.ARPA ...



Google
Web
RFC-Ref