Sciweavers

165 search results - page 28 / 33
» Fast Routing Table Lookup Using CAMs
Sort
View
76
Voted
GC
2004
Springer
15 years 3 months ago
Verifying a Structured Peer-to-Peer Overlay Network: The Static Case
Abstract. Structured peer-to-peer overlay networks are a class of algorithms that provide efficient message routing for distributed applications using a sparsely connected communic...
Johannes Borgström, Uwe Nestmann, Luc Onana A...
GLVLSI
2009
IEEE
128views VLSI» more  GLVLSI 2009»
15 years 2 months ago
Impact of lithography-friendly circuit layout
Current lithography techniques use a light wavelength of 193nm to print sub-65nm features. This introduces process variations which cause mismatches between desired and actual waf...
Pratik J. Shah, Jiang Hu
100
Voted
ISCAPDCS
2003
14 years 11 months ago
Design and Analysis of Improved Shortest Path Tree Update for Network Routing
The quick construction of the Shortest Path Tree (SPT) is essential to achieve fast routing speed for an interior network using link state protocols, such as OSPF and IS-IS. Whene...
Bin Xiao, Qingfeng Zhuge, Zili Shao, Edwin Hsing-M...
90
Voted
GLOBECOM
2008
IEEE
14 years 11 months ago
Blooming Trees for Minimal Perfect Hashing
Abstract—Hash tables are used in many networking applications, such as lookup and packet classification. But the issue of collisions resolution makes their use slow and not suit...
Gianni Antichi, Domenico Ficara, Stefano Giordano,...
TVCG
2008
144views more  TVCG 2008»
14 years 10 months ago
Spherical Piecewise Constant Basis Functions for All-Frequency Precomputed Radiance Transfer
This paper presents a novel basis function, called spherical piecewise constant basis function (SPCBF), for precomputed radiance transfer. SPCBFs have several desirable properties:...
Kun Xu, Yun-Tao Jia, Hongbo Fu, Shi-Min Hu, Chiew-...