期刊文献+

网络处理器中的快速GTP隧道检查方法

Bloom filter method for checking GTP channels
下载PDF
导出
摘要 针对网络处理器中快速存储资源有限和微引擎缺乏存储管理方法等制约实现快速、大量GPRS隧道协议(GPRS tunneling protocol,GTP)隧道检查的问题。提出了基于布隆过滤器(Bloom filter,BF)的数据隧道端点标识(data tunnel endpoint identifier Bloom filter,DTEID BF)方法,该方法将冲突问题转化为误判率问题,通过合理利用快速存储资源减少读写操作周期,采用并行运算提高处理速度,给出了应用该方法的具体步骤和参数选择方法。通过在IXP2850中实现DTEID BF方法并进行吞吐量和延时测试,证明该方法在吞吐量上接近1 Gb/s,在最大延时和平均延时指标上优于Trie方法。 To solve the problems that fast storage resources are limited and memory management methods are absence in micro-engines which restrict the network processor to achieve a large number of GTP(GPRS tunneling protocol) tunnels inspections quickly.DTEID BF method based on Bloom filter is put forward.DTEID BF method transforms the confliction problems into a discusse on false judgment,reduces storage operation by utilizing the fast storage rationally and adopts parallel computing to improve processing speed.The principle of parameters selection and detailed steps are introduced.Through experiments of throughput and latency in IXP 2850,the result shows that DTEID BF achieves nearly 1 Gb/s of processing speed.The maximum delay and average delay of DTEID BF are superior to those of Trie.
出处 《系统工程与电子技术》 EI CSCD 北大核心 2010年第2期423-427,共5页 Systems Engineering and Electronics
基金 教育部科技创新工程重大项目培育资金(707047)资助课题
关键词 GPRS隧道协议 网络处理器 布隆过滤器 微引擎 GPRS tunneling protocol network processor Bloom filter micro-engine
  • 相关文献

参考文献10

  • 1文志成.GPRS网络技术[M].北京:电子工业出版社,2005..
  • 23GPP. GPRS tunneling protocol (GTP) across the Gn and Gp interface [Z]. TS29. 060. v3. 3. 0, 2000:14 - 30.
  • 33GPP. Technical specification. 3rd generation partnership project; technical specification group services and system aspects [Z]. TS 23. 060. V5.2.0, 2002:25 - 31.
  • 4Hung H N, Lin Y B. Connection failure detection mechanism of UMTS charging protocol[J]. IEEE Trans. on Wireless Communication, 2006,5: 1180 - 1186.
  • 5张宏科,苏伟,武勇.网络处理器原理和技术[M].北京:北京邮电大学出版社,2004.
  • 6Intel Crop. Intel IXP2850 network processor, Hardware reference manual[Z]. Intel, 2004:1 - 3.
  • 7Hyesook L, Hye R K, Yeo J J. Parallel multiple hashing for packet classification[C]//Proc, of High Performance Switching and Routing, USA, 2005:104 - 107.
  • 8Bloom B. Space/time trade-offs in hash coding with allowable errors[J]. Communications of the ACM, 1970,13 (7) : 422 - 426.
  • 9Andrei B, Michael M. Network applications of bloom filters: A survey internet math[J]. International Journal Mathematics, 2003,1 (4) : 485 - 509.
  • 10Dharmapurikar S, Krishnamurthy P, Sproull T, et al. Deep packet inspection using parallel Bloom filters[C]//Proc, of the Symposium. On High Performance Interconnects, 2003:44 -51.

共引文献71

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部