Omar Bakr
Idit Keidar
ABSTRACT
We study the running time of distributed algorithms deployed in a widely distributed setting over the Internet using TCP. We consider a simple primitive that corresponds to a communication round in which every host sends information to every other host; this primitive occurs in numerous distributed algorithms. We experiment with four algorithms that typically implement this primitive. We run our experiments on ten hosts at geographically disperse locations over the Internet. We observe that message loss has a large impact on algorithm running times, which causes leader-based algorithms to usually outperform decentralized ones.
- Agarwal, D. A., Moser, L. E., Melliar-Smith, P. M., and Budhia, R. K. The Totem multiple-ring ordering and topology maintenance protocol. ACM Trans. Comput. Syst. 16, 2 (May 1998), 93-132. Google Scholar
Digital Library
- Amir, Y., and Wool, A. Evaluating quorum systems over the internet. In IEEE Fault-Tolerant Computing Symposium (FTCS) (June 1996), pp. 26-35. Google ScholarDigital Library
- Andersen, D. G., Balakrishnan, H., Kaashoek, F., and Morris, R. Resilient overlay networks. In SOSP (Oct. 2001). Google ScholarDigital Library
- Chandra, B., Dahlin, M., Gao, L., and Nayate, A. End-to-end WAN service availability. In Third Usenix Symposium on Internet Technologies and Systems (USITS01) (Mar. 2001). Google ScholarDigital Library
- Chandra, T. D., and Toueg, S. Unreliable failure detectors for reliable distributed systems. J. ACM 43, 2 (Mar. 1996), 225-267. Google ScholarDigital Library
- Culler, D., Karp, R., Patterson, D., Sahay, A., Schauser, K., Santos, E., Subramonian, R., and von Eicken, T. LogP: Towards a realistic model of parallel computation. In 4th ACM SIGPLAN Symp. on Principles and Practice of Parallel Programming (May 1993). Google ScholarDigital Library
- Floyd, S., and Paxson, V. Difficulties in simulating the internet. IEEE/ACM Transactions on Networking 9, 4 (August 2001), 392-403. Google ScholarDigital Library
- Gray, J. N. Notes on database operating systems. In Operating Systems: An Advanced Course, Lecture Notes in Computer Science, vol. 60. Springer Verlag, Berlin, 1978, pp. 393-481. Google ScholarDigital Library
- Guerraoui, R., and Schiper, A. The decentralized non-blocking atomic commitment protocol. In IEEE International Symposium on Parallel and Distributed Processing (SPDP) (October 1995). Google ScholarDigital Library
- Guo, K., Vogels, W., and van Renesse, R. Structured virtual synchrony: Exploring the bounds of virtual synchronous group communication. In 7th ACM SIGOPS European Workshop (September 1996). Google ScholarDigital Library
- Keidar, I., and Dolev, D. Increasing the resilience of distributed and replicated database systems. J. Comput. Syst. Sci. 57, 3 (Dec. 1998), 309-324. Google ScholarDigital Library
- Keidar, I., and Rajsbaum, S. On the cost of fault-tolerant consensus when there are no faults - a tutorial. Tech. Rep. MIT-LCS-TR-821, MIT Laboratory for Computer Science, May 2001. Preliminary version in SIGACT News 32(2), pages 45-63, June 2001 (published May 15th 2001). Google ScholarDigital Library
- Keidar, I., Sussman, J., Marzullo, K., and Dolev, D. Moshe: A group membership service for WANs. ACM Trans. Comput. Syst. (2002). To appear. Google ScholarDigital Library
- Lamport, L. The part-time parliament. ACM Trans. Comput. Syst. 16, 2 (May 1998), 133-169. Google ScholarDigital Library
- Lamport, L. Time, clocks, and the ordering of events in a distributed system. Commun. ACM 21, 7 (July 78), 558-565. Google ScholarDigital Library
- Lamport, L., Shostak, R., and Pease, M. The Byzantine generals problem. ACM Transactions on Programming Languages and Systems 4, 3 (July 1982), 382-401. Google ScholarDigital Library
- Paxson, V. End-to-end Internet packet dynamics. In ACM SIGCOMM (September 1997). Google ScholarDigital Library
- Rajsbaum, S., and Sidi, M. On the performance of synchronized programs in distributed networks with random processing times and transmission delays. IEEE Transactions on Parallel and Distributed Systems 5, 9 (1994), 939-950. Google ScholarDigital Library
- Savage, S., Anderson, T., Aggarwal, A., Becker, D., Cardwell, N., Collins, A., Hoffman, E., Snell, J., Vahdat, A., Voelker, G., and Zahorjan, J. Detour: a case for informed internet routing and transport. IEEE Micro 19, 1 (January 1999), 50-59. Google ScholarDigital Library
- Savage, S., Collins, A., Hoffman, E., Snell, J., and Anderson, T. The end-to-end effects of Internet path selection. In ACM SIGCOMM (September 1999), pp. 289-299. Google ScholarDigital Library
- Sergent, N. Evaluating latency of distributed algorithms using Petri nets. In 5th Euromicro Workshop on Parallel and Distributed Processing (London, UK, Jan. 1997), pp. 437-442.Google Scholar
- Skeen, D. Nonblocking commit protocols. In ACM SIGMOD International Symposium on Management of Data (1981), pp. 133-142. Google ScholarDigital Library
- Stevens, R. TCP/IP Illustrated, vol. 1. Addison-Wesley, 1994. Google ScholarDigital Library
- Urbán, P., Défago, X., and Schiper, A. Contention-aware metrics for distributed algorithms: Comparison of atomic broadcast algorithms. In 9th IEEE International Conference on Computer Communications and Networks (IC3N 2000) (Oct. 2000).Google ScholarCross Ref
- Zhang, Y., Duffield, N., Paxson, V., and Shenker, S. On the constancy of internet path properties. In ACM SIGCOMM Internet Measurement Workshop (November 2001). Google ScholarDigital Library
- Evaluating the running time of a communication round over the internet
Recommendations
Evaluating virtual router performance for a pluralist future internet
ICICS '12: Proceedings of the 3rd International Conference on Information and Communication SystemsInternet Service Providers resist innovating in the network core, fearing that deploying a new protocol or service compromises the network operation and their profit, as a consequence. Therefore, a new Internet model, called Future Internet, which ...
Comments