Sciweavers

275 search results - page 49 / 55
» The Polling Primitive for Computer Networks
Sort
View
SIGCOMM
2009
ACM
15 years 3 months ago
Every microsecond counts: tracking fine-grain latencies with a lossy difference aggregator
Many network applications have stringent end-to-end latency requirements, including VoIP and interactive video conferencing, automated trading, and high-performance computing—wh...
Ramana Rao Kompella, Kirill Levchenko, Alex C. Sno...
PODC
2009
ACM
15 years 10 months ago
Fast distributed random walks
Performing random walks in networks is a fundamental primitive that has found applications in many areas of computer science, including distributed computing. In this paper, we fo...
Atish Das Sarma, Danupon Nanongkai, Gopal Panduran...
MOBISYS
2005
ACM
15 years 9 months ago
A dynamic operating system for sensor nodes
Sensor network nodes exhibit characteristics of both embedded systems and general-purpose systems. They must use little energy and be robust to environmental conditions, while als...
Chih-Chieh Han, Ram Kumar, Roy Shea, Eddie Kohler,...
IMC
2006
ACM
15 years 3 months ago
Approximate fingerprinting to accelerate pattern matching
Pattern matching and analysis over network data streams is increasingly becoming an essential primitive of network monitoring systems. It is a fundamental part of most intrusion d...
Ramaswamy Ramaswamy, Lukas Kencl, Gianluca Iannacc...
MOBISYS
2009
ACM
15 years 10 months ago
SPATE: small-group PKI-less authenticated trust establishment
Establishing trust between a group of individuals remains a difficult problem. Prior works assume trusted infrastructure, require an individual to trust unknown entities, or provi...
Yue-Hsun Lin, Ahren Studer, Hsu-Chun Hsiao, Jonath...