NDLI: Enabling Robust and Efficient Distributed Computation in Dynamic Peer-to-Peer Networks

Content Provider	IEEE Xplore Digital Library
Author	Augustine, J. Pandurangan, G. Robinson, P. Roche, S. Upfal, E.
Copyright Year	2015
Description	Author affiliation: Dept. of Comput. Sci., Univ. of Houston, Houston, TX, USA (Pandurangan, G.) \|\| Dept. of Comput. Sci. & Eng., Indian Inst. of Technol. Madras, Chennai, India (Augustine, J.) \|\| Coll. of Comput. & Inf. Sci., Northeastern Univ., Boston, MA, USA (Roche, S.) \|\| Queen's Univ. Belfast, Belfast, UK (Robinson, P.) \|\| Dept. of Comput. Sci., Brown Univ., Providence, RI, USA (Upfal, E.)
Abstract	Motivated by the need for designing efficient and robust fully-distributed computation in highly dynamic networks such as Peer-to-Peer (P2P) networks, we study distributed protocols for constructing and maintaining dynamic network topologies with good expansion properties. Our goal is to maintain a sparse (bounded degree) expander topology despite heavy churn (i.e., Nodes joining and leaving the network continuously over time). We assume that the churn is controlled by an adversary that has complete knowledge and control of what nodes join and leave and at what time and has unlimited computational power, but is oblivious to the random choices made by the algorithm. Our main contribution is a randomized distributed protocol that guarantees with high probability the maintenance of a constant degree graph with high expansion even under continuous high adversarial churn. Our protocol can tolerate a churn rate of up to O(n/polylog(n)) per round (where n is the stable network size). Our protocol is efficient, lightweight, and scalable, and it incurs only O(polylog(n)) overhead for topology maintenance: only polylogarithmic(in n) bits needs to be processed and sent by each node per round and any node's computation cost per round is also polylogarithmic. The given protocol is a fundamental ingredient that is needed for the design of efficient fully-distributed algorithms for solving fundamental distributed computing problems such as agreement, leader election, search, and storage in highly dynamic P2P networks and enables fast and scalable algorithms for these problems that can tolerate a large amount of churn.
Starting Page	350
Ending Page	369
File Size	334837
Page Count	20
File Format	PDF
ISBN	9781467381918
ISSN	02725428
DOI	10.1109/FOCS.2015.29
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2015-10-17
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Protocols Peer-to-peer computing Heuristic algorithms Network topology Topology Maintenance engineering Robustness expander graph dynamic network P2P computing distributed computation randomized protocol churn fault-tolerance
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

An Age-Based Membership Protocol against Strong Churn in Unstructured P2P Networks

A hybrid P2P overlay network for high efficient search

Leader Election in Sparse Dynamic Networks with Churn

Fault tolerance in distributed genetic algorithms with tree topologies

Distributed construction of random expander networks

Towards robust and efficient computation in dynamic peer-to-peer networks (2012).

Efficient Network Coding Algorithms for Dynamic Networks

Proactive repair redundancy algorithms for distributed storage in P2P networks

Topology, search, and fault tolerance in unstructured P2P networks

Enabling Robust and Efficient Distributed Computation in Dynamic Peer-to-Peer Networks

Similar Documents

An Age-Based Membership Protocol against Strong Churn in Unstructured P2P Networks

A hybrid P2P overlay network for high efficient search

Leader Election in Sparse Dynamic Networks with Churn

Fault tolerance in distributed genetic algorithms with tree topologies

Distributed construction of random expander networks

Towards robust and efficient computation in dynamic peer-to-peer networks (2012).

Efficient Network Coding Algorithms for Dynamic Networks

Proactive repair redundancy algorithms for distributed storage in P2P networks

Topology, search, and fault tolerance in unstructured P2P networks

Enabling Robust and Efficient Distributed Computation in Dynamic Peer-to-Peer Networks