Dahlia Malkhi
Moni Naor
ABSTRACT
We propose a family of constant-degree routing networks of logarithmic diameter, with the additional property that the addition or removal of a node to the network requires no global coordination, only a constant number of linkage changes in expectation, and a logarithmic number with high probability. Our randomized construction improves upon existing solutions, such as balanced search trees, by ensuring that the congestion of the network is always within a logarithmic factor of the optimum with high probability. Our construction derives from recent advances in the study of peer-to-peer lookup networks, where rapid changes require efficient and distributed maintenance, and where the lookup efficiency is impacted both by the lengths of paths to requested data and the presence or elimination of bottlenecks in the network.
- N. Alon, M. Dietzfelbinger, P. B. Miltersen, E. Petrank, and G. Tardos. "Linear Hashing". Journal of the ACM Vol. 46, No. 5, 1999, pp. 667-683. Google Scholar
Digital Library
- L. Barriére, P. Fraigniaud, E. Kranakis and D. Krizanc. "Efficient routing in networks with long range contacts". 15th International Symposium on Distributed Computing (DISC '01), Lecture Notes in Computer Science vol. 2180, Springer, 2001 pp. 270-284. Google ScholarDigital Library
- A. Fiat and J. Saia. "Censorship resistant peer-to-peer content addressable networks". Proceedings of the 13th ACM-SIAM Symp. on Discrete Algorithms, 2002. Google ScholarDigital Library
- S. D. Gribble, E. A. Brewer, J. M. Hellerstein, and D. Culler. "Scalable, distributed data structures for Internet service construction. Proc. Fourth Symposium on Operating System Design and Implementation (OSDI 2000), October 2000. Google ScholarDigital Library
- D. Karger, E. Lehman, F. T. Leighton, M. Levine, D. Lewin, and R. Panigrahy. "Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web". Proceedings of the 29th Annual ACM Symposium on Theory of Computing (STOC), pp. 654-663, May 1997. Google ScholarDigital Library
- J. Kleinberg. "The small world phenomenon: An algorithmic perspective". Proceedings of the 32nd ACM Symposium on Theory of Computing, May 2000, pp. 163-170. (A shorter version available as "Navigation in a Small World", Nature 406, August 2000, pp. 845.) Google ScholarDigital Library
- J. Kubiatowicz, D. Bindel, Y. Chen, S. Czerwinski, P. Eaton, D. Geels, R. Gummadi, S. Rhea, H. Weatherspoon, W. Weimer, C. Wells, and B. Zhao. "OceanStore: An Architecture for Global-Scale Persistent Storage", Proceedings of the Ninth international Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS 2000), November 2000. Google ScholarDigital Library
- N. Lynch, D. Malkhi and D. Ratajczak. "Atomic Data Access in Distributed Hash Tables", Proceedings of the International Peer-to-Peer Symposium, March 2002. Google ScholarDigital Library
- T. Lai and D. Wood. "Adaptive heuristics for binary search trees and constant linkage cost". Proceedings of the 2nd ACM-SIAM Symposium on Discrete Algorithms, pp. 72-77, San Francisco, CA, 1991. Google ScholarDigital Library
- M.-J. Lin, K. Marzullo and S. Masini, "Gossip versus Deterministically Constrained Flooding on Small Networks", Proceedings of the 14th International Conference on Distributed Computing, 2000, pp. 253-267. Google ScholarDigital Library
- R. J. Lipton and J. F. Naughton. "Clocked adversaries for hashing". Algorithmica, Vol. 9(3), 1993, pp. 239-252.Google ScholarCross Ref
- W. Litwin, M.A. Neimat, D. A. Schneider. "LH*-A scalable, distributed data structure". ACM Transactions on Database Systems, Vol. 21(4), 1996, pp. 480-525. Google ScholarDigital Library
- R. Motwani and P. Raghavan. "Randomized Algorithms". Cambridge University Press, 1995. Google ScholarDigital Library
- T. Ottmann and D. Wood. "Updating binary trees with constant linkage cost". International Journal of Foundations of Computer Science, 3, 1992, pp. 479-501.Google ScholarCross Ref
- G. Pandurangan, P. Raghavan and E. Upfal. "Building low-diameter p2p networks". Proceedings of the 42nd Annual IEEE Symposium on the Foundations of Computer Science (FOCS), 2001. Google ScholarDigital Library
- C. Plaxton, R. Rajaram, and A. Richa. "Accessing nearby copies of replicated objects in a distributed environment". Proceedings of the Ninth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA 97), pp. 311-320, June 1997. Google ScholarDigital Library
- W. Pugh. "Skip Lists: A probabilistic alternative to balanced trees". Communications of the ACM, vol 33(6), pp. 668-676, 1990. Google ScholarDigital Library
- S. Ratnasamy, P. Francis, M. Handley, R. Karp and S. Shenker. "A scalable content-addressable network". Proceedings of the ACM SIGCOMM 2001 Technical Conference. August 2001. Google ScholarDigital Library
- H. J. Siegel. "Interconnection networks for SIMD machines". Computer 12(6):57-65, 1979.Google ScholarDigital Library
- I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan. "Chord: A scalable peer-to-peer lookup service for Internet applications". Proceedings of the SIGCOMM 2001, August 2001. Google ScholarDigital Library
- B. Y. Zhao, J. D. Kubiatowicz and A. D. Joseph. "Tapestry: An infrastructure for fault-tolerant wide-area location and routing". U. C. Berkeley Technical Report UCB/CSD-01-1141, April, 2001. Google ScholarDigital Library
- Viceroy: a scalable and dynamic emulation of the butterfly
Recommendations
Parallel integer sorting and simulation amongst CRCW models
AbstractIn this paper a general technique for reducing processors in simulation without any increase in time is described. This results in an O(√logn) time algorithm for simulating one step of PRIORITY on TOLERANT with processor-time product of O(n log ...
Brief Announcement: An Exponential Separation Between Randomized and Deterministic Complexity in the LOCAL Model
PODC '16: Proceedings of the 2016 ACM Symposium on Principles of Distributed ComputingOver the past 30 years numerous algorithms have been designed for symmetry breaking problems in the LOCAL model, such as maximal matching, MIS, vertex coloring, and edge-coloring. For most problems the best randomized algorithm is at least exponentially ...
Super-linear time-space tradeoff lower bounds for randomized computation
FOCS '00: Proceedings of the 41st Annual Symposium on Foundations of Computer ScienceWe prove the first time-space lower bound tradeoffs for randomized computation of decision problems. The bounds hold even in the case that the computation is allowed to have arbitrary probability of error on a small fraction of inputs. Our techniques ...
Comments