Locating Information with Uncertainty in Fully Interconnected Networks: The Case of Nondistributed Memory

Lefteris M. Kirousis; Evangelos Kranakis; Danny Krizanc; Yannis C. Stamatiou

doi:10.1002/net.10094

Locating Information with Uncertainty in Fully Interconnected Networks: The Case of Nondistributed Memory

Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Yannis C. Stamatiou

Computer Science

Research output: Contribution to journal › Article › peer-review

Abstract

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.

Original language	English (US)
Pages (from-to)	169-180
Number of pages	12
Journal	Networks
Volume	42
Issue number	3
DOIs	https://doi.org/10.1002/net.10094
State	Published - Oct 2003

Keywords

Complete network
Information retrieval
Random walks
Search
Uncertainty

ASJC Scopus subject areas

Software
Information Systems
Hardware and Architecture
Computer Networks and Communications

Access to Document

10.1002/net.10094

Cite this

@article{1af7359e9ab641a2b84613518e28db55,

title = "Locating Information with Uncertainty in Fully Interconnected Networks: The Case of Nondistributed Memory",

abstract = "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.",

keywords = "Complete network, Information retrieval, Random walks, Search, Uncertainty",

author = "Kirousis, {Lefteris M.} and Evangelos Kranakis and Danny Krizanc and Stamatiou, {Yannis C.}",

year = "2003",

month = oct,

doi = "10.1002/net.10094",

language = "English (US)",

volume = "42",

pages = "169--180",

journal = "Networks",

issn = "0028-3045",

publisher = "Wiley-Liss Inc.",

number = "3",

}

TY - JOUR

T1 - Locating Information with Uncertainty in Fully Interconnected Networks

T2 - The Case of Nondistributed Memory

AU - Kirousis, Lefteris M.

AU - Kranakis, Evangelos

AU - Krizanc, Danny

AU - Stamatiou, Yannis C.

PY - 2003/10

Y1 - 2003/10

N2 - 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.

AB - 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.

KW - Complete network

KW - Information retrieval

KW - Random walks

KW - Search

KW - Uncertainty

UR - http://www.scopus.com/inward/record.url?scp=2142736174&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=2142736174&partnerID=8YFLogxK

U2 - 10.1002/net.10094

DO - 10.1002/net.10094

M3 - Article

AN - SCOPUS:2142736174

SN - 0028-3045

VL - 42

SP - 169

EP - 180

JO - Networks

JF - Networks

IS - 3

ER -

Locating Information with Uncertainty in Fully Interconnected Networks: The Case of Nondistributed Memory

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this