Sciweavers

945 search results - page 183 / 189
» Resilient and survivable networks
Sort
View
SODA
2012
ACM
203views Algorithms» more  SODA 2012»
13 years 8 months ago
Black-box reductions for cost-sharing mechanism design
We consider the design of strategyproof cost-sharing mechanisms. We give two simple, but extremely versatile, black-box reductions, that in combination reduce the cost-sharing mec...
Konstantinos Georgiou, Chaitanya Swamy
INFOCOM
2009
IEEE
16 years 21 days ago
Rateless Coding with Feedback
The erasure resilience of rateless codes, such as Luby-Transform (LT) codes, makes them particularly suitable to a wide variety of loss-prone wireless and sensor network applicati...
Andrew Hagedorn, Sachin Agarwal, David Starobinski...
MIDDLEWARE
2009
Springer
16 years 18 days ago
Heterogeneous Gossip
Abstract. Gossip-based information dissemination protocols are considered easy to deploy, scalable and resilient to network dynamics. Loadbalancing is inherent in these protocols a...
Davide Frey, Rachid Guerraoui, Anne-Marie Kermarre...
RAID
2009
Springer
16 years 17 days ago
PE-Miner: Mining Structural Information to Detect Malicious Executables in Realtime
In this paper, we present an accurate and realtime PE-Miner framework that automatically extracts distinguishing features from portable executables (PE) to detect zero-day (i.e. pr...
M. Zubair Shafiq, S. Momina Tabish, Fauzan Mirza, ...
INFOCOM
2008
IEEE
16 years 13 days ago
Link Lifetimes and Randomized Neighbor Selection in DHTs
—Several models of user churn, resilience, and link lifetime have recently appeared in the literature [12], [13], [34], [35]; however, these results do not directly apply to clas...
Zhongmei Yao, Dmitri Loguinov