Skip to main content

Advertisement

Fig. 2 | EURASIP Journal on Embedded Systems

Fig. 2

From: Optimizing linear routing in the ToLHnet protocol to improve performance over long RS-485 buses

Fig. 2

Dijkstra-generated tree and routing tables. The logical topology of the example depicted in the previous figure is shown below. Addresses are assigned to the children according to a depth-first pre-order visit of the tree (and are shown in the tag attached to the nodes in the format address@depth). This leads to the minimal routing tables shown on the right, as each node needs at most one entry, besides the implicit routes (own address and default route). There, span is the address range to match, dir is the amount to add to the current depth. Lookup stops after the first match

Back to article page