位置：成果数据库 > 会议 > 会议详情页
CLUE: Achieving fast update over compressed table for parallel lookup with reduced dynamic redundanc
  • 所属机构名称：清华大学
  • 会议名称：32nd IEEE International Conference on Distributed Computing Systems, ICDCS 2012
  • 时间：2012.6.6
  • 成果类型：会议
  • 相关项目：应用层协议识别的硬件加速协处理器关键技术
作者： Yang Tong|Duan Ruian|Lu Jianyuan|Zhang Shenjiang|Dai Huichen|Liu Bin|
同会议论文项目
应用层协议识别的硬件加速协处理器关键技术
期刊论文 18 会议论文 24
同项目会议论文
Greening the Internet using multi-frequency scaling scheme
An Ultra-fast Universal Incremental Update Algorithm for Trie-based Routing Lookup
Approaching optimal compression with fast update for large scale routing tables
Wire Speed Name Lookup: A GPU-based Approach
A Novel Caching Scheme for the Backbone of Named Data Networking
EMC: The Effective Multi-Path Caching Scheme for Named Data Networking
LOOP: Layer-based Overlay and Optimized Polymerization for Multiple Virtual Tables
Improving the throughput and delay performance of network processors by applying push model
Scalable name lookup in NDN using effective name component encoding
Tracking millions of flows in high speed networks for application identification
Greedy name lookup for named data networking
NDNBench: A Benchmark for Named Data Networking Lookup
Effective Caching Schemes for Minimizing Inter-ISP Traffic in Named Data Networking
Parallel Name Lookup for Named Data Networking
A generic application-oriented networking (GAON) simulation framework for next-generation internet
StriD2FA: Scalable Regular Expression Matching for Deep Packet Inspection
NameFilter: Achieving fast name lookup with low memory cost via applying two-stage Bloom filters
Reducing power of traffic manager in routers via dynamic on/off-chip scheduling
Measurements on movie distribution behavior in peer-to-peer networks
ALFE: A Replacement Policy to Cache Elephant Flows in the Presence of Mice Flooding
Constructing Optimal Non-overlap Routing Tables
Popularity-driven coordinated caching in named data networking
Virtual Routing Tables Polymerization for Lookup and Update