Sciweavers

3116 search results - page 518 / 624
» Design and implementation of network puzzles
Sort
View
CMS
2006
15 years 5 months ago
TAO: Protecting Against Hitlist Worms Using Transparent Address Obfuscation
Abstract. Sophisticated worms that use precomputed hitlists of vulnerable targets are especially hard to contain, since they are harder to detect, and spread at rates where even au...
Spyros Antonatos, Kostas G. Anagnostakis
CN
2008
100views more  CN 2008»
15 years 4 months ago
Building resilient low-diameter peer-to-peer topologies
As more applications rely on underlying peer-to-peer topologies, the need for efficient and resilient infrastructure has become more pressing. A number of important classes of top...
Rita H. Wouhaybi, Andrew T. Campbell
INFOCOM
2011
IEEE
14 years 7 months ago
Experimental evaluation of optimal CSMA
Abstract—By ‘optimal CSMA’ we denote a promising approach to maximize throughput-based utility in wireless networks without message passing or synchronization among nodes. De...
Bruno Nardelli, Jinsung Lee, Kangwook Lee, Yung Yi...
INFOCOM
2007
IEEE
15 years 10 months ago
Iterative Scheduling Algorithms
— The input-queued switch architecture is widely used in Internet routers due to its ability to run at very high line speeds. A central problem in designing an input-queued switc...
Mohsen Bayati, Balaji Prabhakar, Devavrat Shah, Ma...
SAMOS
2004
Springer
15 years 9 months ago
Scalable Instruction-Level Parallelism.
This paper presents a model for instruction-level distributed computing that allows the implementation of scalable chip multiprocessors. Based on explicit microthreading it serves ...
Chris R. Jesshope