Topology-aware algorithms for large-scale communication

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1752, Issue , 2000, Pages 127-156

  Rodrigues, Luís ^a   Veríssimo, Paulo ^a  

^a UNIVERSITY OF LISBON   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

TOPOLOGY;

HIGH SPEED; LARGE-SCALE NETWORK; LONG HAUL; NETWORK INFRASTRUCTURE; NETWORK MODELING; PROTOCOL DESIGNERS; TOPOLOGY AWARE; TOPOLOGY INFORMATION;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0042402026     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46475-1_6     Document Type: Article

References (29)

1. Y. Amir, D. Dolev, S. Kramer, and D. Malki. Transis: A communication subsystem for high-availability. In Digest of Papers, The 22nd Int. Symp. on Fault-Tolerant Computing Systems, pages 76-84. IEEE, 1993.
2. K. Birman and T. Joseph. Reliable communication in the presence of failures. ACM, Transactions on Computer Systems, 5(1), February 1987.
3. K. Birman, A. Schiper, and P. Stephenson. Lightweight causal and atomic group multicast. ACM, Transactions on Computer Systems, 9(3), August 1991.
4. T. Chandra and S. Toueg. Unreliable failure detectors for reliable distributed systems. Journal of the ACM, 34(1):225-267, 1996.
5. J. Chang and N. Maxemchuck. Reliable broadcast protocols. ACM, Transactions on Computer Systems, 2(3), August 1984.
6. B. Charron-Bost. Concerning the size of logical clocks in distributed systems. Information Processing Letters, 39(1):11-16, July 1991.
7. D. Dolev, S. Kramer, and D. Malki. Early delivery totally ordered multicast in asynchronous environments. In Digest of Papers, The 23th Int. Symp. on Fault-Tolerant Computing, pages 544-553. IEEE, 1993.
8. Simon Even. Graph Algorithms. Computer Science Press, 1979.
9. P. Ezhilchelvan, R. Macedo, and S. Shrivastava. Newtop: A fault-tolerant group communication protocol. In Proceedings of the 15th Int. Conf. on Distributed Computing Systems, pages 296-306. IEEE, 1995.
10. A. Heybey. The network simulator version 2.1. Technical report, M.I.T., September 1990.
11. P. John. Statistical Methods in Engineering and Quality Assurance. John Wiley & Sons Inc, 1990.
12. M. Kaashoek and A. Tanenbaum. Group communication in the Amoeba distributed operating system. In Proceedings of the 11th Int. Conf. on Distributed Computing Systems, pages 222-230. IEEE, 1991.
13. R. Ladin, B. Liskov, L. Shrira, and S. Ghemawat. Lazy replication: Exploiting the semantics of distributed services. In Proceedings of the Ninth Annual ACM Symp. of Principles of Distributed Computing, pages 43-57, 1990.
14. L. Lamport. Time, clocks and the ordering of events in a distributed system. Communications of the ACM, 21(7):558-565, July 1978.
15. W. Lloyd and P. Kearns. Bounding sequence numbers in distributed systems: a general approach. In Proceedings of the 10th Int. Conf. on Distributed Computing Systems, pages 312-319, Paris, France, May 1990. IEEE.
16. S. Meldal, S. Sankar, and J. Vera. Exploiting locality in maitaining potential causality. In Procedings of the 10th ACM SIGACT-SIGOPS Symp. on Principles of Distributed Computing, pages 231-239, 1991.
17. David Mills. Network time protocol (version 2): Specification and implementation. Technical Report RFC 1119, DARPA Network Working Group, September 1989.
18. L. Moser, P. Melliar-Smith, A. Agarwal, R. Budhia, C. Lingley-Ppadopoulos, and T. Archambault. The Totem system. In Digest of Papers of the 25th Int. Symp. on Fault-Tolerant Computing Systems, pages 61-66. IEEE, June 1995.
19. L. Peterson, N. Buchholz, and R. Schlichting. Preserving and using context information in interprocess communication. ACM Transactions on Computer Systems, 7(3):217-146, August 1989.
20. M. Raynal, A. Schiper, and S. Toueg. The causal ordering abstraction and a simple way to implement it. Information processing letters, 39(6):343-350, September 1991.
21. L. Rodrigues, H. Fonseca, and P. Veríssimo. Totally ordered multicast in large-scale systems. In Proceedings of the 16th IEEE Int. Conf. on Distributed Computing Systems, pages 503-510, Hong Kong, May 1996. (extended report available).
22. L. Rodrigues and P. Veríssimo. xAMp: a multi-primitive group communications service. In Proceedings of the 11th Symp. on Reliable Distributed Systems, pages 112-121. IEEE, 1992.
23. L. Rodrigues and P. Veríssimo. Causal separators for large-scale multicast communication. In Proceedings of the 15th IEEE Int. Conf. on Distributed Computing Systems, pages 83-91, Vancouver, British Columbia, Canada, May 1995. (extended report available).
24. A. Schiper, J. Eggli, and A. Sandoz. A New Algorithm to Implement Causal Ordering. In Proceedings of the 3rd Int Workshop on Distributed Algorithms, Volume LNCS 392, pages 219-232, Nice - France, September 1989. Springer Verlag.
25. F. Schneider. Implementing fault-tolerant services using the state machine approach: a tutorial. ACM Computing Surveys, 22(4):290-319, December 1990.
26. A. Schwarz and F. Mattern. Detecting Causal Relationships in Distributed Computations: In search of the Holy Grail. Technical report, Departement of Computer Science, University of Kaiserlautern, 1991.
27. M. Singhal and Kshemkalyani A. An Efficient Implementation of vector clocks. Technical report, Ohio State University, October 1990.
28. P. Stephenson. Fast Causal Multicast. PhD thesis, Cornell Univ., February 1991.
29. R. van Renesse, Ken Birman, and S. Maffeis. Horus: A flexible group communications system. Communications of the ACM, 39(4):76-83, April 1996.