Hi All. I'm try to understand how l2_multi
(https://github.com/noxrepo/pox/blob/betta/pox/forwarding/l2_multi.py)
works and have a question -  does ryu have similar ability to calc
shortest path and get loop free topology in mesh network like:

          gw1       gw2
         /        \   /         \
        /          /              \
       /         /   \              \
  gre0    gre1     gre0    gre1
      |      |             |         |
      |      |             |         |
     ovs-tun  <--->   ovs-tun
          |        gre        |
     ovs-vm             ovs-vm
      node1              node2


-- 
Vasiliy Tolstov,
e-mail: [email protected]
jabber: [email protected]

------------------------------------------------------------------------------
Android is increasing in popularity, but the open development platform that
developers love is also attractive to malware creators. Download this white
paper to learn more about secure code signing practices that can help keep
Android apps secure.
http://pubads.g.doubleclick.net/gampad/clk?id=65839951&iu=/4140/ostg.clktrk
_______________________________________________
Ryu-devel mailing list
[email protected]
https://lists.sourceforge.net/lists/listinfo/ryu-devel

Reply via email to