A symmetric and resilient configuration scheme for multiple name servers

Author

Nakajima, Amane

Author_Institution

IBM Tokyo Res. Lab., Tokyo, Japan

fYear

1991

fDate

11-13 Sep 1991

Firstpage

651

Lastpage

658

Abstract

A configuration scheme is presented for multiple name servers and name service protocol. The scheme creates a configuration with any number of name servers, and realizes a symmetric and fault-tolerant name service. Name data are distributed to name servers equally and the cost of the name service is independent of the server location. The scheme is efficient because it realizes a lower bound of communication complexity. An investigation is also made of the relations among the number of nodes, the number of name servers, fault-tolerance, the number of data in a server, and the total number of data in all servers to obtain equations for these relationships. Changes in the resiliency and the number of data are shown as functions of the number of nodes and the number of servers in three cases

Keywords

computational complexity; distributed processing; fault tolerant computing; protocols; communication complexity; configuration scheme; fault-tolerant name service; lower bound; multiple name servers; name data; name service protocol; Complexity theory; Costs; Equations; Fault tolerance; Laboratories; Load management; Marine vehicles; Network servers; Operating systems; Protocols;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Software and Applications Conference, 1991. COMPSAC '91., Proceedings of the Fifteenth Annual International

Conference_Location

Tokyo

Print_ISBN

0-8186-2152-4

Type

conf

DOI

10.1109/CMPSAC.1991.170256

Filename

170256