Keywords
BeehiveForagingComputer scienceScalabilityRouting (electronic design automation)Honey beeArtificial intelligenceDistributed computingEcologyComputer networkBiologyDatabase
Affiliated Institutions
Related Publications
SkipNet: a scalable overlay network with practical locality properties
Abstract: Scalable overlay networks such as Chord, CAN, Pastry, and Tapestry have recently emerged as flexible infrastructure for building large peer-to-peer systems. In practic...
How Information-Mapping Patterns Determine Foraging Behaviour of a Honey Bee Colony
We have developed a model of foraging behaviour of a honeybee colony based on reaction-diffusion equations and have studied how mapping the information about the explored enviro...
PAST: a large-scale, persistent peer-to-peer storage utility
This paper sketches the design of PAST, a large-scale, Internet-based, global storage utility that provides scalability, high availability, persistence and security. PAST is a p...
Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and
In today''s chaotic network, data and services are mobile and replicated widely for availability, durability, and locality. Components within this infrastructure interact in ric...
Publication Info
- Year
- 2004
- Type
- book-chapter
- Pages
- 83-94
- Citations
- 231
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
231
OpenAlex
Cite This
Horst F. Wedde,
Muddassar Farooq,
Yue Zhang
(2004).
BeeHive: An Efficient Fault-Tolerant Routing Algorithm Inspired by Honey Bee Behavior.
Lecture notes in computer science
, 83-94.
https://doi.org/10.1007/978-3-540-28646-2_8
Identifiers
- DOI
- 10.1007/978-3-540-28646-2_8