1. 28 6月, 2012 4 次提交
  2. 25 6月, 2012 2 次提交
  3. 21 6月, 2012 8 次提交
  4. 14 5月, 2012 1 次提交
    • A
      batman-adv: improve unicast packet (re)routing · 3275e7cc
      Antonio Quartulli 提交于
      In case of a client X roaming from a generic node A to another node B, it is
      possible that a third node C gets A's OGM but not B's. At this point in time, if
      C wants to send data to X it will send a unicast packet destined to A. The
      packet header will contain A's last ttvn (C got A's OGM and so it knows it).
      
      The packet will travel towards A without being intercepted because the ttvn
      contained in its header is the newest for A.
      
      Once A will receive the packet, A's state will not report to be in a "roaming
      phase" (because, after a roaming, once A sends out its OGM, all the changes are
      committed and the node is considered not to be in the roaming state anymore)
      and it will match the ttvn carried by the packet. Therefore there is no reason
      for A to try to alter the packet's route, thus dropping the packet because the
      destination client is not there anymore.
      
      However, C is well aware that it's routing information towards the client X is
      outdated as it received an OGM from A saying that the client roamed away.
      Thanks to this detail, this patch introduces a small change in behaviour: as
      long as C is in the state of not knowing the new location of client X it will
      forward the traffic to its last known location using ttvn-1 of the destination.
      By using an older ttvn node A will be forced to re-route the packet.
      Intermediate nodes are also allowed to update the packet's destination as long
      as they have the information about the client's new location.
      Signed-off-by: NAntonio Quartulli <ordex@autistici.org>
      3275e7cc
  5. 11 3月, 2012 1 次提交
  6. 17 2月, 2012 2 次提交
  7. 22 8月, 2011 1 次提交
  8. 20 6月, 2011 1 次提交
    • A
      batman-adv: improved client announcement mechanism · a73105b8
      Antonio Quartulli 提交于
      The client announcement mechanism informs every mesh node in the network
      of any connected non-mesh client, in order to find the path towards that
      client from any given point in the mesh.
      
      The old implementation was based on the simple idea of appending a data
      buffer to each OGM containing all the client MAC addresses the node is
      serving. All other nodes can populate their global translation tables
      (table which links client MAC addresses to node addresses) using this
      MAC address buffer and linking it to the node's address contained in the
      OGM. A node that wants to contact a client has to lookup the node the
      client is connected to and its address in the global translation table.
      
      It is easy to understand that this implementation suffers from several
      issues:
       - big overhead (each and every OGM contains the entire list of
         connected clients)
       - high latencies for client route updates due to long OGM trip time and
         OGM losses
      
      The new implementation addresses these issues by appending client
      changes (new client joined or a client left) to the OGM instead of
      filling it with all the client addresses each time. In this way nodes
      can modify their global tables by means of "updates", thus reducing the
      overhead within the OGMs.
      
      To keep the entire network in sync each node maintains a translation
      table version number (ttvn) and a translation table checksum. These
      values are spread with the OGM to allow all the network participants to
      determine whether or not they need to update their translation table
      information.
      
      When a translation table lookup is performed in order to send a packet
      to a client attached to another node, the destination's ttvn is added to
      the payload packet. Forwarding nodes can compare the packet's ttvn with
      their destination's ttvn (this node could have a fresher information
      than the source) and re-route the packet if necessary. This greatly
      reduces the packet loss of clients roaming from one AP to the next.
      Signed-off-by: NAntonio Quartulli <ordex@autistici.org>
      Signed-off-by: NMarek Lindner <lindner_marek@yahoo.de>
      Signed-off-by: NSven Eckelmann <sven@narfation.org>
      a73105b8
  9. 30 5月, 2011 4 次提交
  10. 08 5月, 2011 1 次提交
  11. 02 5月, 2011 1 次提交
  12. 18 4月, 2011 1 次提交
  13. 05 3月, 2011 8 次提交
  14. 12 2月, 2011 2 次提交
  15. 11 2月, 2011 1 次提交
    • S
      batman-adv: Use successive sequence numbers for fragments · c2f7f0e7
      Sven Eckelmann 提交于
      The two fragments of an unicast packet must have successive sequence numbers to
      allow the receiver side to detect matching fragments and merge them again. The
      current implementation doesn't provide that property because a sequence of two
      atomic_inc_return may be interleaved with another sequence which also changes
      the variable.
      
      The access to the fragment sequence number pool has either to be protected by
      correct locking or it has to reserve two sequence numbers in a single fetch.
      The latter one can easily be done by increasing the value of the last used
      sequence number by 2 in a single step. The generated window of two currently
      unused sequence numbers can now be scattered across the two fragments.
      Reported-by: NLinus Lüssing <linus.luessing@web.de>
      Signed-off-by: NSven Eckelmann <sven@narfation.org>
      c2f7f0e7
  16. 08 2月, 2011 1 次提交
  17. 31 1月, 2011 1 次提交