babeld 1.9.1-1 source package in Ubuntu


babeld (1.9.1-1) unstable; urgency=medium

  * New upstream release.

 -- Benda Xu <email address hidden>  Sun, 26 Jan 2020 13:53:14 +0800

Upload details

Uploaded by:
St├ęphane Glondu
Uploaded to:
Original maintainer:
St├ęphane Glondu
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Jammy release universe net
Impish release universe net
Hirsute release universe net
Groovy release universe net
Focal release universe net


File Size SHA-256 Checksum
babeld_1.9.1-1.dsc 2.1 KiB 5470733306beb8d16e3ea6410f10fa169101afe5009c249117fd0341c6bab4ce
babeld_1.9.1.orig.tar.gz 92.4 KiB 1e1b3c01dd929177bc8d027aff1494da75e1e567e1f60df3bb45a78d5f1ca0b4
babeld_1.9.1.orig.tar.gz.asc 488 bytes d3edfb51d3fcbe032a523f745fef2baaceba0bfa1abc928b8483cc8cdbd10df2
babeld_1.9.1-1.debian.tar.xz 11.5 KiB 45a9d07e6a0bf687ab9e0b40ccc2a30d51e2e87250b56cdb1ac1afac8e526f40

Available diffs

No changes file available.

Binary packages built by this source

babeld: loop-free distance-vector routing protocol

 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 has the following features:
  * it is a distance-vector protocol;
  * it is a proactive protocol, but with adaptative (reactive)
  * 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
  * it allows redistributed external routes to be injected into the
    routing domain at multiple points (like EIGRP, but unlike DSDV and

babeld-dbgsym: debug symbols for babeld