面向资源优化的分层式高速报文解析技术研究
|
摘要
随着互联网规模急剧增长和多样化应用需求的不断涌现，现有互联网架构在可扩展性、安全性、服务质量保证等方面的问题日益突出，国家973计划信息技术领域重大项目“可重构信息通信基础网络体系”面向未来网络架构，致力于构建一个功能可动态重构和扩展的基础物理网络，为不同业务提供满足其根本需求的、可定制的基础网络服务，使之与日益增长的应用需求和丰富的光传输资源相匹配。报文解析技术作为支撑IP转发、未来网络实验平台OpenFlow流转发、内容过滤等网络功能的基础核心技术，在可重构信息通信基础网络体系的研究和实验上具有多方面重要的研究意义。报文解析能力与资源占用息息相关，由于现在缺乏完善的理论基础和数学模型，报文解析技术在资源优化方面的研究目前尚处于起步阶段。
本文以高速报文解析技术为研究对象，以高速流水线结构设计为研究内容，以提高报文解析处理的速率、降低存储资源开销，提供可配置的报文解析能力为目标，提出一个基于高速并行流水线可重构的高速报文解析框架，在此基础上针对IP转发、OpenFlow流转发、内容过滤等处理功能的不同层次协议解析需求，深入研究了三个不同层次的高速报文解析方法，主要研究内容如下：
提出一种分层式的报文解析框架SwitchBricks，在框架基础上建立了高速报文解析模型（High-Speed Packet Parsing, HSPP），并提出模型存储资源优化的方向。首先，介绍了SwitchBricks控制与数据分离的结构：控制平面负责多种网络应用下解析能力的控制调度，数据平面完成特定网络环境下报文的高速解析，通过两个平面的协作满足高速报文多样化的解析需求；然后，基于M/D/1排队模型对SwitchBricks的处理性能和存储资源消耗进行推导分析，为后续研究和方案设计提供理论指导；最后，通过对存储资源占用的讨论，提出利用优化流水线存储资源占用原则指导报文解析相关算法的设计。
提出了一种面向IP转发的高速报文解析方法（Parsing Pipeline Architecture forForwarding，PPAF），并基于PPAF方法提出一种优化并行流水线存储空间占用的节点映射算法。PPAF通过构建协议二叉trie树来支持报文协议解析的灵活度，利用并行多级流水查表提升报文协议解析处理速率，并以优化并行流水线存储资源占用原则为指导，提出了一种并行流水线节点映射算法（Node To Pipeline, NTP），可解决协议二叉trie树节点到并行流水线映射过程中存储资源不均衡的问题，进而减低存储资源开销。基于NetFPGA-10G的仿真实验表明，相对于现有的高速解析方法，该PPAF方法在处理速率和资源占用上取得较好均衡的同时，支持基于接口的独立解析能力。
提出了一种OpenFlow流转发的可编程报文解析方法（Programmable Packet ParsingArchitecture, PPPA），利用该方法提出一种优化分段流水线存储空间占用的节点映射算法。PPPA通过构建协议解析多叉trie树，支持报文协议解析的可扩展，利用分段流水线匹配查找提升报文协议解析处理速率，并以优化分段流水线存储资源占用原则为指导，提出了一种分段流水线节点映射算法（Segmented Node Mapping Algorithm, SNMA），用以实现协议多叉trie树节点到分段流水线均衡存储映射，进而减少存储资源的消耗。基于NetFPGA-10G的仿真实验表明，与现有高速解析方法相比，该方法在能够提供基于接口的独立解析能力的同时，在解析带宽和资源占用上取得了较好的平衡。
提出了一种面向内容过滤的协议解析方法(Bidirectional Packet Parsing for ContentFiltering, BiPPCF)，并基于该方法提出一种优化双向流水线存储空间占用的节点映射算法。BiPPCF采用内容提取trie树描述协议的耦合关系，提高了数据包解析的灵活性，利用双向流水线上匹配查找提升报文协议解析处理速率。为优化双向流水线存储资源，提出了一种双向流水线节点映射算法（BidirectionalNode MappingAlgorithmm, BiNMA）均衡各级流水线上的协议多叉trie树节点数目，优化存储空间的使用。数据分析和实验仿真显示，与现有高速解析方法相比，BiPPCF在处理速率、空间利用率等方面能取得较好的均衡。
Along with the unceasing expansion of network scale and increase of diversified applicatio nrequirement, the existing network architecture has been confronted with the increasinglyoutstanding problem of scalability, security, quality of service guarantees. Based on aboverecognition, the major project of National973Plan in field of information technology,"FlexibleArchitecture of Reconfigurable Infrastructure"(FARI) dedicates to build a foundation physicalnetwork whose function is dynamically reconfigurable and extended, to supply basic networkservices which can be customized to satisfy different business, in order to match the growingapplication requirements to rich optical transmission resources. The packet parsing technology asa foundation core technology to support IP forwarding, the future experimental platformOpenFlow forwarding traffic, content filtering, etc., has important many-faceted significance intheory and practice for FARI. Because the capability of packet parsing and resource consumptionis closely related to, However, due to the lack of theoretical basis and mathematic model,researches on the packet parsing technology for resource optimization are still at an initial stage.
This thesis concentrates on algorithm of packet parsing, and its aim is to improve theperformance and configurability of packet parsing, and reduce the cost of storage resources. Aframework is founded based on high-speed parallel pipelines, which can satisfy the packetparsing needs of IP forwarding, OpenFlow, and content filtering, etc. According to thisframework, three packet parsing methods for different layers were proposed after research on thetheories step by step, the main contents of this thesis presents are organized as following follows:
A layered packet parsing framework named SwitchBricks is proposed, and a high-speedpacket parsing(HSPP) model based on SwitchBricks is set-up, and based on it the optimizationdirection of storage resources is deduced. Firstly, the SwitchBricks’s structure of the separationof control plane and data plane is introduced: control plane is responsible for the scheduling of avariety of network applications, and data plane implements the high-speed packet parsing in theparticular network environment. Two planes are worked together to meet a variety of high-speedpacket parsing requirements. Then, the analytical expressions of SwitchBricks's performance andstorage resources consumption based on M/D/1queuing model is deduced, which could providetheoretical guidance for our further researches. Finally, the factor of storage resourcesconsumption is discussed, and the design of using pipeline storage resource consumptionminimization principle to guide packet parsing correlative algorithm is proposed.
An IP forwarding-oriented high-speed packet parsing method named Parsing PipelineArchitecture for Forwarding (PPAF) is proposed, and a node mapping algorithm to optimize storage resource occupied by the parallel pipeline based on PPAF is provided. PPAF flexiblyanalyses packet protocol by constructing forwarding protocol-trie (FP-trie), improves theprocessing rate by employing parallel hardware pipeline look-up table, and takes parallelpipeline storage resources occupied minimization principle as guida nce. An algorithm formapping node to pipeline (NTP) is proposed to solve the unbalance problem of node mappingstorage resource and reduce the resource consumption. The simulation results through theNetFPGA-10G platform show that PPAF is superior to the extant high speed parsing method intwo ways: PPAF achieves ambidexterity in processing speed and resource consumption; and itcan provide independent interface-based flexible protocol parsing capabilities.
An OpenFlow forwarding-oriented programmable packet parsing method namedprogrammable packet parsing architecture (PPPA) is proposed, and a node mapping algorithm tooptimize storage resource consumption by the segmented pipeline based on this method isprovided. The protocol parsing multibit-trie (PPM-trie) is used to express protocol parsing,making the parsing expression of the protocol scalable, and the high-speed look-up table of asegmented pipeline is used to achieve high-performance packet parsing on processing packet.And taking segmented pipeline storage resources occupied minimization principle as guidance, asegmented node mapping algorithm (SNMA) is proposed to establish the association betweenthe pipeline and multibit-trie to optimize the use of storage space on segmented pipeline stages,in order to reduce resource consumption. Finally, the feasibility of PPPA is verified onNetFPGA-10G platform, and the simulation results show that PPPA achieves the balancebetween the performance and resource consumption.
A content filtering-oriented packet parsing method named bidirectional packet parsingfor content filtering (BiPPCF) is presented, and a node mapping algorithm to optimize storageresource consumption by the bidirectional pipeline based on the method is proposed. Firstly, thecontent extraction trie (CE-trie) is used to describe the coupling of the protocol relationship toimprove flexibility of the packet parsing; Secondly, hardware bi-directional parallel pipeline isused to enhance the processing rate of the packet parsing; Thirdly, in order to optimizebidirectional pipeline storage resources occupied, a bi-directional node mapping algorithm(BiNMA) is used to balance the number of nodes on all pipeline stages to optimize the storagespace. Analysis and simulation results show that compared with the existing high-speed packetparsing method, BiPPCF gets better balance between the performance and resourceconsumption.
本文以高速报文解析技术为研究对象，以高速流水线结构设计为研究内容，以提高报文解析处理的速率、降低存储资源开销，提供可配置的报文解析能力为目标，提出一个基于高速并行流水线可重构的高速报文解析框架，在此基础上针对IP转发、OpenFlow流转发、内容过滤等处理功能的不同层次协议解析需求，深入研究了三个不同层次的高速报文解析方法，主要研究内容如下：
提出一种分层式的报文解析框架SwitchBricks，在框架基础上建立了高速报文解析模型（High-Speed Packet Parsing, HSPP），并提出模型存储资源优化的方向。首先，介绍了SwitchBricks控制与数据分离的结构：控制平面负责多种网络应用下解析能力的控制调度，数据平面完成特定网络环境下报文的高速解析，通过两个平面的协作满足高速报文多样化的解析需求；然后，基于M/D/1排队模型对SwitchBricks的处理性能和存储资源消耗进行推导分析，为后续研究和方案设计提供理论指导；最后，通过对存储资源占用的讨论，提出利用优化流水线存储资源占用原则指导报文解析相关算法的设计。
提出了一种面向IP转发的高速报文解析方法（Parsing Pipeline Architecture forForwarding，PPAF），并基于PPAF方法提出一种优化并行流水线存储空间占用的节点映射算法。PPAF通过构建协议二叉trie树来支持报文协议解析的灵活度，利用并行多级流水查表提升报文协议解析处理速率，并以优化并行流水线存储资源占用原则为指导，提出了一种并行流水线节点映射算法（Node To Pipeline, NTP），可解决协议二叉trie树节点到并行流水线映射过程中存储资源不均衡的问题，进而减低存储资源开销。基于NetFPGA-10G的仿真实验表明，相对于现有的高速解析方法，该PPAF方法在处理速率和资源占用上取得较好均衡的同时，支持基于接口的独立解析能力。
提出了一种OpenFlow流转发的可编程报文解析方法（Programmable Packet ParsingArchitecture, PPPA），利用该方法提出一种优化分段流水线存储空间占用的节点映射算法。PPPA通过构建协议解析多叉trie树，支持报文协议解析的可扩展，利用分段流水线匹配查找提升报文协议解析处理速率，并以优化分段流水线存储资源占用原则为指导，提出了一种分段流水线节点映射算法（Segmented Node Mapping Algorithm, SNMA），用以实现协议多叉trie树节点到分段流水线均衡存储映射，进而减少存储资源的消耗。基于NetFPGA-10G的仿真实验表明，与现有高速解析方法相比，该方法在能够提供基于接口的独立解析能力的同时，在解析带宽和资源占用上取得了较好的平衡。
提出了一种面向内容过滤的协议解析方法(Bidirectional Packet Parsing for ContentFiltering, BiPPCF)，并基于该方法提出一种优化双向流水线存储空间占用的节点映射算法。BiPPCF采用内容提取trie树描述协议的耦合关系，提高了数据包解析的灵活性，利用双向流水线上匹配查找提升报文协议解析处理速率。为优化双向流水线存储资源，提出了一种双向流水线节点映射算法（BidirectionalNode MappingAlgorithmm, BiNMA）均衡各级流水线上的协议多叉trie树节点数目，优化存储空间的使用。数据分析和实验仿真显示，与现有高速解析方法相比，BiPPCF在处理速率、空间利用率等方面能取得较好的均衡。
Along with the unceasing expansion of network scale and increase of diversified applicatio nrequirement, the existing network architecture has been confronted with the increasinglyoutstanding problem of scalability, security, quality of service guarantees. Based on aboverecognition, the major project of National973Plan in field of information technology,"FlexibleArchitecture of Reconfigurable Infrastructure"(FARI) dedicates to build a foundation physicalnetwork whose function is dynamically reconfigurable and extended, to supply basic networkservices which can be customized to satisfy different business, in order to match the growingapplication requirements to rich optical transmission resources. The packet parsing technology asa foundation core technology to support IP forwarding, the future experimental platformOpenFlow forwarding traffic, content filtering, etc., has important many-faceted significance intheory and practice for FARI. Because the capability of packet parsing and resource consumptionis closely related to, However, due to the lack of theoretical basis and mathematic model,researches on the packet parsing technology for resource optimization are still at an initial stage.
This thesis concentrates on algorithm of packet parsing, and its aim is to improve theperformance and configurability of packet parsing, and reduce the cost of storage resources. Aframework is founded based on high-speed parallel pipelines, which can satisfy the packetparsing needs of IP forwarding, OpenFlow, and content filtering, etc. According to thisframework, three packet parsing methods for different layers were proposed after research on thetheories step by step, the main contents of this thesis presents are organized as following follows:
A layered packet parsing framework named SwitchBricks is proposed, and a high-speedpacket parsing(HSPP) model based on SwitchBricks is set-up, and based on it the optimizationdirection of storage resources is deduced. Firstly, the SwitchBricks’s structure of the separationof control plane and data plane is introduced: control plane is responsible for the scheduling of avariety of network applications, and data plane implements the high-speed packet parsing in theparticular network environment. Two planes are worked together to meet a variety of high-speedpacket parsing requirements. Then, the analytical expressions of SwitchBricks's performance andstorage resources consumption based on M/D/1queuing model is deduced, which could providetheoretical guidance for our further researches. Finally, the factor of storage resourcesconsumption is discussed, and the design of using pipeline storage resource consumptionminimization principle to guide packet parsing correlative algorithm is proposed.
An IP forwarding-oriented high-speed packet parsing method named Parsing PipelineArchitecture for Forwarding (PPAF) is proposed, and a node mapping algorithm to optimize storage resource occupied by the parallel pipeline based on PPAF is provided. PPAF flexiblyanalyses packet protocol by constructing forwarding protocol-trie (FP-trie), improves theprocessing rate by employing parallel hardware pipeline look-up table, and takes parallelpipeline storage resources occupied minimization principle as guida nce. An algorithm formapping node to pipeline (NTP) is proposed to solve the unbalance problem of node mappingstorage resource and reduce the resource consumption. The simulation results through theNetFPGA-10G platform show that PPAF is superior to the extant high speed parsing method intwo ways: PPAF achieves ambidexterity in processing speed and resource consumption; and itcan provide independent interface-based flexible protocol parsing capabilities.
An OpenFlow forwarding-oriented programmable packet parsing method namedprogrammable packet parsing architecture (PPPA) is proposed, and a node mapping algorithm tooptimize storage resource consumption by the segmented pipeline based on this method isprovided. The protocol parsing multibit-trie (PPM-trie) is used to express protocol parsing,making the parsing expression of the protocol scalable, and the high-speed look-up table of asegmented pipeline is used to achieve high-performance packet parsing on processing packet.And taking segmented pipeline storage resources occupied minimization principle as guidance, asegmented node mapping algorithm (SNMA) is proposed to establish the association betweenthe pipeline and multibit-trie to optimize the use of storage space on segmented pipeline stages,in order to reduce resource consumption. Finally, the feasibility of PPPA is verified onNetFPGA-10G platform, and the simulation results show that PPPA achieves the balancebetween the performance and resource consumption.
A content filtering-oriented packet parsing method named bidirectional packet parsingfor content filtering (BiPPCF) is presented, and a node mapping algorithm to optimize storageresource consumption by the bidirectional pipeline based on the method is proposed. Firstly, thecontent extraction trie (CE-trie) is used to describe the coupling of the protocol relationship toimprove flexibility of the packet parsing; Secondly, hardware bi-directional parallel pipeline isused to enhance the processing rate of the packet parsing; Thirdly, in order to optimizebidirectional pipeline storage resources occupied, a bi-directional node mapping algorithm(BiNMA) is used to balance the number of nodes on all pipeline stages to optimize the storagespace. Analysis and simulation results show that compared with the existing high-speed packetparsing method, BiPPCF gets better balance between the performance and resourceconsumption.
引文
[1]中国互联网络信息中心.中国互联网络发展状况统计报告[EB/OL].http://www.cnnic.net.cn/hlwfzyj/hlwxzbg/hlwtjbg/201301/t20130115_38508.htm.2013-01-15.
[2]韦乐平.下一代网的发展思路与实践[J].华为技术,2005,5:4-9.
[3] Hauger S, Wild T, Mutter A, et al. Packet processing at100gbps and beyond-challengesand perspectives[A]. In Proceedings of ITG Symposium on Photonic Networks[C].2009:1-10.
[4]思科公司[EB/OL]. http://www.cisco.com/en/US/docs/ios/12_2sr/12_2srb/feature/guide/lsrmbrfc.html.
[5]瞻博网络公司[EB/OL]. https://www.juniper.net/techpubs/software/nog/index.html.
[6] Weaver, Nicholas, et al. A taxonomy of computer worms[A]. In Proceedings of the2003ACM workshop on Rapid malcode[C].2003:11-18.
[7] Mirkovic, Jelena, Peter Reiher. A taxonomy of DDoS attack and DDoS defensemechanisms[J]. In Proceedings of ACM SIGCOMM Computer Communication Review.2004:39-53.
[8] Morimoto M, Chang S. Consumers' attitudes toward unsolicited commercial e-mail andpostal direct mail marketing methods: Intrusiveness, perceived loss of control, andirritation[J]. Journal of Interactive Advertising,2006:8-20.
[9] Moshchuk A, Bragin T, Steven D, et al. A Crawler-based Study of Spyware on theWeb[A]. In Proceedings of the2006Network and Distributed System SecuritySymposium[C].2006:17-33.
[10]国家计算机病毒应急处理中心.2011年全国信息网络安全状况与计算机及移动终端病毒疫情调查分析报告[EB/OL]. https://www.antivirus-china.org.cn/head/diaocha2011.
[11]中国互联网络信息中心.2012年中国网民信息安全状况研究报告[EB/OL].http://www.cnnic.net.cn/hlwfzyj/hlwxzbg/mtbg/201212/t20121227_38418.htm.2012-12-27.
[12] Feamster N, Gao L, Rexford J. How to lease the Internet in your spare time[J]. ACMSIGCOMM Computer Communication Review,2007,37(1):61-64.
[13] Francis P, Gummadi R. IPNL: A NAT-extended internet architecture[A]. In Proceedings ofthe ACM SIGCOMM Conference[C].2001:69–80.
[14] Kim C, Caesar M, Rexford J. Floodless in seattle: A scalable ethernet architecture for largeenterprises. In Proceedings of the ACM SIGCOMM Conference[C].2008:3-14.
[15] Casado M, Freedman M J, Pettit J, et al. Ethane: taking control of the enterprise[A]. InProceedings of the ACM SIGCOMM Conference[C].2007.
[16] Casado M, Garfinkel T, Akella A, et al. SANE: A protection architecture for enterprisenetworks[A]. In USENIX Security Symposium[C].2006.
[17] Joseph D A, Tavakoli A, Stoica I. A policy-aware switching layer for data centers[A]. InProceedings of the ACM SIGCOMM Conference[C].2008:51-62.
[18] Yang X, Clark D, Berger A W. NIRA: a new inter-domain routing architecture[J].IEEE/ACM Transactions on Networking,2007,15(4):775–788.
[19] Jian R. Internet3.0: Ten Problems with Current Inter-net Architecture and Solutions forthe Next Generation[A]. In Proceedings of IEEE Military Communications Conference(MILCOM2006)[C].2006:1-9.
[20] Pan J, Paul S, Jain R. A survey of the research on future internet architectures[J].Communications Magazine, IEEE,2011,49(7):26-36.
[21] Rexford J, Dovrolis C. Future Internet architecture: clean-slate versus evolutionaryresearch[J]. Communications of the ACM,2010,53(9):36-40.
[22] Chandrasekhar J, Zhang Z L, Zhenhai D, et al. Towards a service oriented internet[J].IEICE transactions on communications,2006,89(9):2292-2299.
[23] Buyya R, Pathan M, Vakali A. Content delivery networks [M]. Berlin Heidelberg:Springer-Verlag,2008.
[24]张宏科,苏伟.新网络体系基础研究——一体化网络与普适服务[J].电子学报,2007,35(4):593-598.
[25] Luo H, Qin Y, Zhang H. A DHT-based identifier-to-locator mapping approach for ascalable Internet[J]. Parallel and Distributed Systems, IEEE Transactions on,2009,20(12):1790-1802.
[26] Wu J, Ren G, Li X. Source address validation: Architecture and protocol design[A]. InProceedings of IEEE International Conference on Network Protocol[C].2007:276-283.
[27] Anderson T, Peterson L, Shenker S, et al. Overcoming the Internet impasse throughvirtualization[J]. Computer,2005,38(4):34-41.
[28] NSF NeTS FIND Initiative. Future Internet Design[EB/OL]. http://www.nets-find.net/.
[29] Global Environment for Network Innovations[EB/OL]. http://www.geni.net.
[30] The European Community's Seventh Programme[EB/OL]. The FP7Autono mic InternetProject, http://ist-autoi.eu/autoi/.
[31] The European Community's Seventh Programme. The FP74WARD Project[EB/OL].http://www.4ward-project.eu/.
[32] Dutta R, Rouskas G N, Baldine I, et al. The SILO Architecture for Services Integration,control, and Optimization for the Future Internet[A]. In Proceedings of IEEE ICC[C],Scotland,2007:1899-1904.
[33] National Institute Of Information (NICT). AKARI Project[EB/OL].http://akari-project.nict.go.jp.
[34]兰巨龙.可重构信息通信基础网络体系研究[R].国家重点基础研究发展计划(973计划)项目计划任务书[D].2011.
[35] Kumar S, Becchi M, Crowley P, etc. Camp: fast and efficient IP lookup architecture[A]. InProceedings of the ACM/IEEE Symposium on Architectures for Networking andCommunications System(ANCS)[C].2006:51–60.
[36] Lu W, Sahni S. Packet forwarding using pipelined multibit tries[A]. In Proceedings ofIEEE Symposium on Computer and communications (ISCC)[C].2006:802–807.
[37] F. Baboescu, D. M. Tullsen, G. Rosu, and S. Singh. A tree based router search enginearchitecture with single port memories [A]. In Proceedings of ISCA[C].2005:123–133.
[38] Jiang W, Prasanna V K. A memory-balanced linear pipeline architecture for trie-based iplookup[A]. In Proceedings of High-Performance Interconnects (HOTI)[C].2007:83–90.
[39] McKeown N, Anderson T, Balakrishnan H, et al. OpenFlow: enabling innovation incampus networks[J]. ACM SIGCOMM Computer Communication Review,2008,38(2):69-74.
[40] Sherwood R, Chan M, Covington A, et al. Carving research Slices out of your productionnetworks with OpenFlow[J]. ACM SIGCOMM Computer Communication Review,2010,40(1):129-130.
[41] Naous J, Erickson D, Covington G A, et al. Implementing an OpenFlow switch on theNetFPGA platform[A]. In Proceedings of the4th ACM/IEEE Symposium onArchitectures for Networking and Communications Systems. ACM,2008:1-9.
[42] Yu F, Chen Z, Diao Y, et al. Fast and memory-efficient regular expression matching fordeep packet inspection[A]. In Proceedings of the ACM/IEEE Symposium on Architecturesfor Networking and Communications System[C].2006:93-102.
[43] Dharmapurikar S, Lockwood J. Fast and scalable pattern matching for content filtering[A].In Proceedings of the ACM/IEEE Symposium on Architectures for Networking andCommunications System(ANCS)[C].2005:183-192.
[44] Zhang J, fang D, Liu L. Intelligent content filtering model for network security auditsystem[A]. In Proceedings of2nd IEEE International Workshop on Knowledge Discoveryand Data Mining[C].2009:546-548.
[45] Yi S, Kim B, Oh J, et al. Memory-efficient content filering hardware for high-speedinstrusion dedtecion systems[C]. In Proceedings of ACM Symposium on AppliedComputing[A].2007:264-269.
[46] Lu W, Sahni S. Packet classification using space-efficient pipelined multibit tries[J]. IEEETransactions on Computers.2008,57(5):591-605.
[47]黄昆,张大方,谢高岗等.一种面向深度数据包检测的紧凑型正则表达式匹配算法[J].中国科学:信息科学,2010,40(2):356-370.
[48] Xu K, Tan J, Guo L, et al. Traffic-aware multiple regular expression matching algorithmfor deep packet inspection[J]. Journal of Networks,2011,6(5):799-806.
[49] Kohler E, Morris R, Chen B, et al. The Click modular router [J]. ACM Transactions onComputer Systems (TOCS).2000,18(3):263-297.
[50] M. Dobrescu, N. Egi, K. Argyraki, et al. RouteBricks: Exploiting parallelism to scalesoftware routers [A]. In Proceedings of22nd ACM Symposium on Operating SystemsPrinciples (SOSP)[C]. Big Sky, MT,2009:11-14.
[51] Egi N, Greenhalgh A, Hoerdt M, et al. A flexible and performant virtual router[A]. InProceedings of the International Workshop on Self-Organizing Systems (IWSOS'07)[C].Evanston, IL, USA,2007.
[52]曾宪玮,裴昌幸,朱畅华等.基于ARM的分布式网络测量探针的设计与实现[J].仪器仪表学报,2007,28(5):784-787.
[53] Fusco F, Deri L. High speed network traffic analysis with commodity multi-coresystems[A]. In Proceedings of the10th ACM SIGCOMM conference on Internetmeasurement[C].2010:218-224.
[54] Bhatnagar H.高级ASIC芯片综合[M].北京:清华大学出版社,2007.
[55] Ahmadi M, Wong S. Network Processors: Challenges and Trends[A]. In Proceedings ofthe17th Annual Workshop on Circuits, Systems and Signal Processing[C]. TheNetherlands,2006:223-232.
[56] Pati S, Narayanan R, Memik G, et al. Design and Implementation of an FPGA Architecturefor High-Speed Network Feature Extraction[A]. In Proceedings of IEEE InternationalConference on Field-Programmable Technology[C].2007:49-56.
[57] Sidhu R, Prasanna V.K. Fast regular expression maching using FPGAs[A]. In Proceedingsof the9th Annual IEEE Symposium on Field-Programmable Custom ComputingMachines [C]. Rohnert Park, CA, USA,2001:227-238.
[58] Muhammad Bilal Anwer, Murtaza Motiwala, Mukarram bin Tariq, et al. Switchblade: aplatform for rapid deployment of network protocols on programmable hardware[A]. InProceedings of the ACM SIGCOMM Conference[C]. New Delhi, India,2010,183-194.
[59] Dedek T, Martinek T, Marek T. High Level Abstraction Language as an Alternative toEmbedded Processors for Internet Packet Processing in FPGA[A]. In Proceedings of IEEEInternational Conference on Field Programmable Logic and Applications[C].2007:648-651.
[60] Lorenzo De Carli, Yi Pan, Amit Kumar et al. PLUG: Flexible Lookup Modules for RapidDeployment ofNew Protocols in High-speed Routers[A]. In Proceedings of the ACMSIGCOMM Conference[C]. Barcelona, Spain,2009:207-218.
[61] Lu G, Guo C, Li Y, et al. ServerSwitch: A Programmable and High Performance Platformfor Data Center Networks[A]. In Proceedings of8th USENIX Symposium on NetworkedSystems Design and Implementation[C]. Boston, MA, USA,2011:1-14.
[62]林闯,单志广,任丰原.计算机网络的服务质量(QoS)[M].北京:清华大学出版社,2004.
[63]郑波,林闯,曲扬.一种适合于网络处理器的并行多维分类算法AM-Trie[J].软件学报,2006,17(9):1949-1957.
[64] Bando M, Artan N S, Chao H J. Scalable lookahead regular expression detection systemfor deep packet inspection[J]. Networking, IEEE/ACM Transactions on,2012,20(3):699-714.
[65]张树壮,罗浩,方滨兴等.一种面向网络安全检测的高性能正则表达式匹配算法[J].计算机学报,2010,33(10):1976-1986．
[66] Yeim-kuan chang, Ming-li sai and Cheng-chien Su. Improved TCAM-Based Pre-Filteringfor Network Intrusion Detection Systems [A]. In Proceedings of the22nd Internationalconference on Advanced Information Networking and Applications[C]. Okinawa, Japan:IEEE Computer Society,2008:985-990.
[67] Turner J S, Crowley P, DeHart J, et al. Supercharging planetlab: a high performance,multi-application, overlay network platform[J]. In Proceedings of the ACM SIGCOMMComputer Communication Review.2007,37(4):85-96.
[68] Karras K, Wild T, Herkersdorf A. A folded pipeline network processor architecture for100Gbit/s networks[A]. In Proceedings of the6th ACM/IEEE Symposium on Architecturesfor Networking and Communications Systems[C]. La Jolla, CA USA,2010,2:1-11.
[69] Lockwood J W, Naufel N, Turner J S, et al. Reprogrammable network packet processingon the field programmable port extender (fpx)[A]. In Proceedings of the2001ACM/SIGDA ninth international symposium on Field programmable gate arrays[C].2001:87-93.
[70] P. Kobiersky, J. Korenek, and L. Polcak. Packet header analysis and field extraction formultigigabit networks[A]. In Proceedings of the IEEE Symposium on Design andDiagnostics of Electronic Circuits and Systems[C]. Liberec, Czech Republic,2009:96-101.
[71]肖寅东,王厚军,田书林.高速网络入侵检测系统中包头解析方法[J].仪器仪表学报,2012,33(6):1414-1419.
[72] Christos Kozanitis, John Huber, Sushil Singh, et al. Leaping multiple headers in a singlebound: wire-speed parsing using the Kangaroo system[A]. In Proceedings of the29thIEEE Conference on Computer Communications[C]. San Diego, CA, USA,2010:830-838.
[73] Yu F, Katz R H, Lakshman T V. Gigabit rate packet pattern-matching using TCAM[A]. InProceedings of the12th IEEE International Conference on Network Protocols[C].2004:174-183.
[74] Ravikumar V C, Mahapatra R N. TCAM architecture for IP lookup using prefixproperties[J]. Micro, IEEE,2004,24(2):60-69.
[75] Demetriades S, Hanna M, Cho S, et al. An efficient hardware-based multi-hash scheme forhigh speed IP lookup[A]. In Proceedings of the16th IEEE Symposium on HighPerformance Interconnects[C].2008:103-110.
[76] Lim H, Jung Y. A parallel multiple hashing architecture for IP address lookup[A]. InProceedings of the Workshop on High Performance Switching and Routing[C].2004:91-95.
[77] Michael Attig, Gordon Brebner.400Gb/s Programmable Packet Parsing on a SingleFPGA[A]. In Proceedings of the ACM/IEEE Symposium on Architectures forNetworking and Communications Systems(ANCS)[C]. Brooklyn, NY, USA,2011:12-23.
[78] BradReed. Sprint goes40Gbps on Tier1IP net.[EB/OL]. http://www.networkworld.com/news/2008/071508-sprint-40gps.html,July2008.
[79] BradReed. Verizon moving to100Gbps network in09.[EB/OL]. http://www.networkworld.com/news/2008/031008-verizon-100gpbs-network.html,March2008.
[80] Gupta P, McKeown N. Algorithms for packet classification[J]. Network, IEEE,2001,15(2):24-32.
[81] Ruiz-Sánchez M á, Biersack E W, Dabbous W. Survey and taxonomy of IP address lookupalgorithms[J]. Network, IEEE,2001,15(2):8-23.
[82] Chowdhury N M, Boutaba R. A survey of network virtualization[J]. Computer Networks,2010,54(5):862-876.
[83] Chowdhury N M M K, Boutaba R. Network virtualization: state of the art and researchchallenges[J]. IEEE Communications Magazine,2009,47(7):20-26.
[84] LauraA. Chappel. TCP/IP协议原理与应用[M].北京:清华大学出版社,2009.
[85]解培岱.面向内容过滤的协议扩展技术研究与实现[D].长沙:国防科技大学研究生院硕士学位论文,2008.
[86]亓亚烜.多域网包分类算法研究[D].北京:清华大学博士学位论文,2011.
[87]徐恪,吴建平,徐明伟.高等计算机网络--体系结构、协议机制、算法设计与路由器技术(第2版),机械工业出版社,2009.
[88]吴建平,林嵩,徐恪等.可演进的新一代互联网体系结构研究进展[J].计算机学报,2012,35(6):1094-1108.
[89] Zeng S, Zhu L, Zhang L. Virtualization technology applications in the private cloudstorage system[A]. In Proceedings of the4th IEEE International Conference on ElectronicSystem-Integration Technology Conference (ESTC)[C].2012:1154-1157.
[90]陈一骄,卢泽新,孙志刚等.可重构路由器报文转发引擎设计与实现[J].通信学报,2012,33(8):42-51.
[91] Budruk R, Anderson D, Shanley T. PCI express system architecture[M]. Addison WesleyPublishing Company,2004.
[92]董永吉,郭云飞.面向转发的双向高速报文解析结构[J].西安交通大学学报,2013,47(2):63-68
[93]董永吉,郭云飞,黄万伟.面向内容安全的报文解析结构研究[J].四川大学学报,2012,44(5):130-135.
[94]唐应辉,唐小我.排队论——基础与分析技术[M].科学出版社.北京,2006,09.
[95] Breuer L, Baum D. An introduction to queueing theory: and matrix-analytic methods[M].Springer,2005.
[96]李韬,孙志刚,陈一骄等.面向下一代互联网实验平台的新型报文处理模型—EasySwitch[J].通信学报,2011,34(11):2187-2196.
[97] ISE Design Tool [EB/OL]. http://www.xilinx.com/tools/designtools.htm.
[98] Synopsys Tool [EB/OL]. http://www.synopsys.com.cn.
[99] Moayeri F, Akbari B, Khansari M, et al. A distributed locality-aware neighbor selectionalgorithm for P2P video streaming over wireless mesh networks[A]. In Proceedings of the6th IEEE International Symposium on Telecommunications (IST)[C].2012:639-643.
[100] Eichen E, Azim R, Chang S C, et al. Smartphone Docking Stations and StronglyConverged VoIP Clients for Fixed-Mobile Convergence[A]. In Proceedings of the IEEEInternational Conference on Wireless Communications and Networking Conference(WCNC)[C].2012:3140-3144.
[101] Huang C W, Huang S M, Wu P H, et al. OLM: Opportunistic Layered Multicasting forscalable IPTV over mobile WiMAX[J]. IEEE Transactions on Mobile Computing.2012,11(3):453-463.
[102]孙志刚,戴艺,龚正虎.面向下一代互联网的可扩展路由器体系结构—MPFS[J].中国科学E辑:信息科学,2008,38(10):1652-1662.
[103]吕高锋,孙志刚,林雨弦,等. CSRouter:服务可扩展的路由器体系结构[J].通信学报,2012,33(7):49-58.
[104] Bolla R, Bruschi R. IP forwarding performance analysis in the presence of control planefunctionalities in a pc-based open router[M]. Distributed Cooperative Laboratories:Networking, Instrumentation, and Measurements. Springer US,2006:143-158.
[105] Pao D,Lu Z, Poon Y H. Bit-Shuffled Trie: IP Lookup with Multi-Level Index Tables[A].In Proceedings of IEEE International Conference on Communications (ICC)[C]. Kyoto,Japan,2011:1-5.
[106] Hasan J, Vijaykumar T N. Dynamic Pipelining: Making IP-Lookup Truly Scalable[A]. InProceedings of the ACM SIGCOMM Conference[C].2005:205-216.
[107] Feldmann A. Internet clean-slate design: what and why?[J]. ACM SIGCOMM ComputerCommunication Review,2007,37(3):59-64.
[108] Srinivasan V, Suri S, Varghese G, Waldvogel M. Fast and Scalable Layer4Switching[A].In Proceedings of the ACM SIGCOMM Conference[C].1998,9:2003-2014.
[109] Baboescu F, Singh S, Varghese G. Packet classification for core routers: Is there analternative to CAMs[A]. In Proceedings of the IEEE INFOCOM[C].2003,1:53-63.
[110] Singh S, Baboescu F, Varghese G, et al. Packet classification using multidimensionalcutting[A]. In Proceedings of the Conference on Applications, Technologies,Architectures, and Protocols for Computer Communications[C].2003:213-224.
[111] Gupta P, McKeown N. Packet classification on multiple fields[J]. ACM SIGCOMMComputer Communication Review,1999,29(4):147-160.
[112] Meiners C R, Liu A X, Torng E. Bit weaving: A non-prefix approach to compressingpacket classifiers in TCAMs [J]. IEEE/ACM Transactions on Networking (TON),2012,20(2):488-500.
[113] Koldehofe B, et al. The power of software-defined networking: line-rate content-basedrouting using OpenFlow [A]. In Proceedings of the7th Workshop on Middleware forNext Generation Internet Computing[C].2012:1-6.
[114] OFN[EB/OL]. http://www.opennetworking.org/standards/intro-to-openflow.
[115] Gude N, Koponen T, Pettit J, et al. NOX: Towards an operating system for networks[J].ACM SIGCOMM Computer Communication Review,2008,38(3):105-110.
[116] Tootoonchian A, Ganjali Y. HyperFlow: A distributed control plane for OpenFlow[A]. InProceedings of the2010Internet Network Management Conference on Research onEnterprise Networking[C].2010:3-3.
[117] Srinivasan T, Prasad S, Prakash B. A Dynamic Packet Classification Algorithm usingMulti-level Trie[A]. In Proceedings of International Conference on InformationTechnology[C].2004:104-107.
[118]朱映映,吴锦锋,明仲.基于网络事件和深度协议分析的入侵检测研究[J].通信学报,2011,(8):171-178.
[119] Liao M Y, Luo M Y, Yang C S, et al. Design and evaluation of deep packet inspectionsystem: a case study[J]. IET Networks,2012,1(1):2-9.
[120]朱国胜,余少华.基于TCAM的范围匹配方法--C-TCAM[J].通信学报,2012,(1):31-37.
[121] Peng K, Tang S, Dong Q, Chen M. Chain-based DFA deflation for fast and scalableregular expression matching using TCAM [A]. In Proceedings of the ACM/IEEESymposium on Architectures for Networking and Communications Systems [C]. Brooklyn,NY, USA,2011:24-35.
[122] Kumar S, Turner J, Williams J. Advanced algorithms for fast and scalable deep packetinspection [A]. In Proceedings of the2006ACM/IEEE symposium on Architecture fornetworking and communications systems[C].2006:81-92.
[2]韦乐平.下一代网的发展思路与实践[J].华为技术,2005,5:4-9.
[3] Hauger S, Wild T, Mutter A, et al. Packet processing at100gbps and beyond-challengesand perspectives[A]. In Proceedings of ITG Symposium on Photonic Networks[C].2009:1-10.
[4]思科公司[EB/OL]. http://www.cisco.com/en/US/docs/ios/12_2sr/12_2srb/feature/guide/lsrmbrfc.html.
[5]瞻博网络公司[EB/OL]. https://www.juniper.net/techpubs/software/nog/index.html.
[6] Weaver, Nicholas, et al. A taxonomy of computer worms[A]. In Proceedings of the2003ACM workshop on Rapid malcode[C].2003:11-18.
[7] Mirkovic, Jelena, Peter Reiher. A taxonomy of DDoS attack and DDoS defensemechanisms[J]. In Proceedings of ACM SIGCOMM Computer Communication Review.2004:39-53.
[8] Morimoto M, Chang S. Consumers' attitudes toward unsolicited commercial e-mail andpostal direct mail marketing methods: Intrusiveness, perceived loss of control, andirritation[J]. Journal of Interactive Advertising,2006:8-20.
[9] Moshchuk A, Bragin T, Steven D, et al. A Crawler-based Study of Spyware on theWeb[A]. In Proceedings of the2006Network and Distributed System SecuritySymposium[C].2006:17-33.
[10]国家计算机病毒应急处理中心.2011年全国信息网络安全状况与计算机及移动终端病毒疫情调查分析报告[EB/OL]. https://www.antivirus-china.org.cn/head/diaocha2011.
[11]中国互联网络信息中心.2012年中国网民信息安全状况研究报告[EB/OL].http://www.cnnic.net.cn/hlwfzyj/hlwxzbg/mtbg/201212/t20121227_38418.htm.2012-12-27.
[12] Feamster N, Gao L, Rexford J. How to lease the Internet in your spare time[J]. ACMSIGCOMM Computer Communication Review,2007,37(1):61-64.
[13] Francis P, Gummadi R. IPNL: A NAT-extended internet architecture[A]. In Proceedings ofthe ACM SIGCOMM Conference[C].2001:69–80.
[14] Kim C, Caesar M, Rexford J. Floodless in seattle: A scalable ethernet architecture for largeenterprises. In Proceedings of the ACM SIGCOMM Conference[C].2008:3-14.
[15] Casado M, Freedman M J, Pettit J, et al. Ethane: taking control of the enterprise[A]. InProceedings of the ACM SIGCOMM Conference[C].2007.
[16] Casado M, Garfinkel T, Akella A, et al. SANE: A protection architecture for enterprisenetworks[A]. In USENIX Security Symposium[C].2006.
[17] Joseph D A, Tavakoli A, Stoica I. A policy-aware switching layer for data centers[A]. InProceedings of the ACM SIGCOMM Conference[C].2008:51-62.
[18] Yang X, Clark D, Berger A W. NIRA: a new inter-domain routing architecture[J].IEEE/ACM Transactions on Networking,2007,15(4):775–788.
[19] Jian R. Internet3.0: Ten Problems with Current Inter-net Architecture and Solutions forthe Next Generation[A]. In Proceedings of IEEE Military Communications Conference(MILCOM2006)[C].2006:1-9.
[20] Pan J, Paul S, Jain R. A survey of the research on future internet architectures[J].Communications Magazine, IEEE,2011,49(7):26-36.
[21] Rexford J, Dovrolis C. Future Internet architecture: clean-slate versus evolutionaryresearch[J]. Communications of the ACM,2010,53(9):36-40.
[22] Chandrasekhar J, Zhang Z L, Zhenhai D, et al. Towards a service oriented internet[J].IEICE transactions on communications,2006,89(9):2292-2299.
[23] Buyya R, Pathan M, Vakali A. Content delivery networks [M]. Berlin Heidelberg:Springer-Verlag,2008.
[24]张宏科,苏伟.新网络体系基础研究——一体化网络与普适服务[J].电子学报,2007,35(4):593-598.
[25] Luo H, Qin Y, Zhang H. A DHT-based identifier-to-locator mapping approach for ascalable Internet[J]. Parallel and Distributed Systems, IEEE Transactions on,2009,20(12):1790-1802.
[26] Wu J, Ren G, Li X. Source address validation: Architecture and protocol design[A]. InProceedings of IEEE International Conference on Network Protocol[C].2007:276-283.
[27] Anderson T, Peterson L, Shenker S, et al. Overcoming the Internet impasse throughvirtualization[J]. Computer,2005,38(4):34-41.
[28] NSF NeTS FIND Initiative. Future Internet Design[EB/OL]. http://www.nets-find.net/.
[29] Global Environment for Network Innovations[EB/OL]. http://www.geni.net.
[30] The European Community's Seventh Programme[EB/OL]. The FP7Autono mic InternetProject, http://ist-autoi.eu/autoi/.
[31] The European Community's Seventh Programme. The FP74WARD Project[EB/OL].http://www.4ward-project.eu/.
[32] Dutta R, Rouskas G N, Baldine I, et al. The SILO Architecture for Services Integration,control, and Optimization for the Future Internet[A]. In Proceedings of IEEE ICC[C],Scotland,2007:1899-1904.
[33] National Institute Of Information (NICT). AKARI Project[EB/OL].http://akari-project.nict.go.jp.
[34]兰巨龙.可重构信息通信基础网络体系研究[R].国家重点基础研究发展计划(973计划)项目计划任务书[D].2011.
[35] Kumar S, Becchi M, Crowley P, etc. Camp: fast and efficient IP lookup architecture[A]. InProceedings of the ACM/IEEE Symposium on Architectures for Networking andCommunications System(ANCS)[C].2006:51–60.
[36] Lu W, Sahni S. Packet forwarding using pipelined multibit tries[A]. In Proceedings ofIEEE Symposium on Computer and communications (ISCC)[C].2006:802–807.
[37] F. Baboescu, D. M. Tullsen, G. Rosu, and S. Singh. A tree based router search enginearchitecture with single port memories [A]. In Proceedings of ISCA[C].2005:123–133.
[38] Jiang W, Prasanna V K. A memory-balanced linear pipeline architecture for trie-based iplookup[A]. In Proceedings of High-Performance Interconnects (HOTI)[C].2007:83–90.
[39] McKeown N, Anderson T, Balakrishnan H, et al. OpenFlow: enabling innovation incampus networks[J]. ACM SIGCOMM Computer Communication Review,2008,38(2):69-74.
[40] Sherwood R, Chan M, Covington A, et al. Carving research Slices out of your productionnetworks with OpenFlow[J]. ACM SIGCOMM Computer Communication Review,2010,40(1):129-130.
[41] Naous J, Erickson D, Covington G A, et al. Implementing an OpenFlow switch on theNetFPGA platform[A]. In Proceedings of the4th ACM/IEEE Symposium onArchitectures for Networking and Communications Systems. ACM,2008:1-9.
[42] Yu F, Chen Z, Diao Y, et al. Fast and memory-efficient regular expression matching fordeep packet inspection[A]. In Proceedings of the ACM/IEEE Symposium on Architecturesfor Networking and Communications System[C].2006:93-102.
[43] Dharmapurikar S, Lockwood J. Fast and scalable pattern matching for content filtering[A].In Proceedings of the ACM/IEEE Symposium on Architectures for Networking andCommunications System(ANCS)[C].2005:183-192.
[44] Zhang J, fang D, Liu L. Intelligent content filtering model for network security auditsystem[A]. In Proceedings of2nd IEEE International Workshop on Knowledge Discoveryand Data Mining[C].2009:546-548.
[45] Yi S, Kim B, Oh J, et al. Memory-efficient content filering hardware for high-speedinstrusion dedtecion systems[C]. In Proceedings of ACM Symposium on AppliedComputing[A].2007:264-269.
[46] Lu W, Sahni S. Packet classification using space-efficient pipelined multibit tries[J]. IEEETransactions on Computers.2008,57(5):591-605.
[47]黄昆,张大方,谢高岗等.一种面向深度数据包检测的紧凑型正则表达式匹配算法[J].中国科学:信息科学,2010,40(2):356-370.
[48] Xu K, Tan J, Guo L, et al. Traffic-aware multiple regular expression matching algorithmfor deep packet inspection[J]. Journal of Networks,2011,6(5):799-806.
[49] Kohler E, Morris R, Chen B, et al. The Click modular router [J]. ACM Transactions onComputer Systems (TOCS).2000,18(3):263-297.
[50] M. Dobrescu, N. Egi, K. Argyraki, et al. RouteBricks: Exploiting parallelism to scalesoftware routers [A]. In Proceedings of22nd ACM Symposium on Operating SystemsPrinciples (SOSP)[C]. Big Sky, MT,2009:11-14.
[51] Egi N, Greenhalgh A, Hoerdt M, et al. A flexible and performant virtual router[A]. InProceedings of the International Workshop on Self-Organizing Systems (IWSOS'07)[C].Evanston, IL, USA,2007.
[52]曾宪玮,裴昌幸,朱畅华等.基于ARM的分布式网络测量探针的设计与实现[J].仪器仪表学报,2007,28(5):784-787.
[53] Fusco F, Deri L. High speed network traffic analysis with commodity multi-coresystems[A]. In Proceedings of the10th ACM SIGCOMM conference on Internetmeasurement[C].2010:218-224.
[54] Bhatnagar H.高级ASIC芯片综合[M].北京:清华大学出版社,2007.
[55] Ahmadi M, Wong S. Network Processors: Challenges and Trends[A]. In Proceedings ofthe17th Annual Workshop on Circuits, Systems and Signal Processing[C]. TheNetherlands,2006:223-232.
[56] Pati S, Narayanan R, Memik G, et al. Design and Implementation of an FPGA Architecturefor High-Speed Network Feature Extraction[A]. In Proceedings of IEEE InternationalConference on Field-Programmable Technology[C].2007:49-56.
[57] Sidhu R, Prasanna V.K. Fast regular expression maching using FPGAs[A]. In Proceedingsof the9th Annual IEEE Symposium on Field-Programmable Custom ComputingMachines [C]. Rohnert Park, CA, USA,2001:227-238.
[58] Muhammad Bilal Anwer, Murtaza Motiwala, Mukarram bin Tariq, et al. Switchblade: aplatform for rapid deployment of network protocols on programmable hardware[A]. InProceedings of the ACM SIGCOMM Conference[C]. New Delhi, India,2010,183-194.
[59] Dedek T, Martinek T, Marek T. High Level Abstraction Language as an Alternative toEmbedded Processors for Internet Packet Processing in FPGA[A]. In Proceedings of IEEEInternational Conference on Field Programmable Logic and Applications[C].2007:648-651.
[60] Lorenzo De Carli, Yi Pan, Amit Kumar et al. PLUG: Flexible Lookup Modules for RapidDeployment ofNew Protocols in High-speed Routers[A]. In Proceedings of the ACMSIGCOMM Conference[C]. Barcelona, Spain,2009:207-218.
[61] Lu G, Guo C, Li Y, et al. ServerSwitch: A Programmable and High Performance Platformfor Data Center Networks[A]. In Proceedings of8th USENIX Symposium on NetworkedSystems Design and Implementation[C]. Boston, MA, USA,2011:1-14.
[62]林闯,单志广,任丰原.计算机网络的服务质量(QoS)[M].北京:清华大学出版社,2004.
[63]郑波,林闯,曲扬.一种适合于网络处理器的并行多维分类算法AM-Trie[J].软件学报,2006,17(9):1949-1957.
[64] Bando M, Artan N S, Chao H J. Scalable lookahead regular expression detection systemfor deep packet inspection[J]. Networking, IEEE/ACM Transactions on,2012,20(3):699-714.
[65]张树壮,罗浩,方滨兴等.一种面向网络安全检测的高性能正则表达式匹配算法[J].计算机学报,2010,33(10):1976-1986．
[66] Yeim-kuan chang, Ming-li sai and Cheng-chien Su. Improved TCAM-Based Pre-Filteringfor Network Intrusion Detection Systems [A]. In Proceedings of the22nd Internationalconference on Advanced Information Networking and Applications[C]. Okinawa, Japan:IEEE Computer Society,2008:985-990.
[67] Turner J S, Crowley P, DeHart J, et al. Supercharging planetlab: a high performance,multi-application, overlay network platform[J]. In Proceedings of the ACM SIGCOMMComputer Communication Review.2007,37(4):85-96.
[68] Karras K, Wild T, Herkersdorf A. A folded pipeline network processor architecture for100Gbit/s networks[A]. In Proceedings of the6th ACM/IEEE Symposium on Architecturesfor Networking and Communications Systems[C]. La Jolla, CA USA,2010,2:1-11.
[69] Lockwood J W, Naufel N, Turner J S, et al. Reprogrammable network packet processingon the field programmable port extender (fpx)[A]. In Proceedings of the2001ACM/SIGDA ninth international symposium on Field programmable gate arrays[C].2001:87-93.
[70] P. Kobiersky, J. Korenek, and L. Polcak. Packet header analysis and field extraction formultigigabit networks[A]. In Proceedings of the IEEE Symposium on Design andDiagnostics of Electronic Circuits and Systems[C]. Liberec, Czech Republic,2009:96-101.
[71]肖寅东,王厚军,田书林.高速网络入侵检测系统中包头解析方法[J].仪器仪表学报,2012,33(6):1414-1419.
[72] Christos Kozanitis, John Huber, Sushil Singh, et al. Leaping multiple headers in a singlebound: wire-speed parsing using the Kangaroo system[A]. In Proceedings of the29thIEEE Conference on Computer Communications[C]. San Diego, CA, USA,2010:830-838.
[73] Yu F, Katz R H, Lakshman T V. Gigabit rate packet pattern-matching using TCAM[A]. InProceedings of the12th IEEE International Conference on Network Protocols[C].2004:174-183.
[74] Ravikumar V C, Mahapatra R N. TCAM architecture for IP lookup using prefixproperties[J]. Micro, IEEE,2004,24(2):60-69.
[75] Demetriades S, Hanna M, Cho S, et al. An efficient hardware-based multi-hash scheme forhigh speed IP lookup[A]. In Proceedings of the16th IEEE Symposium on HighPerformance Interconnects[C].2008:103-110.
[76] Lim H, Jung Y. A parallel multiple hashing architecture for IP address lookup[A]. InProceedings of the Workshop on High Performance Switching and Routing[C].2004:91-95.
[77] Michael Attig, Gordon Brebner.400Gb/s Programmable Packet Parsing on a SingleFPGA[A]. In Proceedings of the ACM/IEEE Symposium on Architectures forNetworking and Communications Systems(ANCS)[C]. Brooklyn, NY, USA,2011:12-23.
[78] BradReed. Sprint goes40Gbps on Tier1IP net.[EB/OL]. http://www.networkworld.com/news/2008/071508-sprint-40gps.html,July2008.
[79] BradReed. Verizon moving to100Gbps network in09.[EB/OL]. http://www.networkworld.com/news/2008/031008-verizon-100gpbs-network.html,March2008.
[80] Gupta P, McKeown N. Algorithms for packet classification[J]. Network, IEEE,2001,15(2):24-32.
[81] Ruiz-Sánchez M á, Biersack E W, Dabbous W. Survey and taxonomy of IP address lookupalgorithms[J]. Network, IEEE,2001,15(2):8-23.
[82] Chowdhury N M, Boutaba R. A survey of network virtualization[J]. Computer Networks,2010,54(5):862-876.
[83] Chowdhury N M M K, Boutaba R. Network virtualization: state of the art and researchchallenges[J]. IEEE Communications Magazine,2009,47(7):20-26.
[84] LauraA. Chappel. TCP/IP协议原理与应用[M].北京:清华大学出版社,2009.
[85]解培岱.面向内容过滤的协议扩展技术研究与实现[D].长沙:国防科技大学研究生院硕士学位论文,2008.
[86]亓亚烜.多域网包分类算法研究[D].北京:清华大学博士学位论文,2011.
[87]徐恪,吴建平,徐明伟.高等计算机网络--体系结构、协议机制、算法设计与路由器技术(第2版),机械工业出版社,2009.
[88]吴建平,林嵩,徐恪等.可演进的新一代互联网体系结构研究进展[J].计算机学报,2012,35(6):1094-1108.
[89] Zeng S, Zhu L, Zhang L. Virtualization technology applications in the private cloudstorage system[A]. In Proceedings of the4th IEEE International Conference on ElectronicSystem-Integration Technology Conference (ESTC)[C].2012:1154-1157.
[90]陈一骄,卢泽新,孙志刚等.可重构路由器报文转发引擎设计与实现[J].通信学报,2012,33(8):42-51.
[91] Budruk R, Anderson D, Shanley T. PCI express system architecture[M]. Addison WesleyPublishing Company,2004.
[92]董永吉,郭云飞.面向转发的双向高速报文解析结构[J].西安交通大学学报,2013,47(2):63-68
[93]董永吉,郭云飞,黄万伟.面向内容安全的报文解析结构研究[J].四川大学学报,2012,44(5):130-135.
[94]唐应辉,唐小我.排队论——基础与分析技术[M].科学出版社.北京,2006,09.
[95] Breuer L, Baum D. An introduction to queueing theory: and matrix-analytic methods[M].Springer,2005.
[96]李韬,孙志刚,陈一骄等.面向下一代互联网实验平台的新型报文处理模型—EasySwitch[J].通信学报,2011,34(11):2187-2196.
[97] ISE Design Tool [EB/OL]. http://www.xilinx.com/tools/designtools.htm.
[98] Synopsys Tool [EB/OL]. http://www.synopsys.com.cn.
[99] Moayeri F, Akbari B, Khansari M, et al. A distributed locality-aware neighbor selectionalgorithm for P2P video streaming over wireless mesh networks[A]. In Proceedings of the6th IEEE International Symposium on Telecommunications (IST)[C].2012:639-643.
[100] Eichen E, Azim R, Chang S C, et al. Smartphone Docking Stations and StronglyConverged VoIP Clients for Fixed-Mobile Convergence[A]. In Proceedings of the IEEEInternational Conference on Wireless Communications and Networking Conference(WCNC)[C].2012:3140-3144.
[101] Huang C W, Huang S M, Wu P H, et al. OLM: Opportunistic Layered Multicasting forscalable IPTV over mobile WiMAX[J]. IEEE Transactions on Mobile Computing.2012,11(3):453-463.
[102]孙志刚,戴艺,龚正虎.面向下一代互联网的可扩展路由器体系结构—MPFS[J].中国科学E辑:信息科学,2008,38(10):1652-1662.
[103]吕高锋,孙志刚,林雨弦,等. CSRouter:服务可扩展的路由器体系结构[J].通信学报,2012,33(7):49-58.
[104] Bolla R, Bruschi R. IP forwarding performance analysis in the presence of control planefunctionalities in a pc-based open router[M]. Distributed Cooperative Laboratories:Networking, Instrumentation, and Measurements. Springer US,2006:143-158.
[105] Pao D,Lu Z, Poon Y H. Bit-Shuffled Trie: IP Lookup with Multi-Level Index Tables[A].In Proceedings of IEEE International Conference on Communications (ICC)[C]. Kyoto,Japan,2011:1-5.
[106] Hasan J, Vijaykumar T N. Dynamic Pipelining: Making IP-Lookup Truly Scalable[A]. InProceedings of the ACM SIGCOMM Conference[C].2005:205-216.
[107] Feldmann A. Internet clean-slate design: what and why?[J]. ACM SIGCOMM ComputerCommunication Review,2007,37(3):59-64.
[108] Srinivasan V, Suri S, Varghese G, Waldvogel M. Fast and Scalable Layer4Switching[A].In Proceedings of the ACM SIGCOMM Conference[C].1998,9:2003-2014.
[109] Baboescu F, Singh S, Varghese G. Packet classification for core routers: Is there analternative to CAMs[A]. In Proceedings of the IEEE INFOCOM[C].2003,1:53-63.
[110] Singh S, Baboescu F, Varghese G, et al. Packet classification using multidimensionalcutting[A]. In Proceedings of the Conference on Applications, Technologies,Architectures, and Protocols for Computer Communications[C].2003:213-224.
[111] Gupta P, McKeown N. Packet classification on multiple fields[J]. ACM SIGCOMMComputer Communication Review,1999,29(4):147-160.
[112] Meiners C R, Liu A X, Torng E. Bit weaving: A non-prefix approach to compressingpacket classifiers in TCAMs [J]. IEEE/ACM Transactions on Networking (TON),2012,20(2):488-500.
[113] Koldehofe B, et al. The power of software-defined networking: line-rate content-basedrouting using OpenFlow [A]. In Proceedings of the7th Workshop on Middleware forNext Generation Internet Computing[C].2012:1-6.
[114] OFN[EB/OL]. http://www.opennetworking.org/standards/intro-to-openflow.
[115] Gude N, Koponen T, Pettit J, et al. NOX: Towards an operating system for networks[J].ACM SIGCOMM Computer Communication Review,2008,38(3):105-110.
[116] Tootoonchian A, Ganjali Y. HyperFlow: A distributed control plane for OpenFlow[A]. InProceedings of the2010Internet Network Management Conference on Research onEnterprise Networking[C].2010:3-3.
[117] Srinivasan T, Prasad S, Prakash B. A Dynamic Packet Classification Algorithm usingMulti-level Trie[A]. In Proceedings of International Conference on InformationTechnology[C].2004:104-107.
[118]朱映映,吴锦锋,明仲.基于网络事件和深度协议分析的入侵检测研究[J].通信学报,2011,(8):171-178.
[119] Liao M Y, Luo M Y, Yang C S, et al. Design and evaluation of deep packet inspectionsystem: a case study[J]. IET Networks,2012,1(1):2-9.
[120]朱国胜,余少华.基于TCAM的范围匹配方法--C-TCAM[J].通信学报,2012,(1):31-37.
[121] Peng K, Tang S, Dong Q, Chen M. Chain-based DFA deflation for fast and scalableregular expression matching using TCAM [A]. In Proceedings of the ACM/IEEESymposium on Architectures for Networking and Communications Systems [C]. Brooklyn,NY, USA,2011:24-35.
[122] Kumar S, Turner J, Williams J. Advanced algorithms for fast and scalable deep packetinspection [A]. In Proceedings of the2006ACM/IEEE symposium on Architecture fornetworking and communications systems[C].2006:81-92.
© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号 地址：北京市海淀区学院路29号 邮编：100083 电话：办公室：(+86 10)66554848；文献借阅、咨询服务、科技查新：66554700 |