- Page 4: Chad R. Meiners • Alex X. Liu •
- Page 8: This book is dedicated to chance en
- Page 12: viii Contents 5 Bit Weaving .......
- Page 16: List of Figures 2.1 IllustrationofF
- Page 20: List of Tables 1.1 An example packe
- Page 24: 2 1 Introduction 1.1 Motivation To
- Page 28: Chapter 2 Background We now formall
- Page 32: 2.1 Firewall decision diagrams 7 In
- Page 36: 2.2 One-Dimensional Classier Minimi
- Page 40: 2.2 One-Dimensional Classier Minimi
- Page 44: 2.2 One-Dimensional Classier Minimi
- Page 48: 16 3 Related Work tion schemes have
- Page 52:
18 3 Related Work 3.1.2 Range Encod
- Page 56:
20 3 Related Work An Encoding Schem
- Page 60:
22 3 Related Work is fast; however,
- Page 64:
24 3 Related Work allow each node i
- Page 68:
Consider the following TCAM Minimiz
- Page 72:
32 4 TCAM Razor [Gouda and Liu(2007
- Page 76:
34 4 TCAM Razor Rule # F 1 Decision
- Page 80:
36 4 TCAM Razor another copy of the
- Page 84:
38 4 TCAM Razor Input: A packet cla
- Page 88:
Chapter 5 Bit Weaving Prior TCAM-ba
- Page 92:
5.1 Bit Swapping 43 The rest of thi
- Page 96:
5.1 Bit Swapping 45 Fig. 5.2 Exampl
- Page 100:
5.2 Bit Merging 47 cross-free parti
- Page 104:
5.2 Bit Merging 49 Theorem 5.4. For
- Page 108:
5.3 Discussion 51 Lemma 5.3. Consid
- Page 112:
5.3 Discussion 53 5.3.4 Prex Shadow
- Page 116:
5.4 Complexity Analysis of Bit Weav
- Page 120:
Chapter 6 All-Match Redundancy Remo
- Page 124:
6.1 All-Match Based Redundancy Theo
- Page 128:
6.2 All-Match Based Redundancy Remo
- Page 132:
6.2 All-Match Based Redundancy Remo
- Page 136:
6.3 Optimization Techniques 65 gets
- Page 140:
6.4 Classier Incremental Updates 67
- Page 144:
6.5 Redundancy Analysis 69 Input: v
- Page 148:
Part II New Architectural Approache
- Page 152:
Chapter 7 Sequential Decomposition
- Page 156:
7.1 Multi-Lookup Approach 77 packet
- Page 160:
7.1 Multi-Lookup Approach 79 ⇓ Ta
- Page 164:
7.1 Multi-Lookup Approach 81 TCAM.
- Page 168:
7.2 Pipelined-lookup Approach 83 ea
- Page 172:
7.3 Packing Approach 85 7.2.3.1 Spa
- Page 176:
7.3 Packing Approach 87 Fig. 7.6 St
- Page 180:
7.3 Packing Approach 89 7.3.2 Shado
- Page 184:
7.3 Packing Approach 91 idea of SPa
- Page 188:
7.4 Table Consolidation 93 7.3.3 St
- Page 192:
7.4 Table Consolidation 95 strategy
- Page 196:
7.6 Implementation Issues 97 The pa
- Page 200:
7.6 Implementation Issues 99 7.6.4
- Page 204:
102 8 Topological Transformations c
- Page 208:
104 8 Topological Transformations T
- Page 212:
106 8 Topological Transformations A
- Page 216:
108 8 Topological Transformations F
- Page 220:
110 8 Topological Transformations C
- Page 224:
112 8 Topological Transformations F
- Page 228:
114 8 Topological Transformations 8
- Page 232:
116 8 Topological Transformations P
- Page 236:
References [Applegate et al(2007)Ap
- Page 240:
References 121 [iva san et al(1999)