Title :
Analysis of a class of distributed directory algorithms
Author :
Gopal, P.M. ; Kadaba, B.K.
Author_Institution :
IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA
Abstract :
Three directory schemes are investigated: the local cache (LC) scheme in which there is a cache at the network nodes to store the results of a previous query for a remote resource so that a subsequent query for that resource can be resolved locally, and two enhancements of this scheme, namely the regional cache server (RCS) scheme and the cooperating cache servers (CCS) scheme, in which the queries not resolved locally are funneled through designated nodes or servers to reduce multiple network searchers for a given resource. The performance of these schemes in terms of the network search rate is dependent on the cache sizes at the nodes and servers, the probability distribution for queuing resources, and the cache replacement policy used to displace resources from the cache to accommodate newly discovered ones. Two policies are investigated: A0, which is the optimal policy for the LC scheme, and the least recently used policy, which is of practical importance
Keywords :
buffer storage; distributed processing; storage management; cache replacement policy; cache sizes; computer networks; cooperating cache servers; distributed directory algorithms; local cache; network nodes; network search rate; probability distribution; queuing resources; regional cache server; Algorithm design and analysis; Cache storage; Carbon capture and storage; Circuits; Computer networks; Distributed algorithms; Frequency; Network servers; Peer to peer computing; Performance analysis;
Conference_Titel :
INFOCOM '89. Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies. Technology: Emerging or Converging, IEEE
Conference_Location :
Ottawa, Ont.
Print_ISBN :
0-8186-1920-1
DOI :
10.1109/INFCOM.1989.101468
