Skip to main content
SpringerLink
Log in

Toward Optimal Network Topology Design for Fast and Secure Distributed Computation

  • Conference paper
Decision and Game Theory for Security (GameSec 2014)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 8840))

Included in the following conference series:

Abstract

A typical distributed computation problem deals with a network of multiple agents and the constraint that each agent is able to communicate only with its neighboring agents. Two important issues of such a network are the convergence rate of the corresponding distributed algorithm and the security level of the network against external attacks. In this paper, we take algebraic connectivity as an index of convergence rate, which works for consensus and gossip algorithms, and consider certain type of external attacks by using the expected portion of the infected agents to measure the security level. Extremal examples and analysis show that fast convergence rate and high security level require opposite connectivity of the network. Thus, there has to be a trade-off between the two issues in the design of network topology. This paper aims to provide an approach to design a network topology which balances between convergence rate and security. A class of tree graphs, called extended star graphs, are considered. The optimal extended star graph is provided under appropriate assumptions.

This research was supported in part by the U.S. Air Force Office of Scientific Research (AFOSR) MURI grant FA9550-10-1-0573.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Tsitsiklis, J.N.: Problems in Decentralized Decision Making and Computation. PhD thesis, Department of Electrical Engineering and Computer Science, MIT (1984)

    Google Scholar 

  2. Bertsekas, D.P., Tsitsiklis, J.N.: Parallel and Distributed Computation: Numerical Methods. Prentice Hall (1989)

    Google Scholar 

  3. Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann Publishers (1997)

    Google Scholar 

  4. Jadbabaie, A., Lin, J., Morse, A.S.: Coordination of groups of mobile autonomous agents using nearest neighbor rules. IEEE Transactions on Automatic Control 48(6), 988–1001 (2003)

    Article  MathSciNet  Google Scholar 

  5. Xiao, L., Boyd, S.: Fast linear iterations for distributed averaging. Systems and Control Letters 53(1), 65–78 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  6. Cortés, J., Martínez, S., Karataş, T., Bullo, F.: Coverage control for mobile sensing networks. IEEE Transactions on Robotics and Automation 20(2), 243–255 (2004)

    Article  Google Scholar 

  7. Lin, J., Morse, A.S., Anderson, B.D.O.: The multi-agent rendezvous problem. Part 1: The Synchronous case. SIAM Journal on Control and Optimization 46(6), 2096–2119 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  8. Hu, L., Evans, D.: Localization for mobile sensor networks. In: Proceedings of the 10th Annual International Conference on Mobile Computing and Networking, pp. 45–57 (2004)

    Google Scholar 

  9. Krick, L., Broucke, M.E., Francis, B.A.: Stabilisation of infinitesimally rigid formations of multi-robot networks. International Journal of Control 82(3), 423–439 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  10. Liu, J., Hassanpour, N., Tatikonda, S., Morse, A.S.: Dynamic threshold models of collective action in social networks. In: Proceedings of the 51st IEEE Conference on Decision and Control, pp. 3991–3996 (2012)

    Google Scholar 

  11. Dörfler, F., Chertkov, M., Bullo, F.: Synchronization in complex oscillator networks and smart grids. Proceedings of the National Academy of Sciences 110(6), 2005–2010 (2013)

    Article  MathSciNet  Google Scholar 

  12. Olfati-Saber, R., Murray, R.M.: Consensus problems in networks of agents with switching topology and time-delays. IEEE Transactions on Automatic Control 49(9), 1520–1533 (2004)

    Article  MathSciNet  Google Scholar 

  13. Moreau, L.: Stability of multi-agent systems with time-dependent communication links. IEEE Transactions on Automatic Control 50(2), 169–182 (2005)

    Article  MathSciNet  Google Scholar 

  14. Ren, W., Beard, R.W.: Consensus seeking in multiagent systems under dynamically changing interaction topologies. IEEE Transactions on Automatic Control 50(5), 655–661 (2005)

    Article  MathSciNet  Google Scholar 

  15. Kashyap, A., Başar, T., Srikant, R.: Quantized consensus. Automatica 43(7), 1192–1203 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  16. Touri, B., Nedić, A.: Product of random stochastic matrices. IEEE Transactions on Automatic Control 59(2), 437–448 (2014)

    Article  Google Scholar 

  17. Xiao, L., Boyd, S., Lall, S.: A scheme for robust distributed sensor fusion based on average consensus. In: Proceedings of the 4th International Conference on Information Processing in Sensor Networks, pp. 63–70 (2005)

    Google Scholar 

  18. Boyd, S., Ghosh, A., Prabhakar, B., Shah, D.: Randomized gossip algorithms. IEEE Transactions on Information Theory 52(6), 2508–2530 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  19. Liu, J., Mou, S., Morse, A.S., Anderson, B.D.O., Yu, C.: Deterministic gossiping. Proceedings of the IEEE 99(9), 1505–1524 (2011)

    Article  Google Scholar 

  20. Liu, J., Morse, A.S.: Asynchronous distributed averaging using double linear iterations. In: Proceedings of the 2012 American Control Conference, pp. 6620–6625 (2012)

    Google Scholar 

  21. Kempe, D., Dobra, A., Gehrke, J.: Gossip-based computation of aggregate information. In: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, pp. 482–491 (2003)

    Google Scholar 

  22. Bénézit, F., Blondel, V., Thiran, P., Tsitsiklis, J.N., Vetterli, M.: Weighted gossip: distributed averaging using non-doubly stochastic matrices. In: Proceedings of the 2010 IEEE International Symposium on Information Theory, pp. 1753–1757 (2010)

    Google Scholar 

  23. Domínguez-García, A.D., Cady, S.T., Hadjicostis, C.N.: Decentralized optimal dispatch of distributed energy resources. In: Proceedings of the 51st IEEE Conference on Decision and Control, pp. 3688–3693 (2012)

    Google Scholar 

  24. Nedić, A., Ozdaglar, A.: Distributed sub-gradient methods for multi-agent optimization. IEEE Transactions on Automatic Control 58(6), 48–61 (2009)

    Google Scholar 

  25. Nedić, A., Ozdaglar, A., Parrilo, P.A.: Constrained consensus and optimization in multi-agent networks. IEEE Transactions on Automatic Control 55(4), 922–938 (2010)

    Article  Google Scholar 

  26. Bénézit, F., Thiran, P., Vetterli, M.: The distributed multiple voting problem. IEEE Journal of Selected Topics in Signal Processing 5(4), 791–804 (2011)

    Article  Google Scholar 

  27. Bürger, M., Notarstefano, G., Bullo, F., Allgöwer, F.: A distributed simplex algorithm for degenerate linear programs and multi-agent assignments. Automatica 48(9), 2298–2304 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  28. Mou, S., Liu, J., Morse, A.S.: A distributed algorithm for solving a linear algebraic equation. In: Proceedings of the 51st Annual Allerton Conference on Communication, Control, and Computing, pp. 267–274 (2013)

    Google Scholar 

  29. Gharesifard, B., Cortés, J.: Distributed convergence to Nash equilibria in two-network zero-sum games. Automatica 49(6), 1683–1692 (2013)

    Article  MathSciNet  Google Scholar 

  30. Olfati-Saber, R., Fax, J.A., Murray, R.M.: Consensus and cooperation in networked multi-agent systems. Proceedings of the IEEE 95(1), 215–233 (2007)

    Article  Google Scholar 

  31. Pasqualetti, F., Bicchi, A., Bullo, F.: Consensus computation in unreliable networks: a system theoretic approach. IEEE Transactions on Automatic Control 57(1), 90–104 (2012)

    Article  MathSciNet  Google Scholar 

  32. Yucelen, T., Egerstedt, M.: Control of multiagent systems under persistent disturbances. In: Proceedings of the 2012 American Control Conference, pp. 5264–5269 (2012)

    Google Scholar 

  33. LeBlanc, H., Zhang, H., Koutsoukos, X., Sundaram, S.: Resilient asymptotic consensus in robust networks. IEEE Journal on Selected Areas in Communications 31(4), 766–781 (2013)

    Article  Google Scholar 

  34. Manitara, N.E., Hadjicostis, C.N.: Privacy-preserving asymptotic average consensus. In: Proceedings of the 2013 European Control Conference, pp. 760–765 (2013)

    Google Scholar 

  35. Khanafer, A., Touri, B., Başar, T.: Robust distributed averaging on networks with adversarial intervention. In: Proceedings of the 52nd IEEE Conference on Decision and Control, pp. 7131–7136 (2013)

    Google Scholar 

  36. Zhu, Q., Bushnell, L., Başar, T.: Game-theoretic analysis of node capture and cloning attack with multiple attackers in wireless sensor networks. In: Proceedings of the 51st IEEE Conference on Decision and Control, pp. 3404–3411 (2012)

    Google Scholar 

  37. Acemoglu, D., Malekian, A., Ozdaglar, A.: Network security and contagion (2013) (submitted)

    Google Scholar 

  38. Chasparis, G.C., Shamma, J.S.: Control of preferences in social networks. In: Proceedings of the 49th IEEE Conference on Decision and Control, pp. 6651–6656 (2010)

    Google Scholar 

  39. Goyal, S., Kearns, M.: Competitive contagion in networks. In: Proceedings of the 44th Annual ACM Symposium on Theory of Computing, pp. 759–774 (2012)

    Google Scholar 

  40. Etesami, S.R., Başar, T.: Complexity of equilibrium in diffusion games on social networks. In: Proceedings of the 2014 American Control Conference, pp. 2065–2070 (2014)

    Google Scholar 

  41. Cao, M., Wu, C.W.: Topology design for fast convergence of network consensus algorithms. In: Proceedings of the 2007 IEEE International Symposium on Circuits and Systems, pp. 1029–1032 (2007)

    Google Scholar 

  42. Kar, S., Moura, J.M.F.: Sensor networks with random links: topology design for distributed consensus. IEEE Transactions on Signal Processing 56(7), 3315–3326 (2008)

    Article  MathSciNet  Google Scholar 

  43. Rafiee, M., Bayen, A.M.: Optimal network topology design in multi-agent systems for efficient average consensus. In: Proceedings of the 49th IEEE Conference on Decision and Control, pp. 3877–3883 (2010)

    Google Scholar 

  44. Zhang, H., Sundaram, S.: Robustness of complex networks with implications for consensus and contagion. In: Proceedings of the 51st IEEE Conference on Decision and Control, pp. 3426–3432 (2012)

    Google Scholar 

  45. Bamieh, B., Jovanović, M.R., Mitra, P., Patterson, S.: Coherence in large-scale networks: dimension-dependent limitations of local feedback. IEEE Transactions on Automatic Control 57(9), 2235–2249 (2012)

    Article  Google Scholar 

  46. Chapman, A., Mesbahi, M.: Semi-autonomous consensus: network measures and adaptive trees. IEEE Transactions on Automatic Control 58(1), 19–31 (2013)

    Article  MathSciNet  Google Scholar 

  47. Fiedler, M.: Algebraic connectivity of graphs. Czechoslovak Mathematical Journal 23(2), 298–305 (1973)

    MathSciNet  Google Scholar 

  48. Fiedler, M.: A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory. Czechoslovak Mathematical Journal 25(4), 619–633 (1975)

    MathSciNet  Google Scholar 

  49. Grone, R., Merris, R.: Algebraic connectivity of trees. Czechoslovak Mathematical Journal 37(112), 660–670 (1987)

    MathSciNet  Google Scholar 

  50. Kirkland, S., Neumann, M., Shader, B.L.: Characteristic vertices of weighted trees via perron values. Linear and Multilinear Algebra 40(4), 311–325 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  51. Mitchell, L.H.: A characterization of tree type. Rose-Hulman Undergraduate Mathematics Journal 4(2) (2003)

    Google Scholar 

  52. Fallat, S.M., Kirkland, S., Pati, S.: Maximizing algebraic connectivity over unicyclic graphs. Linear and Multilinear Algebra 51(3), 221–241 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  53. Grone, R., Merris, R., Sunder, S.: The Laplacian spectrum of a graph. SIAM Journal on Matrix Analysis and Applications 11(2), 218–238 (1990)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Coordinated Science Laboratory, University of Illinois at Urbana-Champaign, 1308 W Main Street, Urbana, Illinois, USA

    Ji Liu & Tamer Başar

Authors
  1. Ji Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Tamer Başar
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Electrical Engineering Department, Network Securitiy Lab, University of Washington, Box 352500, 98195-2055, Seattle, WA, USA

    Radha Poovendran

  2. Department of Electrical and Computer Engineering, Virginia Tech, Whittmore Hall 302, 1185 Perry Street, 24061, Blacksburg, VA, USA

    Walid Saad

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Liu, J., Başar, T. (2014). Toward Optimal Network Topology Design for Fast and Secure Distributed Computation. In: Poovendran, R., Saad, W. (eds) Decision and Game Theory for Security. GameSec 2014. Lecture Notes in Computer Science, vol 8840. Springer, Cham. https://doi.org/10.1007/978-3-319-12601-2_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-12601-2_13

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-12600-5

  • Online ISBN: 978-3-319-12601-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation