| 1 |
Source: babeld |
| 2 |
Section: net |
| 3 |
Maintainer: Stéphane Glondu <[email protected]> |
| 4 |
Uploaders: Benda Xu <[email protected]> |
| 5 |
Build-Depends: |
| 6 |
debhelper-compat (= 13), |
| 7 |
dh-sequence-cruft, |
| 8 |
libb2-dev, |
| 9 |
Standards-Version: 4.7.4 |
| 10 |
Homepage: http://www.pps.univ-paris-diderot.fr/~jch/software/babel/ |
| 11 |
Vcs-Browser: https://salsa.debian.org/debian/babeld |
| 12 |
Vcs-Git: https://salsa.debian.org/debian/babeld.git |
| 13 |
|
| 14 |
Package: babeld |
| 15 |
Architecture: any |
| 16 |
Depends: |
| 17 |
${shlibs:Depends}, |
| 18 |
${misc:Depends} |
| 19 |
Pre-Depends: ${misc:Pre-Depends} |
| 20 |
Suggests: ahcpd |
| 21 |
Description: loop-free distance-vector routing protocol |
| 22 |
Babel is a distance-vector routing protocol for IPv6 and IPv4 with |
| 23 |
fast convergence properties, described in RFC 6126. It was designed |
| 24 |
to be robust and efficient on both wireless mesh networks and |
| 25 |
classical wired networks. Babel has extremely modest memory and CPU |
| 26 |
requirements. Unlike most routing protocols, which route either IPv4 |
| 27 |
or IPv6 but not both at the same time, Babel is a hybrid IPv6 and |
| 28 |
IPv4 protocol: a single update packet can carry both IPv6 and IPv4 |
| 29 |
routes (this is similar to how multi-protocol BGP works). This makes |
| 30 |
Babel particularly efficient on dual (IPv6 and IPv4) networks. This |
| 31 |
implementation also includes a radio frequency-aware variant of |
| 32 |
Babel. |
| 33 |
. |
| 34 |
Babel has the following features: |
| 35 |
* it is a distance-vector protocol; |
| 36 |
* it is a proactive protocol, but with adaptative (reactive) |
| 37 |
features; |
| 38 |
* it senses link quality for computing route metrics using a variant |
| 39 |
of the ETX algorithm; |
| 40 |
* it uses a feasibility condition that guarantees the absence of |
| 41 |
loops (the feasibility condition is taken from EIGRP and is |
| 42 |
somewhat less strict than the one in AODV); |
| 43 |
* it uses sequence numbers to make old routes feasible again (like |
| 44 |
DSDV and AODV, but unlike EIGRP); |
| 45 |
* it speeds up convergence by reactively requesting a new sequence |
| 46 |
number (like AODV, and to a certain extent EIGRP, but unlike |
| 47 |
DSDV); |
| 48 |
* it allows redistributed external routes to be injected into the |
| 49 |
routing domain at multiple points (like EIGRP, but unlike DSDV and |
| 50 |
AODV). |