ls3-www.cs.tu-dortmund.de/cms/medien/publikationen/boppard07.pdf
\documentstyle[german,deutsch]{llncs}
Frisch [1, 2] in the BeeHive project, distri-
buted multi-agent algorithms for network routing [6, 7, 8, 9] have been derived over
the past 5 years. These have been found to be considerably superior in the field [...] (costs). The flooding algorithm is a variant of
the breadth first search algorithm. Nodes 2,3,4,5,6,7,8,9,11 constitute the foraging
zone of node 10.
For routing in packet switching networks the quality of [...] of all links of a node are
approximated by transmitting hello packets. (For more details see e.g. [4,9]).
3 The BeeJamA Algorithm
The algorithm presented in this section is designed for routing vehicles …