Searching with Mobile Agents in Networks with Liars

Authors:
Nicolas Hanusse;Evangelos Kranakis;Danny Krizanc
Affiliations:
-;-;-
Venue:
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
Year:
2000

Citing 11
Cited 0

The complexity of searching a graph

Journal of the ACM (JACM)
Monotonicity in graph searching

Journal of Algorithms
Searching in the plane

Information and Computation
Self-stabilizing end-to-end communication

Journal of High Speed Networks
Exploring unknown environments

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Computation in noisy radio networks

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Exploring unknown undirected graphs

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Bubbles: Adaptive Routing Scheme for High-Speed Dynamic Networks

SIAM Journal on Computing
Routing on butterfly networks with random faults

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Upper and lower bounds for routing schemes in dynamic networks

SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Expanders might be practical: fast algorithms for routing around faults on multibutterflies

SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present algorithms to search for an item s contained in a node of a network, without prior knowledge of its exact location. Each node of the network has a database that will answer queries of the form "how do I get to s?" by responding with the first edge on a shortest path to s. It may happen that some nodes, called liars, give bad advice. If the number of liars k is bounded, we show different strategies to find the item depending on the topology of the network. In particular we consider the complete graph, ring, torus, hypercube and bounded degree trees.