Sciweavers

655 search results - page 87 / 131
» Fundamental bounds on the accuracy of network performance me...
Sort
View
SIGMETRICS
2011
ACM
229views Hardware» more  SIGMETRICS 2011»
12 years 11 months ago
Model-driven optimization of opportunistic routing
Opportunistic routing aims to improve wireless performance by exploiting communication opportunities arising by chance. A key challenge in opportunistic routing is how to achieve ...
Eric Rozner, Mi Kyung Han, Lili Qiu, Yin Zhang
CONEXT
2009
ACM
13 years 10 months ago
FairTorrent: bringing fairness to peer-to-peer systems
Peer-to-Peer file-sharing applications suffer from a fundamental problem of unfairness. Free-riders cause slower download times for others by contributing little or no upload band...
Alex Sherman, Jason Nieh, Clifford Stein
TWC
2008
80views more  TWC 2008»
13 years 8 months ago
Robust connectivity-aware energy-efficient routing for wireless sensor networks
In this paper, we consider a class of energy-aware routing algorithm that explicitly takes into account the connectivity of the remaining sensor network. In typical sensor network ...
Charles Pandana, K. J. Ray Liu
IMC
2010
ACM
13 years 6 months ago
Comparing DNS resolvers in the wild
The Domain Name System (DNS) is a fundamental building block of the Internet. Today, the performance of more and more applications depend not only on the responsiveness of DNS, bu...
Bernhard Ager, Wolfgang Mühlbauer, Georgios S...
PODC
2009
ACM
14 years 9 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...