414 search results - page 31 / 83 » Minimizing Routing State for Light-Weight Network Simulation |
113
click to vote
ISCA
2005
IEEE
15 years 5 months ago
2005
IEEE
Minimizing latency and maximizing throughput are important goals in the design of routing algorithms for interconnection networks. Ideally, we would like a routing algorithm to (a...
DCOSS
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. Two difficulties in designing data-centric routes [2–5] in wireless sensor networks are the lack of reasonably practical data aggregation models and the high computatio...
NSDI
2004
15 years 1 months ago
2004
Most current peer-to-peer lookup schemes keep a small amount of routing state per node, typically logarithmic in the number of overlay nodes. This design assumes that routing info...
101
click to vote
DSN
2004
IEEE
15 years 3 months ago
2004
IEEE
This paper presents a scalable mechanism, Fast Routing Table Recovery (FRTR), for detecting and correcting route inconsistencies between neighboring BGP routers. The large size of...
WSC
2004
15 years 1 months ago
2004
Supervisory Control And Data Acquisition (SCADA) systems gather and analyze data for real-time control. SCADA systems are used extensively, in applications such as electrical powe...