Re: algorithm for list of nodes
Graham Phillips (graham@ISI.EDU)
Wed, 29 Jan 97 10:07:22 PST
>
> bortsche@cayman.crd.ge.com (Betty J Bortscheller) said:
>
> Betty> I'm fairly new to tkined and scotty and would appreciate some
> Betty> help. We have a program we run that collects network performance
> Betty> information between two nodes. Someone other than me has already
> Betty> incorporated this program into our tkined. What I don't understand
> Betty> is the order in which the nodes get passed to this program when
> Betty> it's executed. We have a diagram of 8 nodes, some are in a star
> Betty> topology and one node is on a different LAN. When I execute our
> Betty> program after selecting 2 nodes, it isn't clear to me in what order
> Betty> the nodenames get passed to this program. Can anyone point me
> Betty> to a place where I can get this info? Thanks.
>
> The nodes are hashed internally which means that the order is
> implementation dependent. You can't control the order via the user
> interface. Note that some ways to select nodes do not imply an order
> at all. (Thats why I did not bother to preserve an order if you select
> nodes one by one.)
> Juergen
I have an application in which it would be very useful if this order were
preserved. The application allows the user to set up an ATM virtual circuit
through a list of *ordered* nodes.
After some playing around I realized that the order in which the user selected
nodes was not preserved. I avoided this problem by having the user select
*links* instead of nodes. This method, however, does require extra processing
to string these links together into a ordered sequence. However, it is still
impossible to determine the first link from the last link.
--Graham
--
!! This message is brought to you via the `tkined & scotty' mailing list.
!! Please do not reply to this message to unsubscribe. To subscribe or
!! unsubscribe, send a mail message to <tkined-request@ibr.cs.tu-bs.de>.
!! See http://wwwsnmp.cs.utwente.nl/~schoenw/scotty/ for more information.