跳到主要內容

臺灣博碩士論文加值系統

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

詳目顯示

我願授權國圖
: 
twitterline
研究生:鄭維倫
研究生(外文):Wei-Lun Cheng
論文名稱:高效能管線化最長字首比對設計
論文名稱(外文):A High-performance Pipeline Longest Prefix Matching Circuit
指導教授:張延任
學位類別:碩士
校院名稱:國立中興大學
系所名稱:資訊科學與工程學系
學門:工程學門
學類:電資工程學類
論文種類:學術論文
畢業學年度:96
語文別:中文
論文頁數:66
中文關鍵詞:最長字首比對封包路由路由器
外文關鍵詞:longest prefix matchingLPMinternet package routingrouter
相關次數:
  • 被引用被引用:0
  • 點閱點閱:125
  • 評分評分:
  • 下載下載:0
  • 收藏至我的研究室書目清單書目收藏:0
在本論文中,我們將會提出一個高效能管線化最長字首比對的電路設計,此架構用於解決路由器上封包的路由機制。在此我們會討論以往用以解決最長字首比對(LPM)的方法,並進一步說明我們利用三元內容定址記憶體為基礎所提出的架構。我們所提出的設計使用純硬體的方式來解決最長字首比對的問題,與傳統架構比較並不需要做字首(prefix)的排序。我們所提出的電路設計利用三層管線化的技術來增加效能。本設計使用台積電0.13微米製程來驗證電路,實際電路大小為32*32。實際模擬結果在1.2v的供應電壓與時脈頻率為50MHz之下,能有效解決封包路由機制,並確實得到所要搜尋的最長字首。
In this paper, we will propose a High-performance Pipeline Longest Prefix Matching circuit, the circuit solve package routing on the internet router. In this paper we discussed previous solution for the longest prefix matching, in detail we explained our circuit composed by ternary content addressable memory. Compared conventional circuit, this design used hardware solution for the longest prefix matching and prefix without sorting. We proposed the circuit design uses three pipeline technologies to increase performance. The whole design was fabricated with the TSMC 0.13um CMOS process with 32*32 TCAM size. Measurement results indicate that our design can solve the longest prefix matching at 1.2v supply voltage.
摘要………………………………………………………………………i
目錄 ……………………………………………………………………iii
圖目錄 …………………………………………………………………iv
表目錄 …………………………………………………………………v
一、 簡介 ………………………………………………………………1
二、 最長字首比對 (LPM) ……………………………………………4
三、 相關研究 ………………………………………………………15
3.1使用CAM單胞解決最長字首比對 …………………………15
3.2 HLPM…………………………………………………………17
3.3 WC-LPM………………………………………………………19
3.4 利用分段式搜尋解決最長字首比對………………………20
四、 高效能管線化最長字首比對……………………………………22
4.1 TCAM矩陣 …………………………………………………24
4.2 優先權編碼器………………………………………………25
4.3 CAM矩陣 ……………………………………………………26
4.4 流程說明……………………………………………………28
4.5 架構細部電路………………………………………………33
五、 晶片製作 ………………………………………………………44
5.1 晶片製作流程………………………………………………45
5.2 晶片佈局圖…………………………………………………46
六、 模擬結果 ………………………………………………………55
七、 結論………………………………………………………………62
八、 未來展望 ………………………………………………………63
九、 參考文獻 ………………………………………………………64
[1] Kasnavi, S.; Gaudet, V.C.; Berube, P.; Amaral, J.N., “A hardware-based longest prefix matching scheme for TCAMs,” ISCAS’05. May 23-26 2005, pp. 3339 – 3342
[2] B.; Pfeffer, Z.; Khatri, S.P. , “A fast ternary CAM design for IP networking applications Gamache,”ICCCN’03, In Proc.The 12th International Conference,October 20-23 2003, pp. 434 – 439
[3] Tsai, Ruei-Jhe; Ting, Hsin-Wen; Lin, Chi-Sheng; Liu, Bin-Da, “A CAM/WTA-Based High Speed and Low Power Longest Prefix Matching Circuit Design,” Circuits and Systems, 2006. APCCAS 2006. IEEE Asia Pacific Conference on 4-7 Dec 2006, pp. 426 – 429
[4] Kobayashi, M.; Murase, T.; Kuriyama, A. , “A longest prefix match search engine for multi-gigabit IP processing,” Communications, 2000. ICC 2000. 2000 IEEE International Conference on Volume 3, 18-22 June 2000, pp. 1360 – 1364
[5] Kai Zheng; Chengchen Hu; Hongbin Lu; Bin Liu, “A TCAM-based distributed parallel IP lookup scheme and performance analysis,” Networking, IEEE/ACM Transactions on Volume 14, Issue 4, Aug. 2006, pp. 863 – 875
[6] D. Shah and P. Gupta, “Fast Updating Algorithms for TCAMs,” IEEE Micro, vol. 21, Jan/Feb 2001, pp. 36– 7
[7] Hyesook Lim; Ji-Hyun Seo; Yeo-Jin Jung, “High speed IP address lookup architecture using hashing,” Communications Letters, IEEE Volume 7, Issue 10, Oct. 2003, pp. 502 - 504
[8] V.C.; Mahapatra, R.N.; “TCAM architecture for IP lookup using prefix properties Ravikumar,” Micro IEEE Volume 24, Issue 2, Mar-Apr 2004, pp. 60 – 69
[9] Yi Tang; Wei Lin; Bin Liu, “A TCAM Index Scheme for IP Address Lookup,” Communications and Networking in China, 2006. ChinaCom ''06. First International Conference on 25-27 Oct. 2006, pp. 1 - 5
[10] Akhbarizadeh, M.J.; Nourani, M.; Vijayasarathi, D.S.; Balsara, P.T. , “PCAM: a ternary CAM optimized for longest prefix matching tasks,” Computer Design: VLSI in Computers and Processors, 2004. ICCD 2004. Proceedings. IEEE International Conference on 11-13 Oct. 2004, pp. 6 – 11
[11] Vijayasarathi, D.S.; Nourani, M.; Akhbarizadeh, M.J.; Balsara, P.T. , “Ripple-precharge TCAM: a low-power solution for network search engines,” Computer Design: VLSI in Computers and Processors, 2005. ICCD 2005. Proceedings. 2005 IEEE International Conference on 2-5 Oct. 2005, pp. 243 – 248
[12] Zhiyong Liang; Jianping Wu; Ke Xu, “A TCAM-based IP lookup scheme for multi-nexthop routing,” Computer Networks and Mobile Computing, 2003. ICCNMC 2003. 2003 International Conference on 20-23 Oct. 2003, pp. 128 - 135
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top