Sciweavers

569 search results - page 67 / 114
» Evaluating Cluster-based Network Servers
Sort
View
BROADNETS
2006
IEEE
14 years 4 months ago
Distributed Job Scheduling based on Multiple Constraints Anycast Routing
— As the popularity of resource-constrained devices such as hand-held computers increases, a new network service offloading complex processing tasks towards computational resour...
Tim Stevens, Marc De Leenheer, Filip De Turck, Bar...
SIGCOMM
2010
ACM
13 years 10 months ago
Symbiotic routing in future data centers
Building distributed applications for data centers is hard. CamCube explores whether replacing the traditional switchbased network with a directly connected topology makes it easi...
Hussam Abu-Libdeh, Paolo Costa, Antony I. T. Rowst...
WWW
2004
ACM
14 years 10 months ago
A method for transparent admission control and request scheduling in e-commerce web sites
This paper presents a method for admission control and request scheduling for multiply-tiered e-commerce Web sites, achieving both stable behavior during overload and improved res...
Sameh Elnikety, Erich M. Nahum, John M. Tracey, Wi...
CCS
2008
ACM
13 years 12 months ago
Authenticated hash tables
Hash tables are fundamental data structures that optimally answer membership queries. Suppose a client stores n elements in a hash table that is outsourced at a remote server so t...
Charalampos Papamanthou, Roberto Tamassia, Nikos T...
PEWASUN
2007
ACM
13 years 11 months ago
Worst-case lifetime computation of a wireless sensor network by model-checking
Wireless Sensor Network (WSN) technology is now mature enough to be used in numerous application domains. However, due to the restricted amount of energy usually allocated to each...
Laurent Mounier, Ludovic Samper, Wassim Znaidi