登入選單
返回Google圖書搜尋
註釋Abstract: "We model the process 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 necessary to find a resource when nothing is known about the location of the resource. The model also helps us to establish some results about the complexity of finding optimal algorithms to locate a resource when the probablilty distribution for the location of the resource in the network is known. We show that the optimization problem is NP-hard for general networks.