DocumentCode
3254871
Title
A simulation based analysis of naming schemes for distributed systems
Author
Znati, Taieb B. ; Molka, Judith
Author_Institution
Dept. of Comput. Sci., Pittsburgh Univ., PA, USA
fYear
1992
fDate
6-9 Apr 1992
Firstpage
42
Lastpage
51
Abstract
As the Internet grows in size and number of users, the way in which resources are identified and accessed becomes increasingly important. This implies the need for an efficient naming service. A naming service is a facility that enables clients to name objects, and subsequently use these names to locate these objects. Developing a naming facility and choosing the naming conventions involves a tradeoff between performance, user friendliness, object mobility, availability of naming information, individual autonomy, storage space requirement, and the cost of maintaining data consistency. The purpose of this paper is to analyze three different naming schemes in a wide area network, and study the impact of design parameters such as transmission capabilities, cache hit ratio, and servers´ rate of failure on the performance of a naming facility
Keywords
distributed processing; object-oriented methods; virtual machines; wide area networks; Internet; cache hit ratio; data consistency; design parameters; distributed systems; individual autonomy; information availability; naming schemes; naming service; object mobility; performance; resource access; resource identification; server failure rate; simulation based analysis; storage space requirement; transmission capabilities; user friendliness; wide area network; Analytical models; Availability; Computational modeling; Computer science; Computer simulation; Distributed computing; Human computer interaction; Internet; Performance analysis; Wide area networks;
fLanguage
English
Publisher
ieee
Conference_Titel
Simulation Symposium, 1992. Proceedings., 25th Annual
Conference_Location
Orlando, FL
Print_ISBN
0-8186-2765-4
Type
conf
DOI
10.1109/SIMSYM.1992.227578
Filename
227578
Link To Document