Re: Navigation with centroids

Christian Huitema (Christian.Huitema@sophia.inria.fr)
Tue, 03 May 1994 17:32:27 +0200

Message-Id: <199405031532.AA01029@mitsou.inria.fr>
To: Simon E Spero <ses@tipper.oit.unc.edu>
Subject: Re: Navigation with centroids
In-Reply-To: Your message of "Tue, 03 May 1994 11:15:27 EDT."
<9405031515.AA07674@tipper.oit.unc.edu>
Date: Tue, 03 May 1994 17:32:27 +0200
From: Christian Huitema <Christian.Huitema@sophia.inria.fr>

Simon,

Do I understand correctly that you suggest:

1) that each "subordinate" keeps a centroid of all its "parents", collapsing
all the parents subordinates, so that it can chose "the best" parent to
poll,

2) that all possible servers are tried in sequence, with a "cost of access"
ordering,

3) that the query stops at the first match?

Christian Huitema