Distributed construction of a fault-tolerant network from a tree

Proceedings of the IEEE Symposium on Reliable Distributed Systems

Volumn , Issue , 2005, Pages 155-165

  Reiter, Michael K ^a,b   Samar, Asad ^a   Wang, Chenxi ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b NONE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER ARCHITECTURE; COMPUTER GRAPHICS; COMPUTER SIMULATION; DISTRIBUTED COMPUTER SYSTEMS; FORMAL LOGIC; TOPOLOGY; TREES (MATHEMATICS);

FAULT-TOLERANT COMMUNICATION STRUCTURE; LOGICAL EXPANDER; NODES; VERTEX CONNECTIVITY;

FAULT TOLERANT COMPUTER SYSTEMS;

EID: 33749422894     PISSN: 10609857     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/RELDIS.2005.16     Document Type: Conference Paper

References (44)

1. M. Ajtai, J. Koml'os, and E. Szemer'edi. An O(n log n) sorting network. Combinatorica, 3(1):1-19, 1983.
2. N. Alon. Eigenvalues and expanders. Combinatorica, 6(2): 83-96, 1986.
3. A. Awan, R. A. Ferreira, S. Jagannathan, and A. Grama. Distributed uniform sampling in real-world networks. In Purdue University, CSD Technical Report (CSD-TR-04-029), Oct. 2004.
4. A. Bagchi, A. Bhargava, A. Chaudhary, D. Eppstein, and C. Scheideler. The effects of faults on network expansion. In Proc. 16th ACM Symposium on Parallel Algorithms and Architectures, June 2004.
5. M. Blum, R. M. Karp, O. Vornberger, C. H. Papadimitriou, and M. Yannakakis. The complexity of testing whether a graph is a superconcentrator. Information Processing Letters, 13(4/5): 164-167, 1981.
6. D. Boggs. Internet broadcasting. Technical Report CSL-83-3, XEROX Palo Alto Research Center, 1983.
7. B. Bollobas. A probabilistic proof of an asymptotic formula for the number of labelled regular graphs. European Journal of Combinatorics, 1(4):311-316, 1980.
8. S. Boyd, P. Diaconis, and L. Xiao. Fastest mixing markov chain on a graph. SIAM Review, 46(4):667-689, 2004.
9. Y. Chang, M. Singhal, and M. Liu. A fault tolerant algorithm for distributed mutual exclusion. In Proc. 9th IEEE Symp. on Reliable Dist. Syst., pages 146-154, 1990.
10. S. E. Czerwinski, B. Y. Zhao, T. D. Hodes, A. D. Joseph, and R. H. Katz. An architecture for a secure service discovery service. In Proc. 5th Annual International Conference on Mobile Computing and Networks (MobiCom), 1999.
11. M. J. Demmer and M. P. Herlihy. The arrow distributed directory protocol. In Proc. 12th International Symposium of Distributed Computing, pages 119-133, 1998.
12. A. M. Despain and A. D. Patterson. X-tree: A tree structured multi-processor computer architecture. In Proc. 5th Annual Symposium on Computer Architecture, 1978.
13. J. Friedman. On the second eigenvalue and random walks in random d-regular graphs. Combinatorica, 11(4):331-362, 1991.
14. O. Gabber and Z. Galil. Explicit construction of linear-sized superconcentrators. Journal of Computer and System Sciences, 22(3):407-420, 1981.
15. L. Garcs-Erice, E. Biersack, P. Felber, K. Ross, and G. Urvoy-Keller. Hierarchical peer-to-peer systems. In Proc. International Conference on Parallel and Distributed Computing, 2003.
16. C. Gkantsidis, M. Mihail, and A. Saberi. Random walks in peer-to-peer networks. In Proc. Infocom, Mar. 2004.
17. A. Goerdt. Random regular graphs with edge faults: Expansion through cores. In Proc. 9th International Symposium on Algorithms and Computation, 1998.
18. J. R. Goodman and H. S. Carlo. Hypertree: A multiprocessor interconnection topology. IEEE Transactions on Computers, C-30(12):923-933, 1981.
19. J. Goshi and R. E. Ladner. Algorithms for dynamic multicast key distribution trees. In Proc. 22nd Symposium on Principles of Distributed Computing, July 2003.
20. J.-M. Hlary, A. Mostefaoui, and M. Raynal. A general scheme for token- and tree-based distributed mutual exclusion algorithms. IEEE Transactions on Parallel and Distributed Systems, 5(11): 1185-1196, 1994.
21. K. Horowitz and D. Malkhi. Estimating network size from local information. Information Processing Letters, 88(5):237-243, 2003.
22. J. H. Kim and V. H. Vu. Generating random regular graphs. In Proc. 35th ACM Symposium on Theory of Computing, June 2001.
23. D. Kleitman. Methods for investigating connectivity of large graphs. IEEE Transactions on Circuits and Systems, 16(2):232-233, 1969.
24. N. Kotilainen, M. Weber, M. Vapa, and J. Vuori. Mobile Chedar: A peer-to-peer middleware for mobile devices. In Proc. 3rd IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOMW), 2005.
25. B. W. Lampson, M. Abadi, M. Burrows, and E. Wobber. Authentication in distributed systems: Theory and practice. ACM Transactions on Computer Systems, 10(4):265-310, 1992.
26. C. Law and K.-Y. Siu. Distributed construction of random expander networks. In Proc. Infocom, Apr. 2003.
27. D. Loguinov, A. Kumar, V. Rai, and S. Ganesh. Graphtheoretic analysis of structured peer-to-peer systems: routing distances and fault resilience. In ACM SIGCOMM Conference, Aug. 2003.
28. L. Lovasz. Random walks on graphs: A survey. Combinatorics, Paul Erdos is Eighty, 2:1-46, 1993.
29. H. Lu. A novel high-order tree for secure multicast key management. IEEE Transactions on Computers, 54(2):214-224, 2005.
30. P. MacKenzie and M. K. Reiter. Delegation of cryptographic servers for capture-resilient devices. Distributed Computing, 16(4):307-327, 2003.
31. P. MacKenzie and M. K. Reiter. Networked cryptographic devices resilient to capture. International Journal of Information Security, 2(1): 1-20, 2003.
32. G. A. Margulis. Explicit constructions of concentrators. Problemy Peredachi Informatsii, pages 71-80, 1973.
33. P. Mockapetris. Domain names - concepts and facilities. RFC 1034, Nov. 1987.
34. M. Naimi, M. Trehel, and A. Arnold. A log (n) distributed mutual exclusion algorithm based on path reversal. Journal of Parallel and Distributed Computing, 34(1): 1-13, 1996.
35. G. Pandurangan, P. Raghavan, and E. Upfal. Building low-diameter p2p networks. In Proc. 42nd IEEE Symposium on Foundations of Computer Science, Oct. 2003.
36. N. Pippenger and G. Lin. Fault-tolerant circuit-switching networks. In Proc. 4th ACM Symposium on Parallel Algorithms and Architectures, June 1992.
37. K. Raymond. A tree-based algorithm for distributed mutual exclusion. ACM Transactions on Computer Systems, 7(1):61-77, Feb. 1989.
38. M. K. Reiter, A. Samar, and C. Wang. Design and implementation of a JCA-compliant capture protection infrastructure. In Proc. of the 22nd IEEE Symp. on Reliable Dist. Syst., Oct. 2003.
39. K. Rothermel and C. Maihöfer. A robust and efficient mechanism for constructing multicast acknowledgement trees. In Proc. 8th International Conference on Computer Communications and Networks ICCCN, 1999.
40. R. D. Schlichting and F. B. Schneider. Fail-stop processors: An approach to designing fault-tolerant computing systems. ACM Transactions on Computer Systems, 1(3):222-238, 1983.
41. M. Sipser and D. A. Spielman. Expander codes. IEEE Transactions on Information Theory, 42(6): 1710-1722, 1996.
42. A. Steger and N. Wormald. Generating random regular graphs quickly. Combinatorics, Probability and Computing, 8(4):377-396, 1999.
43. SUN Microsystems. Jini technology architectural overview. http://www.sun.com/software/ jini/whitepapers/architecture.html, Jan. 1999. White Paper.
44. S. Wang and S. Lang. A tree-based distributed algorithm for the k-entry critical section problem. In IEEE International Conference on Parallel and Distributed Systems, Dec. 1994.