An adaptive randomised structured search network for locating objects in a distributed computing system

Jia-bin Li, C. Fung, D. Myers · 2007

Summary

An Adaptive RandoMised Structured search network termed ARMS is presented that provides name resolution by forwarding a query through neighbouring nodes through the use of the flexible neighbour selection and a distributed Ant Colony Optimisation algorithm (ACO).

Published: 2007-01-01
Cited by: 0
References: 23
Semantic Scholar: https://api.semanticscholar.org/CorpusID:18763241

References

Symphony: Distributed Hashing in a Small WorldGurmeet Singh Manku, Mayank Bawa, Prabhakar Raghavan — 2003
An Infrastructure for Fault-tolerant Wide-area Location and RoutingBen Y. Zhao, John Kubiatowicz, Anthony D. Joseph — 2001
Efficient and scalable query routing for unstructured peer-to-peer networksAbhishek Kumar, Jun Xu, E.W. Zegara — 2005
On power-law relationships of the Internet topologyMichalis Faloutsos, Petros Faloutsos, Christos Faloutsos — 1999
Search and replication in unstructured peer-to-peer networksQin Lv, Pei Cao, Edith Cohen — 2002
Actor induction and meta-evaluationCarl Hewitt, Peter Bishop, Irene Greif — 1973
Incrementally improving lookup latency in distributed hash table systemsHui Zhang, Ashish Goel, Ramesh Govindan — 2003
The impact of DHT routing geometry on resilience and proximityKrishna P. Gummadi, R. Gummadi, Steven D. Gribble — 2003
A random graph model for massive graphsWilliam Aiello, Fan Chung, Linyuan Lü — 2000
A local search mechanism for peer-to-peer networksVana Kalogeraki, Dimitrios Gunopulos, Demetrios Zeinalipour-Yazti — 2002
RASTER: a light-weight routing protocol to discover shortest overlay routes in randomized DHT systemsChih-Chiang Wang, Khaled Harfoush — 2006
Performance analysis of distributed search in open agent systemsVassilios V. Dimakopoulos, Evaggelia Pitoura — 2003
Chord: A scalable peer-to-peer lookup service for internet applicationsIon Stoica, Robert Morris, David R. Karger — 2001
A scalable content-addressable networkSylvia Ratnasamy, Paul Francis, Mark Handley — 2001
Pastry: Scalable, distributed object location and routing for large-scale peer-to-A. Rowstron, P. Druschel — 2001
Are Virtualized Overlay Networks Too Much of a Good Thing?P. Keleher, Bobby Bhattacharjee, Bujor D. Silaghi — 2002
Routing Algorithms for DHTs: Some Open QuestionsSylvia Ratnasamy, Ion Stoica, S. Shenker — 2002
1 Positive Feedback as a Search StrategyM. Dorigo, V. Maniezzo, A. Colorni — 1991
Dynamic Lookup NetworksM. Castro, Peter Druschel, Y. C. Hu — 2003

Cited by

No citing papers recorded for this paper.

Related papers

No related papers recorded.