Clue tables: a distributed, dynamic-binding naming mechanism

  • Authors:
  • Cheng-Zen Yang;Chih-Chung Chen;Yen-Jen Oyang

  • Affiliations:
  • Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan, R.O.C.;Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan, R.O.C.;Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan, R.O.C.

  • Venue:
  • USTC'94 Proceedings of the USENIX Summer 1994 Technical Conference on USENIX Summer 1994 Technical Conference - Volume 1
  • Year:
  • 1994

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents a distributed, dynamic naming mechanism called clue tables for building highly scalable, highly available distributed file systems. The clue tables naming mechanism is distinctive in three aspects. First, it is designed to cope well with the hierarchical structure of the modern large-scale computer networks. Second, it implicitlycarries out load balancing among servers to improve systemscalability. Third, it supports file replication and dynamically designates a primary copy to resolve possible data inconsistency. This paper also reports a performance evaluation of the clue tables mechanism when compared with NFS, a popular distributed file system.