Distributed File System | prof. Giovanni Chiola | ![]() |
Each server maintains two fixed-size tables of cooperating servers: one with nearest neighbors connected by fast links; another with servers that are far away. |
||
One of the first K stripes is always accepted unless the server runs out of memory. | ||
Additional original stripes are forwarded to a nearest neighbor. | ||
Redundant stripes are either accepted (only if no other stripe is already stored) or forwarded to a far away neighbor. | ||
Addresses of servers that accepted a stripe are cached in form of "hints". Retrieve and Update requests are forwarded using such hints. If no hint is available, requestes are forwarded at random to one nearest neighbor and/or one or more far away neighbors. | ||
previous | proto05.htm | next |