Re: algorithm for list of nodes

Juergen Schoenwaelder (schoenw@cs.utwente.nl)
Wed, 29 Jan 1997 16:30:04 +0100

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

-- 
Juergen Schoenwaelder schoenw@cs.utwente.nl http://www.cs.utwente.nl/~schoenw
Computer Science Department, University of Twente,   (Fax: +31-53-489-3247)
P.O. Box 217, NL-7500 AE Enschede, The Netherlands.  (Tel. +31-53-489-3678)
--
!! 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.