Article
An efficient algorithm for name resolution in computer networks

https://doi.org/10.1016/0169-7552(87)90005-5Get rights and content

Abstract

The name resolution problem is to determine the current location of a resource when it is requested. In a large network, each site cannot store the locations of all resources available in the network and hence a search algorithm may have to be invoked when a program uses a remote resource. We present a search algorithm that requires considerably less bandwidth than the currently used flooding algorithms. The bandwidth and search time of the proposed algorithm are analyzed and compared with a controlled flooding algorithm. We also explore the relationship between the bandwidth required by the search algorithms and the network connectivity.

References (8)

  • A. Bernstein et al.

    Storing and Retrieving the Network State

  • A. Birrel et al.

    Grapevine: An Exercise in Distributed Computing

    (April 1992)
  • Y. Dalal

    Broadcast Protocols in Packet-Switched Computer Networks

  • Dasgupta P., LeBlanc R. and Spafford G., Clouds: An Architecture for Reliable Distributed Operating Systems, Technical...
There are more references available in the full text version of this article.

Cited by (0)

View full text