Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

Lower bounds for in-network computation of arbitrary functions

  • Published:
Distributed Computing Aims and scope Submit manuscript

Abstract

In this paper, we provide a family of bounds for the rate at which the functions of many inputs can be computed in-network on general topologies. Going beyond simple symmetric functions where the output is invariant to the permutation of the operands, e.g., average, parity, we describe an algorithm that is analyzed to provide throughput bounds (both lower and upper) for the general functions. In particular, we analyze our algorithm when the function to be computed is given as a binary tree schema. Our lower bounds depend on schema parameters like the number of operands and graph parameters like the second largest eigenvalue of the transition matrix of simple random walk on network graph, the maximum and minimum degree of any node in the network. The lower bounding technique that we have used is based on the network flows and can capture general multi-commodity flow settings. Our proposed algorithm uses the well-known simple random walk on a network as its basic primitive for routing. We show that the lower bound obtained on the rate of computation is tight for the complete network topology, the hypercube and the star topology. We also present an upper bound on the expected latency of any data operand in terms of the height of schema, well-studied random walk parameter like the hitting time, and the relative distance from the critical data rate. For the computation time of symmetric functions on the random geometric graph under the gossip model, our approach achieves an order-optimal \(\widetilde{O}(n)\) time despite enforcing a binary tree schema for function computation. In general, Big-O notation represents an upper bound and \(\widetilde{O}\) hides \(\text {poly}\log n\) factors.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2

Similar content being viewed by others

References

  1. Aldous, D., Fill, J.: Reversible markov chains and random walks on graphs (2002)

  2. Aqeel-ur, R., Abbasi, A.Z., Islam, N., Shaikh, Z.A.: A review of wireless sensors and networks’ applications in agriculture. Comp. Stand. Interfaces 36(2), 263–270 (2014)

    Article  Google Scholar 

  3. Ayaso, O., Shah, D., Dahleh, M.A.: Information theoretic bounds for distributed computation over networks of point-to-point channels. IEEE Trans. Inf. Theory 56(12), 6020–039 (2010)

    Article  MathSciNet  Google Scholar 

  4. Banerjee, S., Gupta, P., Shakkottai, S.: Towards a queueing-based framework for in-network function computation. Queueing Syst. 72(3), 219–250 (2012)

    Article  MathSciNet  Google Scholar 

  5. Becchetti, L., Bonifaci, V., Natale, E.: Pooling or sampling: Collective dynamics for electrical flow estimation. In: Proc. of the 17th International Conference on Autonomous Agents and Multi Agent Systems, AAMAS ’18, pp. 1576–1584 (2018)

  6. Bénézit, F., Dimakis, A.G., Thiran, P., Vetterli, M.: Order-optimal consensus through randomized path averaging. IEEE Trans. Inform Theory 56(10), 5150–5167 (2010)

    Article  MathSciNet  Google Scholar 

  7. Boyd, S., Ghosh, A., Prabhakar, B., Shah, D.: Gossip algorithms: design, analysis and applications. In: Proceedings of the 24th annual joint conference of the IEEE computer and communications societies, INFOCOM ’05, vol. 3, pp. 1653–1664. IEEE (2005)

  8. Christiano, P., Kelner, J.A., Madry, A., Spielman, D.A., Teng, S.H.: Electrical flows, Laplacian systems, and faster approximation of maximum flow in undirected graphs. In: Proceedings of the 43rd annual ACM Symposium on theory of computing, STOC ’11, pp. 273–282. ACM (2011)

  9. Dimakis, A.D.G., Sarwate, A.D., Wainwright, M.J.: Geographic gossip: efficient averaging for sensor networks. IEEE Trans. Signal Process. 56(3), 1205–1216 (2008)

    Article  MathSciNet  Google Scholar 

  10. Dutta, C., Radhakrishnan, J.: Lower bounds for noisy wireless networks using sampling algorithms. In: Proceedings of 49th annual IEEE symposium on foundations of computer science, FOCS ’08, pp. 394–402. IEEE (2008)

  11. Georgiadis, L., Szpankowski, W.: Stability of token passing rings. Queueing Syst. 11(1–2), 7–33 (1992)

    Article  MathSciNet  Google Scholar 

  12. Gillani, I.A., Bagchi, A.: A queueing network-based distributed Laplacian solver for directed graphs. Inf. Proc. Lett. (2021). https://doi.org/10.1016/j.ipl.2020.106040

    Article  MathSciNet  MATH  Google Scholar 

  13. Gillani, I.A., Bagchi, A., Ranu, S.: A group-to-group version of random walk betweenness centrality. In: Proceedings of 8th ACM IKDD CODS and 26th COMAD, CODS-COMAD ’21 (2021). https://doi.org/10.1145/3430984.3431020

  14. Gillani, I.A., Bagchi, A., Vyavahare, P.: Decentralized random walk-based data collection in networks (2017). ArXiv:1701.05296v4 [cs.NI]

  15. Gillani, I.A., Bagchi, A., Vyavahare, P.: A stochastic process on a network with connections to Laplacian systems of equations (2017). ArXiv:1701.05296 [cs.NI]

  16. Giridhar, A., Kumar, P.R.: Computing and communicating functions over sensor networks. IEEE J. Sel. Area. Comm. 23(4), 755–764 (2005)

    Article  Google Scholar 

  17. Gross, D.: Fundamentals of Queueing Theory. Wiley, New York (2008)

    Book  Google Scholar 

  18. Intanagonwiwat, C., Govindan, R., Estrin, D., Heidemann, J., Silva, F.: Directed diffusion for wireless sensor networking. IEEE/ACM Trans. Netw. 11(1), 2–16 (2003)

    Article  Google Scholar 

  19. Jawad, H., Nordin, R., Gharghan, S., Jawad, A., Ismail, M.: Energy-efficient wireless sensor networks for precision agriculture: a review. Sensors 17(8), 1781 (2017)

    Article  Google Scholar 

  20. Jones, N.M., Paschos, G.S., Shrader, B., Modiano, E.: An overlay architecture for throughput optimal multipath routing. IEEE/ACM Trans. Netw. 25(5), 2615–2628 (2017)

    Article  Google Scholar 

  21. Kamath, S., Manjunath, D., Mazumdar, R.: On distributed function computation in structure-free random wireless networks. IEEE Trans. on Inform. Theory 60(1), 432–442 (2014)

    Article  MathSciNet  Google Scholar 

  22. Kamra, A., Misra, V., Feldman, J., Rubenstein, D.: Growth codes: maximizing sensor network data persistence. In: Proceedings of the 2006 Conference on applications, technologies, architectures, and protocols for computer communications, SIGCOMM ’06, pp. 255–266. ACM (2006)

  23. Kannan, S., Viswanath, P.: Multi-session function computation and multicasting in undirected graphs. IEEE J. Sel. Area. Comm. 31(4), 702–713 (2013)

    Article  Google Scholar 

  24. Karamchandani, N., Appuswamy, R., Franceschetti, M.: Time and energy complexity of function computation over networks. IEEE Trans. Inf. Theory 57(12), 7671–7684 (2011)

    Article  MathSciNet  Google Scholar 

  25. Kelner, J.A., Lee, Y.T., Orecchia, L., Sidford, A.: An almost-linear-time algorithm for approximate max flow in undirected graphs, and its multicommodity generalizations. In: Proceedings of the 25th annual ACM-SIAM Symposium on discrete algorithms, SODA ’14, pp. 217–226. SIAM (2014)

  26. Leighton, T., Rao, S.: Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. J. ACM 46(6), 787–832 (1999)

    Article  MathSciNet  Google Scholar 

  27. Levin, D.A., Peres, Y., Wilmer, E.L.: Markov chains and mixing times. American Mathematical Soc. (2009)

  28. Liu, J., Xia, C.H., Shroff, N.B., Zhang, X.: On distributed computation rate optimization for deploying cloud computing programming frameworks. SIGMETRICS Perform. Eval. Rev. 40(4), 63–72 (2013)

    Article  Google Scholar 

  29. Loynes, R.M.: The stability of a queue with non-independent inter-arrival and service times. In: Mathematical Proceedings of the Cambridge philosophical society, vol. 58, pp. 497–520. Cambridge University Press (1962)

  30. Lu, Z., Wen, Y., Fan, R., Tan, S.L., Biswas, J.J.: Toward efficient distributed algorithms for in-network binary operator tree placement in wireless sensor networks. IEEE J. Sel. Area. Comm. 31(4), 743–755 (2013)

    Article  Google Scholar 

  31. Luo, W., Ephremides, A.: Stability of \(N\) interacting queues in random-access systems. IEEE Trans. Info. Theory 45(5), 1579–1587 (1999)

    Article  MathSciNet  Google Scholar 

  32. Mosk-Aoyama, D., Shah, D.: Computing separable functions via gossip. In: Proceedings of the 25th annual ACM symposium on principles of distributed computing, PODC ’06, pp. 113–122. ACM (2006)

  33. Ndzi, D.L., Harun, A., Ramli, F.M., Kamarudin, M.L., Zakaria, A., Shakaff, A.Y.M., Jaafar, M.N., Zhou, S., Farook, R.S.: Wireless sensor network coverage measurement and planning in mixed crop farming. Comput. Electr. Agric. 105, 83–94 (2014)

    Article  Google Scholar 

  34. Pandurangan, G., Robinson, P., Scquizzato, M.: Distributed complexity of large-scale graph computations. In: Proceedings of the 30th ACM symposium on parallelism and architectures, SPAA ’18, pp. 405–414. ACM (2018)

  35. Sefidgaran, M., Tchamkerten, A.: Distributed function computation over a rooted directed tree. IEEE Trans. Inf. Theory 62(12), 7135–7152 (2016)

    Article  MathSciNet  Google Scholar 

  36. Shah, D.: Network gossip algorithms. In: Proceedings of the IEEE international conference on acoustics, speech and signal processing, ICASSP ’09, pp. 3673–3676. IEEE (2009)

  37. Shah, V., Dey, B.K., Manjunath, D.: Network flows for function computation. IEEE J. Sel. Area. Comm. 31(4), 714–730 (2013)

    Article  Google Scholar 

  38. Sinclair, A.: Algorithms for random generation and counting. Progress in theoretical computer science (1993)

  39. Szpankowski, W.: Stability conditions for some distributed systems: Buffered random access systems. Adv. Appl. Prob. 26(2), 498–515 (1994)

    Article  MathSciNet  Google Scholar 

  40. Von Luxburg, U., Radl, A., Hein, M.: Hitting and commute times in large random neighborhood graphs. J. Mach. Learn. Res. 15(1), 1751–1798 (2014)

    MathSciNet  MATH  Google Scholar 

  41. Vyavahare, P., Limaye, N., Manjunath, D.: Optimal embedding of functions for in-network computation: complexity analysis and algorithms. IEEE/ACM Trans. Netw. 24(4), 2019–2032 (2016)

    Article  Google Scholar 

  42. Wang, G., Wang, Z., Wu, J.: A local average broadcast gossip algorithm for fast global consensus over graphs. J Parallel Distrib. Comput. 109, 301–309 (2017)

    Article  Google Scholar 

  43. Xu, A., Raginsky, M.: Information-theoretic lower bounds for distributed function computation. IEEE Trans. Inf. Theory 63(4), 2314–2337 (2017)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, IIT Delhi, New Delhi, India

    Iqra Altaf Gillani & Amitabha Bagchi

  2. Department of Electrical Engineering, IIT Tirupati, Tirupati, India

    Pooja Vyavahare

Authors
  1. Iqra Altaf Gillani
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pooja Vyavahare
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Amitabha Bagchi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Iqra Altaf Gillani.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Gillani, I.A., Vyavahare, P. & Bagchi, A. Lower bounds for in-network computation of arbitrary functions. Distrib. Comput. 34, 181–193 (2021). https://doi.org/10.1007/s00446-021-00394-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00446-021-00394-7

Keywords

Search

Navigation