Article ID: | iaor20041595 |
Country: | United States |
Volume: | 42 |
Issue: | 3 |
Start Page Number: | 169 |
End Page Number: | 180 |
Publication Date: | Oct 2003 |
Journal: | Networks |
Authors: | Kranakis Evangelos, Kirousis M., Krizanc Danny, Stamatiou Yannis C. |
Keywords: | information theory |
We consider the problem of searching for a piece of information in a fully interconnected computer network (also called a complete network or clique) by exploiting advice about its location from the network nodes. Each node contains a database that “knows” what kind of documents or information is stored in other nodes (e.g., a node could be a Web server that answers queries about documents stored on the Web). The databases in each node, when queried, provide a pointer that leads to the node that contains the information. However, this information is up-to-date (or correct) with some bounded probability. While, in principle, one may always locate the information by simply visiting the network nodes in some prescribed ordering, this requires a time complexity in the order of the number of nodes of the network. In this paper, we provide algorithms for locating an information node in the complete communication network, which take advantage of advice given from network nodes. The nodes may either give correct advice, by pointing directly to the information node, or give wrong advice, by pointing elsewhere. On the lower-bounds' side, we show that no fixed-memory (i.e., with memory independent of the network size) deterministic algorithm may locate the information node in a constant (independent of the network size) expected number of steps. Moreover, if