Resource finding in store-and-forward networks

We present a model of searching for a resource in a distributed system whose nodes are connected through a store-and-forward network. Based on this model, we show a lower bound on the number of messages needed to find a resource when nothing is known about the nodes that have the current location of the resource. The model also helps us to establish results about the time complexity of determining a message optimal resource finding algorithm when the probability distribution for the location of the resource in the network is known. We show that the optimization problem is NP-hard for general networks. Finally we show that optimal resource finding algorithms can be determined in polynomial time for a class of tree networks and bidirectional rings. The polynomial algorithms can be used as a basis of heuristic algorithms for general networks.

[1]  T. D. Parsons,et al.  Pursuit-evasion in a graph , 1978 .

[2]  Roger M. Needham,et al.  Grapevine: an exercise in distributed computing , 1982, CACM.

[3]  Paul M. B. Vitányi,et al.  Distributed match-making for processes in computer networks (preliminary version) , 1985, PODC '85.

[4]  Lawrence D. Stone,et al.  Optimal Search Using Uninterrupted Contact Investigation , 1971 .

[5]  B. O. Koopman.  Search and Screening: General Principles and Historical Applications , 1980 .

[6]  Mostafa H. Ammar,et al.  Using multicast communication to locate resources in LAN-based distributed system , 1988, Proceedings [1988] 13th Conference on Local Computer Networks.

[7]  Robert J. Fowler,et al.  The complexity of using forwarding addresses for decentralized object finding , 1986, PODC '86.

[8]  Douglas B. Terry.  Caching Hints in Distributed Systems , 1987, IEEE Transactions on Software Engineering.

[9]  Christos H. Papadimitriou,et al.  The complexity of searching a graph , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[10]  Mostafa H. Ammar,et al.  Optimal selection of multicast groups for resource location in a distributed system , 1989, IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies.

[11]  Y. C. Kan.  Optimal Search of a Moving Target , 1977, Oper. Res..

[12]  K E Trummel,et al.  Technical Note - The Complexity of the Optimal Searcher Path Problem , 1986, Oper. Res..

[13]  Nicholas F. Maxemchuk,et al.  Routing in the Manhattan Street Network , 1987, IEEE Trans. Commun..

[14]  Flaminio Borgonovo,et al.  Locally-optimal deflection routing in the Bidirectional Manhattan Network , 1990, Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration.

[15]  L. Stone.  Theory of Optimal Search , 1975 .

[16]  Paul M. B. Vitányi,et al.  Distributed match-making , 1988, Algorithmica.

[17]  Robert Joseph Fowler,et al.  Decentralized object finding using forwarding address , 1985 .

[18]  Paul M. B. Vitányi,et al.  Distributed match-making for processes in computer networks , 1986, OPSR.