babeld 1.4.3-1 source package in Ubuntu

Changelog

babeld (1.4.3-1) unstable; urgency=low


  * New upstream release

 -- Stéphane Glondu <email address hidden>  Fri, 22 Nov 2013 00:12:28 +0100

Upload details

Uploaded by:
Stéphane Glondu
Uploaded to:
Sid
Original maintainer:
Stéphane Glondu
Architectures:
any
Section:
net
Urgency:
Low Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Trusty release universe net

Downloads

File Size SHA-256 Checksum
babeld_1.4.3-1.dsc 1.8 KiB e884f211741b52c027c2ef51b6ba8fd05c4e0e1e0b518a04283b444baa4dd99e
babeld_1.4.3.orig.tar.gz 69.4 KiB d0b80fa9714591b13bb695af32b5116e21286687df5f2e814cf4f57ecf030ba3
babeld_1.4.3-1.debian.tar.gz 5.3 KiB 246e5b78920b4c903b2aa7ad21e7fbe82bab95f2439b7a5a2f069a67263cbdc2

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.
 .
 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).