Article

Fast construction of overlay networks

Authors:

Yitong YinAuthors Info & Claims

SPAA '05: Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures

Pages 145 - 154

https://doi.org/10.1145/1073970.1073991

Published: 18 July 2005 Publication History

Abstract

An asynchronous algorithm is described for rapidly constructing an overlay network in a peer-to-peer system where all nodes can in principle communicate with each other directly through an underlying network, but each participating node initially has pointers to only a handful of other participants. The output of the mechanism is a linked list of all participants sorted by their identifiers, which can be used as a foundation for building various linear overlay networks such as Chord or skip graphs. Assuming the initial pointer graph is weakly-connected with maximum degree d and the length of a node identifier is W, the mechanism constructs a binary search tree of nodes of depth O(W) in expected O(W log n) time using expected O((d+W)n log n) messages of size O(W) each. Furthermore, the algorithm has low contention: at any time there are only O(d) undelivered messages for any given recipient. A lower bound of Ω(d + log n) is given for the running time of any procedure in a related synchronous model that yields a sorted list from a degree-d weakly-connected graph of n nodes. We conjecture that this lower bound is tight and could be attained by further improvements to our algorithms.

References

[1]

K. Aberer. P-Grid: A self-organizing access structure for P2P information systems. Lecture Notes in Computer Science, 2172:179--194, 2001.]]

Digital Library

[2]

I. Abraham and D. Dolev. Asynchronous resource discovery. In Proceedings of the twenty-second annual symposium on Principles of distributed computing, pages 143--150. ACM Press, 2003.]]

Digital Library

[3]

J. Aspnes and G. Shah. Skip Graphs. In Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 384--393, Baltimore, MD, USA, Jan. 2003. Submitted to a special issue of Journal of Algorithms dedicated to select papers of SODA 2003.]]

Digital Library

[4]

I. Cidon, I. Gopal, and S. Kutten. New models and algorithms for future networks. IEEE Transactions on Information Theory, 41(3):769--780, May 1995.]]

Digital Library

[5]

R. de la Briandais. File searching using variable length keys. In Proceedings of the Western Joint Computer Conference, volume 15, pages 295--298, Montvale, NJ, USA, 1959.]]

Digital Library

[6]

E. Fredkin. Trie Memory. Communications of the ACM, 3(9):490--499, Sept. 1960.]]

Digital Library

[7]

M. J. Freedman and R. Vingralek. Efficient peer-to-peer lookup based on a distributed trie. In Proceedings of the 1st International Workshop on Peer-to-Peer Systems (IPTPS02), Cambridge, MA, March 2002.]]

Digital Library

[8]

R. G. Gallager, P. A. Humblet, and P. M. Spira. A distributed algorithm for minimum-weight spanning trees. ACM Trans. Program. Lang. Syst., 5(1):66--77, 1983.]]

Digital Library

[9]

M. T. Goodrich and S. R. Kosaraju. Sorting on a parallel pointer machine with applications to set expression evaluation. J. ACM, 43(2):331--361, 1996.]]

Digital Library

[10]

M. Harchol-Balter, T. Leighton, and D. Lewin. Resource discovery in distributed networks. In Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing, pages 229--237. ACM Press, 1999.]]

Digital Library

[11]

A. Israeli and A. Itai. A fast and simple randomized parallel algorithm for maximal matching. Information Processing Letters, 22(2):77--80, 1986.]]

[12]

T. Johnson and P. Krishna. Lazy updates for distributed search structure. In P. Buneman and S. Jajodia, editors, Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, Washington, D.C., May 26-28, 1993, pages 337--346. ACM Press, 1993.]]

Digital Library

[13]

S. Kutten and D. Peleg. Asynchronous resource discovery in peer to peer networks. In 21st IEEE Symposium on Reliable Distributed Systems (SRDS'02), pages 224--231, October 13--16, 2002.]]

Digital Library

[14]

S. Kutten, D. Peleg, and U. Vishkin. Deterministic resource discovery in distributed networks. In Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures, pages 77--83. ACM Press, 2001.]]

Digital Library

[15]

R. E. Ladner and M. J. Fischer. Parallel prefix computation. J. ACM, 27(4):831--838, 1980.]]

Digital Library

[16]

C. Law and K.-Y. Siu. An O(log n) randomized resource discovery algorithm. In Brief Announcements of the 14th International Symposium on Distributed Computing, Technical University of Madrid, Technical Report FIM/110.1/DLSIIS/2000, pages 5--8, Oct. 2000.]]

[17]

D. R. Morrison. Patricia---practical algorithm to retrieve information coded in alphanumeric. J. ACM, 15(4):514--534, 1968.]]

Digital Library

[18]

C. Okasaki and A. Gill. Fast mergeable integer maps. In Workshop on ML, pages 77--86, 1998.]]

[19]

I. Stoica, R. Morris, D. Liben-Nowell, D. R. Karger, M. F. Kaashoek, F. Dabek, and H. Balakrishnan. Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications. IEEE/ACM Transactions on Networking, 11(1):17--32, Feb. 2003.]]

Digital Library

[20]

R. Uehara and Z.-Z. Chen. Parallel approximation algorithms for maximum weighted matching in general graphs. In Proceedings of IFIP TCS 2000, pages 84--98. Springer-Verlag, LNCS 1872, 2000.]]

Digital Library

[21]

H. Yokota, Y. Kanemasa, and J. Miyazaki. Fat-btree: An update-conscious parallel directory structure. In Proceedings of the 15th International Conference on Data Engineering, 23-26 March 1999, Sydney, Austrialia, pages 448--457. IEEE Computer Society, 1999.]]

Digital Library

Cited By

Mertzios GMichail OSkretas GSpirakis PTheofilatos M(2024)The complexity of growing a graphJournal of Computer and System Sciences10.1016/j.jcss.2024.103587(103587)Online publication date: Sep-2024
https://doi.org/10.1016/j.jcss.2024.103587
Götte THinnenthal KScheideler CWerthmann J(2023)Time-optimal construction of overlay networksDistributed Computing10.1007/s00446-023-00442-436:3(313-347)Online publication date: 15-Feb-2023
https://doi.org/10.1007/s00446-023-00442-4
Augustine JChoudhary KCohen APeleg DSivasubramaniam SSourav S(2022)Distributed Graph RealizationsIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2021.310423933:6(1321-1337)Online publication date: 1-Jun-2022
https://doi.org/10.1109/TPDS.2021.3104239
Show More Cited By

Index Terms

Fast construction of overlay networks
1. Software and its engineering
  1. Software organization and properties
    1. Software system structures
      1. Distributed systems organizing principles
        Organizing principles for web applications
2. Theory of computation
  1. Design and analysis of algorithms

Recommendations

C²: a new overlay network based on CAN and Chord

In this paper, we present C², a new overlay network based on CAN and Chord. It is primarily designed for a dynamic environment in which peers join and depart the network frequently. For an n-peers C² system, each peer maintains only about O(log n) of ...
Faster Construction of Overlay Networks
Structural Information and Communication Complexity
Abstract
We consider the problem of transforming any weakly connected overlay network of polylogarithmic degree into a topology of logarithmic diameter. The overlay network is modeled as a directed graph, in which messages are sent in synchronous rounds, ...
Increasing QoS in Selfish Overlay Networks

A routing overlay network is an application-layer overlay on the existing Internet routing substrate that allows an alternative routing service. Recent studies have suggested that such networks might contain selfish nodes, which develop their strategies ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SPAA '05: Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures

July 2005

346 pages

ISBN:1581139861

DOI:10.1145/1073970

General Chair:
Phil Gibbons
Intel Research
,
Program Chair:
Paul Spirakis
Research and Academic Computer Technology Institute, Greece

Copyright © 2005 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 18 July 2005

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

SPAA05

Sponsor:

SPAA05: 17th ACM Symposium on Parallelism in Algorithms and Architectures 2005

July 18 - 20, 2005

Nevada, Las Vegas, USA

Acceptance Rates

Overall Acceptance Rate 447 of 1,461 submissions, 31%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

41
Total Citations
View Citations
589
Total Downloads

Downloads (Last 12 months)12
Downloads (Last 6 weeks)1

Reflects downloads up to 01 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Mertzios GMichail OSkretas GSpirakis PTheofilatos M(2024)The complexity of growing a graphJournal of Computer and System Sciences10.1016/j.jcss.2024.103587(103587)Online publication date: Sep-2024
https://doi.org/10.1016/j.jcss.2024.103587
Götte THinnenthal KScheideler CWerthmann J(2023)Time-optimal construction of overlay networksDistributed Computing10.1007/s00446-023-00442-436:3(313-347)Online publication date: 15-Feb-2023
https://doi.org/10.1007/s00446-023-00442-4
Augustine JChoudhary KCohen APeleg DSivasubramaniam SSourav S(2022)Distributed Graph RealizationsIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2021.310423933:6(1321-1337)Online publication date: 1-Jun-2022
https://doi.org/10.1109/TPDS.2021.3104239
Mertzios GMichail OSkretas GSpirakis PTheofilatos M(2022)The Complexity of Growing a GraphAlgorithmics of Wireless Networks10.1007/978-3-031-22050-0_9(123-137)Online publication date: 13-Dec-2022
https://doi.org/10.1007/978-3-031-22050-0_9
Connor MMichail OSpirakis P(2021)On the Distributed Construction of Stable Networks in Polylogarithmic Parallel TimeInformation10.3390/info1206025412:6(254)Online publication date: 19-Jun-2021
https://doi.org/10.3390/info12060254
Michail OSkretas GSpirakis P(2021)Distributed computation and reconfiguration in actively dynamic networksDistributed Computing10.1007/s00446-021-00415-5Online publication date: 19-Dec-2021
https://doi.org/10.1007/s00446-021-00415-5
Chatterjee DRao S(2020)Computational SustainabilityACM Computing Surveys10.1145/340979753:5(1-29)Online publication date: 28-Sep-2020
https://dl.acm.org/doi/10.1145/3409797
Davoudian ALiu M(2020)Big Data SystemsACM Computing Surveys10.1145/340831453:5(1-39)Online publication date: 28-Sep-2020
https://dl.acm.org/doi/10.1145/3408314
Álvarez-García JCvetković BLuštrek M(2020)A Survey on Energy Expenditure Estimation Using Wearable DevicesACM Computing Surveys10.1145/340448253:5(1-35)Online publication date: 28-Sep-2020
https://dl.acm.org/doi/10.1145/3404482
Sharma PJindal RBorah M(2020)Blockchain Technology for Cloud StorageACM Computing Surveys10.1145/340395453:4(1-32)Online publication date: 3-Aug-2020
https://dl.acm.org/doi/10.1145/3403954
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents