[1991] Proceedings. 11th International Conference on Distributed Computing Systems
DOI: 10.1109/icdcs.1991.148734
|View full text |Cite
|
Sign up to set email alerts
|

A comparison of two approaches to build reliable distributed file servers

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(2 citation statements)
references
References 9 publications
0
2
0
Order By: Relevance
“…By this mechanism, each server will update its load state periodically to its server group while its load state is changed by equation ( I ) and (2). And, the most heavyloaded server will inform NFS client to change its target server to another candidate server, choose by the most heavy-loaded server.…”
Section: E Load-sharing Policymentioning
confidence: 99%
“…By this mechanism, each server will update its load state periodically to its server group while its load state is changed by equation ( I ) and (2). And, the most heavyloaded server will inform NFS client to change its target server to another candidate server, choose by the most heavy-loaded server.…”
Section: E Load-sharing Policymentioning
confidence: 99%
“…Commercial solutions include clustering [2,11], hardware support, such as usage of dual-ported disks [3], and others. Such solutions however are susceptible to "site-disaster", For example, the network link to the cluster may fail or simply be temporarily congested, rendering the whole cluster inaccessible and disrupting the service, while nodes in the cluster are functional.…”
Section: Introductionmentioning
confidence: 99%