Computing frequent elements using gossip

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5058 LNCS, Issue , 2008, Pages 119-130

  Lahiri, Bibudh ^a   Tirthapura, Srikanta ^a  

^a IOWA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CHLORINE COMPOUNDS; PROBABILITY;

CENTRAL CONTROL; COMMUNICATION COMPLEXITIES; DATA DISSEMINATION; DISTRIBUTED DATA; HIGH PROBABILITY; NETWORK STRUCTURES; PROBABILISTIC GUARANTEES; SPANNING TREES; STRUCTURAL INFORMATIONS;

WIRELESS SENSOR NETWORKS;

EID: 48249128328     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-69355-0_11     Document Type: Conference Paper

References (16)

1. Demers, A.J., Greene, D.H., Hauser, C., Irish, W., Larson, J., Shenker, S., Sturgis, H.E., Swinehart, D.C., Terry, D.B.: Epidemic algorithms for replicated database maintenance. In: Proceedings of the Principles of Distibuted Computing (PODC), pp. 1-12 (1987)
2. Lahiri, B., Tirthapura, S.: Computing frequent elements using gossip. Technical report, Dept. of Electrical and Computer Engineering, Iowa State University (April 2008), http://archives.ece.iastate.edu/archive/00000415/01/ gossip.pdf
3. Kempe, D., Dobra, A., Gehrke, J.: Gossip-based computation of aggregate information. In: Proceedings of the 44th Symposium on Foundations of Computer Science (FOCS), pp. 482-491 (2003)
4. Boyd, S.P., Ghosh, A., Prabhakar, B., Shah, D.: Gossip algorithms: design, analysis and applications. In: Proceedings of the IEEE Conference on Computer Communications (INFOCOM), pp. 1653-1664 (2005)
5. Boyd, S.P., Ghosh, A., Prabhakar, B., Shah, D.: Randomized gossip algorithms. IEEE Transactions on Information Theory 52(6), 2508-2530 (2006)
6. Mosk-Aoyama, D., Shah, D.: Computing separable functions via gossip. In: Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 113-122 (2006)
7. Misra, J., Gries, D.: Finding repeated elements. Science of Computer Programming 2(2), 143-152 (1982)
8. Manku, G.S., Motwani, R.: Approximate frequency counts over data streams. In: Proceedings of 28th International Conference on Very Large Data Bases (VLDB), pp. 346-357 (2002)
9. Karp, R.M., Shenker, S., Papadimitriou, C.H.: A simple algorithm for finding frequent elements in streams and bags. ACM Trans. Database Syst. 28, 51-55 (2003)
10. Cao, P., Wang, Z.: Efficient top-k query calculation in distributed networks. In: Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 206-215 (2004)
11. Zhao, Q., Ogihara, M., Wang, H., Xu, J.: Finding global icebergs over distributed data sets. In: Proceedings of the Twenty-Fifth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS), pp. 298-307 (2006)
12. Manjhi, A., Shkapenyuk, V., Dhamdhere, K., Olston, C.: Finding (recently) frequent items in distributed data streams. In: Proceedings of the 21st International Conference on Data Engineering (ICDE), pp. 767-778 (2005)
13. Keralapura, R., Cormode, G., Ramamirtham, J.: Communication-efficient distributed monitoring of thresholded counts. In: Proceedings of the ACM SIGMOD International Conference on Management of Data (SIGMOD), pp. 289-300 (2006)
14. Gkantsidis, C., Mihail, M., Saberi, A.: Random walks in peer-to-peer networks. In: Proceedings of the 23rd Conference of the IEEE Communications Society (INFO-COM) (2004)
15. Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge (1995)
16. Broder, A.Z., Charikar, M., Frieze, A.M., Mitzenmacher, M.: Min-wise independent permutations (extended abstract). In: Proceedings of the ACM Symposium on Theory of Computing (STOC), pp. 327-336 (1998)