babeld 1.6.1-1 source package in Ubuntu
Changelog
babeld (1.6.1-1) unstable; urgency=medium * New upstream release -- Stéphane Glondu <email address hidden> Sat, 20 Jun 2015 11:33:19 +0200
Upload details
- Uploaded by:
- Stéphane Glondu
- Uploaded to:
- Sid
- Original maintainer:
- Stéphane Glondu
- Architectures:
- any
- Section:
- net
- Urgency:
- Medium Urgency
See full publishing history Publishing
| Series | Published | Component | Section |
|---|
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| babeld_1.6.1-1.dsc | 1.8 KiB | fb16424fdb76545c54957af45d10c7fc93d6890afac891490536a5f83b6c8f5f |
| babeld_1.6.1.orig.tar.gz | 83.9 KiB | 54c72b903e9107955a1e274c37db8fe5c9555e7c61bd4b2572ba5358457085b4 |
| babeld_1.6.1-1.debian.tar.xz | 10.5 KiB | eb53fce04c5e142e427c61e1e7391a178dd6996a7cf684db5d3581b78f3ca4c2 |
Available diffs
- diff from 1.6.0-1 to 1.6.1-1 (3.8 KiB)
No changes file available.
Binary packages built by this source
- babeld: No summary available for babeld in ubuntu wily.
No description available for babeld in ubuntu wily.
- babeld-dbgsym: debug symbols for package babeld
Babel is a distance-vector routing protocol for IPv6 and IPv4 with
fast convergence properties, described in RFC 6126. It was designed
to be robust and efficient on both wireless mesh networks and
classical wired networks. Babel has extremely modest memory and CPU
requirements. Unlike most routing protocols, which route either IPv4
or IPv6 but not both at the same time, Babel is a hybrid IPv6 and
IPv4 protocol: a single update packet can carry both IPv6 and IPv4
routes (this is similar to how multi-protocol BGP works). This makes
Babel particularly efficient on dual (IPv6 and IPv4) networks. This
implementation also includes a radio frequency-aware variant of
Babel.
.
Babel has the following features:
* it is a distance-vector protocol;
* it is a proactive protocol, but with adaptative (reactive)
features;
* it senses link quality for computing route metrics using a variant
of the ETX algorithm;
* it uses a feasibility condition that guarantees the absence of
loops (the feasibility condition is taken from EIGRP and is
somewhat less strict than the one in AODV);
* it uses sequence numbers to make old routes feasible again (like
DSDV and AODV, but unlike EIGRP);
* it speeds up convergence by reactively requesting a new sequence
number (like AODV, and to a certain extent EIGRP, but unlike
DSDV);
* it allows redistributed external routes to be injected into the
routing domain at multiple points (like EIGRP, but unlike DSDV and
AODV).
