babeld 1.3.0-1 source package in Ubuntu

Changelog

babeld (1.3.0-1) unstable; urgency=low

  * New upstream release
 -- Ubuntu Archive Auto-Sync <email address hidden>   Mon,  19 Dec 2011 11:05:20 +0000

Upload details

Uploaded by:
Ubuntu Archive Auto-Sync on 2011-12-19
Uploaded to:
Precise
Original maintainer:
St├ęphane Glondu
Architectures:
any
Section:
net
Urgency:
Low Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Precise release on 2011-12-19 universe net

Downloads

File Size SHA-256 Checksum
babeld_1.3.0.orig.tar.gz 63.4 KiB a3ddc737b32ec338810f6e726cc3fd57b672db3d9c1f554a49d1a8c25eb6112c
babeld_1.3.0-1.debian.tar.gz 5.1 KiB afec27b482583ca1d95c57d48cc81b141a6fed3194c1cd31f37c8f69fbe82ff7
babeld_1.3.0-1.dsc 1.8 KiB 13e084a67a75ecb947ad4515dae1ae6baa5cb880edfa7a21ed7e04b6ea59f4b8

Available diffs

View changes file

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