Error when implementing the shortest path code

[IamBushra]

I'm trying to implement "Using Bellman-Ford to find a shortest path". but when run ping between h1 and h2 the packet didn't reach.

~/pox$ ./pox.py bellmanford openflow.discovery
POX 0.5.0 (eel) / Copyright 2011-2014 James McCauley, et al.
INFO:core:POX 0.5.0 (eel) is up.
INFO:openflow.of_01:[00-00-00-00-00-01 1] connected
INFO:openflow.of_01:[00-00-00-00-00-05 5] connected
INFO:openflow.of_01:[00-00-00-00-00-04 2] connected
INFO:openflow.of_01:[00-00-00-00-00-03 3] connected
INFO:openflow.of_01:[00-00-00-00-00-02 4] connected
WARNING:bellmanford:Not flooding -- holddown active
INFO:openflow.discovery:link detected: 00-00-00-00-00-01.2 -> 00-00-00-00-00-02.1
INFO:openflow.discovery:link detected: 00-00-00-00-00-01.3 -> 00-00-00-00-00-03.1
INFO:openflow.discovery:link detected: 00-00-00-00-00-05.1 -> 00-00-00-00-00-02.2
INFO:openflow.discovery:link detected: 00-00-00-00-00-05.2 -> 00-00-00-00-00-04.2
INFO:openflow.discovery:link detected: 00-00-00-00-00-04.1 -> 00-00-00-00-00-03.2
WARNING:bellmanford:Not flooding -- holddown active

[MurphyMc]

I can't really say for sure since bellmanford seems to be a modification of a component that POX came with, not one of the originals.

But... have you tried waiting for a few seconds and then running the ping? The WARNING indicates it may still be waiting for things to calm down.