|From:||"Simon 'corecode' Schubert" <corecode@xxxxxxxxxxxx>|
|Date:||Tue, 03 Apr 2007 13:31:05 +0200|
One big issue still needs to be resolved, and that is how to figure out an optimal physical route from point A to point C without having to go through point B, where point B is the registration node used as a rendezvous for A and C. It is always possible for A to issue a cluster-wide broadcast to 'forge' a route to C, or vise-versa, and we will probably implement things this way initially (and always have it available for emergencies), but it would not scale as the cluster grows despite the fairly rough granularity in the resources being advertised (e.g. filesystems rather then files).
1. shortest hop 2. maximize minimum bandwidth 3. lowest latency 4. node/link availability of the routing nodes
-- Serve - BSD +++ RENT this banner advert +++ ASCII Ribbon /"\ Work - Mac +++ space for low €€€ NOW!1 +++ Campaign \ / Party Enjoy Relax | http://dragonflybsd.org Against HTML \ Dude 2c 2 the max ! http://golden-apple.biz Mail + News / \
Description: OpenPGP digital signature