224 search results - page 20 / 45 » Auctions with Severely Bounded Communication |
INFOCOM
1997
IEEE
13 years 11 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...
INFOCOM
2012
IEEE
11 years 9 months 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
14 years 1 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 ...
PODC
2011
ACM
12 years 10 months 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
14 years 1 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...