2003-10-01
Locating Information with Uncertainty in Fully Interconnected Networks: The Case of Nondistributed Memory
Publication
Publication
Networks , Volume 42 - Issue 3 p. 169- 180
The problem of searching for a piece of information in a fully interconnected computer network by exploiting advice about its location from the network nodes is discussed. Each node contains a database that knows what kind of documents or information are stored in other nodes. The databases in each node, when queried, provide a pointer that leads to the node that contains the information. It is found that the information is up-to-date with some bounded probability.
| Additional Metadata | |
|---|---|
| Complete network, Information retrieval, Random walks, Search, Uncertainty | |
| dx.doi.org/10.1002/net.10094 | |
| Networks | |
| Organisation | School of Computer Science |
|
Kirousis, L.M. (Lefteris M.), Kranakis, E, Krizanc, D. (Danny), & Stamatiou, Y.C. (Yannis C.). (2003). Locating Information with Uncertainty in Fully Interconnected Networks: The Case of Nondistributed Memory. Networks, 42(3), 169–180. doi:10.1002/net.10094
|
|