The Forgiving Graph: A distributed data structure for low stretch under adversarial attack

Distributed Computing

Volumn 25, Issue 4, 2012, Pages 261-278

  Hayes, Thomas P ^a   Saia, Jared ^a   Trehan, Amitabh ^b  

^a University of New Mexico   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Dynamic; Networks; Peer to peer; Responsive; Self healing; Stretch; Trees

Indexed keywords

PEER TO PEER; RESPONSIVE; SELF-HEALING; STRETCH; TREES;

DATA STRUCTURES; DISTRIBUTED COMPUTER SYSTEMS; DYNAMICS; NETWORKS (CIRCUITS); PEER TO PEER NETWORKS;

TREES (MATHEMATICS);

EID: 84865329925     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00446-012-0160-1     Document Type: Article

References (23)

1. Andersen,D., Balakrishnan, H.,Kaashoek, F., Morris, R.: Resilient overlay networks. SIGOPS Oper. Syst. Rev. 35(5), 131-145 (2001 (Pubitemid 33612610)
2. Awerbuch, B., Patt-Shamir, B., Peleg, D., Saks, M.: Adapting to asynchronous dynamic networks (extended abstract). In: TOC '92: Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing, pp. 557-570. ACM, New York (1992 (Pubitemid 23608074)
3. 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
4. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2 edn. McGraw-Hill, New York (2001
5. Doverspike,R.D.,Wilson, B.:Comparison of capacity efficiency of DCS network restoration routing techniques. J. Netw. Syst. Manag. 2(2), 95-123 (1994
6. Frisanco, T.: Optimal spare capacity design for various protection switching methods in ATM networks. In: IEEE International Conference on Communications (ICC 97 Montreal), 'Towards the Knowledge Millennium', 1997, vol. 1, pp. 293-298 (1997)
7. 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 37thHawaii InternationalConference on System Sciences, 0-7695- 2056-1/04:1-11 (2004
8. Hayashi, Y.,Miyazaki, T.: Emergent rewirings for cascades on correlated networks. cond-mat/0503615 (2005
9. 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 (2009)
10. 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 (2008
11. Holme, P., Kim, B.J.: Vertex overload breakdown in evolving networks. Phy. Rev. E 65, 066109 (2002
12. Iraschko, R.R., MacGregor, M.H., Grover, W.D.: Optimal capacity placement for path restoration in STMorATMmesh-survivable networks. IEEE/ACM Trans. Netw. 6(3), 325-336 (1998 (Pubitemid 128750051)
13. Manku, G.S., Naor, M., Wieder, U.: Know thy neighbor's neighbor: the power of lookahead in randomized p2p networks. In: Proceedings of the 36th ACM Symposium on Theory of Computing (STOC) (2004
14. 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
15. Minsky, Y., Trachtenberg, A.: Practical set reconciliation. Technical Report, Boston Unuiversity, Boston (2002-2003
16. Motter, A.E.: Cascade control and defense in complex networks. Phys. Rev. Lett. 93, 098701 (2004
17. Motter, A.E., Lai, Y.-C: Cascade-based attacks on complex networks. Phys. Rev. E 66, 065102 (2002
18. Murakami, K., Kim, H.S.: Comparative study on restoration schemes of survivableATMnetworks. In: INFOCOM (1), pp. 345- 352 (1997
19. Naor, M., Wieder, U.: Know thy neighbor's neighbor: better routing for skip-graphs and small worlds. In: Proceedings of IPTPS, 2004, pp. 269-277 (2004 (Pubitemid 41190558)
20. Saia, J., Trehan, A.: Picking up the pieces: Self-healing in reconfigurable networks. In: IEEE International Parallel & Distributed Processing Symposium (2008
21. van Caenegem, B., Wauters, N., Demeester, P.: Spare capacity assignment for different restoration strategies in mesh survivable networks. In: IEEE International Conference on Communications (ICC 97 Montreal), 'Towards the Knowledge Millennium', vol. 1, pp. 288-292 (1997
22. Vaucher, J.G.: Building optimal binary search trees from sorted values in o(n) time. In: Essays in Memory of Ole-Johan Dahl, pp. 376-388 (2004
23. 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)