Sciweavers

3116 search results - page 500 / 624
» Design and implementation of network puzzles
Sort
View
DSN
2011
IEEE
14 years 6 months ago
High performance state-machine replication
Computer systems are usually made fault tolerant through replication. By replicating a service on multiple servers we make sure that if some replicas fail, the service can still b...
Parisa Jalili Marandi, Marco Primi, Fernando Pedon...
ICDE
2012
IEEE
277views Database» more  ICDE 2012»
13 years 8 months ago
Lookup Tables: Fine-Grained Partitioning for Distributed Databases
—The standard way to scale a distributed OLTP DBMS is to horizontally partition data across several nodes. Ideally, this results in each query/transaction being executed at just ...
Aubrey Tatarowicz, Carlo Curino, Evan P. C. Jones,...
MOBISYS
2008
ACM
16 years 5 months ago
Efficient channel-aware rate adaptation in dynamic environments
Increasingly, 802.11 devices are being used by mobile users. This results in very dynamic wireless channels that are difficult to use efficiently. Current rate selection algorithm...
Glenn Judd, Xiaohui Wang, Peter Steenkiste
MOBISYS
2007
ACM
16 years 5 months ago
Real-time deployment of multihop relays for range extension
When the range of single-hop wireless communication is limited by distance or harsh radio propagation conditions, relays can be used to extend the communication range through mult...
Michael R. Souryal, Johannes Geissbuehler, Leonard...
ISCA
2005
IEEE
134views Hardware» more  ISCA 2005»
15 years 12 months ago
A High Throughput String Matching Architecture for Intrusion Detection and Prevention
Network Intrusion Detection and Prevention Systems have emerged as one of the most effective ways of providing security to those connected to the network, and at the heart of alm...
Lin Tan, Timothy Sherwood