skip to main content
research-article

Streaming Communication Protocols

Published:16 October 2018Publication History
Skip Abstract Section

Abstract

We define the Streaming Communication model that combines the main aspects of communication complexity and streaming. Input arrives as a stream, spread between several agents across a network. Each agent has a bounded memory, which can be updated upon receiving a new bit, or a message from another agent. We provide tight tradeoffs between the necessary resources, i.e., communication between agents and memory, for some of the canonical problems from communication complexity by proving a strong general lower bound technique. Second, we analyze the Approximate Matching problem and show that the complexity of this problem (i.e., the achievable approximation ratio) in the one-way variant of our model is strictly different both from the streaming complexity and the one-way communication complexity thereof.

References

  1. Noga Alon, Yossi Matias, and Mario Szegedy. 1999. The space complexity of approximating the frequency moments. J. Comput. Syst. Sci. 58, 1 (1999), 137--147. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Sepehr Assadi, Sanjeev Khanna, Yang Li, and Grigory Yaroslavtsev. 2016. Maximum matchings in dynamic graph streams and the simultaneous communication model. In Proceedings of the 27th ACM-SIAM Symposium on Discrete Algorithms. 1345--1364. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. László Babai, Peter Frankl, and Janos Simon. 1986. Complexity classes in communication complexity theory. In Proceedings of the 27th IEEE Foundations of Computer Science. 337--347. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Ziv Bar-Yossef, T. S. Jayram, Ravi Kumar, and D. Sivakumar. 2004. An information statistics approach to data stream and communication complexity. J. Comput. System Sci. 68, 4 (2004), 702--732. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Paul Beame, Martin Tompa, and Peiyuan Yan. 1990. Communication-space tradeoffs for unrestricted protocols. In Proceedings of 31st Foundations of Computer Science. 420--428. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Therese C. Biedl, Erik D. Demaine, Christian A. Duncan, Rudolf Fleischer, and Stephen G. Kobourov. 2004. Tight bounds on maximal and maximum matchings. Discrete Math. 285, 1--3 (2004), 7--15.Google ScholarGoogle ScholarCross RefCross Ref
  7. Joshua E. Brody, Shiteng Chen, Periklis A. Papakonstantinou, Hao Song, and Xiaoming Sun. 2013. Space-bounded communication complexity. In Proceedings of the 4th Innovations in Theoretical Computer Science. 159--172. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Ho-Leung Chan, Tak-Wah Lam, Lap-Kei Lee, and Hing-Fung Ting. 2011. Continuous monitoring of distributed data streams over a time-based sliding window. Algorithmica 62, 3 (2011), 1088--1111. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Jiecao Chen and Qin Zhang. 2017. Improved algorithms for distributed entropy monitoring. Algorithmica 78, 3 (2017), 1041--1066. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Graham Cormode and Minos N. Garofalakis. 2005. Sketching streams through the net: Distributed approximate query tracking. In Proceedings of the International Conference on Very Large Data Bases. 13--24. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Graham Cormode, Minos N. Garofalakis, S. Muthukrishnan, and Rajeev Rastogi. 2005. Holistic aggregates in a networked world: Distributed tracking of approximate quantiles. In Proceedings of the Special Interest Group on Management of Data. 25--36. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Graham Cormode, S. Muthukrishnan, and Ke Yi. 2008. Algorithms for distributed functional monitoring. In Proceedings of the 19th ACM-SIAM Symposium on Discrete Algorithms. 1076--1085. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Graham Cormode, S. Muthukrishnan, Ke Yi, and Qin Zhang. 2012. Continuous sampling from distributed streams. J. ACM 59, 2 (2012), 10:1--10:25. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Graham Cormode, S. Muthukrishnan, and Wei Zhuang. 2006. What’s different: Distributed, continuous monitoring of duplicate-resilient aggregates on data streams. In Proceedings of the 22nd International Conference on Data Engineering. 57. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Jon Feldman, S. Muthukrishnan, Anastasios Sidiropoulos, Clifford Stein, and Zoya Svitkina. 2006. On the complexity of processing massive, unordered, distributed data. CoRR abs/cs/0611108.Google ScholarGoogle Scholar
  16. Phillip B. Gibbons and Srikanta Tirthapura. 2001. Estimating simple functions on the union of data streams. In Proceedings of the 13th ACM Symposium on Parallel Algorithms and Architectures. 281--291. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Phillip B. Gibbons and Srikanta Tirthapura. 2002. Distributed streams algorithms for sliding windows. In Proceedings of the 14th ACM Symposium on Parallel Algorithms and Architectures. 63--72. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Ashish Goel, Michael Kapralov, and Sanjeev Khanna. 2012. On the communication and streaming complexity of maximum bipartite matching. In Proceedings of the 23rd ACM-SIAM Symposium on Discrete Algorithms. 468--485. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Zengfeng Huang, Ke Yi, and Qin Zhang. 2012. Randomized algorithms for tracking distributed count, frequencies, and ranks. In Proceedings of the 31st Symposium on Principles of Database Systems. 295--306. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. Russell Impagliazzo and Ryan Williams. 2010. Communication complexity with synchronized clocks. In Proceedings of the 25th IEEE Conference on Computational Complexity. 259--269. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Michael Kapralov. 2013. Better bounds for matchings in the streaming model. In Proceedings of the 24th ACM-SIAM Symposium on Discrete Algorithms. 1679--1697. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Michael Kapralov, Sanjeev Khanna, and Madhu Sudan. 2014. Approximating matching size from random streams. In Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms. 734--751. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Christian Konrad. 2015. Maximum matching in turnstile streams. In Proceedings of 23rd European Symposium on Algorithms. 840--852.Google ScholarGoogle ScholarCross RefCross Ref
  24. Eyal Kushilevitz and Noam Nisan. 1997. Communication Complexity. Cambridge University Press, New York, NY. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. Tak Wah Lam, Prasoon Tiwari, and Martin Tompa. 1992. Trade-offs between communication and space. J. Comput. System Sci. 45, 3 (1992), 296--315. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. Yi Li, Huy L. Nguyen, and David P. Woodruff. 2014. Turnstile streaming algorithms might as well be linear sketches. In Proceedings of the 46th ACM Symposium on Theory of Computing. 174--183. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. Zhenming Liu, Bozidar Radunovic, and Milan Vojnovic. 2012. Continuous distributed counting for non-monotonic streams. In Proceedings of the 31st ACM Symposium on Principles of Database Systems. 307--318. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. Frédéric Magniez, Claire Mathieu, and Ashwin Nayak. 2014. Recognizing well-parenthesized expressions in the streaming model. SIAM J. Comput. 43, 6 (2014), 1880--1905.Google ScholarGoogle ScholarCross RefCross Ref
  29. S. Muthukrishnan. 2005. Data streams: Algorithms and applications. Found. Trends Theoret. Comput. Sci. 2, 1 (2005), 117--236. Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. David P. Woodruff and Qin Zhang. 2012. Tight bounds for distributed functional monitoring. In Proceedings of the 44th ACM Symposium on Theory of Computing. 941--960. Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. Andrew Chi-Chih Yao. 1979. Some complexity questions related to distributive computing. In Proceedings of the 11th ACM Symposium on Theory of Computing. 209--213. Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. Ke Yi and Qin Zhang. 2013. Optimal tracking of distributed heavy hitters and quantiles. Algorithmica 65, 1 (2013), 206--223. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Streaming Communication Protocols

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in

      Full Access

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader
      About Cookies On This Site

      We use cookies to ensure that we give you the best experience on our website.

      Learn more

      Got it!