Sciweavers

376 search results - page 26 / 76
» Hardware-Assisted Fast Routing
Sort
View
IFIP
2007
Springer
14 years 3 months ago
A Novel Loop-Free IP Fast Reroute Algorithm
Although providing reliable network services is getting more and more important, currently used methods in IP networks are typically reactive and error correcting can take a long t...
Gábor Enyedi, Gábor Rétv&aacu...
AIPS
2008
14 years 5 hour ago
Fast Planning for Dynamic Preferences
We present an algorithm that quickly finds optimal plans for unforeseen agent preferences within graph-based planning domains where actions have deterministic outcomes and action ...
Brian Ziebart, Anind K. Dey, J. Andrew Bagnell
DEBS
2007
ACM
13 years 11 months ago
Chained forests for fast subsumption matching
Content delivery is becoming increasingly popular on the Internet. There are many ways to match content to subscribers. In this paper, we focus on subsumption-based matching. We p...
Sasu Tarkoma
FPGA
2008
ACM
168views FPGA» more  FPGA 2008»
13 years 10 months ago
Architectural improvements for field programmable counter arrays: enabling efficient synthesis of fast compressor trees on FPGAs
The Field Programmable Counter Array (FPCA) was introduced to improve FPGA performance for arithmetic circuits. An FPCA is a reconfigurable IP core that can be integrated into an ...
Alessandro Cevrero, Panagiotis Athanasopoulos, Had...
CONEXT
2008
ACM
13 years 11 months ago
Efficient IP-address lookup with a shared forwarding table for multiple virtual routers
Virtual routers are a promising way to provide network services such as customer-specific routing, policy-based routing, multi-topology routing, and network virtulization. However...
Jing Fu, Jennifer Rexford