[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Springer Nature Link
Log in

Xheal: a localized self-healing algorithm using expanders

  • Published:
Distributed Computing Aims and scope Submit manuscript

Abstract

We consider the problem of self-healing in reconfigurable networks e.g., peer-to-peer and wireless mesh networks. For such networks under repeated attack by an omniscient adversary, we propose a fully distributed algorithm, Xheal, that maintains good expansion and spectral properties of the network, while keeping the network connected. Moreover, Xheal does this while allowing only low stretch and degree increase per node. The algorithm heals global properties like expansion and stretch while only doing local changes and using only local information. We also provide bounds on the second smallest eigenvalue of the Laplacian which captures key properties such as mixing time, conductance, congestion in routing etc. Xheal has low amortized latency and bandwidth requirements. Our work improves over the self-healing algorithms Forgiving tree [PODC 2008] and Forgiving graph [PODC 2009] in that we are able to give guarantees on degree and stretch, while at the same time preserving the expansion and spectral properties of the network.

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
£29.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 includes VAT (United Kingdom)

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

  1. Andersen, D., Balakrishnan, H., Kaashoek, F., Morris, R.: Resilient overlay networks. SIGOPS Oper. Syst. Rev. 35(5), 131–145 (2001)

    Article  MATH  Google Scholar 

  2. Arak, V.: What Happened on August 16, August 2007. http://heartbeat.skype.com/2007/08/what-happened-on-august-16.html

  3. Awerbuch, B., Patt-Shamir, B., Peleg, D., Saks, M.: Adapting to asynchronous dynamic networks (extended abstract). In: STOC ’92: Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing, pp. 557–570. ACM, New York, NY (1992)

  4. Barabási, A.-L., Oltvai, Z.N.: Network biology: understanding the cell’s functional organization. Nat. Rev. Genet. 5(2), 101–113 (2004)

    Article  Google Scholar 

  5. Boman, I., Saia, J., Abdallah, C.T., Schamiloglu, E.: Brief announcement: self-healing algorithms for reconfigurable networks. In: Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS) (2006)

  6. Chung, F.: Spectral Graph Theory. American Mathematical Society, Providence (1997)

  7. Dolev, S., Tzachar, N.: Spanders: distributed spanning expanders. In: SAC, pp. 1309–1314 (2010)

  8. Doverspike, R.D., Wilson, B.: Comparison of capacity efficiency of dcs network restoration routing techniques. J. Netw. Syst. Manag. 2(2), 95–123 (1994)

    Google Scholar 

  9. Fisher, K.: Skype Talks of “perfect storm” that Caused Outage, Clarifies Blame (August 2007). http://arstechnica.com/news.ars/post/20070821-skype-talks-of-perfect-storm.html

  10. Friedman, J.: On the second eigenvalue and random walks in random d-regular graphs. Combinatorica 11, 331–362 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  11. Frisanco, T.: Optimal spare capacity design for various protection switching methods in ATM networks. In: 1997 IEEE International Conference on Communications, 1997 (ICC 97 Montreal), ‘Towards the Knowledge Millennium’, vol. 1, pp. 293–298 (1997)

  12. Gkantsidis, C., Mihail, M., Saberi, A.: Random walks in peer-to-peer networks: algorithms and evaluation. Perform. Eval. 63(3), 241–263 (2006)

    Article  Google Scholar 

  13. Goel, S., Belardo, S., Iwan, L.: A resilient network that can operate under duress: to support communication between government agencies during crisis situations. In: Proceedings of the 37th Hawaii International Conference on System Sciences, 0-7695-2056-1/04:1–11 (2004)

  14. Hayashi, Y., Miyazaki, T.: Emergent Rewirings for Cascades on Correlated, Networks. cond-mat/0503615 (2005)

  15. Hayes, T.P., Saia, J., Trehan, A.: The forgiving graph: a distributed data structure for low stretch under adversarial attack. In: PODC ’09: Proceedings of the 28th ACM Symposium on Principles of Distributed Computing, pp. 121–130. ACM, New York, NY (2009)

  16. Hayes, T., Rustagi, N., Saia, J., Trehan, A.: The forgiving tree: a self-healing distributed data structure. In: PODC ’08: Proceedings of the Twenty-Seventh ACM Symposium on Principles of Distributed Computing, pp. 203–212. ACM, New York, NY (2008)

  17. Hillel, K.C., Shachnai, H.: Partial information spreading with application to distributed maximum coverage. In: PODC ’10: Proceedings of the 28th ACM Symposium on Principles of Distributed Computing. ACM, New York, NY (2010)

  18. Holme, P., Kim, B.J.: Vertex overload breakdown in evolving networks. Phys. Rev. E 65, 066109 (2002)

    Google Scholar 

  19. Hoory, S., Linial, N., Wigderson, A.: Expander graphs and their applications. Bull. Am. Math. Soc. 43(04), 439–562 (August 2006)

  20. IBM http://www.research.ibm.com/autonomic/manifesto/autonomiccomputing.pdf

  21. IBM: http://www.research.ibm.com/autonomic/research/papers/AC_Vision_Computer_Jan_2003.pdf

  22. Iraschko, R.R., MacGregor, M.H., Grover, W.D.: Optimal capacity placement for path restoration in STM or ATM mesh-survivable networks. IEEE/ACM Trans. Netw. 6(3), 325–336 (1998)

    Google Scholar 

  23. Khan, M., Pandurangan, G., Kumar, AVS.: A simple randomized scheme for constructing low-weight \(k\)-connected spanning subgraphs with applications to distributed algorithms. Theor. Comput. Sci. 385(1–3), 101–114 (2007)

    Google Scholar 

  24. Law, C., Siu, K.-Y.: Distributed construction of random expander networks. In: Twenty-Second Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2003). IEEE, vol. 3, pp. 2133–2143 (2003)

  25. Malik, O.: Does Skype Outage Expose P2Ps Limitations? (August 2007). http://gigaom.com/2007/08/16/skype-outage

  26. Medard, M., Finn, S.G., Barry, R.A.: Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs. IEEE/ACM Trans. Netw. 7(5), 641–652 (1999)

    Article  Google Scholar 

  27. Moore, M.: Skype’s outage not a hang-up for user base (August 2007). http://www.usatoday.com/tech/wireless/phones/2007-08-24-skype-outage-effects-N.htm

  28. Motter, A.E.: Cascade control and defense in complex networks. Phys. Rev. Lett. 93, 098701 (2004)

    Google Scholar 

  29. Motter, A.E., Lai, Y.-C.: Cascade-based attacks on complex networks. Phys. Rev. E 66, 065102 (2002)

    Article  Google Scholar 

  30. Murakami, K., Kim, H.S.: Comparative study on restoration schemes of survivable ATM networks. In: INFOCOM, pp. 345–352 (1997)

  31. Pandurangan, G., Robinson, P., Trehan, A.: Self-healing deterministic expanders. CoRR, abs/1206.1522 (2012)

  32. Pandurangan, G., Trehan, A.: Xheal: localized self-healing using expanders. In: Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing (PODC ’11), pp. 301–310. ACM, New York, NY (2011)

  33. Peleg, D.: Distributed Computing: A Locality Sensitive Approach. SIAM, Philadelphia (2000)

  34. Ray, B.: Skype Hangs up on Users (August 2007). http://www.theregister.co.uk/2007/08/16/skype_down/

  35. Saia, J., Trehan, A.: Picking up the pieces: Self-healing in reconfigurable networks. In: IPDPS. 22nd IEEE International Symposium on Parallel and Distributed Processing, pp. 1–12. IEEE (April 2008)

  36. Stone, B.: Skype: Microsoft Update Took Us Down (August 2007). http://bits.blogs.nytimes.com/2007/08/20/skype-microsoft-update-took-us-down

  37. Trehan, A.: Algorithms for Self-Healing Networks. Dissertation, University of New Mexico (2010)

  38. Van Caenegem, B., Wauters, N., Demeester, P.: Spare capacity assignment for different restoration strategies in mesh survivable networks. In: 1997 IEEE International Conference on Communications, 1997 (ICC 97 Montreal), ‘Towards the Knowledge Millennium’, vol. 1, pp. 288–292 (1997)

  39. Whatis.com.: http://searchcio-midmarket.techtarget.com/definition/autonomic-computing

  40. Xiong, Y., Mason, L.G.: Restoration strategies and spare capacity requirements in self-healing ATM networks. IEEE/ACM Trans. Netw. 7(1), 98–110 (1999)

    Article  Google Scholar 

Download references

Acknowledgments

We would like to thank the anonymous referees for their comments. G. Pandurangan’s research was supported in part by Nanyang Technological University grant M58110000, Singapore Ministry of Education (MOE) Academic Research Fund (AcRF) Tier 2 grant MOE2010-T2-2-082, US NSF grant CCF-1023166, by a grant from the United States-Israel Binational Science Foundation (BSF). A. Trehan’s research was supported at the Technion by a fellowship of the Israel Council for Higher Education, and was conducted (and supported) partly at Brown University, USA and at University of Victoria, Canada. A preliminary version of this paper was published at the 30th ACM Symposium on Principles of Distributed Computing (PODC), 2011, San Jose, CA, USA.

Author information

Authors and Affiliations

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

    Gopal Pandurangan

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

    Gopal Pandurangan

  3. Faculty of Industrial Engineering and Management, Technion—Israel Institute of Technology, 32000 , Haifa, Israel

    Amitabh Trehan

Authors
  1. Gopal Pandurangan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Amitabh Trehan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Amitabh Trehan.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Pandurangan, G., Trehan, A. Xheal: a localized self-healing algorithm using expanders. Distrib. Comput. 27, 39–54 (2014). https://doi.org/10.1007/s00446-013-0192-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00446-013-0192-1

Keywords

Search

Navigation