The BFSM Algorithm The transition rules L2.A T.A. B B (a)State-transition diagram lle current state input next state priority 1 1108 Ih S 2 Ih S 2h S aBsON H RRRRRR Bh Ah S
The BFSM Algorithm • The transition rules
The BFSM Algorithm The block diagram of BFSM put State Register Transition Rule Rule Selector Memory ext state a)Block diagram test part result part current next table state/nput conditions state addressmask H (b) Transition-rule vector
The BFSM Algorithm • The block diagram of BFSM
The BFSM Algorithm Rule Selector Policy: Balanced Routing Table Searching Algorithm rule current state input next state prionity 0001b RRRRRR 0001b S 0010b S4 1011b 1010b (a) Transition rules I rule RA rule Rs rule R6 0 rule Ri rule R2 rule Rs rule R6 (b) BArT-compressed transition-rule table H
The BFSM Algorithm • Rule Selector Policy: Balanced Routing Table Searching Algorithm
The BFSM Algorithm Balanced Routing Table Searching Algorithm The maximum number of collisions for every hash index is no more than a configurable bound P The index bits optimally selected by an update function +NEsN.4 H
The BFSM Algorithm • Balanced Routing Table Searching Algorithm: • ** The maximum number of collisions for every hash index is no more than a configurable bound P. • The index bits: • ** optimally selected by an update function