ls3-www.cs.tu-dortmund.de/cms/medien/publikationen/boppard07.pdf
\documentstyle[german,deutsch]{llncs}
Traffic Congestion Avoid-
ance in Real-Time Inspired by Honey Bee Behavior Horst F. Wedde
1 , Sebastian Lehnhoff
1
1University of Dortmund, School of Computer Science, 44227 Dortmund
Zusammenfassung. Traffic [...] to identify the single most desirable
food [1] (In comparison OSPF always chooses a next hop on the shortest path).
Abb. 1. BeeHive Flooding Algorithm
Abb. 1 provides an exemplary partitioning of the flooding [...] 4
IFZarea 1 2 3 4 5 6 7
1 c11 c21 c31 c41 c51 c61 c71
3 c13 c23 c33 c43 c53 c63 c73
5 c15 c25 c35 c45 c55 c65 c75
Hence, c71 represents the costs of traveling from node 4 to node 7 over node 1.
On the area …