搜索资源列表
Advanced_Router_design
- 要 高性能和安全是计算机网络研究的两个主要问题。如何使路由器在保证转发性能的前提下提供网络安全保护已经成为当前的研究热点。本文介绍了在完成国家“863”计划重大课题“高性能安全路由器”的过程中解决的若干关键技术问题。“高性能安全路由器”基于自主设计的高性能路由器操作系统HEROS。为保证高性能的路由转发，设计实现了基于RAM的高性能路由查找算法；为支持服务质量控制和安全管理，设计实现了基于无冲突哈希Trie树的分组分类算法和基于反馈的分布式分组调度算法；为保证网络安全，提出了基于分布式密钥管理的
TrieTree
- 什么是Trie树？ Trie树的性质和特点 Trie树的实现 Trie树是做什么的？
B01AB525d01
- The problem of efficient data structures for IP lookups has been well studied in literature. Techniques such as LC tries and Extensible Hashing are commonly used. In this paper, we address the problem of generalizing LC tries and Extensible H
Course-design-English-dictionary
- Trie树通常作为一种索引树，这种结构对于大小变化很大的关键字特别有用。利用Trie树实现一个英语单词辅助记忆系统，完成相应的建表和查表程序。-Trie trees usually as a tree, the structure on the index of the key word size change a lot is especially useful. Use Trie tree realize one English word memory system, complete au
CMST-DataStruct
- A Classifi ed Multi-Suffi x Trie for IP Lookup and Update
English-dictionary
- 数据结构课设--英语词典的维护和识别--Trie树-Data structures course set- English dictionary maintenance and identification- Trie tree
void_tableau
- programme qui trie les tableaux de 2 dimensions en C-programme qui trie les tableaux de 2 dimensions en C++
ComXbee
- helo my descr iption is not avalabel becose my lang is not English. je suis trie disole
Peersim-Pht-master
- Distributed Hash Tables are scalable, robust, and self-organizing peer-to-peer systems that support exact match lookups. This paper describes the design and implementation of a Prefix Hash Tree - a distributed data structure that enables more s