I did something like that, about a year ago? But it was manually not automated
-----Original Message-----
From: Johnny Billquist <bqt at softjar.se>
Sender: owner-hecnet at Update.UU.SE
Date: Tue, 25 Dec 2012 13:34:13
To: <hecnet at Update.UU.SE>
Reply-To: hecnet at Update.UU.SE
Cc: <sampsa at mac.com>
Subject: Re: [HECnet] HECnet mapping project
On 2012-12-25 12:22, sampsa at mac.com wrote:
[Brian, please don't kill me for announcing this too early :P ]
Guys,
We're working on a network walker that will eventually produce a graph of HECnet.
We're basically doing a NCP SHOW KNOW CIRC, grabbing each area routing node and then recursively walking those.
Well it's a bit more complex than that, but that's the general idea :)
Once this is done, we do a NCP SHOW ADJ NODES to get the nodes in the area of each area router.
This is what we've come up with so far (the ADJ NODES code is under work, so if your node is missing, don't worry - mainly checking all the area routers are there):
http://sampsa.com/routers.svg
Very cool. However, if someone were to do something really useful, it
would be to instead figure out the actual connectivity.
It's hard to explain exactly what I mean, but in short, that graph have
quite a lot of lines for the Update bridge, for example. But in reality,
that is all one ethernet segment. Such a thing would be nice to have
illustrated as one (thick) line with all nodes attached to that.
The same goes for a local ethernet segment somewhere as well. Having
everything illustrated as point-to-point connections makes for lots of
lines, and sometimes some confusion.
Another kind of graph that would be cool (but even harder) would be to
have a map of the world, with the nodes placed out, and connections.
That kind of map would work to have everything illustrated as
point-to-point connections. But figuring out the physical locations is
another story. (I guess the only way would be if people could put that
kind of information in some file, in a format that would be machine
parseable.)
Anyone feeling like tackling this? :-)
Johnny
On 2012-12-21 19:18, Cory Smelosky wrote:
Hey Johhny,
Can you add:
MEAGHN (9.8)
MAKYLA (9.9)
to the nodelist please?
Not sure if I confirmed that I did this...
Johnny
On 2012-12-25 13:49, sampsa at mac.com wrote:
Doh doh doh.
I actually wanted the node to be called SIIKAX.
Can you change it? So sorry.
Sure. Change coming up... :-)
Johnny
Sampsa
On 25 Dec 2012, at 14:47, sampsa at mac.com wrote:
So weird, SHOW KNOWN NODES lists it.
Confused....
47.11 (GIFTVX) 0 4 47.556 (KUHAVX)
47.12 (GFTVX2) 47.556 (KUHAVX)
47.100 (HILANT) 47.556 (KUHAVX)
47.113 (SIIRI) 0 4 47.556 (KUHAVX)
47.555 (LABVAX) 0 4 47.556 (KUHAVX)
47.556 (KUHAVX) reachable 1 4 UNA-0 47.556 (KUHAVX)
47.559 (HPIVAX) 0 4 47.556 (KUHAVX)
47.661 (SOLAR5) 47.556 (KUHAVX)
47.700 (K4VX1) 0 4 47.556 (KUHAVX)
47.701 (K4VX2) 0 4 47.556 (KUHAVX)
47.727 (SHAMS) 47.556 (KUHAVX)
47.747 (QAMAR) 47.556 (KUHAVX)
47.1000 (BONZO2) 47.556 (KUHAVX)
47.1001 (SIIKVX) 47.556 (KUHAVX)
sampsa
On 25 Dec 2012, at 14:42, sampsa at mac.com wrote:
You sure?
$mcr ncp tell mim show node siikx
Node Volatile Summary as of 25-DEC-2012 14:40:06
%NCP-W-UNRCMP, Unrecognized component , Node
On 25 Dec 2012, at 14:22, Johnny Billquist <bqt at softjar.se> wrote:
On 2012-12-25 01:07, sampsa at mac.com wrote:
Whilst you're at it, add another one, SIIKVX, 47.1001
SIMH-VAX on Core 2 Duo.
Also done.
Johnny
On 2012-12-25 13:47, sampsa at mac.com wrote:
On 25 Dec 2012, at 14:46, Johnny Billquist <bqt at softjar.se> wrote:
On 2012-12-25 13:34, sampsa at mac.com wrote:
We can certainly provide the data - we keep the interface info and everything, I just make a simple graph of it :)
I haven't thought the whole thing through yet. I don't know if that is enough information to figure out what the exact segments are...
But you'll have to agree that a fully connected mesh is confusing to look at, when the reality is that it's a bus-type connection.
Johnny
True but it's hard with the bridges - if everyone used MULTINET point to point connections, this would be a doddle :)
Equally hard with any ethernet connection...
Still, it's better than nothing..
Oh, I agree. :-)
Johnny
Doh doh doh.
I actually wanted the node to be called SIIKAX.
Can you change it? So sorry.
Sampsa
On 25 Dec 2012, at 14:47, sampsa at mac.com wrote:
So weird, SHOW KNOWN NODES lists it.
Confused....
47.11 (GIFTVX) 0 4 47.556 (KUHAVX)
47.12 (GFTVX2) 47.556 (KUHAVX)
47.100 (HILANT) 47.556 (KUHAVX)
47.113 (SIIRI) 0 4 47.556 (KUHAVX)
47.555 (LABVAX) 0 4 47.556 (KUHAVX)
47.556 (KUHAVX) reachable 1 4 UNA-0 47.556 (KUHAVX)
47.559 (HPIVAX) 0 4 47.556 (KUHAVX)
47.661 (SOLAR5) 47.556 (KUHAVX)
47.700 (K4VX1) 0 4 47.556 (KUHAVX)
47.701 (K4VX2) 0 4 47.556 (KUHAVX)
47.727 (SHAMS) 47.556 (KUHAVX)
47.747 (QAMAR) 47.556 (KUHAVX)
47.1000 (BONZO2) 47.556 (KUHAVX)
47.1001 (SIIKVX) 47.556 (KUHAVX)
sampsa
On 25 Dec 2012, at 14:42, sampsa at mac.com wrote:
You sure?
$mcr ncp tell mim show node siikx
Node Volatile Summary as of 25-DEC-2012 14:40:06
%NCP-W-UNRCMP, Unrecognized component , Node
On 25 Dec 2012, at 14:22, Johnny Billquist <bqt at softjar.se> wrote:
On 2012-12-25 01:07, sampsa at mac.com wrote:
Whilst you're at it, add another one, SIIKVX, 47.1001
SIMH-VAX on Core 2 Duo.
Also done.
Johnny
How about you learn to spell your nodenames correctly? :-)
SIIKVX, not SIIKX ;-)
Johnny
On 2012-12-25 13:42, sampsa at mac.com wrote:
You sure?
$mcr ncp tell mim show node siikx
Node Volatile Summary as of 25-DEC-2012 14:40:06
%NCP-W-UNRCMP, Unrecognized component , Node
On 25 Dec 2012, at 14:22, Johnny Billquist <bqt at softjar.se> wrote:
On 2012-12-25 01:07, sampsa at mac.com wrote:
Whilst you're at it, add another one, SIIKVX, 47.1001
SIMH-VAX on Core 2 Duo.
Also done.
Johnny
On 25 Dec 2012, at 14:46, Johnny Billquist <bqt at softjar.se> wrote:
On 2012-12-25 13:34, sampsa at mac.com wrote:
We can certainly provide the data - we keep the interface info and everything, I just make a simple graph of it :)
I haven't thought the whole thing through yet. I don't know if that is enough information to figure out what the exact segments are...
But you'll have to agree that a fully connected mesh is confusing to look at, when the reality is that it's a bus-type connection.
Johnny
True but it's hard with the bridges - if everyone used MULTINET point to point connections, this would be a doddle :)
Still, it's better than nothing..
Sampsa
On 2012-12-25 13:34, sampsa at mac.com wrote:
We can certainly provide the data - we keep the interface info and everything, I just make a simple graph of it :)
I haven't thought the whole thing through yet. I don't know if that is enough information to figure out what the exact segments are...
But you'll have to agree that a fully connected mesh is confusing to look at, when the reality is that it's a bus-type connection.
Johnny
Sampsa
On 25 Dec 2012, at 14:34, Johnny Billquist <bqt at softjar.se> wrote:
On 2012-12-25 12:22, sampsa at mac.com wrote:
[Brian, please don't kill me for announcing this too early :P ]
Guys,
We're working on a network walker that will eventually produce a graph of HECnet.
We're basically doing a NCP SHOW KNOW CIRC, grabbing each area routing node and then recursively walking those.
Well it's a bit more complex than that, but that's the general idea :)
Once this is done, we do a NCP SHOW ADJ NODES to get the nodes in the area of each area router.
This is what we've come up with so far (the ADJ NODES code is under work, so if your node is missing, don't worry - mainly checking all the area routers are there):
http://sampsa.com/routers.svg
Very cool. However, if someone were to do something really useful, it would be to instead figure out the actual connectivity.
It's hard to explain exactly what I mean, but in short, that graph have quite a lot of lines for the Update bridge, for example. But in reality, that is all one ethernet segment. Such a thing would be nice to have illustrated as one (thick) line with all nodes attached to that.
The same goes for a local ethernet segment somewhere as well. Having everything illustrated as point-to-point connections makes for lots of lines, and sometimes some confusion.
Another kind of graph that would be cool (but even harder) would be to have a map of the world, with the nodes placed out, and connections. That kind of map would work to have everything illustrated as point-to-point connections. But figuring out the physical locations is another story. (I guess the only way would be if people could put that kind of information in some file, in a format that would be machine parseable.)
Anyone feeling like tackling this? :-)
Johnny
