625 search results - page 35 / 125 » Semi-preemptive routing on trees |
DAC
1993
ACM
13 years 11 months ago
1993
ACM
We present an efficient and effective method for the detailed routing of symmetrical or sea-of-gates FPGA architectures. Instead of breaking the problem into 2-terminal net collec...
CNSR
2010
IEEE
13 years 11 months ago
2010
IEEE
—MANET routing protocols are designed to scale up to thousands of routers with frequent changes of the topology. In preference, MANET routing protocols should also support constr...
DAC
2006
ACM
14 years 8 months ago
2006
ACM
Traditionally, rectilinear Steiner minimum trees (RSMT) are widely used for routing estimation in design optimizations like floorplanning and physical synthesis. Since it optimize...
SENSYS
2009
ACM
14 years 2 months ago
2009
ACM
This paper presents and evaluates two principles for wireless routing protocols. The first is datapath validation: data traffic quickly discovers and fixes routing inconsistenc...
LCN
2006
IEEE
14 years 1 months ago
2006
IEEE
Today’s intra-domain protocols are limited in their scalability. We examine these limitations and propose an alternative in the form of an IGP based on path vectors. Taking adva...