1. 11 5月, 2012 3 次提交
  2. 18 4月, 2012 3 次提交
  3. 11 4月, 2012 2 次提交
    • S
      batman-adv: add basic bridge loop avoidance code · 23721387
      Simon Wunderlich 提交于
      This second version of the bridge loop avoidance for batman-adv
      avoids loops between the mesh and a backbone (usually a LAN).
      
      By connecting multiple batman-adv mesh nodes to the same ethernet
      segment a loop can be created when the soft-interface is bridged
      into that ethernet segment. A simple visualization of the loop
      involving the most common case - a LAN as ethernet segment:
      
      node1  <-- LAN  -->  node2
        |                   |
      wifi   <-- mesh -->  wifi
      
      Packets from the LAN (e.g. ARP broadcasts) will circle forever from
      node1 or node2 over the mesh back into the LAN.
      
      With this patch, batman recognizes backbone gateways, nodes which are
      part of the mesh and backbone/LAN at the same time. Each backbone
      gateway "claims" clients from within the mesh to handle them
      exclusively. By restricting that only responsible backbone gateways
      may handle their claimed clients traffic, loops are effectively
      avoided.
      Signed-off-by: NSimon Wunderlich <siwu@hrz.tu-chemnitz.de>
      Signed-off-by: NAntonio Quartulli <ordex@autistici.org>
      23721387
    • S
      batman-adv: remove old bridge loop avoidance code · a7f6ee94
      Simon Wunderlich 提交于
      The functionality is to be replaced by an improved implementation,
      so first clean up.
      Signed-off-by: NSimon Wunderlich <siwu@hrz.tu-chemnitz.de>
      Signed-off-by: NAntonio Quartulli <ordex@autistici.org>
      a7f6ee94
  4. 11 3月, 2012 1 次提交
  5. 17 2月, 2012 5 次提交
  6. 08 9月, 2011 1 次提交
  7. 22 8月, 2011 1 次提交
  8. 05 7月, 2011 1 次提交
  9. 20 6月, 2011 4 次提交
    • A
      batman-adv: gateway election code refactoring · 2265c141
      Antonio Quartulli 提交于
      The gateway election mechanism has been a little revised. Now the
      gw_election is trigered by an atomic_t flag (gw_reselect) which is set
      to 1 in case of election needed, avoding to set curr_gw to NULL.
      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>
      2265c141
    • A
      batman-adv: protect the local and the global trans-tables with rcu · 7683fdc1
      Antonio Quartulli 提交于
      The local and the global translation-tables are now lock free and rcu
      protected.
      Signed-off-by: NAntonio Quartulli <ordex@autistici.org>
      Acked-by: NSimon Wunderlich <siwu@hrz.tu-chemnitz.de>
      Signed-off-by: NSven Eckelmann <sven@narfation.org>
      7683fdc1
    • A
      batman-adv: improved roaming mechanism · cc47f66e
      Antonio Quartulli 提交于
      With the current client announcement implementation, in case of roaming,
      an update is triggered on the new AP serving the client. At that point
      the new information is spread around by means of the OGM broadcasting
      mechanism. Until this operations is not executed, no node is able to
      correctly route traffic towards the client. This obviously causes packet
      drops and introduces a delay in the time needed by the client to recover
      its connections.
      
      A new packet type called ROAMING_ADVERTISEMENT is added to account this
      issue.
      
      This message is sent in case of roaming from the new AP serving the
      client to the old one and will contain the client MAC address. In this
      way an out-of-OGM update is immediately committed, so that the old node
      can update its global translation table. Traffic reaching this node will
      then be redirected to the correct destination utilising the fresher
      information. Thus reducing the packet drops and the connection recovery
      delay.
      Signed-off-by: NAntonio Quartulli <ordex@autistici.org>
      Signed-off-by: NSven Eckelmann <sven@narfation.org>
      cc47f66e
    • 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
  10. 30 5月, 2011 1 次提交
  11. 08 5月, 2011 3 次提交
  12. 05 3月, 2011 4 次提交
  13. 12 2月, 2011 1 次提交
  14. 31 1月, 2011 1 次提交
  15. 17 12月, 2010 1 次提交
  16. 30 11月, 2010 5 次提交
  17. 11 11月, 2010 1 次提交
  18. 10 11月, 2010 1 次提交
  19. 21 10月, 2010 1 次提交