路由器SoC系统架构的研究与设计
|
摘要
作为Internet网络的核心设备，路由器对整个网络系统的性能起到了关键作用。一方面，随着大数据时代的到来，当前的路由器体系结构难以解决目前路由器所面临的容量、效率、扩展性和功耗等问题。另一方面，伴随着网络的快速发展，网络的安全性面临着巨大挑战，需要在路由器中快速发现网络进攻行为，保护网络数据安全。针对路由器在网络传输效率和数据安全两方面的需求，本文对路由器SoC（System on Chip）体系结构、片内通信、互连结构诊断技术、深度包检测技术中特征（模式）匹配技术以及功能验证等关键技术进行了深入的研究，提出一些新的解决思路，为下一代网络路由器的性能和数据安全提升提供借鉴。
论文的主要研究内容和创新性成果包括：
1.对路由器SoC的片内通信机制进行了深入的研究，提出了Mobius立方体的最短路径算法，该算法相对于Cull P提出的算法能快速找到一条最短路径；在此基础上，提出了查找Mobius立方体中任意源/目的节点之间所有最短路径查找算法。
2.基于0型/1型-2维Mobius立方体，提出了一种适于硬件实现的路由器SoC互连结构分层路由交叉互连Mesh结构HRCM，以及适用于该结构的分层路由算法HXY。该结构具有良好的系统性能和可扩展性，易于实现IP路由器中的以完成路由器中的分布式转发和交换。实验结果表明，与Xmesh和Mesh相比，HRCM不论是在系统吞吐量、丢包率还是系统平均延时上都具有较大优势。
3．提出了一种带有容错的分层双环形路由器SoC拓扑结构，该结构中链路分为两组环网，其中有一组环网为备用环网。为该结构设计了一种时分和空分复用的路由算法，分离控制和数据，去除了数据缓存，消除了链路拥塞。仿真结果表明该结构可以有效避免拥塞、死锁和饥饿，保证带宽充分利用。
4.提出一种在PMC模型下HRCM的快速条件诊断算法，通过广度优先搜索遍历整个HRCM网络，在遍历过程中通过相邻节点之间的诊断结果将HRCM中的节点分成若干个集合，再通过集合之间的关系和集合中所含元素的数量识别出故障集合和无故障集合，对于N*N的HRCM网络，该算法的时间复杂度为O (N2)。本文还将该算法有效的推广到超立方体中，用来诊断由多个路由器组成的路由器系统。
5.针对网络安全提出了一种用于深度包检测系统的模式匹配算法基于分布式存储的正则表达式并行匹配算法REPMBDS。实验表明，该算法在处理时间上相比现有的串行匹配算法至少可以提高5倍以上，可以有效地处理在高速、大容量的Internet对网络入侵的实时检测。
6.基于NetFPGA开发板设计了路由器SoC的功能仿真验证平台。该平台通过软件模块对其进行动态系统配置，实现了不同路由器SoC系统的功能仿真与验证。设计了4*4的HRCM路由器SoC系统并进行了仿真。在验证平台上对基于HRCM互连结构的路由器SoC进行了验证，并将深度包检测系统嵌入到该路由器SoC结构中对其完成功能及性能验证。
In order to meet the increasing requirement of higher network transmissionefficiency, various further studies about the Internet Protocol Router, the core equipmentof Internet, whose performance directly determines the performance of whole networksystem, have been taken by researchers. Meanwhile, as the security situation isbecoming serious, many security policies were proposed by researchers to ensure thenormal operation of the network. In this paper, our researches mainly focus on theproblems of current network data transmission efficiency and data security. Based onthe analyses and summarizations of those key technologies such as the deep packetinspection technology of network security, feature (schema) matching techniques, routerSoC architecture, on-chip communication, diagnosis technology for interconnectstructure and function verification, a novel solution idea is proposed, which providessome useful reference for improving the router data transmission efficiency and datasecurity of new network.
The major contributions of this dissertation are as follows.
1. Further researches of the on-chip communication scheme of router SoC aretaken based on the network on chip technology. A shortest path algorithm based onMobius cube which can find a shortest path quickly is proposed in this paper, and onthis basis, a multiple shortest path search algorithm is proposed, which can find all theshortest paths between the source node and destination mode at the same time.
2. A router SoC architecture based on the0-Mobius and1-Mobius cubes ofdimension2, i.e. Hierarchical Routing Cross-Connected Mesh(HRCM), is proposed inthis paper, then a hierarchical routing algorithm HXY (Hierarchical XY) is derived fromthis architecture to perform the functions of switching and forwarding and realize thedistributed forwarding and switching. The simulation results show this structure hasgood performance and scalability.
3. A hierarchical fault-tolerance ring NoC topology is proposed in this paper, inwhich links are divided into two groups rings. One group is used for fault-tolerance incase of the other group fails. Ring network adopts Time-Division Multiplexing andpriority mechanism to implements space-division-multiplexing of bandwidth and fairrouting. Simulation results show that the architecture can avoid traffic congestion,deadlock and hungry and ensure use of bandwidth effectively.
4. A fast condition diagnosis algorithm of HRCM topology under the condition of the PMC model is proposed in this paper. First, traverse all the HRCM by using thebreadth-first search and categorize the HRCM nodes into several sets based on thediagnosis results between adjacent nodes, then identify the fault set and fault-free setthrough the relationship between sets and the amount of the elements contained in thesets. As for the n-level HRCM, the time complexity of this algorithm isO (N2). Thealgorithm can be extended to multi-dimensional cube，ie. Hypercube，Used to diagnoserouter system.
5. A pattern matching algorithm aiming at network content detection is proposedfor deep packet inspection system, i.e. regular expression pattern matching based ondistributed storage (REPMBDS). Simulation results show the proposed algorithmcompared to conventional matching algorithm can improve at least five times inprocessing time performance, which makes it effectively to handle the real-timedetection of the network intrusion in high-speed, large-capacity Internet.
6. A general router SoC functional verification testbench based on NetFPGA isdesigned and implemented in this paper. This testbench achieves the functionalverification of different router SoC systems by performing dynamic systemconfiguration on its software module. The router SoC based on4*4HRCM is designed,and verified. meanwhile, the router SoC with deep packet inspection system is verifiedusing this test platform.
论文的主要研究内容和创新性成果包括：
1.对路由器SoC的片内通信机制进行了深入的研究，提出了Mobius立方体的最短路径算法，该算法相对于Cull P提出的算法能快速找到一条最短路径；在此基础上，提出了查找Mobius立方体中任意源/目的节点之间所有最短路径查找算法。
2.基于0型/1型-2维Mobius立方体，提出了一种适于硬件实现的路由器SoC互连结构分层路由交叉互连Mesh结构HRCM，以及适用于该结构的分层路由算法HXY。该结构具有良好的系统性能和可扩展性，易于实现IP路由器中的以完成路由器中的分布式转发和交换。实验结果表明，与Xmesh和Mesh相比，HRCM不论是在系统吞吐量、丢包率还是系统平均延时上都具有较大优势。
3．提出了一种带有容错的分层双环形路由器SoC拓扑结构，该结构中链路分为两组环网，其中有一组环网为备用环网。为该结构设计了一种时分和空分复用的路由算法，分离控制和数据，去除了数据缓存，消除了链路拥塞。仿真结果表明该结构可以有效避免拥塞、死锁和饥饿，保证带宽充分利用。
4.提出一种在PMC模型下HRCM的快速条件诊断算法，通过广度优先搜索遍历整个HRCM网络，在遍历过程中通过相邻节点之间的诊断结果将HRCM中的节点分成若干个集合，再通过集合之间的关系和集合中所含元素的数量识别出故障集合和无故障集合，对于N*N的HRCM网络，该算法的时间复杂度为O (N2)。本文还将该算法有效的推广到超立方体中，用来诊断由多个路由器组成的路由器系统。
5.针对网络安全提出了一种用于深度包检测系统的模式匹配算法基于分布式存储的正则表达式并行匹配算法REPMBDS。实验表明，该算法在处理时间上相比现有的串行匹配算法至少可以提高5倍以上，可以有效地处理在高速、大容量的Internet对网络入侵的实时检测。
6.基于NetFPGA开发板设计了路由器SoC的功能仿真验证平台。该平台通过软件模块对其进行动态系统配置，实现了不同路由器SoC系统的功能仿真与验证。设计了4*4的HRCM路由器SoC系统并进行了仿真。在验证平台上对基于HRCM互连结构的路由器SoC进行了验证，并将深度包检测系统嵌入到该路由器SoC结构中对其完成功能及性能验证。
In order to meet the increasing requirement of higher network transmissionefficiency, various further studies about the Internet Protocol Router, the core equipmentof Internet, whose performance directly determines the performance of whole networksystem, have been taken by researchers. Meanwhile, as the security situation isbecoming serious, many security policies were proposed by researchers to ensure thenormal operation of the network. In this paper, our researches mainly focus on theproblems of current network data transmission efficiency and data security. Based onthe analyses and summarizations of those key technologies such as the deep packetinspection technology of network security, feature (schema) matching techniques, routerSoC architecture, on-chip communication, diagnosis technology for interconnectstructure and function verification, a novel solution idea is proposed, which providessome useful reference for improving the router data transmission efficiency and datasecurity of new network.
The major contributions of this dissertation are as follows.
1. Further researches of the on-chip communication scheme of router SoC aretaken based on the network on chip technology. A shortest path algorithm based onMobius cube which can find a shortest path quickly is proposed in this paper, and onthis basis, a multiple shortest path search algorithm is proposed, which can find all theshortest paths between the source node and destination mode at the same time.
2. A router SoC architecture based on the0-Mobius and1-Mobius cubes ofdimension2, i.e. Hierarchical Routing Cross-Connected Mesh(HRCM), is proposed inthis paper, then a hierarchical routing algorithm HXY (Hierarchical XY) is derived fromthis architecture to perform the functions of switching and forwarding and realize thedistributed forwarding and switching. The simulation results show this structure hasgood performance and scalability.
3. A hierarchical fault-tolerance ring NoC topology is proposed in this paper, inwhich links are divided into two groups rings. One group is used for fault-tolerance incase of the other group fails. Ring network adopts Time-Division Multiplexing andpriority mechanism to implements space-division-multiplexing of bandwidth and fairrouting. Simulation results show that the architecture can avoid traffic congestion,deadlock and hungry and ensure use of bandwidth effectively.
4. A fast condition diagnosis algorithm of HRCM topology under the condition of the PMC model is proposed in this paper. First, traverse all the HRCM by using thebreadth-first search and categorize the HRCM nodes into several sets based on thediagnosis results between adjacent nodes, then identify the fault set and fault-free setthrough the relationship between sets and the amount of the elements contained in thesets. As for the n-level HRCM, the time complexity of this algorithm isO (N2). Thealgorithm can be extended to multi-dimensional cube，ie. Hypercube，Used to diagnoserouter system.
5. A pattern matching algorithm aiming at network content detection is proposedfor deep packet inspection system, i.e. regular expression pattern matching based ondistributed storage (REPMBDS). Simulation results show the proposed algorithmcompared to conventional matching algorithm can improve at least five times inprocessing time performance, which makes it effectively to handle the real-timedetection of the network intrusion in high-speed, large-capacity Internet.
6. A general router SoC functional verification testbench based on NetFPGA isdesigned and implemented in this paper. This testbench achieves the functionalverification of different router SoC systems by performing dynamic systemconfiguration on its software module. The router SoC based on4*4HRCM is designed,and verified. meanwhile, the router SoC with deep packet inspection system is verifiedusing this test platform.
引文
[1]中国互联网络信息中心.中国互联网络发展状况统计报告[R].北京,2013.
[2] Mayer-Sch nberger V, Cukier K. Big Data: A Revolution that Will Transformhow We Live, Work, and Think[M]. Eamon Dolan/Houghton Mifflin Harcourt,2013.
[3] Odlyzko A M. Internet traffic growth: Sources and implications[C]//ITCom2003.International Society for Optics and Photonics,2003.
[4] Baliga J, Hinton K, Tucker R S. Energy consumption of the Internet[C]//OpticalInternet,2007and the200732nd Australian Conference on Optical Fibre Technology.COIN-ACOFT2007. Joint International Conference on. IEEE,2007.
[5] Moore D, Shannon C, Brown D J, et al. Inferring internet denial-of-serviceactivity[J]. ACM Transactions on Computer Systems (TOCS).2006,24(2):115-139.
[6] Walfish M, Vutukuru M, Balakrishnan H, et al. DDoS defense by offense[J].ACM SIGCOMM Computer Communication Review.2006,36(4):303-314.
[7] Naoumov N, Ross K. Exploiting p2p systems for ddos attacks[C]//Proceedings ofthe1st international conference on Scalable information systems. ACM,2006.
[8] Garcia-Teodoro P, Diaz-Verdejo J, Maciá-Fernández G, et al. Anomaly-basednetwork intrusion detection: Techniques, systems and challenges[J]. computers&security.2009,28(1):18-28.
[9] Provos N, Holz T. Virtual honeypots: from botnet tracking to intrusiondetection[M]. Pearson Education,2007.
[10] Gu G, Porras P, Yegneswaran V, et al. Bothunter: Detecting malware infectionthrough ids-driven dialog correlation[C]//Proceedings of16th USENIX SecuritySymposium on USENIX Security Symposium. USENIX Association,2007.
[11] King S T, Chen P M. SubVirt: Implementing malware with virtual machines[C]//Security and Privacy,2006IEEE Symposium on. IEEE,2006.
[12] Bailey M, Oberheide J, Andersen J, et al. Automated classification and analysis ofinternet malware[C]//Recent Advances in Intrusion Detection. Springer,2007.
[13] Lanzi A, Balzarotti D, Kruegel C, et al. AccessMiner: using system-centricmodels for malware protection[C]//Proceedings of the17th ACM conference onComputer and communications security. ACM,2010.
[14]国家互联网应急中心.2012年我国互联网网络安全态势综述[R].北京,2013.
[15] Aweya J. IP router architectures: an overview[J]. International Journal ofCommunication Systems.2001,14(5):447-475.
[16] Sandhu R S, Coyne E J, Feinstein H L, et al. Role-based access control models[J].Computer.1996,29(2):38-47.
[17] Sandhu R S, Samarati P. Access control: principle and practice[J].Communications Magazine, IEEE.1994,32(9):40-48.
[18] Oppliger R. Internet security: firewalls and beyond[J]. Communications of theACM.1997,40(5):92-102.
[19] Cheswick W R, Bellovin S M, Rubin A D. Firewalls and Internet security:repelling the wily hacker[M]. Addison-Wesley Longman Publishing Co., Inc.,2003.
[20] Handley M, Paxson V, Kreibich C. Network Intrusion Detection: Evasion, TrafficNormalization, and End-to-End Protocol Semantics.[C]//USENIX Security Symposium.2001.
[21] Wang K, Stolfo S J. Anomalous payload-based network intrusion detection[C]//Recent Advances in Intrusion Detection. Springer,2004.
[22] Bayer U, Habibi I, Balzarotti D, et al. A view on current malware behaviors[C]//USENIX workshop on large-scale exploits and emergent threats (LEET).2009.
[23] Gu G, Porras P, Yegneswaran V, et al. Bothunter: Detecting malware infectionthrough ids-driven dialog correlation[C]//Proceedings of16th USENIX SecuritySymposium on USENIX Security Symposium. USENIX Association,2007.
[24] Provos N, Mcnamee D, Mavrommatis P, et al. The ghost in the browser analysisof web-based malware[C]//Proceedings of the first conference on First Workshop onHot Topics in Understanding Botnets.2007.
[25] Moser A, Kruegel C, Kirda E. Exploring multiple execution paths for malwareanalysis[C]//Security and Privacy,2007. SP'07. IEEE Symposium on. IEEE,2007.
[26] Hao S, Syed N A, Feamster N, et al. Detecting Spammers with SNARE:Spatio-temporal Network-level Automatic Reputation Engine.[C]//USENIX SecuritySymposium.2009.
[27] Almeida T A, Yamakami A, Almeida J. Evaluation of approaches fordimensionality reduction applied with Naive Bayes anti-spam filters[C]//MachineLearning and Applications,2009. ICMLA'09. International Conference on. IEEE,2009.
[28] Kreibich C, Kanich C, Levchenko K, et al. Spamcraft: An inside look at spamcampaign orchestration[J]. Proc. of2nd USENIX LEET.2009.
[29] Piyachon P, Luo Y. Efficient memory utilization on network processors for deeppacket inspection[C]//Proceedings of the2006ACM/IEEE symposium on Architecturefor networking and communications systems. ACM,2006.
[30] Dharmapurikar S, Lockwood J. Fast and scalable pattern matching for contentfiltering[C]//Architecture for networking and communications systems,2005. ANCS2005. Symposium on. IEEE,2005.
[31] Dharmapurikar S, Lockwood J. Fast and scalable pattern matching for contentfiltering[C]//Architecture for networking and communications systems,2005. ANCS2005. Symposium on. IEEE,2005.
[32] Cho Y H, Mangione-Smith W H. Deep network packet filter design forreconfigurable devices[J]. ACM Transactions on Embedded Computing Systems(TECS).2008,7(2):21.
[33] Rohrer J, Atasu K, van Lunteren J, et al. Memory-efficient distribution of regularexpressions for fast deep packet inspection[C]//Proceedings of the7th IEEE/ACMinternational conference on Hardware/software codesign and system synthesis. ACM,2009.
[34] Ni J, Lin C, Chen Z, et al. A fast multi-pattern matching algorithm for deeppacket inspection on a network processor[C]//Parallel Processing,2007. ICPP2007.International Conference on. IEEE,2007.
[35] Jacoby G A, Mosley S. Mobile security using separated deep packet inspection[C]//Consumer Communications and Networking Conference,2008. CCNC2008.5thIEEE. IEEE,2008.
[36] Lin P, Lin Y, Lee T, et al. Using string matching for deep packet inspection[J].Computer.2008,41(4):23-28.
[37] Svensson J. Design of a core router using the SoCBUS on-chip network[J].LiTH-ISY-EX.2004,4:3562.
[38] Wiklund D, Ehliar A, Liu D. Design of an Internet core router using the SoCBUSnetwork on chip[C] IEEE,2005.
[39] Shen X B. Evolution of MPP SoC architecture techniques[J]. Science in ChinaSeries F: Information Sciences.2008,51(6):756-764.
[40] Preparata F P, Metze G, Chien R T. On the connection assignment problem ofdiagnosable systems[J]. Electronic Computers, IEEE Transactions on.1967(6):848-854.
[41] Barsi F, Grandoni F, Maestrini P. A theory of diagnosability of digital systems[J].Computers, IEEE Transactions on.1976,100(6):585-593.
[42] Chwa K, Hakimi S L. Schemes for fault-tolerant computing: A comparison ofmodularly redundant and t-diagnosable systems[J]. Information and Control.1981,49(3):212-238.
[43] Lai P, Tan J J, Chang C, et al. Conditional diagnosability measures for largemultiprocessor systems[J]. Computers, IEEE Transactions on.2005,54(2):165-175.
[44] Zhou S, Xiao W. Conditional diagnosability of alternating group networks[J].Information Processing Letters.2010,110(10):403-409.
[45] Zhou S. The conditional diagnosability of twisted cubes under the comparisonmodel[C]//Parallel and Distributed Processing with Applications,2009IEEEInternational Symposium on. IEEE,2009.
[46] Chang G. Conditional ({t}, k)-Diagnosis under the PMC Model[J]. Parallel andDistributed Systems, IEEE Transactions on.2011,22(11):1797-1803.
[47] Yang E, Yang X, Dong Q, et al. Conditional diagnosability of hypermeshes underthe comparison model[J]. Information Processing Letters.2011,111(4):188-193.
[48] Hsu G, Chiang C, Tan J J. Comparison-based conditional diagnosability on theclass of hypercube-like networks[J]. Journal of Interconnection Networks.2010,11(03n04):143-156.
[49] Cho Y H, Mangione-Smith W H. Deep network packet filter design forreconfigurable devices[J]. ACM Transactions on Embedded Computing Systems(TECS).2008,7(2):1-26.
[50] Sung J S, Kang S M, Lee Y, et al. A multi-gigabit rate deep packet inspectionalgorithm using TCAM[C] IEEE,2005.
[51] Yang L, Dantu R, Anderson T, et al. Forwarding and control element separation(ForCES) framework[J].2004.
[52] Hagsand O, Hidell M, Sjodin P. Design and implementation of a distributedrouter[C] IEEE,2005.
[53] Wang W M, Dong L G, Zhuge B. Analysis and implementation of an openprogrammable router based on forwarding and control element separation[J]. Journal ofComputer Science and Technology.2008,23(5):769-779.
[54]张小平，刘振华，赵有健，等.可扩展路由器[J].软件学报.2008,19(6):1452-1464.
[55]戴艺，苏金树，孙志刚，等.一种支持高速IPv6转发的路由器体系结构FIS[J].计算机工程与科学.2009,31(02):4-6.
[56]戴艺，孙志刚，苏金树，等.基于分布式转发交换的并行路由器关键技术研究[J].国防科技大学学报.2008,3:53-58.
[57]孙志刚，戴艺，龚正虎.面向下一代互联网的可扩展路由器体系结构MPFS[J].中国科学: E辑.2008,38(10):1652-1662.
[58] Sun Z G, Dai Y, Gong Z H. MPFS: A truly scalable router architecture for nextgeneration Internet[J]. Science in China Series F: Information Sciences.2008,51(11):1761-1771.
[59]戴艺，苏金树，孙志刚.一种维序的基于组合输入输出排队的并行交换结构[J].软件学报.2008,19(12):3207-3217.
[60] Nalin T, Takashi I, Morino H, et al. A scalable and high capacity router onmulti-dimension crossbar switch principle[C] IEEE,2001.
[61] Tzeng N F. Multistage-based switching fabrics for scalable routers[J]. Parallel andDistributed Systems, IEEE Transactions on.2004,15(4):304-318.
[62] He R, Delgado-Frias J G. Fault Tolerant Interleaved Switching Fabrics forScalable High-Performance Routers[J]. Parallel and Distributed Systems, IEEETransactions on.2007,18(12):1727-1739.
[63]乐祖晖，吴建平，赵有健. CR:基于一类新型结构的可扩展路由器[J].软件学报.2007,18(10):2624-2634.
[64]沈绪榜. MPP系统芯片体系结构技术的发展[J].中国科学: E辑.2008,38(6):933-940.
[65] Hu J, Marculescu R. Energy-and performance-aware mapping for regular NoCarchitectures[J]. Computer-Aided Design of Integrated Circuits and Systems, IEEETransactions on.2005,24(4):551-562.
[66] Ogras U Y, Hu J, Marculescu R. Key research problems in NoC design: a holisticperspective[C] ACM,2005.
[67] Held J, Bautista J, Koehl S. From a few cores to many: A tera-scale computingresearch overview2006/日期.
[68] Team I. Overview of the IBM Blue Gene/P project[J]. IBM Journal of Researchand Development.2008,52(1/2):199-220.
[69] Dally W J. Performance analysis of k-ary n-cube interconnection networks[J].Computers, IEEE Transactions on.1990,39(6):775-785.
[70] Taylor M B, Kim J, Miller J, et al. The Raw microprocessor: A computationalfabric for software circuits and general-purpose programs[J]. Micro, IEEE.2002,22(2):25-35.
[71] Agarwal A, Saif U, Anderson J W. The raw router: gigabit routing on ageneral-purpose microprocessor[D]. Massachusetts Institute of Technology,2004.
[72] Chuvpilo G, Wentzlaff D, Amarasinghe S. Gigabit IP routing on raw[C] Citeseer,2002.
[73] Watson G, Mckeown N, Casado M. NetFPGA: A tool for network research andeducation[C]2006.
[74] Lockwood J W, Mckeown N, Watson G, et al. NetFPGA--an open platform forgigabit-rate network switching and routing[C] IEEE,2007.
[75] Dally W J, Towles B. Route packets, not wires: On-chip interconnectionnetworks[C] IEEE,2001.
[76] Benini L, De Micheli G. Powering networks on chips: energy-efficient andreliable interconnect design for SoCs[C] ACM,2001.
[77] Kumar S, Jantsch A, Millberg M, et al. A network on chip architecture and designmethodology[C]//VLSI,2002. Proceedings. IEEE Computer Society AnnualSymposium on. Published by the IEEE Computer Society,2002.
[78] Jantsch A, Tenhunen H. Networks on chip[M]. Springer Netherlands,2003.
[79] Benini L, De Micheli G. Networks on chips: Technology and Tools[M]. MorganKaufmann,2006.
[80] Bjerregaard T, Mahadevan S. A survey of research and practices ofnetwork-on-chip[J]. ACM Computing Surveys (CSUR).2006,38(1):1-51.
[81] Agarwal A, Iskander C, Shankar R. Survey of network on chip (noc) architectures&contributions[J]. Journal of engineering, Computing and Architecture.2009,3(1):21-27.
[82] Ogras U Y, Marculescu R. Energy-and performance-driven NoC communicationarchitecture synthesis using a decomposition approach[C] IEEE Computer Society,2005.
[83] Marculescu R, Ogras U Y, Peh L S, et al. Outstanding research problems in NoCdesign: system, microarchitecture, and circuit perspectives[J]. Computer-Aided Designof Integrated Circuits and Systems, IEEE Transactions on.2009,28(1):3-21.
[84] Ho R, Mai K W, Horowitz M A. The future of wires[J]. Proceedings of the IEEE.2001,89(4):490-504.
[85] Salminen E, Kulmala A, Hamalainen T D. Survey of Network-on-chipProposals[J]. white paper, OCP-IP.2008:1-13.
[86]周干民. NoC基础研究[D].合肥工业大学,2005.
[87] Marculescu R, Bogdan P. The chip is the network: Toward a science ofnetwork-on-chip design[M]. Citeseer,2009.
[88] Duato J, Yalamanchili S, Ni L M. Interconnection networks: An engineeringapproach[M]. Morgan Kaufmann,2003.
[89] Dally W J, Towles B. Principles and practices of interconnection networks[M].Morgan Kaufmann,2004.
[90] Somani A K. System level diagnosis: a review[J]. Technique Report, DependableComputer Laboratory, Iowa State University.1997.
[91] Wang D. Diagnosability of hypercubes and enhanced hypercubes under thecomparison diagnosis model[J]. Computers, IEEE Transactions on.1999,48(12):1369-1374.
[92] Chang G, Chang G J, Chen G. Diagnosabilities of regular networks[J]. Paralleland Distributed Systems, IEEE Transactions on.2005,16(4):314-323.
[93] Lai P, Tan J J, Tsai C, et al. The diagnosability of the matching compositionnetwork under the comparison diagnosis model[J]. Computers, IEEE Transactions on.2004,53(8):1064-1069.
[94] Araki T, Shibata Y.(t, k)-Diagnosable System: A Generalization of the PMCModels[J]. Computers, IEEE Transactions on.2003,52(7):971-975.
[95] Fan J, Lin X. The t/k-Diagnosability of the BC Graphs[J]. Computers, IEEETransactions on.2005,54(2):176-184.
[96] Chessa S. Self-diagnosis of grid-interconnected systems, with application toself-test of VLSI wafers[D]. Citeseer,1999.
[97] Caruso A, Chessa S, Maestrini P, et al. Evaluation of a diagnosis algorithm forregular structures[J]. Computers, IEEE Transactions on.2002,51(7):850-865.
[98] Yang X. A fast pessimistic one-step diagnosis algorithm for hypercubemulticomputer systems[J]. Journal of Parallel and Distributed Computing.2004,64(4):546-553.
[99] Lai P, Tan J J, Chang C, et al. Conditional diagnosability measures for largemultiprocessor systems[J]. Computers, IEEE Transactions on.2005,54(2):165-175.
[100] Hsu G, Chiang C, Shih L, et al. Conditional diagnosability of hypercubes underthe comparison diagnosis model[J]. Journal of Systems Architecture.2009,55(2):140-146.
[101] Xu M, Thulasiraman K, Hu X. Conditional diagnosability of matchingcomposition networks under the PMC model[J]. Circuits and Systems II: Express Briefs,IEEE Transactions on.2009,56(11):875-879.
[102] Zhou S, Xiao W. Conditional diagnosability of alternating group networks[J].Information Processing Letters.2010,110(10):403-409.
[103] Zhou S. The conditional diagnosability of twisted cubes under the comparisonmodel[C]//Parallel and Distributed Processing with Applications,2009IEEEInternational Symposium on. IEEE,2009.
[104] Chang G. Conditional ({t}, k)-Diagnosis under the PMC Model[J]. Parallel andDistributed Systems, IEEE Transactions on.2011,22(11):1797-1803.
[105] Chang N, Hsieh S. Conditional diagnosability of augmented cubes under the PMCmodel[J]. Dependable and Secure Computing, IEEE Transactions on.2012,9(1):46-60.
[106] Hong W, Hsieh S. Strong diagnosability and conditional diagnosability ofaugmented cubes under the comparison diagnosis model[J]. Reliability, IEEETransactions on.2012,61(1):140-148.
[107] Hsu G, Chiang C, Tan J J. Comparison-based conditional diagnosability on theclass of hypercube-like networks[J]. Journal of Interconnection Networks.2010,11(03n04):143-156.
[108] Dharmapurikar S, Krishnamurthy P, Sproull T, et al. Deep packet inspectionusing parallel bloom filters[C]//High Performance Interconnects,2003. Proceedings.11th Symposium on. IEEE,2003.
[109] Kumar S, Dharmapurikar S, Yu F, et al. Algorithms to accelerate multiple regularexpressions matching for deep packet inspection[C]//ACM SIGCOMM ComputerCommunication Review. ACM,2006.
[110] Yu F, Chen Z, Diao Y, et al. Fast and memory-efficient regular expressionmatching for deep packet inspection[C]//Architecture for Networking andCommunications systems,2006. ANCS2006. ACM/IEEE Symposium on. IEEE,2006.
[111] Cho Y H, Mangione-Smith W H. Deep network packet filter design forreconfigurable devices[J]. ACM Transactions on Embedded Computing Systems(TECS).2008,7(2):21.
[112] Ni J, Lin C, Chen Z, et al. A fast multi-pattern matching algorithm for deeppacket inspection on a network processor[C]//Parallel Processing,2007. ICPP2007.International Conference on. IEEE,2007.
[113] Jacoby G A, Mosley S. Mobile security using separated deep packet inspection[C]//Consumer Communications and Networking Conference,2008. CCNC2008.5thIEEE. IEEE,2008.
[114] Lin P, Lin Y, Lee T, et al. Using string matching for deep packet inspection[J].Computer.2008,41(4):23-28.
[115] Brodie B C, Taylor D E, Cytron R K. A scalable architecture for high-throughputregular-expression pattern matching[C]//ACM SIGARCH Computer ArchitectureNews. IEEE Computer Society,2006.
[116] Knuth D E, Morris J J H, Pratt V R. Fast pattern matching in strings[J]. SIAMjournal on computing.1977,6(2):323-350.
[117] Aho A V, Corasick M J. Efficient string matching: an aid to bibliographicsearch[J]. Communications of the ACM.1975,18(6):333-340.
[118] Boyer R S, Moore J S. A fast string searching algorithm[J]. Communications ofthe ACM.1977,20(10):762-772.
[119] Commentz-Walter B. A string matching algorithm fast on the average[M].Springer,1979.
[120] Allauzen C, Crochemore M, Raffinot M. Factor oracle: A new structure forpattern matching[C]//SOFSEM99: Theory and Practice of Informatics. Springer,1999.
[121] Raffinot M. On the multi backward dawg matching algorithm (MultiBDM)[J].1997.
[122] Horspool R N. Practical fast searching in strings[J]. Software: Practice andExperience.1980,10(6):501-506.
[123] Navarro G, Raffinot M. Flexible pattern matching in strings: practical on-linesearch algorithms for texts and biological sequences[M]. Cambridge University Press,2002.
[124] Wu S, Manber U. A fast algorithm for multi-pattern searching[R]. TechnicalReport TR-94-17, University of Arizona,1994.
[125] Coit C J, Staniford S, Mcalerney J. Towards faster string matching for intrusiondetection or exceeding the speed of snort[C]//DARPA Information SurvivabilityConference&Exposition II,2001. DISCEX'01. Proceedings. IEEE,2001.
[126]贺龙涛，方滨兴，余翔湛.一种时间复杂度最优的精确串匹配算法[J].软件学报.2005,16(5):676-683.
[127]宋华，戴一奇.一种用于内容过滤和检测的快速多关键词识别算法[J].计算机研究与发展.2004,41(6):940-945.
[128] Salmela L, Tarhio J, Kyt joki J. Multipattern string matching with q-grams[J].Journal of Experimental Algorithmics (JEA).2007,11:1.
[129] Shinohara T N S F. Speed-up of Aho-Corasick pattern matching machines byrearranging states[J].2001.
[130] Norton M. Optimizing pattern matching for intrusion detection[J]. white paper,Sourcefire Inc.2004.
[131]郭莉，刘燕兵，谭建龙.基于存储压缩的多模式串匹配算法[C].2005.
[132] Erdogan O, Cao P. Hash-AV: fast virus signature scanning by cache-residentfilters[J]. International Journal of Security and Networks.2007,2(1):50-59.
[133] Tan J, Liu Y, Liu P. Accelerating multiple string matching by usingcache-efficient strategy[C]//Web-Age Information Management,2008. WAIM'08. TheNinth International Conference on. IEEE,2008.
[134] Friedl J. Mastering regular expressions[M]. O'Reilly Media, Inc.,2006.
[135] Thompson K. Programming Techniques: Regular expression search algorithm[J].Communications of the ACM.1968,11(6):419-422.
[136] Clarke C L, Cormack G V. On the use of regular expressions for searching text[J].ACM Transactions on Programming Languages and Systems (TOPLAS).1997,19(3):413-426.
[137] Hosoya H, Vouillon J, Pierce B C. Regular expression types for XML[C]//ACMSIGPLAN Notices. ACM,2000.
[138] Li Y, Krishnamurthy R, Raghavan S, et al. Regular expression learning forinformation extraction[C]//Proceedings of the Conference on Empirical Methods inNatural Language Processing. Association for Computational Linguistics,2008.
[139] Bex G J, Gelade W, Martens W, et al. Simplifying XML schema: effortlesshandling of nondeterministic regular expressions[C]//Proceedings of the2009ACMSIGMOD International Conference on Management of data. ACM,2009.
[140] Chang C, Kayed M, Girgis R, et al. A survey of web information extractionsystems[J]. Knowledge and Data Engineering, IEEE Transactions on.2006,18(10):1411-1428.
[141] Limanto H Y, Giang N N, Trung V T, et al. An information extraction engine forweb discussion forums[C]//Special interest tracks and posters of the14th internationalconference on World Wide Web. ACM,2005.
[142] Carzaniga A, Wolf A L. Content-based networking: A new communicationinfrastructure[M]. Developing an Infrastructure for Mobile and Wireless Systems,Springer,2002,59-68.
[143] Carzaniga A, Rutherford M J, Wolf A L. A routing scheme for content-basednetworking[C]//INFOCOM2004. Twenty-third AnnualJoint Conference of the IEEEComputer and Communications Societies. IEEE,2004.
[144] Ellul K, Krawetz B, Shallit J, et al. Regular expressions: New results and openproblems[J]. Journal of Automata, Languages and Combinatorics.2005,10(4):407-437.
[145] Majumder A, Rastogi R, Vanama S. Scalable regular expression matching on datastreams[C]//Proceedings of the2008ACM SIGMOD international conference onManagement of data. ACM,2008.
[146] Bille P, Thorup M. Faster regular expression matching[M]. Automata, Languagesand Programming, Springer,2009,171-182.
[147] Holzer M, Maletti A. An nlogn algorithm for hyper-minimizing states in a(minimized) deterministic automaton[M]. Implementation and Application of Automata,Springer,2009,4-13.
[148] Hopcroft J. An n log n algorithm for minimizing states in a finite automaton[R].DTIC Document,1971.
[149] P un A, P un M, Rodríguez-Patón A. On the Hopcroft s minimization techniquefor DFA and DFCA[J]. Theoretical Computer Science.2009,410(24):2424-2430.
[150] Mcnaughton R, Yamada H. Regular expressions and state graphs for automata[J].Electronic Computers, IRE Transactions on.1960(1):39-47.
[151] Hopcroft J E, Motwani R, Ullman J D. Introduction to Automata Theory,Languages, and Computation,2nd[Z]. Addison-Wesley,2001.
[152]韩俊刚，杜慧敏.数字硬件的形式化验证[M].北京大学出版社,2001.
[153] Brahme D, Cox S, Gallo J, et al. The transaction-based verificationmethodology[J]. Cadence Design Systems, Inc.2000.
[154] Foster H, Krolnik A, Lacey D. Assertion-based design[M]. Springer,2004.
[155] Ye T T. On-chip multiprocessor communication network design and analysis[D].stanford university,2003.
[156] Hu J, Marculescu R. Energy-and performance-aware mapping for regular NoCarchitectures[J]. Computer-Aided Design of Integrated Circuits and Systems, IEEETransactions on.2005,24(4):551-562.
[157] Ogras U Y, Marculescu R. Energy-and performance-driven NoC communicationarchitecture synthesis using a decomposition approach[C]//Proceedings of theconference on Design, Automation and Test in Europe-Volume1. IEEE ComputerSociety,2005.
[158] Bhuyan L N, Agrawal D P. Generalized hypercube and hyperbus structures for acomputer network[J]. Computers, IEEE Transactions on.1984,100(4):323-333.
[159] Larson S M, Cull P. The M bius Cubes[J]. IEEE Transactions on Computers.1995,44(5):647-659.
[160] Fan J. Diagnosability of the Mobius cubes[J]. Parallel and Distributed Systems,IEEE Transactions on.1998,9(9):923-928.
[161] Fan J. Hamilton-connectivity and cycle-embedding of the M bius cubes[J].Information Processing Letters.2002,82(2):113-117.
[162] Huang W, Chuang Y, Tan Jimmy J M, et al. Faul-Free Hamiltonian Cycle inFaulty M bius Cubes[J]. Computación y Sistemas.2009,4(002).
[163] Tsai C. Embedding of meshes in M bius cubes[J]. Theoretical Computer Science.2008,401(1):181-190.
[164] Zhou S. The conditional diagnosability of M bius cubes under the comparisonmodel[C]//Information and Automation,2009. ICIA'09. International Conference on.IEEE,2009.
[165] Tsai C, Lai P, Hsu H. Embed Geodesic Cycles into M bius Cubes[C]//Circuits,Communications and Systems,2009. PACCS'09. Pacific-Asia Conference on. IEEE,2009.
[166] Lee C, Hsieh S. Determining the diagnosability of (1,2)-matching compositionnetworks and its applications[J]. Dependable and Secure Computing, IEEE Transactionson.2011,8(3):353-362.
[167] Wen Y, Zang W, Li C. A novel shortest path method based on heuristicalgorithm[C]//Machine Vision and Human-Machine Interface (MVHI),2010International Conference on. IEEE,2010.
[168]柴登峰，张登荣.前N条最短路径问题的算法及应用[J][J].浙江大学学报:工学版.2002,36(5):531-534.
[169] Pande P P, Grecu C, Jones M, et al. Performance evaluation and design trade-offsfor network-on-chip interconnect architectures[J]. Computers, IEEE Transactions on.2005,54(8):1025-1040.
[170] Matsutani H, Koibuchi M, Amano H. Tightly-coupled multi-layer topologies for3-D NoCs[C]//Parallel Processing,2007. ICPP2007. International Conference on.IEEE,2007.
[171] Pavlidis V F, Friedman E G.3-D topologies for networks-on-chip[J]. Very LargeScale Integration (VLSI) Systems, IEEE Transactions on.2007,15(10):1081-1090.
[172] Zhu Q. On conditional diagnosability and reliability of the BC networks[J]. TheJournal of Supercomputing.2008,45(2):173-184.
[173] Zhu Q, Liu S, Xu M. On conditional diagnosability of the folded hypercubes[J].Information Sciences.2008,178(4):1069-1077.
[174] Sidhu R, Prasanna V K. Fast regular expression matching using FPGAs[C]//Field-Programmable Custom Computing Machines,2001. FCCM'01. The9th AnnualIEEE Symposium on. IEEE,2001.
[2] Mayer-Sch nberger V, Cukier K. Big Data: A Revolution that Will Transformhow We Live, Work, and Think[M]. Eamon Dolan/Houghton Mifflin Harcourt,2013.
[3] Odlyzko A M. Internet traffic growth: Sources and implications[C]//ITCom2003.International Society for Optics and Photonics,2003.
[4] Baliga J, Hinton K, Tucker R S. Energy consumption of the Internet[C]//OpticalInternet,2007and the200732nd Australian Conference on Optical Fibre Technology.COIN-ACOFT2007. Joint International Conference on. IEEE,2007.
[5] Moore D, Shannon C, Brown D J, et al. Inferring internet denial-of-serviceactivity[J]. ACM Transactions on Computer Systems (TOCS).2006,24(2):115-139.
[6] Walfish M, Vutukuru M, Balakrishnan H, et al. DDoS defense by offense[J].ACM SIGCOMM Computer Communication Review.2006,36(4):303-314.
[7] Naoumov N, Ross K. Exploiting p2p systems for ddos attacks[C]//Proceedings ofthe1st international conference on Scalable information systems. ACM,2006.
[8] Garcia-Teodoro P, Diaz-Verdejo J, Maciá-Fernández G, et al. Anomaly-basednetwork intrusion detection: Techniques, systems and challenges[J]. computers&security.2009,28(1):18-28.
[9] Provos N, Holz T. Virtual honeypots: from botnet tracking to intrusiondetection[M]. Pearson Education,2007.
[10] Gu G, Porras P, Yegneswaran V, et al. Bothunter: Detecting malware infectionthrough ids-driven dialog correlation[C]//Proceedings of16th USENIX SecuritySymposium on USENIX Security Symposium. USENIX Association,2007.
[11] King S T, Chen P M. SubVirt: Implementing malware with virtual machines[C]//Security and Privacy,2006IEEE Symposium on. IEEE,2006.
[12] Bailey M, Oberheide J, Andersen J, et al. Automated classification and analysis ofinternet malware[C]//Recent Advances in Intrusion Detection. Springer,2007.
[13] Lanzi A, Balzarotti D, Kruegel C, et al. AccessMiner: using system-centricmodels for malware protection[C]//Proceedings of the17th ACM conference onComputer and communications security. ACM,2010.
[14]国家互联网应急中心.2012年我国互联网网络安全态势综述[R].北京,2013.
[15] Aweya J. IP router architectures: an overview[J]. International Journal ofCommunication Systems.2001,14(5):447-475.
[16] Sandhu R S, Coyne E J, Feinstein H L, et al. Role-based access control models[J].Computer.1996,29(2):38-47.
[17] Sandhu R S, Samarati P. Access control: principle and practice[J].Communications Magazine, IEEE.1994,32(9):40-48.
[18] Oppliger R. Internet security: firewalls and beyond[J]. Communications of theACM.1997,40(5):92-102.
[19] Cheswick W R, Bellovin S M, Rubin A D. Firewalls and Internet security:repelling the wily hacker[M]. Addison-Wesley Longman Publishing Co., Inc.,2003.
[20] Handley M, Paxson V, Kreibich C. Network Intrusion Detection: Evasion, TrafficNormalization, and End-to-End Protocol Semantics.[C]//USENIX Security Symposium.2001.
[21] Wang K, Stolfo S J. Anomalous payload-based network intrusion detection[C]//Recent Advances in Intrusion Detection. Springer,2004.
[22] Bayer U, Habibi I, Balzarotti D, et al. A view on current malware behaviors[C]//USENIX workshop on large-scale exploits and emergent threats (LEET).2009.
[23] Gu G, Porras P, Yegneswaran V, et al. Bothunter: Detecting malware infectionthrough ids-driven dialog correlation[C]//Proceedings of16th USENIX SecuritySymposium on USENIX Security Symposium. USENIX Association,2007.
[24] Provos N, Mcnamee D, Mavrommatis P, et al. The ghost in the browser analysisof web-based malware[C]//Proceedings of the first conference on First Workshop onHot Topics in Understanding Botnets.2007.
[25] Moser A, Kruegel C, Kirda E. Exploring multiple execution paths for malwareanalysis[C]//Security and Privacy,2007. SP'07. IEEE Symposium on. IEEE,2007.
[26] Hao S, Syed N A, Feamster N, et al. Detecting Spammers with SNARE:Spatio-temporal Network-level Automatic Reputation Engine.[C]//USENIX SecuritySymposium.2009.
[27] Almeida T A, Yamakami A, Almeida J. Evaluation of approaches fordimensionality reduction applied with Naive Bayes anti-spam filters[C]//MachineLearning and Applications,2009. ICMLA'09. International Conference on. IEEE,2009.
[28] Kreibich C, Kanich C, Levchenko K, et al. Spamcraft: An inside look at spamcampaign orchestration[J]. Proc. of2nd USENIX LEET.2009.
[29] Piyachon P, Luo Y. Efficient memory utilization on network processors for deeppacket inspection[C]//Proceedings of the2006ACM/IEEE symposium on Architecturefor networking and communications systems. ACM,2006.
[30] Dharmapurikar S, Lockwood J. Fast and scalable pattern matching for contentfiltering[C]//Architecture for networking and communications systems,2005. ANCS2005. Symposium on. IEEE,2005.
[31] Dharmapurikar S, Lockwood J. Fast and scalable pattern matching for contentfiltering[C]//Architecture for networking and communications systems,2005. ANCS2005. Symposium on. IEEE,2005.
[32] Cho Y H, Mangione-Smith W H. Deep network packet filter design forreconfigurable devices[J]. ACM Transactions on Embedded Computing Systems(TECS).2008,7(2):21.
[33] Rohrer J, Atasu K, van Lunteren J, et al. Memory-efficient distribution of regularexpressions for fast deep packet inspection[C]//Proceedings of the7th IEEE/ACMinternational conference on Hardware/software codesign and system synthesis. ACM,2009.
[34] Ni J, Lin C, Chen Z, et al. A fast multi-pattern matching algorithm for deeppacket inspection on a network processor[C]//Parallel Processing,2007. ICPP2007.International Conference on. IEEE,2007.
[35] Jacoby G A, Mosley S. Mobile security using separated deep packet inspection[C]//Consumer Communications and Networking Conference,2008. CCNC2008.5thIEEE. IEEE,2008.
[36] Lin P, Lin Y, Lee T, et al. Using string matching for deep packet inspection[J].Computer.2008,41(4):23-28.
[37] Svensson J. Design of a core router using the SoCBUS on-chip network[J].LiTH-ISY-EX.2004,4:3562.
[38] Wiklund D, Ehliar A, Liu D. Design of an Internet core router using the SoCBUSnetwork on chip[C] IEEE,2005.
[39] Shen X B. Evolution of MPP SoC architecture techniques[J]. Science in ChinaSeries F: Information Sciences.2008,51(6):756-764.
[40] Preparata F P, Metze G, Chien R T. On the connection assignment problem ofdiagnosable systems[J]. Electronic Computers, IEEE Transactions on.1967(6):848-854.
[41] Barsi F, Grandoni F, Maestrini P. A theory of diagnosability of digital systems[J].Computers, IEEE Transactions on.1976,100(6):585-593.
[42] Chwa K, Hakimi S L. Schemes for fault-tolerant computing: A comparison ofmodularly redundant and t-diagnosable systems[J]. Information and Control.1981,49(3):212-238.
[43] Lai P, Tan J J, Chang C, et al. Conditional diagnosability measures for largemultiprocessor systems[J]. Computers, IEEE Transactions on.2005,54(2):165-175.
[44] Zhou S, Xiao W. Conditional diagnosability of alternating group networks[J].Information Processing Letters.2010,110(10):403-409.
[45] Zhou S. The conditional diagnosability of twisted cubes under the comparisonmodel[C]//Parallel and Distributed Processing with Applications,2009IEEEInternational Symposium on. IEEE,2009.
[46] Chang G. Conditional ({t}, k)-Diagnosis under the PMC Model[J]. Parallel andDistributed Systems, IEEE Transactions on.2011,22(11):1797-1803.
[47] Yang E, Yang X, Dong Q, et al. Conditional diagnosability of hypermeshes underthe comparison model[J]. Information Processing Letters.2011,111(4):188-193.
[48] Hsu G, Chiang C, Tan J J. Comparison-based conditional diagnosability on theclass of hypercube-like networks[J]. Journal of Interconnection Networks.2010,11(03n04):143-156.
[49] Cho Y H, Mangione-Smith W H. Deep network packet filter design forreconfigurable devices[J]. ACM Transactions on Embedded Computing Systems(TECS).2008,7(2):1-26.
[50] Sung J S, Kang S M, Lee Y, et al. A multi-gigabit rate deep packet inspectionalgorithm using TCAM[C] IEEE,2005.
[51] Yang L, Dantu R, Anderson T, et al. Forwarding and control element separation(ForCES) framework[J].2004.
[52] Hagsand O, Hidell M, Sjodin P. Design and implementation of a distributedrouter[C] IEEE,2005.
[53] Wang W M, Dong L G, Zhuge B. Analysis and implementation of an openprogrammable router based on forwarding and control element separation[J]. Journal ofComputer Science and Technology.2008,23(5):769-779.
[54]张小平，刘振华，赵有健，等.可扩展路由器[J].软件学报.2008,19(6):1452-1464.
[55]戴艺，苏金树，孙志刚，等.一种支持高速IPv6转发的路由器体系结构FIS[J].计算机工程与科学.2009,31(02):4-6.
[56]戴艺，孙志刚，苏金树，等.基于分布式转发交换的并行路由器关键技术研究[J].国防科技大学学报.2008,3:53-58.
[57]孙志刚，戴艺，龚正虎.面向下一代互联网的可扩展路由器体系结构MPFS[J].中国科学: E辑.2008,38(10):1652-1662.
[58] Sun Z G, Dai Y, Gong Z H. MPFS: A truly scalable router architecture for nextgeneration Internet[J]. Science in China Series F: Information Sciences.2008,51(11):1761-1771.
[59]戴艺，苏金树，孙志刚.一种维序的基于组合输入输出排队的并行交换结构[J].软件学报.2008,19(12):3207-3217.
[60] Nalin T, Takashi I, Morino H, et al. A scalable and high capacity router onmulti-dimension crossbar switch principle[C] IEEE,2001.
[61] Tzeng N F. Multistage-based switching fabrics for scalable routers[J]. Parallel andDistributed Systems, IEEE Transactions on.2004,15(4):304-318.
[62] He R, Delgado-Frias J G. Fault Tolerant Interleaved Switching Fabrics forScalable High-Performance Routers[J]. Parallel and Distributed Systems, IEEETransactions on.2007,18(12):1727-1739.
[63]乐祖晖，吴建平，赵有健. CR:基于一类新型结构的可扩展路由器[J].软件学报.2007,18(10):2624-2634.
[64]沈绪榜. MPP系统芯片体系结构技术的发展[J].中国科学: E辑.2008,38(6):933-940.
[65] Hu J, Marculescu R. Energy-and performance-aware mapping for regular NoCarchitectures[J]. Computer-Aided Design of Integrated Circuits and Systems, IEEETransactions on.2005,24(4):551-562.
[66] Ogras U Y, Hu J, Marculescu R. Key research problems in NoC design: a holisticperspective[C] ACM,2005.
[67] Held J, Bautista J, Koehl S. From a few cores to many: A tera-scale computingresearch overview2006/日期.
[68] Team I. Overview of the IBM Blue Gene/P project[J]. IBM Journal of Researchand Development.2008,52(1/2):199-220.
[69] Dally W J. Performance analysis of k-ary n-cube interconnection networks[J].Computers, IEEE Transactions on.1990,39(6):775-785.
[70] Taylor M B, Kim J, Miller J, et al. The Raw microprocessor: A computationalfabric for software circuits and general-purpose programs[J]. Micro, IEEE.2002,22(2):25-35.
[71] Agarwal A, Saif U, Anderson J W. The raw router: gigabit routing on ageneral-purpose microprocessor[D]. Massachusetts Institute of Technology,2004.
[72] Chuvpilo G, Wentzlaff D, Amarasinghe S. Gigabit IP routing on raw[C] Citeseer,2002.
[73] Watson G, Mckeown N, Casado M. NetFPGA: A tool for network research andeducation[C]2006.
[74] Lockwood J W, Mckeown N, Watson G, et al. NetFPGA--an open platform forgigabit-rate network switching and routing[C] IEEE,2007.
[75] Dally W J, Towles B. Route packets, not wires: On-chip interconnectionnetworks[C] IEEE,2001.
[76] Benini L, De Micheli G. Powering networks on chips: energy-efficient andreliable interconnect design for SoCs[C] ACM,2001.
[77] Kumar S, Jantsch A, Millberg M, et al. A network on chip architecture and designmethodology[C]//VLSI,2002. Proceedings. IEEE Computer Society AnnualSymposium on. Published by the IEEE Computer Society,2002.
[78] Jantsch A, Tenhunen H. Networks on chip[M]. Springer Netherlands,2003.
[79] Benini L, De Micheli G. Networks on chips: Technology and Tools[M]. MorganKaufmann,2006.
[80] Bjerregaard T, Mahadevan S. A survey of research and practices ofnetwork-on-chip[J]. ACM Computing Surveys (CSUR).2006,38(1):1-51.
[81] Agarwal A, Iskander C, Shankar R. Survey of network on chip (noc) architectures&contributions[J]. Journal of engineering, Computing and Architecture.2009,3(1):21-27.
[82] Ogras U Y, Marculescu R. Energy-and performance-driven NoC communicationarchitecture synthesis using a decomposition approach[C] IEEE Computer Society,2005.
[83] Marculescu R, Ogras U Y, Peh L S, et al. Outstanding research problems in NoCdesign: system, microarchitecture, and circuit perspectives[J]. Computer-Aided Designof Integrated Circuits and Systems, IEEE Transactions on.2009,28(1):3-21.
[84] Ho R, Mai K W, Horowitz M A. The future of wires[J]. Proceedings of the IEEE.2001,89(4):490-504.
[85] Salminen E, Kulmala A, Hamalainen T D. Survey of Network-on-chipProposals[J]. white paper, OCP-IP.2008:1-13.
[86]周干民. NoC基础研究[D].合肥工业大学,2005.
[87] Marculescu R, Bogdan P. The chip is the network: Toward a science ofnetwork-on-chip design[M]. Citeseer,2009.
[88] Duato J, Yalamanchili S, Ni L M. Interconnection networks: An engineeringapproach[M]. Morgan Kaufmann,2003.
[89] Dally W J, Towles B. Principles and practices of interconnection networks[M].Morgan Kaufmann,2004.
[90] Somani A K. System level diagnosis: a review[J]. Technique Report, DependableComputer Laboratory, Iowa State University.1997.
[91] Wang D. Diagnosability of hypercubes and enhanced hypercubes under thecomparison diagnosis model[J]. Computers, IEEE Transactions on.1999,48(12):1369-1374.
[92] Chang G, Chang G J, Chen G. Diagnosabilities of regular networks[J]. Paralleland Distributed Systems, IEEE Transactions on.2005,16(4):314-323.
[93] Lai P, Tan J J, Tsai C, et al. The diagnosability of the matching compositionnetwork under the comparison diagnosis model[J]. Computers, IEEE Transactions on.2004,53(8):1064-1069.
[94] Araki T, Shibata Y.(t, k)-Diagnosable System: A Generalization of the PMCModels[J]. Computers, IEEE Transactions on.2003,52(7):971-975.
[95] Fan J, Lin X. The t/k-Diagnosability of the BC Graphs[J]. Computers, IEEETransactions on.2005,54(2):176-184.
[96] Chessa S. Self-diagnosis of grid-interconnected systems, with application toself-test of VLSI wafers[D]. Citeseer,1999.
[97] Caruso A, Chessa S, Maestrini P, et al. Evaluation of a diagnosis algorithm forregular structures[J]. Computers, IEEE Transactions on.2002,51(7):850-865.
[98] Yang X. A fast pessimistic one-step diagnosis algorithm for hypercubemulticomputer systems[J]. Journal of Parallel and Distributed Computing.2004,64(4):546-553.
[99] Lai P, Tan J J, Chang C, et al. Conditional diagnosability measures for largemultiprocessor systems[J]. Computers, IEEE Transactions on.2005,54(2):165-175.
[100] Hsu G, Chiang C, Shih L, et al. Conditional diagnosability of hypercubes underthe comparison diagnosis model[J]. Journal of Systems Architecture.2009,55(2):140-146.
[101] Xu M, Thulasiraman K, Hu X. Conditional diagnosability of matchingcomposition networks under the PMC model[J]. Circuits and Systems II: Express Briefs,IEEE Transactions on.2009,56(11):875-879.
[102] Zhou S, Xiao W. Conditional diagnosability of alternating group networks[J].Information Processing Letters.2010,110(10):403-409.
[103] Zhou S. The conditional diagnosability of twisted cubes under the comparisonmodel[C]//Parallel and Distributed Processing with Applications,2009IEEEInternational Symposium on. IEEE,2009.
[104] Chang G. Conditional ({t}, k)-Diagnosis under the PMC Model[J]. Parallel andDistributed Systems, IEEE Transactions on.2011,22(11):1797-1803.
[105] Chang N, Hsieh S. Conditional diagnosability of augmented cubes under the PMCmodel[J]. Dependable and Secure Computing, IEEE Transactions on.2012,9(1):46-60.
[106] Hong W, Hsieh S. Strong diagnosability and conditional diagnosability ofaugmented cubes under the comparison diagnosis model[J]. Reliability, IEEETransactions on.2012,61(1):140-148.
[107] Hsu G, Chiang C, Tan J J. Comparison-based conditional diagnosability on theclass of hypercube-like networks[J]. Journal of Interconnection Networks.2010,11(03n04):143-156.
[108] Dharmapurikar S, Krishnamurthy P, Sproull T, et al. Deep packet inspectionusing parallel bloom filters[C]//High Performance Interconnects,2003. Proceedings.11th Symposium on. IEEE,2003.
[109] Kumar S, Dharmapurikar S, Yu F, et al. Algorithms to accelerate multiple regularexpressions matching for deep packet inspection[C]//ACM SIGCOMM ComputerCommunication Review. ACM,2006.
[110] Yu F, Chen Z, Diao Y, et al. Fast and memory-efficient regular expressionmatching for deep packet inspection[C]//Architecture for Networking andCommunications systems,2006. ANCS2006. ACM/IEEE Symposium on. IEEE,2006.
[111] Cho Y H, Mangione-Smith W H. Deep network packet filter design forreconfigurable devices[J]. ACM Transactions on Embedded Computing Systems(TECS).2008,7(2):21.
[112] Ni J, Lin C, Chen Z, et al. A fast multi-pattern matching algorithm for deeppacket inspection on a network processor[C]//Parallel Processing,2007. ICPP2007.International Conference on. IEEE,2007.
[113] Jacoby G A, Mosley S. Mobile security using separated deep packet inspection[C]//Consumer Communications and Networking Conference,2008. CCNC2008.5thIEEE. IEEE,2008.
[114] Lin P, Lin Y, Lee T, et al. Using string matching for deep packet inspection[J].Computer.2008,41(4):23-28.
[115] Brodie B C, Taylor D E, Cytron R K. A scalable architecture for high-throughputregular-expression pattern matching[C]//ACM SIGARCH Computer ArchitectureNews. IEEE Computer Society,2006.
[116] Knuth D E, Morris J J H, Pratt V R. Fast pattern matching in strings[J]. SIAMjournal on computing.1977,6(2):323-350.
[117] Aho A V, Corasick M J. Efficient string matching: an aid to bibliographicsearch[J]. Communications of the ACM.1975,18(6):333-340.
[118] Boyer R S, Moore J S. A fast string searching algorithm[J]. Communications ofthe ACM.1977,20(10):762-772.
[119] Commentz-Walter B. A string matching algorithm fast on the average[M].Springer,1979.
[120] Allauzen C, Crochemore M, Raffinot M. Factor oracle: A new structure forpattern matching[C]//SOFSEM99: Theory and Practice of Informatics. Springer,1999.
[121] Raffinot M. On the multi backward dawg matching algorithm (MultiBDM)[J].1997.
[122] Horspool R N. Practical fast searching in strings[J]. Software: Practice andExperience.1980,10(6):501-506.
[123] Navarro G, Raffinot M. Flexible pattern matching in strings: practical on-linesearch algorithms for texts and biological sequences[M]. Cambridge University Press,2002.
[124] Wu S, Manber U. A fast algorithm for multi-pattern searching[R]. TechnicalReport TR-94-17, University of Arizona,1994.
[125] Coit C J, Staniford S, Mcalerney J. Towards faster string matching for intrusiondetection or exceeding the speed of snort[C]//DARPA Information SurvivabilityConference&Exposition II,2001. DISCEX'01. Proceedings. IEEE,2001.
[126]贺龙涛，方滨兴，余翔湛.一种时间复杂度最优的精确串匹配算法[J].软件学报.2005,16(5):676-683.
[127]宋华，戴一奇.一种用于内容过滤和检测的快速多关键词识别算法[J].计算机研究与发展.2004,41(6):940-945.
[128] Salmela L, Tarhio J, Kyt joki J. Multipattern string matching with q-grams[J].Journal of Experimental Algorithmics (JEA).2007,11:1.
[129] Shinohara T N S F. Speed-up of Aho-Corasick pattern matching machines byrearranging states[J].2001.
[130] Norton M. Optimizing pattern matching for intrusion detection[J]. white paper,Sourcefire Inc.2004.
[131]郭莉，刘燕兵，谭建龙.基于存储压缩的多模式串匹配算法[C].2005.
[132] Erdogan O, Cao P. Hash-AV: fast virus signature scanning by cache-residentfilters[J]. International Journal of Security and Networks.2007,2(1):50-59.
[133] Tan J, Liu Y, Liu P. Accelerating multiple string matching by usingcache-efficient strategy[C]//Web-Age Information Management,2008. WAIM'08. TheNinth International Conference on. IEEE,2008.
[134] Friedl J. Mastering regular expressions[M]. O'Reilly Media, Inc.,2006.
[135] Thompson K. Programming Techniques: Regular expression search algorithm[J].Communications of the ACM.1968,11(6):419-422.
[136] Clarke C L, Cormack G V. On the use of regular expressions for searching text[J].ACM Transactions on Programming Languages and Systems (TOPLAS).1997,19(3):413-426.
[137] Hosoya H, Vouillon J, Pierce B C. Regular expression types for XML[C]//ACMSIGPLAN Notices. ACM,2000.
[138] Li Y, Krishnamurthy R, Raghavan S, et al. Regular expression learning forinformation extraction[C]//Proceedings of the Conference on Empirical Methods inNatural Language Processing. Association for Computational Linguistics,2008.
[139] Bex G J, Gelade W, Martens W, et al. Simplifying XML schema: effortlesshandling of nondeterministic regular expressions[C]//Proceedings of the2009ACMSIGMOD International Conference on Management of data. ACM,2009.
[140] Chang C, Kayed M, Girgis R, et al. A survey of web information extractionsystems[J]. Knowledge and Data Engineering, IEEE Transactions on.2006,18(10):1411-1428.
[141] Limanto H Y, Giang N N, Trung V T, et al. An information extraction engine forweb discussion forums[C]//Special interest tracks and posters of the14th internationalconference on World Wide Web. ACM,2005.
[142] Carzaniga A, Wolf A L. Content-based networking: A new communicationinfrastructure[M]. Developing an Infrastructure for Mobile and Wireless Systems,Springer,2002,59-68.
[143] Carzaniga A, Rutherford M J, Wolf A L. A routing scheme for content-basednetworking[C]//INFOCOM2004. Twenty-third AnnualJoint Conference of the IEEEComputer and Communications Societies. IEEE,2004.
[144] Ellul K, Krawetz B, Shallit J, et al. Regular expressions: New results and openproblems[J]. Journal of Automata, Languages and Combinatorics.2005,10(4):407-437.
[145] Majumder A, Rastogi R, Vanama S. Scalable regular expression matching on datastreams[C]//Proceedings of the2008ACM SIGMOD international conference onManagement of data. ACM,2008.
[146] Bille P, Thorup M. Faster regular expression matching[M]. Automata, Languagesand Programming, Springer,2009,171-182.
[147] Holzer M, Maletti A. An nlogn algorithm for hyper-minimizing states in a(minimized) deterministic automaton[M]. Implementation and Application of Automata,Springer,2009,4-13.
[148] Hopcroft J. An n log n algorithm for minimizing states in a finite automaton[R].DTIC Document,1971.
[149] P un A, P un M, Rodríguez-Patón A. On the Hopcroft s minimization techniquefor DFA and DFCA[J]. Theoretical Computer Science.2009,410(24):2424-2430.
[150] Mcnaughton R, Yamada H. Regular expressions and state graphs for automata[J].Electronic Computers, IRE Transactions on.1960(1):39-47.
[151] Hopcroft J E, Motwani R, Ullman J D. Introduction to Automata Theory,Languages, and Computation,2nd[Z]. Addison-Wesley,2001.
[152]韩俊刚，杜慧敏.数字硬件的形式化验证[M].北京大学出版社,2001.
[153] Brahme D, Cox S, Gallo J, et al. The transaction-based verificationmethodology[J]. Cadence Design Systems, Inc.2000.
[154] Foster H, Krolnik A, Lacey D. Assertion-based design[M]. Springer,2004.
[155] Ye T T. On-chip multiprocessor communication network design and analysis[D].stanford university,2003.
[156] Hu J, Marculescu R. Energy-and performance-aware mapping for regular NoCarchitectures[J]. Computer-Aided Design of Integrated Circuits and Systems, IEEETransactions on.2005,24(4):551-562.
[157] Ogras U Y, Marculescu R. Energy-and performance-driven NoC communicationarchitecture synthesis using a decomposition approach[C]//Proceedings of theconference on Design, Automation and Test in Europe-Volume1. IEEE ComputerSociety,2005.
[158] Bhuyan L N, Agrawal D P. Generalized hypercube and hyperbus structures for acomputer network[J]. Computers, IEEE Transactions on.1984,100(4):323-333.
[159] Larson S M, Cull P. The M bius Cubes[J]. IEEE Transactions on Computers.1995,44(5):647-659.
[160] Fan J. Diagnosability of the Mobius cubes[J]. Parallel and Distributed Systems,IEEE Transactions on.1998,9(9):923-928.
[161] Fan J. Hamilton-connectivity and cycle-embedding of the M bius cubes[J].Information Processing Letters.2002,82(2):113-117.
[162] Huang W, Chuang Y, Tan Jimmy J M, et al. Faul-Free Hamiltonian Cycle inFaulty M bius Cubes[J]. Computación y Sistemas.2009,4(002).
[163] Tsai C. Embedding of meshes in M bius cubes[J]. Theoretical Computer Science.2008,401(1):181-190.
[164] Zhou S. The conditional diagnosability of M bius cubes under the comparisonmodel[C]//Information and Automation,2009. ICIA'09. International Conference on.IEEE,2009.
[165] Tsai C, Lai P, Hsu H. Embed Geodesic Cycles into M bius Cubes[C]//Circuits,Communications and Systems,2009. PACCS'09. Pacific-Asia Conference on. IEEE,2009.
[166] Lee C, Hsieh S. Determining the diagnosability of (1,2)-matching compositionnetworks and its applications[J]. Dependable and Secure Computing, IEEE Transactionson.2011,8(3):353-362.
[167] Wen Y, Zang W, Li C. A novel shortest path method based on heuristicalgorithm[C]//Machine Vision and Human-Machine Interface (MVHI),2010International Conference on. IEEE,2010.
[168]柴登峰，张登荣.前N条最短路径问题的算法及应用[J][J].浙江大学学报:工学版.2002,36(5):531-534.
[169] Pande P P, Grecu C, Jones M, et al. Performance evaluation and design trade-offsfor network-on-chip interconnect architectures[J]. Computers, IEEE Transactions on.2005,54(8):1025-1040.
[170] Matsutani H, Koibuchi M, Amano H. Tightly-coupled multi-layer topologies for3-D NoCs[C]//Parallel Processing,2007. ICPP2007. International Conference on.IEEE,2007.
[171] Pavlidis V F, Friedman E G.3-D topologies for networks-on-chip[J]. Very LargeScale Integration (VLSI) Systems, IEEE Transactions on.2007,15(10):1081-1090.
[172] Zhu Q. On conditional diagnosability and reliability of the BC networks[J]. TheJournal of Supercomputing.2008,45(2):173-184.
[173] Zhu Q, Liu S, Xu M. On conditional diagnosability of the folded hypercubes[J].Information Sciences.2008,178(4):1069-1077.
[174] Sidhu R, Prasanna V K. Fast regular expression matching using FPGAs[C]//Field-Programmable Custom Computing Machines,2001. FCCM'01. The9th AnnualIEEE Symposium on. IEEE,2001.