Sciweavers

705 search results - page 86 / 141
» Designing a Common Communication Subsystem
Sort
View
SIGCOMM
2006
ACM
15 years 5 months ago
Policy-based routing with non-strict preferences
Traditional studies of routing problems often assumed strict preferences on paths, by eliminating ambiguity in path comparisons, or imposing a priori deterministic tie-breaking. S...
Chi-kin Chau
INFOCOM
2005
IEEE
15 years 5 months ago
Farsighted users harness network time-diversity
Abstract— Fluctuations in network conditions are a common phenomenon. They arise in the current wired Internet due to changes in demand, and in wireless networks due to changing ...
Peter B. Key, Laurent Massoulié, Milan Vojn...
INFOCOM
2005
IEEE
15 years 5 months ago
Capturing accurate snapshots of the Gnutella network
— A common approach for measurement-based characterization of peer-to-peer (P2P) systems is to capture overlay snapshots using a crawler. The accuracy of captured snapshots by P2...
Daniel Stutzbach, Reza Rejaie
IPSN
2005
Springer
15 years 4 months ago
The particle computer system
Abstract—This paper presents a sensor-based, networked embedded system, referred to as the Particle computer system. It is comprised of tiny wireless sensor nodes, capable of com...
Christian Decker, Albert Krohn, Michael Beigl, Tob...
CCS
2004
ACM
15 years 4 months ago
Mitigating bandwidth-exhaustion attacks using congestion puzzles
d Abstract) XiaoFeng Wang∗ Michael K. Reiter† We present congestion puzzles (CP), a new countermeasure to bandwidth-exhaustion attacks. Like other defenses based on client puz...
XiaoFeng Wang, Michael K. Reiter