Sciweavers

363 search results - page 2 / 73
» Experimental Evaluations of Algorithms for IP Table Minimiza...
Sort
View
TCAD
2008
119views more  TCAD 2008»
13 years 5 months ago
FLUTE: Fast Lookup Table Based Rectilinear Steiner Minimal Tree Algorithm for VLSI Design
Abstract-- In this paper, we present a very fast and accurate rectilinear Steiner minimal tree (RSMT) algorithm called FLUTE. FLUTE is based on pre-computed lookup table to make RS...
Chris C. N. Chu, Yiu-Chung Wong
ICC
2009
IEEE
109views Communications» more  ICC 2009»
13 years 3 months ago
Loop-Free Forwarding Table Updates with Minimal Link Overflow
The forwarding paths in an IP network may change due to a link failure, network equipment maintenance, or reconfiguration of link weights. The forwarding tables in the routers need...
Lei Shi, Jing Fu, Xiaoming Fu
ICNP
2005
IEEE
13 years 11 months ago
Shape Shifting Tries for Faster IP Route Lookup
Some of the fastest practical algorithms for IP route lookup are based on space-efficient encodings of multi-bit tries [1, 2]. Unfortunately, the time required by these algorithm...
Haoyu Song, Jonathan S. Turner, John W. Lockwood
EDBT
2010
ACM
155views Database» more  EDBT 2010»
13 years 11 months ago
Reducing metadata complexity for faster table summarization
Since the visualization real estate puts stringent constraints on how much data can be presented to the users at once, table summarization is an essential tool in helping users qu...
K. Selçuk Candan, Mario Cataldi, Maria Luis...
TON
2002
83views more  TON 2002»
13 years 4 months ago
MLSR: a novel routing algorithm for multilayered satellite IP networks
Several IP-based routing algorithms have been developed for low-Earth orbit (LEO) satellite networks in recent years. The performance of the satellite IP networks can be improved d...
Ian F. Akyildiz, Eylem Ekici, Michael D. Bender