Sciweavers

625 search results - page 25 / 125
» Routing in Trees
Sort
View
GLVLSI
2003
IEEE
135views VLSI» more  GLVLSI 2003»
15 years 3 months ago
Constructing exact octagonal steiner minimal trees
Octagonal Steiner Minimal Trees (OSMTs) are used in the global routing phase of pervasive octagonal VLSI layout. The OSMT problem seeks a minimal length spanning structure using e...
Chris Coulston
CORR
2007
Springer
132views Education» more  CORR 2007»
14 years 10 months ago
On Compact Routing for the Internet
The Internet’s routing system is facing stresses due to its poor fundamental scaling properties. Compact routing is a research field that studies fundamental limits of routing ...
Dmitri V. Krioukov, Kimberly C. Claffy, Kevin R. F...
GLOBECOM
2007
IEEE
15 years 4 months ago
Power Efficient IP Lookup with Supernode Caching
— In this paper, we propose a novel supernode caching scheme to reduce IP lookup latencies and energy consumption in network processors. In stead of using an expensive TCAM based...
Lu Peng, Wencheng Lu, Lide Duan
TCAD
2008
100views more  TCAD 2008»
14 years 9 months ago
Robust Clock Tree Routing in the Presence of Process Variations
Abstract--Advances in very large-scale integration technology make clock skew more susceptible to process variations. Notwithstanding efficient exact zero-skew algorithms, clock sk...
Uday Padmanabhan, Janet Meiling Wang, Jiang Hu
SIGMOD
2006
ACM
113views Database» more  SIGMOD 2006»
15 years 10 months ago
XPORT: extensible profile-driven overlay routing trees
XPORT is a profile-driven distributed data dissemination system that supports an extensible set of data types, profiles types, and optimization metrics. XPORT efficiently implemen...
Olga Papaemmanouil, Yanif Ahmad, Ugur Çetin...