(Solved) : Consider Following Pattern Matching Table Rule 1st Field F1 2nd Field F2 P 00 Q 1 0 R 001 Q35420206 . . .
Consider the following pattern-matching table:
Rule
1st Field (F1)
2nd Field (F2)
P
*
00*
Q
1*
0*
R
001*
10*
S
01*
1*
T
110*
11*
U
00*
1*
A) Construct a two-dimensional geometric view of the rules usingF1 representing the horizontal and F2 representing the verticalaxes (use different border line patterns/colors/thicknesses to havethe rule areas separated from the neighboring areas).
B) Build a hierarchical binary tree representation of the rulesin the table that can be used for pattern matching.
C) Show the Hierarchical intelligent cutting version of thetwo-dimensional rule space in A with four cuts in the horizontal(F1) and two cuts in vertical (F2) dimensions and its correspondingsearch tree.
D) Use the binary tree in B to search for the match for theincoming packet with F1/F2 = 00100/100101.
E) Repeat D using the tree in C.
F) Repeat D for F1/F2 = 11011/001111.
G) Repeat E for F1/F2 = 11011/001111.
H) Assuming three bits for F1 and two bits for F2 and no wildcharacters, what would be the
maximum number of possible rules for this table?
I) Calculate what percentage of the incoming packets will NOTmatch any rules in the table.
Expert Answer
Answer to Consider Following Pattern Matching Table Rule 1st Field F1 2nd Field F2 P 00 Q 1 0 R 001 Q35420206 . . .
OR