Degree 3 Suffices: A Large-Scale Overlay for P2P Networks
- 636 Downloads
Most peer-to-peer (P2P) networks proposed until now have either logarithmic degree and logarithmic dilation or constant degree and logarithmic dilation. In the latter case (which is optimal up to constant factors), the constant degree is achieved either in expectation or with high probability. We propose the first overlay network, called SkewCCC, with a maximum degree of 3 (minimum possible) and logarithmic dilation. Our approach can be viewed as a decentralized and distorted version of a Cube Connected Cycles network. Additionally, basic network operations such as join and leave take logarithmic time and are very simple to implement, which makes our construction viable in fields other than P2P networks. A very good example is scatternet construction for Bluetooth devices, in which case it is crucial to keep the degree at most 7.
KeywordsOverlay Network Distribute Hash Table Core Node Logarithmic Time Split Operation
Unable to display preview. Download preview PDF.
- 1.Aspnes, J., Shah, G.: Skip graphs. ACM Transactions on Algorithms 3(4) (2007); Also appeared in: Proc. of the 14th SODA, pp. 384–393 (2003)Google Scholar
- 2.Awerbuch, B., Scheideler, C.: The hyperring: a low-congestion deterministic data structure for distributed environments. In: Proc. of the 15th ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 318–327 (2004)Google Scholar
- 3.Barrière, L., Fraigniaud, P., Narayanan, L., Opatrny, J.: Dynamic construction of bluetooth scatternets of fixed degree and low diameter. In: Proc. of the 14th ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 781–790 (2003)Google Scholar
- 4.Bienkowski, M., Brinkmann, A., Korzeniowski, M., Orhan, O.: Cube connected cycles based bluetooth scatternet formation. In: Proc. of the 4th International Conference on Networking, pp. 413–420 (2005)Google Scholar
- 5.Harvey, N.J.A., Jones, M.B., Saroiu, S., Theimer, M., Wolman, A.: Skipnet: a scalable overlay network with practical locality properties. In: Proc. of the 4th USENIX Symposium on Internet Technologies and Systems (2003)Google Scholar
- 6.Jiang, X., Polastre, J., Culler, D.: Perpetual environmentally powered sensor networks. In: Proc. of the 4th Int. Symp. on Information Processing in Sensor Networks (IPSN), pp. 463–468 (2005)Google Scholar
- 7.Karger, D., Lehman, E., Leighton, T., Levine, M., Lewin, D., Panigrahy, R.: Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the world wide web. In: Proc. of the 29th ACM Symp. on Theory of Computing (STOC), pp. 654–663 (1997)Google Scholar
- 9.Malkhi, D., Naor, M., Ratajczak, D.: Viceroy: A scalable and dynamic emulation of the butterfly. In: Proc. of the 21st ACM Symp. on Principles of Distributed Computing (PODC), pp. 183–192 (2002)Google Scholar
- 10.Naor, M., Wieder, U.: Novel architectures for P2P applications: The continuous-discrete approach. ACM Transactions on Algorithms 3(3) (2007); Also appeared in: Proc. of the 15th SPAA, pp 50–59 (2003)Google Scholar
- 12.Stoica, I., Morris, R., Liben-Nowell, D., Karger, D.R., Kaashoek, M.F., Dabek, F., Balakrishnan, H.: Chord: a scalable peer-to-peer lookup protocol for internet applications. IEEE/ACM Transactions on Networking 11(1), 17–32 (2003); In: Proc. of the ACM SIGCOMM, pp. 149–160 (2001)CrossRefGoogle Scholar