Skip to main content
Springer Nature Link
Log in

Distributed Algorithmic Foundations of Dynamic Networks

  • Conference paper
Structural Information and Communication Complexity (SIROCCO 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8576))

Abstract

Much of the well-established theory of distributed algorithms focuses on static networks, where nodes do not crash and edges maintain operational status forever. On the other hand, large real-world networks are inherently dynamic: the participants in peer-to-peer networks and social networks change over time, mobile nodes in wireless networks move in and out of each other’s transmission range, and, in distributed data center networks, faulty machines need to be replaced by new machines without interrupting the operation of the remaining network. Dynamic network models, where the communication topology varies over time but where the set of nodes is fixed, have been studied extensively in literature.

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

Access this chapter

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

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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.

Similar content being viewed by others

References

  1. Abshoff, S., Benter, M., Malatyali, M., Meyer auf der Heide, F.: On two-party communication through dynamic networks. In: Baldoni, R., Nisse, N., van Steen, M. (eds.) OPODIS 2013. LNCS, vol. 8304, pp. 11–22. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  2. Augustine, J., Molla, A.R., Morsy, E., Pandurangan, G., Robinson, P., Upfal, E.: Storage and search in dynamic peer-to-peer networks. In: SPAA, pp. 53–62 (2013)

    Google Scholar 

  3. Augustine, J., Pandurangan, G., Robinson, P.: Fast byzantine agreement in dynamic networks. In: Fatourou, P., Taubenfeld, G. (eds.) PODC, pp. 74–83. ACM (2013)

    Google Scholar 

  4. Augustine, J., Pandurangan, G., Robinson, P., Upfal, E.: Towards robust and efficient computation in dynamic peer-to-peer networks. In: ACM-SIAM, SODA 2012, pp. 551–569. SIAM (2012)

    Google Scholar 

  5. Avin, C., Koucký, M., Lotker, Z.: How to explore a fast-changing world (Cover time of a simple random walk on evolving graphs). In: Aceto, L., Damgård, I., Goldberg, L.A., Halldórsson, M.M., Ingólfsdóttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol. 5125, pp. 121–132. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  6. Cornejo, A., Gilbert, S., Newport, C.C.: Aggregation in dynamic networks. In: PODC, pp. 195–204 (2012)

    Google Scholar 

  7. Dutta, C., Pandurangan, G., Rajaraman, R., Sun, Z., Viola, E.: On the complexity of information spreading in dynamic networks. In: Khanna, S. (ed.) SODA, pp. 717–736. SIAM (2013)

    Google Scholar 

  8. Dwork, C., Peleg, D., Pippenger, N., Upfal, E.: Fault tolerance in networks of bounded degree. SIAM J. Comput. 17(5), 975–988 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  9. Falkner, J., Piatek, M., John, J.P., Krishnamurthy, A., Anderson, T.E.: Profiling a million user dht. In: Internet Measurement Comference, pp. 129–134 (2007)

    Google Scholar 

  10. Krishna Gummadi, P., Saroiu, S., Gribble, S.D.: A measurement study of napster and gnutella as examples of peer-to-peer file sharing systems. Computer Communication Review 32(1), 82 (2002)

    Article  Google Scholar 

  11. Kuhn, F., Oshman, R.: Dynamic networks: Models and algorithms. SIGACT News 42(1), 82–96 (2011)

    Article  Google Scholar 

  12. Kuhn, F., Lynch, N., Oshman, R.: Distributed computation in dynamic networks. In: ACM STOC, pp. 513–522 (2010)

    Google Scholar 

  13. Kuhn, F., Oshman, R., Moses, Y.: Coordinated consensus in dynamic networks. In: Proceedings of the 30th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC 2011, pp. 1–10. ACM (2011)

    Google Scholar 

  14. Lua, E.K., Crowcroft, J., Pias, M., Sharma, R., Lim, S.: A survey and comparison of peer-to-peer overlay network schemes. IEEE Communications Survey and Tutorial (2004)

    Google Scholar 

  15. O’Dell, R., Wattenhofer, R.: Information dissemination in highly dynamic graphs. In: DIALM-POMC, pp. 104–110 (2005)

    Google Scholar 

  16. Pease, M.C., Shostak, R.E., Lamport, L.: Reaching agreement in the presence of faults. J. ACM 27(2), 228–234 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  17. Das Sarma, A., Molla, A.R., Pandurangan, G.: Fast distributed computation in dynamic networks via random walks. In: Aguilera, M.K. (ed.) DISC 2012. LNCS, vol. 7611, pp. 136–150. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  18. Sen, S., Wang, J.: Analyzing peer-to-peer traffic across large networks. In: Proceedings of the 2nd ACM SIGCOMM Workshop on Internet Measurment, IMW 2002, pp. 137–150. ACM, New York (2002)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Division of Mathematical Sciences, Nanyang Technological University, Singapore, 637371

    Gopal Pandurangan

  2. Department of Computer Science and ICERM, Brown University, Providence, RI, 02912, USA

    Gopal Pandurangan

Authors
  1. Gopal Pandurangan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science, Reykjavik University, Menntavegur 1, 101, Reykjavik, Iceland

    Magnús M. Halldórsson

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Pandurangan, G. (2014). Distributed Algorithmic Foundations of Dynamic Networks. In: Halldórsson, M.M. (eds) Structural Information and Communication Complexity. SIROCCO 2014. Lecture Notes in Computer Science, vol 8576. Springer, Cham. https://doi.org/10.1007/978-3-319-09620-9_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-09620-9_3

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-09619-3

  • Online ISBN: 978-3-319-09620-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics