检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]国家数字交换系统工程技术研究中心,郑州450002 [2]解放军理工大学指挥信息系统学院,南京210007
出 处:《西安交通大学学报》2013年第2期63-68,共6页Journal of Xi'an Jiaotong University
基 金:国家"973计划"资助项目(2012CB315901;2012CB315905);国家"863计划"资助项目(2011AA01A103);国家科技支撑计划资助项目(2011BAH19B01)
摘 要:为进一步提升未来互联网体系结构的实验平台对转发报文高速灵活解析的能力,提出了一种面向转发的双向报文解析结构(BiPPAF)。该结构由以下2个方面构成:在协议的解析表达上,利用二叉trie树动态灵活的字符串组织方式,实现协议解析表达的可扩展;在协议解析的处理上,采用硬件流水线通过高速流水的查表方式,实现协议解析的高性能。BiPPAF结构通过为每个网络接口建立协议二叉trie树实现接口独立的协议解析能力,并利用节点映射算法来完成流水线和二叉trie树之间的关联,能够均衡各级流水线上二叉trie树的节点数目优化存储空间的使用。仿真实验表明,与Packet Parsing方法相比,BiPPAF结构的协议处理速率提升了31%,而资源占用降低了64%。A parsing architecture for bidirectional forwarding packet(BiPPAF) is proposed to enhance the experimental platform ability of future Internet architecture with high-speed and flexible parsing forwarding packets,The proposed method is composed of two aspects: the dynamic string organization of a binary trie is used to express protocol parsing scalably on the parsing expression of the protocol;and the high-speed look-up table of a hardware pipeline is used to achieve high-performance protocol parsing on processing protocol parsing.A protocol binary trie is established for each network interface to provide independent interface protocol parsing,and a node mapping algorithm is used to establish the association between the pipeline and the binary trie and to optimize the use of storage space for a balanced binary trie in all pipeline stages.Simulated experiments and comparisons with the Packet Parsing show that the proposed method improves the protocol processing by 31%,and reduces the resource consumption by 64%.
关 键 词:报文解析 二叉 TRIE 树 流水线 未来互联网
分 类 号:TN914.42[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.229