Parallel and Distributed Processing Symposium, International (2010)
Atlanta, GA, USA
Apr. 19, 2010 to Apr. 23, 2010
Bo Wu , Department of Computer Science, University of New Mexico, Albuquerque, NM 87131-1386, USA
Jared Saia , Department of Computer Science, University of New Mexico, Albuquerque, NM 87131-1386, USA
Valerie King , Department of Computer Science, University of Victoria, Victoria, BC, Canada V8W 3P6
We present collaborative peer-to-peer algorithms for the problem of approximating frequency counts for popular items distributed across the peers of a large-scale network. Our algorithms are attack-resistant in the sense that they function correctly even in the case where an adaptive and computationally unbounded adversary causes up to a 1/3 fraction of the peers in the network to suffer Byzantine faults. Our algorithms are scalable in the sense that all resource costs are polylogarithmic. Specifically, latency is O(log n); the number of messages and number of bits sent and received by each peer is O(log
V. King, B. Wu and J. Saia, "Attack-resistant frequency counting," 2010 IEEE International Symposium on Parallel & Distributed Processing (IPDPS), Atlanta, GA, 2010, pp. 1-10.