跳到主要內容

臺灣博碩士論文加值系統

(3.231.230.177) 您好!臺灣時間:2021/08/02 10:42
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

我願授權國圖
: 
twitterline
研究生:何泰慶
研究生(外文):Tai-Ching Ho
論文名稱:基於三元內容定址記憶體的省電多重比對封包分類
論文名稱(外文):Power-Efficient Multimatch Packet Classification by Using TCAM
指導教授:王丕中
學位類別:碩士
校院名稱:國立中興大學
系所名稱:資訊科學與工程學系
學門:工程學門
學類:電資工程學類
論文種類:學術論文
畢業學年度:96
語文別:英文
論文頁數:39
中文關鍵詞:封包分類低功率TCAM多重比對
外文關鍵詞:packet classificationlow powerTCAMmulti-match
相關次數:
  • 被引用被引用:0
  • 點閱點閱:109
  • 評分評分:
  • 下載下載:0
  • 收藏至我的研究室書目清單書目收藏:0
在網際網路上,當我們考慮路由器的核心時,封包分類是一個非常重要的議題。 而在諸多網路應用程式,例如入侵偵測系統等等,往往需要多個吻合的比對結果,而在處理多個比對結果是相當費時的,例如線性搜尋,因此TCAM 便成了在硬體上快速搜尋的方法,然而伴隨而來的是大量的功率消耗以及處理輸出的位元向量的不便利。因此在此篇論文中,我們利用Geometric Intersection-Based Solutions來解決多重比對的問題,此方法只需傳回在TCAM 中的第一個比對結果即可達到多重比對的要求,而為了減少TCAM 的功率消耗,我們提出分群的機制來決定TCAM區塊的開關與否,此方法只需兩階段的TCAM 搜尋,透過只開啟吻合的區塊來達到節省功率的目的。
經由上述兩個方法的結合,將可快速有效的完成多重比對的封包分類並達到省電的結果。
Packet classification is an important issue when we consider kernel of the router in the Internet. It is needed to obtain matched results in some Internet programs such as Intrusion Detection System. A number of algorithms have been derived to carry out packet classification to handle the heavy traffic of the Internet, and TCAM is among one of them. TCAM has become a high-speed policy in hardware. However, it comes with large power consumption and the inconvenience of dealing with the bit vector. For these reasons, we utilize Geometric Intersection-Based Solutions to solve multi-match problems in this paper. It only needs to feedback the first match of TCAM and could achieve the purpose of multi-match. In order to reduce the power consumption of TCAM, we present a scheme to partition TCAM to decide whether TCAM blocks are enabled or not. This method needs only two phases of TCAM search and minimizes power consumption through enabling only few blocks for search.
By combining Geometric Intersection-Based Solutions and the scheme of TCAM partitioning, we can achieve multi-match and power-efficient packet classification effectively.
摘要 i
Abstract ii
Contents iii
List of Figures iv
List of Tables v

Chapter 1 Introduction 1
1.1 Overview 1
1.2 Motivation 2
1.3 Thesis Organization 4

Chapter 2 Background 5
2.1 Preliminaries and Terminology 5
2.2 Related Works 7
2.2.1 Multi-match Classification 7
2.2.2 TCAM-based Solution 8
2.2.3 Multi-match Using Discriminators (MUD) 10
2.2.4 Geometric Intersection-Based Solutions 11
2.2.5 Set Splitting Algorithm (SSA) 12
2.2.6 A Hybrid Approach 13
2.2.7 Extended TCAM 15

Chapter 3 Power-Efficient and Multimatch Packet Classification Method 16
3.1 Geometric Intersection-based solution 16
3.1.1 Filter Construction and Sorting 18
3.1.2 Algorithm Proof 20
3.2 TCAM Partitioning 21
3.2.1 System Construction 21
3.2.2 Filter Grouping Algorithm 23
Chapter 4 Simulation Results 27
Chapter 5 Conclusions and Future Work 37
References 38
[1] K. Lakshminarayanan, A. Rangarajan, and S.Venkatachary S.,"Algorithms for Advanced Packet Classification with Ternary CAMs," Proc. ACM Sigcomm, 2005.
[2] S. Singh, F. Baboescu, G. Varghese, and J. Wang, “Packet Classification using Multidimensional Cutting,” in UCSD Technical Report CS2003-0736, 2003.
[3] P. Gupta and N. McKeown, “Packet Classification using Hierarchical Intelligent Cuttings,” in Proc. Hot Interconnects, 1999.
[4] F. Yu, T.V. Lakshman, M. A. Motoyama, and R. H. Katz, “SSA: A Power and Memory Efficient Scheme to Multi-match Packet Classification,” in Proceed Symposium Architecture Network Communication System,, October 2005.
[5] E. Spitznagel, D. Taylor, and J. Turner, “Packet Classification Using Extended TCAMs,” Proceedings of ICNP, 2003.
[6] F. Yu and R. H. Katz, "Efficient Multi-Match Packet Classification with TCAM," Hot Interconnects, August 2004.
[7] Fang Yu, T. V. Lakshman, Martin Austin Motoyama, and Randy H. Katz, “Efficient Multimatch Packet Classification for Network Security Applications,” in IEEE Journal on Selected Areas in Communications, October 2006.
[8] H. Song and J. W. Lockwood, "Efficient Packet Classification for Network Intrusion Detection Using FPGA," Proc. International Symposium on Field Programmable Gate Arrays (FPGA), Monterey, USA, 2005.
[9] D. Taylor and J. Turner, “ClassBench: A Packet Classification Benchmark,” IEEE INFOCOM, 2005.
[10] F. Baboescu, S. Singh, and G. Varghese, “Packet Classification for Core Routers: Is There an Alternatives to CAMs?,” in Proc. IEEE INFOCOM, 2003.
[11] R. Panigrahy and S. Sharma, “Reducing TCAM Power Consumption and Increasing Throughput,” in Proc. Hot Interconnects, August 2001.
[12] Baboescu, F. and G. Varghese, “Scalable Packet Classification,” Proc. of ACM Sigcomm, September 2001.
[13] P. Gupta and N. McKeown, “Packet Classification on Multiple fields,” in SIGCOMM, August 1999.
[14] V. Srinivasan, G. Varghese, S. Suri, and M. Waldvogel, “Fast and Scalable Layer Four Switching,” in SIGCOMM, September 1998.
[15] T. Y. C. Woo., “A Modular Approach to Packet Classification: Algorithms and Results,” in Proc. of IEEE INFOCOM, 2000.
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top
無相關期刊