17 Feb, 2012

1 commit


22 Aug, 2011

1 commit


30 May, 2011

2 commits


05 Mar, 2011

1 commit


31 Jan, 2011

2 commits

  • Signed-off-by: Sven Eckelmann

    Sven Eckelmann
     
  • The routing algorithm must be able to decide if a fragment can be merged with
    the missing part and still be passed to a forwarding interface. The fragments
    can only differ by one byte in case that the original payload had an uneven
    length. In that situation the sender has to inform all possible receivers that
    the tail is one byte longer using the flag UNI_FRAG_LARGETAIL.

    The combination of UNI_FRAG_LARGETAIL and UNI_FRAG_HEAD flag makes it possible
    to calculate the correct length for even and uneven sized payloads.

    The original formula missed to add the unicast header at all and forgot to
    remove the fragment header of the second fragment. This made the results highly
    unreliable and only useful for machines with large differences between the
    configured MTUs.

    Reported-by: Russell Senior
    Reported-by: Marek Lindner
    Signed-off-by: Sven Eckelmann

    Sven Eckelmann
     

17 Dec, 2010

1 commit

  • B.A.T.M.A.N. (better approach to mobile ad-hoc networking) is a routing
    protocol for multi-hop ad-hoc mesh networks. The networks may be wired or
    wireless. See http://www.open-mesh.org/ for more information and user space
    tools.

    Signed-off-by: Sven Eckelmann
    Signed-off-by: David S. Miller

    Sven Eckelmann