Evaluating the running time of a communication round over the internet

@inproceedings{Bakr2002EvaluatingTR,
  title={Evaluating the running time of a communication round over the internet},
  author={Omar Bakr and Idit Keidar},
  booktitle={PODC},
  year={2002}
}
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… CONTINUE READING
Highly Cited
This paper has 51 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 37 extracted citations

Quorum Placement on Wide-Area Networks

View 9 Excerpts
Highly Influenced

On the Latency Efficiency of Message-Parsimonious Asynchronous Atomic Broadcast

2007 26th IEEE International Symposium on Reliable Distributed Systems (SRDS 2007) • 2007
View 8 Excerpts
Highly Influenced

Using leader-based communication to improve the scalability of single-round group membership algorithms

19th IEEE International Parallel and Distributed Processing Symposium • 2005
View 8 Excerpts
Highly Influenced

Separating the WHEAT from the Chaff: An Empirical Design for Geo-Replicated State Machines

2015 IEEE 34th Symposium on Reliable Distributed Systems (SRDS) • 2015
View 1 Excerpt

51 Citations

051015'03'06'10'14'18
Citations per Year
Semantic Scholar estimates that this publication has 51 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-2 of 2 references

Similar Papers

Loading similar papers…