/// Constructs an instance out of the host identity tag, public key algorithm, public key and rendezvous servers fields.
/// </summary>
/// <param name="hostIdentityTag">Stored as a binary value in network byte order.</param>
/// <param name="publicKeyAlgorithm">Identifies the public key's cryptographic algorithm and determines the format of the public key field.</param>
/// <param name="publicKey">Contains the algorithm-specific portion of the KEY RR RDATA.</param>
/// <param name="rendezvousServers">
/// Indicates one or more domain names of rendezvous server(s).
/// Must not be compressed.
/// The rendezvous server(s) are listed in order of preference (i.e., first rendezvous server(s) are preferred),
/// defining an implicit order amongst rendezvous servers of a single RR.
/// When multiple HIP RRs are present at the same owner name,
/// this implicit order of rendezvous servers within an RR must not be used to infer a preference order between rendezvous servers stored in different RRs.
/// A 16-bit unsigned integer specifying the order in which the NAPTR records MUST be processed in order to accurately represent the ordered list of Rules.
/// A 16-bit unsigned integer specifying the order in which the NAPTR records MUST be processed
/// in order to accurately represent the ordered list of Rules.
/// The ordering is from lowest to highest.
/// The ordering is from lowest to highest.
/// If two records have the same order value then they are considered to be the same rule and should be selected based on the combination of the Preference values and Services offered.
/// If two records have the same order value then they are considered to be the same rule and should be selected
/// based on the combination of the Preference values and Services offered.
/// </summary>
/// </summary>
publicushortOrder{get;privateset;}
publicushortOrder{get;privateset;}
/// <summary>
/// <summary>
/// Although it is called "preference" in deference to DNS terminology, this field is equivalent to the Priority value in the DDDS Algorithm.
/// Although it is called "preference" in deference to DNS terminology, this field is equivalent to the Priority value in the DDDS Algorithm.
/// It specifies the order in which NAPTR records with equal Order values should be processed, low numbers being processed before high numbers.
/// It specifies the order in which NAPTR records with equal Order values should be processed, low numbers being processed before high numbers.
/// This is similar to the preference field in an MX record, and is used so domain administrators can direct clients towards more capable hosts or lighter weight protocols.
/// This is similar to the preference field in an MX record,
/// A client may look at records with higher preference values if it has a good reason to do so such as not supporting some protocol or service very well.
/// and is used so domain administrators can direct clients towards more capable hosts or lighter weight protocols.
/// The important difference between Order and Preference is that once a match is found the client must not consider records with a different Order but they may process records with the same Order but different Preferences.
/// A client may look at records with higher preference values if it has a good reason to do so such
/// The only exception to this is noted in the second important Note in the DDDS algorithm specification concerning allowing clients to use more complex Service determination between steps 3 and 4 in the algorithm.
/// as not supporting some protocol or service very well.
/// Preference is used to give communicate a higher quality of service to rules that are considered the same from an authority standpoint but not from a simple load balancing standpoint.
/// The important difference between Order and Preference is that once a match is found the client must not consider records
/// with a different Order but they may process records with the same Order but different Preferences.
/// The only exception to this is noted in the second important Note in the DDDS algorithm specification
/// concerning allowing clients to use more complex Service determination between steps 3 and 4 in the algorithm.
/// Preference is used to give communicate a higher quality of service to rules that are considered the same from an authority standpoint
/// but not from a simple load balancing standpoint.
///
///
/// It is important to note that DNS contains several load balancing mechanisms and if load balancing among otherwise equal services should be needed then methods such as SRV records or multiple A records should be utilized to accomplish load balancing.
/// It is important to note that DNS contains several load balancing mechanisms and if load balancing among otherwise equal services
/// should be needed then methods such as SRV records or multiple A records should be utilized to accomplish load balancing.
/// A substitution expression that is applied to the original string held by the client in order to construct the next domain name to lookup.
/// A substitution expression that is applied to the original string held by the client in order to construct the next domain name to lookup.
/// See the DDDS Algorithm specification for the syntax of this field.
/// See the DDDS Algorithm specification for the syntax of this field.
///
///
/// As stated in the DDDS algorithm, The regular expressions must not be used in a cumulative fashion, that is, they should only be applied to the original string held by the client, never to the domain name produced by a previous NAPTR rewrite.
/// As stated in the DDDS algorithm, The regular expressions must not be used in a cumulative fashion,
/// The latter is tempting in some applications but experience has shown such use to be extremely fault sensitive, very error prone, and extremely difficult to debug.
/// that is, they should only be applied to the original string held by the client, never to the domain name produced by a previous NAPTR rewrite.
/// The latter is tempting in some applications but experience has shown such use to be extremely fault sensitive, very error prone,