Skip to main content
USENIX
  • Conferences
  • Students
Sign in

connect with us


  •  Twitter
  •  Facebook
  •  LinkedIn
  •  Google+
  •  YouTube

twitter

Tweets by @usenix

usenix conference policies

  • Event Code of Conduct
  • Conference Network Policy
  • Statement on Environmental Responsibility Policy

You are here

Home ยป Clue Tables: A Distributed, Dynamic-Binding Naming Mechanism
Tweet

connect with us

Clue Tables: A Distributed, Dynamic-Binding Naming Mechanism

Authors: 

Cheng-Zen Yang, Chih-Chung Chen, Yen-Jen Oyang, National Taiwan University

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 implicitly carries out load balancing among servers to improve system scalability. 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.

Cheng-Zen Yang, National Taiwan University

Chih-Chung Chen, National Taiwan University

Yen-Jen Oyang, National Taiwan University

BibTeX
@inproceedings {252800,
author = {Cheng-Zen Yang and Chih-Chung Chen and Yen-Jen Oyang},
title = {Clue Tables: A Distributed, Dynamic-Binding Naming Mechanism},
booktitle = {{USENIX} Summer 1994 Technical Conference ({USENIX} Summer 1994 Technical Conference)},
year = {1994},
address = {Boston, MA},
url = {https://www.usenix.org/conference/usenix-summer-1994-technical-conference/clue-tables-distributed-dynamic-binding-naming},
publisher = {{USENIX} Association},
month = jun,
}
Download

Links

Paper: 
http://usenix.org/publications/library/proceedings/bos94/full_papers/yang.ps
  • Log in or    Register to post comments

© USENIX

  • Privacy Policy
  • Conference Policies
  • Contact Us