Sciweavers

376 search results - page 25 / 76
» Hardware-Assisted Fast Routing
Sort
View
INFOCOM
2000
IEEE
14 years 2 months ago
Near Optimal Routing Lookups with Bounded Worst Case Performance
Abstract—The problem of route address lookup has received much attention recently and several algorithms and data structures for performing address lookups at high speeds have be...
Pankaj Gupta, Balaji Prabhakar, Stephen P. Boyd
INFOCOM
1999
IEEE
14 years 1 months ago
High Performance IP Routing Table Lookup using CPU Caching
Wire-speed IP (Internet Protocol) routers require very fast routing table lookup for incoming IP packets. The routing table lookup operation is time consuming because the part of ...
Tzi-cker Chiueh, Prashant Pradhan
MAM
2006
95views more  MAM 2006»
13 years 9 months ago
Stochastic spatial routing for reconfigurable networks
FPGA placement and routing is time consuming, often serving as the major obstacle inhibiting a fast edit-compile-test loop in prototyping and development and the major obstacle pr...
André DeHon, Randy Huang, John Wawrzynek
MOBIHOC
2002
ACM
14 years 9 months ago
Path set selection in mobile ad hoc networks
Topological changes in mobile ad hoc networks frequently render routing paths unusable. Such recurrent path failures have detrimental effects on the network ability to support QoS...
Emin Gün Sirer, Panagiotis Papadimitratos, Zy...
CN
2004
148views more  CN 2004»
13 years 9 months ago
Multiway range trees: scalable IP lookup with fast updates
In this paper, we introduce a new IP lookup scheme with worst-case search and update time of O(log n), where n is the number of prefixes in the forwarding table. Our scheme is base...
Priyank Ramesh Warkhede, Subhash Suri, George Varg...