There is a network graph in the loopremover module that has the capability for Dijkstra, but is currently not enabled/used. By default if you run the l2switch project out of the box it runs in a flood mode which installs flood flows from each port to all other ports. (It isn't pretty but it allows newcomers to execute 'pingall' in mininet and see traffic flowing)
The l2switch-main module observes packet-ins to the controller and installs mac-to-mac L2 flows when it sees unicast ARP traffic. (match dest-mac, fwd out known port) Evan On Tue, May 8, 2018 at 6:35 AM, Haitham Ghalwash <haitham.ghalw...@uconn.edu > wrote: > Hi All, > > How L2switching feature in open-daylight, carbon and successors, decides > the paths for packet switching? it was mention somewhere that old versions > were using Dijkstra algorithm. I do not think that aplies for the new > versions, is that true? What algorithm is currently used? > > *Haitham Ghalwash* > > *Ph.D. Student– Computer Science and Engineering* > > *University of Connecticut, Storrs , CT* > > > * <https://www.linkedin.com/pub/haitham-ghalwash/1a/b08/172>* > > > > _______________________________________________ > L2switch-dev mailing list > L2switch-dev@lists.opendaylight.org > https://lists.opendaylight.org/mailman/listinfo/l2switch-dev > >
_______________________________________________ L2switch-dev mailing list L2switch-dev@lists.opendaylight.org https://lists.opendaylight.org/mailman/listinfo/l2switch-dev
