Information and Computation
Searching in an unknown environment: an optimal randomized algorithm for the cow-path problem
Information and Computation
Freenet: a distributed anonymous information storage and retrieval system
International workshop on Designing privacy enhancing technologies: design issues in anonymity and unobservability
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
A scalable content-addressable network
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Search and replication in unstructured peer-to-peer networks
ICS '02 Proceedings of the 16th international conference on Supercomputing
Replication strategies in unstructured peer-to-peer networks
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Operations Research
Optimization problems in congestion control
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Revisiting the TTL-based controlled flooding search: optimality and randomization
Proceedings of the 10th annual international conference on Mobile computing and networking
Heterogeneous Search in Unstructured Peer-to-Peer Networks
IEEE Distributed Systems Online
Optimal Controlled Flooding Search in a Large Wireless Network
WIOPT '05 Proceedings of the Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
Adaptive strategies for efficiently locating internet-based servers in MANETs
MSWiM '05 Proceedings of the 8th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems
Design and analysis of adaptive strategies for locating internet-based servers in MANETs
Performance Evaluation
Novel approaches to efficient flooding search in peer-to-peer networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Controlled flooding search in a large network
IEEE/ACM Transactions on Networking (TON)
On search sets of expanding ring search in wireless networks
Ad Hoc Networks
Hybrid Retrieval Mechanisms in Vehicle-Based P2P Networks
ICCS '09 Proceedings of the 9th International Conference on Computational Science: Part I
Hi-index | 0.00 |
We consider flood search on a line and show that no algorithm can achieve an average-case competitive ratio of less than 4 when compared to the optimal off-line algorithm. We also demonstrate that the optimal scanning sequences are described by simple recursive relationships that yield surprisingly complex behavior related to Hamiltonian chaos.