hello; i am doing some research on the rir databases. for my purposes having all data in, what i call 'arin' format, would be the simplest for processing. are there any software utilities available for converting from rpsl to 'arin' format? if no software utilities are available is there a mapping description available from rpsl to 'arin' format? -- terry l. ridder ><>
On Sun, 15 Feb 2004, terry l. ridder wrote:
hello;
i am doing some research on the rir databases. for my purposes having all data in, what i call 'arin' format, would be the simplest for processing.
are there any software utilities available for converting from rpsl to 'arin' format?
if no software utilities are available is there a mapping description available from rpsl to 'arin' format?
well, we bit the bullet and spent today writing an rpsl-to-arin conversion program. works rather well except for orgid: and parent: fields. obviously, orgid:, we will have a create our own. i do have a question concerning parent:. i am do not have an indepth knowledge of rpsl, so please bare with the question. does rpsl have a concept of parent? if rpsl does have a concept of parent would someone direct me to the document/documents which explain it? thank you all for your answers. -- terry l. ridder ><>
Hi, On 2004-02-17 19:49:30 -0600, terry l. ridder wrote:
On Sun, 15 Feb 2004, terry l. ridder wrote:
hello;
i am doing some research on the rir databases. for my purposes having all data in, what i call 'arin' format, would be the simplest for processing.
are there any software utilities available for converting from rpsl to 'arin' format?
if no software utilities are available is there a mapping description available from rpsl to 'arin' format?
The syntax and meanings of attributes (fields) of RIPE Whois object can be found in the RIPE DB Reference Manual: http://www.ripe.net/ripe/docs/databaseref-manual.html You must be able to figure out a (close) mapping if a similar document exists for ARIN DB as well.
well, we bit the bullet and spent today writing an rpsl-to-arin conversion program. works rather well except for orgid: and parent: fields. obviously, orgid:, we will have a create our own.
i do have a question concerning parent:.
i am do not have an indepth knowledge of rpsl, so please bare with the question.
does rpsl have a concept of parent? if rpsl does have a concept of parent would someone direct me to the document/documents which explain it?
'parent' information is not buried in other objects in RIPE Whois Database (unlike ARIN DB). You need to perform queries to find the parents/children of an object. The relevant query flags are -l, -L, -m, -M. See http://www.ripe.net/ripe/docs/databaseref-manual.html#2.2 for IP Address Lookups in RIPE DB. A parent is sometimes called 'one level less specific inetnum' in RIPE DB.
thank you all for your answers.
-- terry l. ridder ><>
-- Engin Gunduz RIPE NCC Software Engineering Department
On Wed, 18 Feb 2004, Engin Gunduz wrote:
Hi,
On 2004-02-17 19:49:30 -0600, terry l. ridder wrote:
On Sun, 15 Feb 2004, terry l. ridder wrote:
hello;
i am doing some research on the rir databases. for my purposes having all data in, what i call 'arin' format, would be the simplest for processing.
are there any software utilities available for converting from rpsl to 'arin' format?
if no software utilities are available is there a mapping description available from rpsl to 'arin' format?
The syntax and meanings of attributes (fields) of RIPE Whois object can be found in the RIPE DB Reference Manual:
http://www.ripe.net/ripe/docs/databaseref-manual.html
You must be able to figure out a (close) mapping if a similar document exists for ARIN DB as well.
as far as i am able to determine there is no arin db documentation available.
well, we bit the bullet and spent today writing an rpsl-to-arin conversion program. works rather well except for orgid: and parent: fields. obviously, orgid:, we will have a create our own.
i do have a question concerning parent:.
i am do not have an indepth knowledge of rpsl, so please bare with the question.
does rpsl have a concept of parent? if rpsl does have a concept of parent would someone direct me to the document/documents which explain it?
'parent' information is not buried in other objects in RIPE Whois Database (unlike ARIN DB). You need to perform queries to find the parents/children of an object. The relevant query flags are -l, -L, -m, -M. See
lacnic's modified rpsl db also includes parent information. lacnic's modified rpsl db also includes org information. arin and lacnic have org and parent. apnic and ripencc do not have org and parent. we are not doing queries we are doing, hopefully, a one-time mass conversion of apnic db and ripe db from rpsl to arin format. right now we just need a snapshot of apnic db and ripe db. we may need to update at some time in the future. that depends on where the research leads us.
http://www.ripe.net/ripe/docs/databaseref-manual.html#2.2
for IP Address Lookups in RIPE DB.
A parent is sometimes called 'one level less specific inetnum' in RIPE DB.
sorry i was not clear with my above questions. without my having to read the ripe whoisd source code to determine what is taking place when a query is issued with the -l, -L, -m, or -M flags is there a document which explains rpsl 'parent' concept? it is late here 0340 am so i will pick this up again later today after i get some sleep. -- terry l. ridder ><>
On 2004-02-18 03:41:23 -0600, terry l. ridder wrote: [...]
we are not doing queries we are doing, hopefully, a one-time mass conversion of apnic db and ripe db from rpsl to arin format. right now we just need a snapshot of apnic db and ripe db. we may need to update at some time in the future. that depends on where the research leads us.
http://www.ripe.net/ripe/docs/databaseref-manual.html#2.2
for IP Address Lookups in RIPE DB.
A parent is sometimes called 'one level less specific inetnum' in RIPE DB.
sorry i was not clear with my above questions.
without my having to read the ripe whoisd source code to determine what is taking place when a query is issued with the -l, -L, -m, or -M flags is there a document which explains rpsl 'parent' concept?
The text we have written for CRISP effort might help. I'm quoting the relevant part here. Please find the full text at https://www1.ietf.org/mail-archive/working-groups/crisp/current/msg00012.htm... ============================ Terminology: More specific, most specific, less specific, least specific. More specific: Given two networks, A and B, A is more specific than B if network B includes all space of network A, and if network B is larger than network A. Less specific: Opposite of more specific. The network B is less specific than network A if network A's all space is included in network B and if network A is smaller than network B. Most specific: Given a set of networks, the network or networks that are more specific than zero or more of other networks in the set, and that are not a less specific of any of the networks in the set. Least specific: Given a set of networks, the network or networks that are not more specific to any of the other networks in the set. Examples: +-------------------------------------------------------+ | | | Given the networks A, B, C and D as follows: | | | | A |---------------------------------| | | B |-----------------| | | C |---------| | | D |-------| | | | | | | The network A is less specific than B, C and D. | | The network B is more specific than A. | | Among these four networks, A is the least specific, | | and C and D are the most specific networks. | | | +-------------------------------------------------------+ +-------------------------------------------------------+ | | | Given the networks E, F and G: | | | | E |----------| | | F |--------------| | | G |---| | | | | The networks E and F are least specific networks. | | The networks F and G are most specific networks. | | | +-------------------------------------------------------+ Nested matching searches: ==== [1] Given a range, find all the networks that contain that range (ie, all less specifics and exact matches). These networks are the networks that fulfill the following condition: (start(network) <= start(search)) AND (end(network) >= end(search)) ==== [2] Given a range, find only the most specific network that contains that range (could be multiple networks, but usually single); This is the set of networks from [1], with the provision that: no network in the return set is contained by any other network in the set. If there are exact match networks in the set from [1], they both must appear in the result set as well. ==== [3] Given a range, find all the networks that are fully within that range. The set must not contain an exact match: (start(network) >= start(search)) AND (end(network) <= end(search)) AND NOT ((start(network) = start(search)) AND (end(network) = end(search))) ==== [4] Given a range, find only the least specific networks that are fully within that range. This is the set of networks from [3], with the provision that: no network in the return set contains any other network in the return set. An example: X Y A |------------------| B |-------------------------| C |--------| D |---------| Here, the search for least specific networks that are fully within the range "X - Y" would return networks A and B. The result set would not contain C (because it is contained by A) nor D (because it is contained by C). ==== [5] Given a range, find the network that begins and ends on the same IP addresses as the range ("exact match"). That is, the networks that fulfill the following condition: (start(network) = start(search)) AND (end(network) = end(search)) ==== [6] Given a range, or single IP address, find the exact match network if exists, and if not, perform the [2] search. ============================ Type [1] search is achieved with -L [2] with -l [3] with -M [4] with -m [5] with -x and [6] is the default search in RIPE Whois Database. I hope this helps, -engin
it is late here 0340 am so i will pick this up again later today after i get some sleep.
-- terry l. ridder ><>
-- Engin Gunduz RIPE NCC Software Engineering Department
participants (2)
-
Engin Gunduz -
terry l. ridder