Sciweavers

41 search results - page 2 / 9
» Improved Table Lookup Algorithms for Postscaled Division
Sort
View
WEA
2007
Springer
97views Algorithms» more  WEA 2007»
14 years 4 days ago
Experimental Evaluations of Algorithms for IP Table Minimization
Abstract. The continuous growth of the routing tables sizes in backbone routers is one of the most compelling scaling problems affecting the Internet and has originated considerab...
Angelo Fanelli, Michele Flammini, Domenico Mango, ...
AINA
2008
IEEE
14 years 16 days ago
Ternary CAM Compaction for IP Address Lookup
Motivated by the high cost problem of ternary CAM, we proposed a new technique for providing a compaction routing table. With the comparisons with existing algorithms, our new tec...
Yi-Ting Fang, Tzung-Chian Huang, Pi-Chung Wang
TIFS
2008
109views more  TIFS 2008»
13 years 6 months ago
Lookup-Table-Based Secure Client-Side Embedding for Spread-Spectrum Watermarks
Today, mass-scale electronic content distribution systems embed forensic tracking watermarks primarily at the distribution server. For limiting the bandwidth usage and server compl...
Mehmet Utku Celik, Aweke N. Lemma, Stefan Katzenbe...
ICDCS
2006
IEEE
14 years 3 days ago
Elastic Routing Table with Provable Performance for Congestion Control in DHT Networks
Distributed hash table (DHT) networks based on consistent hashing functions have an inherent load balancing problem. The problem becomes more severe due to the heterogeneity of ne...
Haiying Shen, Cheng-Zhong Xu
IPTPS
2003
Springer
13 years 11 months ago
A Simple Fault Tolerant Distributed Hash Table
We introduce a distributed hash table (DHT) with logarithmic degree and logarithmic dilation. We show two lookup algorithms. The first has a message complexity of log n and is ro...
Moni Naor, Udi Wieder