Research Article
SDN Programming for Heterogeneous Switches with Flow Table Pipelining
Table 1
Flow table corresponding to forwarding tree shown in Figure 
7.
| | 
 |  | ā | Pri | Match | Action |  | 
 |  | Table-0 | 0 | srcMac = :01 | reg0 = 1; goto Table-1; |  | 0 | srcMac = :03 | reg0 = 1; goto Table-1; |  | 0 | srcMac = :02 | reg0 = 2; goto Table-2; |  | 0 | srcMac = :04 | reg0 = 2; goto Table-2; |  | 0 | Otherwise | Punt |  | 
 |  | Table-1 | 0 | dstMac = :11 | reg1 = 1; goto Table-ACTION; |  | 0 | dstMac = :13 | reg1 = 1; goto Table-ACTION; |  | 0 | dstMac = :12 | reg1 = 2; goto Table-ACTION; |  | 0 | dstMac = :14 | reg1 = 2; goto Table-ACTION; |  | 0 | Otherwise | Punt |  | 
 |  | Table-2 | 0 | Otherwise | reg2 = 1; goto Table-ACTION |  | 
 |  | Table-ACTION | 0 | reg0 == 1 && reg1 == 1; | Action1 |  | 0 | reg0 == 1 && reg1 == 2; | Action2 |  | 0 | reg0 == 2 && reg2 == 1; | Drop |  | 0 | Otherwise | Punt |  | 
 | 
 |