Sciweavers

92 search results - page 12 / 19
» Minimizing Expected Attacking Cost in Networks
Sort
View
SPAA
2004
ACM
14 years 1 months ago
Fighting against two adversaries: page migration in dynamic networks
Page migration is one of the fundamental subproblems in the framework of data management in networks. It occurs in a distributed network of processors sharing one indivisible memo...
Marcin Bienkowski, Miroslaw Korzeniowski, Friedhel...
CCS
2005
ACM
14 years 1 months ago
On the cost-ineffectiveness of redundancy in commercial P2P computing
We present a game-theoretic model of the interactions between server and clients in a constrained family of commercial P2P computations (where clients are financially compensated...
Matthew Yurkewych, Brian Neil Levine, Arnold L. Ro...
MOBIHOC
2009
ACM
14 years 8 months ago
Optimal monitoring in multi-channel multi-radio wireless mesh networks
Wireless mesh networks (WMN) are finding increasing usage in city-wide deployments for providing network connectivity. Mesh routers in WMNs typically use multiple wireless channel...
Dong-Hoon Shin, Saurabh Bagchi
NETWORKING
2004
13 years 9 months ago
Bounds on Benefits and Harms of Adding Connections to Noncooperative Networks
Abstract. In computer networks (and, say, transportation networks), we can consider the situation where each user has its own routing decision so as to minimize noncooperatively th...
Hisao Kameda
NDSS
2006
IEEE
14 years 1 months ago
Induced Churn as Shelter from Routing-Table Poisoning
Structured overlays are an important and powerful class of overlay networks that has emerged in recent years. They are typically targeted at peer-to-peer deployments involving mil...
Tyson Condie, Varun Kacholia, Sriram Sank, Joseph ...