Sciweavers

Share
ICPP
2009
IEEE
9 years 3 days ago
Mediacoop: Hierarchical Lookup for P2P-VoD Services
The random seeking in P2P-VoD system requires efficient lookup for "good" suppliers. The main challenge is that good suppliers should meet two requirements: "conten...
Tieying Zhang, Jianming Lv, Xueqi Cheng
ANCS
2009
ACM
9 years 6 days ago
Divide and discriminate: algorithm for deterministic and fast hash lookups
Exact and approximate membership lookups are among the most widely used primitives in a number of network applications. Hash tables are commonly used to implement these primitive ...
Domenico Ficara, Stefano Giordano, Sailesh Kumar, ...
INFOCOM
2010
IEEE
9 years 8 days ago
FlashTrie: Hash-based Prefix-Compressed Trie for IP Route Lookup Beyond 100Gbps
It is becoming apparent that the next generation IP route lookup architecture needs to achieve speeds of 100Gbps and beyond while supporting both IPv4 and IPv6 with fast real-time ...
Masanori Bando, H. Jonathan Chao
COMCOM
2002
82views more  COMCOM 2002»
9 years 2 months ago
High-performance IP routing table lookup
Nowadays, the commonly used table lookup scheme for IP routing is based on the so-called classless interdomain routing (CIDR). With CIDR, routers must
Pi-Chung Wang, Chia-Tai Chan, Yaw-Chung Chen
CN
2004
148views more  CN 2004»
9 years 2 months ago
Multiway range trees: scalable IP lookup with fast updates
In this paper, we introduce a new IP lookup scheme with worst-case search and update time of O(log n), where n is the number of prefixes in the forwarding table. Our scheme is base...
Priyank Ramesh Warkhede, Subhash Suri, George Varg...
JNW
2007
75views more  JNW 2007»
9 years 2 months ago
Improving and Analyzing LC-Trie Performance for IP-Address Lookup
— IP-address lookup is a key processing function of Internet routers. The lookup is challenging because it needs to perform a longest prefix match. In this paper, we present our...
Jing Fu, Olof Hagsand, Gunnar Karlsson
PE
2006
Springer
127views Optimization» more  PE 2006»
9 years 2 months ago
Cycloid: A constant-degree and lookup-efficient P2P overlay network
There are many structured P2P systems that use DHT technologies to map data items onto the nodes in various ways for scalable routing and location. Most of the systems require O(lo...
Haiying Shen, Cheng-Zhong Xu, Guihai Chen
COMCOM
2006
98views more  COMCOM 2006»
9 years 2 months ago
High-speed IP address lookup using balanced multi-way trees
Rapid growth of the Internet traffic requires more bandwidth and high-speed packet processing in the Internet routers. As one of the major packet processing performed in routers, ...
Hyesook Lim, Wonjung Kim, Bomi Lee, Changhoon Yim
SIGCOMM
2010
ACM
9 years 2 months ago
Achieving O(1) IP lookup on GPU-based software routers
IP address lookup is a challenging problem due to the increasing routing table size, and higher line rate. This paper investigates a new way to build an efficient IP lookup scheme...
Jin Zhao, Xinya Zhang, Xin Wang, Xiangyang Xue
CCS
2010
ACM
9 years 2 months ago
In search of an anonymous and secure lookup: attacks on structured peer-to-peer anonymous communication systems
The ability to locate random relays is a key challenge for peer-to-peer (P2P) anonymous communication systems. Earlier attempts like Salsa and AP3 used distributed hash table look...
Qiyan Wang, Prateek Mittal, Nikita Borisov
books