224 search results - page 20 / 45 » Auctions with Severely Bounded Communication |
INFOCOM
1997
IEEE
15 years 2 months ago
1997
IEEE
Several types of network trafic have been shown to exhibit long-range dependence (LRD). In this work, we show that the busy period of an ATM system driven by a long-range dependen...
105
click to vote
INFOCOM
2012
IEEE
13 years 17 days ago
2012
IEEE
—This paper addresses the problem of sparse recovery with graph constraints in the sense that we can take additive measurements over nodes only if they induce a connected subgrap...
GLOBECOM
2007
IEEE
15 years 4 months ago
2007
IEEE
Abstract— Peer-to-Peer (P2P) systems provide decentralization, self-organization, scalability and failure-resilience, but suffer from high worst-case latencies. Researchers have ...
113
Voted
PODC
2011
ACM
14 years 29 days ago
2011
ACM
We study several variants of coordinated consensus in dynamic networks. We assume a synchronous model, where the communication graph for each round is chosen by a worst-case adver...
INFOCOM
2005
IEEE
15 years 3 months ago
2005
IEEE
— To proactively defend against intruders from readily jeopardizing single-path data sessions, we propose a distributed secure multipath solution to route data across multiple pa...