p2p-biblio-20181106.bib

gistfile1.txt

@article{Freedman,
author = {Freedman, Michael J and Mazi, David},
file = {:Users/raul/Documents/Mendeley/coral-iptps03.pdf:pdf},
mendeley-groups = {Peer-to-peer networks},
title = {{Sloppy hashing and self-organizing clusters}}
}
@article{Baumgart2014,
author = {Baumgart, Ingmar and Mies, Sebastian},
doi = {10.1109/ICPADS.2007.4447808},
file = {:Users/raul/Documents/Mendeley/download.pdf:pdf},
mendeley-groups = {Peer-to-peer networks},
number = {June},
title = {{S / Kademlia : A practicable approach towards secure key-based routing S / Kademlia : A Practicable Approach Towards Secure Key-Based Routing}},
year = {2014}
}
@inproceedings{10.1007/3-540-45748-8_5,
abstract = {We describe a peer-to-peer distributed hash table with provable consistency and performance in a fault-prone environment. Our system routes queries and locates nodes using a novel XOR-based metric topology that simplifies the algorithm and facilitates our proof. The topology has the property that every message exchanged conveys or reinforces useful contact information. The system exploits this information to send parallel, asynchronous query messages that tolerate node failures without imposing timeout delays on users.},
address = {Berlin, Heidelberg},
author = {Maymounkov, Petar and Mazi{\`{e}}res, David},
booktitle = {Peer-to-Peer Systems},
doi = {10.1007/3-540-45748-8_5},
editor = {Druschel, Peter and Kaashoek, Frans and Rowstron, Antony},
file = {:Users/raul/Documents/Mendeley/maymounkov-kademlia-lncs.pdf:pdf},
isbn = {978-3-540-45748-0},
mendeley-groups = {Peer-to-peer networks},
pages = {53--65},
publisher = {Springer Berlin Heidelberg},
title = {{Kademlia: A Peer-to-Peer Information System Based on the XOR Metric}},
year = {2002}
}
@article{Wang2014,
author = {Wang, Xiao Sophia and Balasubramanian, Aruna and Krishnamurthy, Arvind and Wetherall, David and Nsdi, Implementation},
file = {:Users/raul/Documents/Mendeley/nsdi14-paper-wang{\_}xiao{\_}sophia.pdf:pdf},
isbn = {9781931971096},
mendeley-groups = {Peer-to-peer networks},
title = {{How Speedy is SPDY ? This paper is included in the Proceedings of the}},
year = {2014}
}
@article{Iyengar2019,
author = {Iyengar, J and Thomson, M},
file = {:Users/raul/Documents/Mendeley/draft-ietf-quic-transport-16.pdf:pdf},
mendeley-groups = {Peer-to-peer networks},
pages = {1--135},
title = {{QUIC: A UDP-Based Multiplexed and Secure Transport draft-ietf-quic-transport-16}},
year = {2019}
}
@article{Winstein,
author = {Winstein, Keith and Balakrishnan, Hari},
file = {:Users/raul/Documents/Mendeley/sigcomm13.pdf:pdf},
isbn = {9781450320566},
mendeley-groups = {Peer-to-peer networks},
title = {{TCP ex Machina : Computer-Generated Congestion Control}}
}
@article{Kermarrec2013,
author = {Kermarrec, Anne-marie and Bretagne-atlantique, Inria Rennes},
file = {:Users/raul/Documents/Mendeley/kermarrec2013.pdf:pdf},
mendeley-groups = {Peer-to-peer networks},
number = {2},
pages = {1--46},
title = {{XL Peer-to-Peer Pub / Sub Systems}},
volume = {46},
year = {2013}
}
@article{Lu2007,
author = {Lu, Pereira and Di, Rodrigues and Tr, Fcul},
file = {:Users/raul/Documents/Mendeley/dsn07-leitao.pdf:pdf},
mendeley-groups = {Peer-to-peer networks},
title = {{HyParView : a membership protocol for reliable gossip-based broadcast}},
year = {2007}
}
@article{Tang,
author = {Tang, Chunqiang and Chang, Rong N and Ward, Christopher},
file = {:Users/raul/Documents/Mendeley/10.1.1.75.4811.pdf:pdf},
mendeley-groups = {Peer-to-peer networks},
title = {{GoCast : Gossip-Enhanced Overlay Multicast for Fast and Dependable Group Communication}}
}
@article{Surati2017,
abstract = {Implementation of a P2P (Peer-to-Peer) overlay network directly on the realistic network environments is not a feasible initiative as scalability is a major challenge for P2P. The implementation of newly created P2P networks must be analyzed, well tested and evaluated through experiments by researchers and organizations. Various simulators have been developed to analyze and simulate P2P protocols before applying to real applications. However, selection of an appropriate simulator suitable for a given application requires a prior comprehensive survey of P2P simulators. The existing literature survey of P2P simulators has limitations viz. (i) all P2P related simulators have not been included, (ii) all design criteria for comparison and appropriate selection of the simulator may not be considered, (iii) appropriate practical application through the simulation has not been presented to enhance the outcome of a survey. To overcome these limitations, we survey existing simulators with classifications, additional design parameters, limitations and comparison using various criteria. In addition, we discuss about common interface concept that creates a generic application to make the implementation of targeted application portable. Not only that, we present a case study of implementation of BATON (BAlanced Tree Overlay Network) and BATON* using an event-driven model of PeerSim simulator that helps the developers to simulate the tree overlays efficiently.},
author = {Surati, Shivangi and Jinwala, Devesh C. and Garg, Sanjay},
doi = {10.1016/j.jestch.2016.12.010},
file = {:Users/raul/Documents/Mendeley/1-s2.0-S2215098616306012-main.pdf:pdf},
issn = {22150986},
journal = {Engineering Science and Technology, an International Journal},
keywords = {Distributed computing,Network simulation,Overlay networks,Peer-to-Peer simulators,Peer-to-Peer systems},
mendeley-groups = {Peer-to-peer networks},
number = {2},
pages = {705--720},
publisher = {Karabuk University},
title = {{A survey of simulators for P2P overlay networks with a case study of the P2P tree overlay using an event-driven simulator}},
url = {http://dx.doi.org/10.1016/j.jestch.2016.12.010},
volume = {20},
year = {2017}
}
@techreport{VanRenesse,
abstract = {The paper shows that anti-entropy protocols can process only a limited rate of updates, and proposes and evaluates a new state reconciliation mechanism as well as a flow control scheme for anti-entropy protocols.},
author = {{Van Renesse}, Robbert and Dumitriu, Dan and Gough, Valient and Thomas, Chris},
file = {:Users/raul/Documents/Mendeley/Van Renesse et al. - Unknown - Efficient Reconciliation and Flow Control for Anti-Entropy Protocols.pdf:pdf},
keywords = {C21 [Computer-Com-munication Networks]: Network Architecture and Design-network communications,C24 [Computer-Communic-ation Networks]: Distributed Systems-distributed appli-cations,D13 [Programming Techniques]: Concurrent Programming-distributed programming,D44 [Operating Systems]: Communications Management-network com-munication,D45 [Operating Systems]: Reliability-fault tolerance,General Terms: Algorithms, Reliability Additional Key Words and Phrases: Epidemics, Anti-Entropy, Gossip, Flow Control},
mendeley-groups = {Peer-to-peer networks},
title = {{Efficient Reconciliation and Flow Control for Anti-Entropy Protocols}},
url = {https://www.cs.cornell.edu/home/rvr/papers/flowgossip.pdf}
}
@article{Surati2017a,
abstract = {Implementation of a P2P (Peer-to-Peer) overlay network directly on the realistic network environments is not a feasible initiative as scalability is a major challenge for P2P. The implementation of newly created P2P networks must be analyzed, well tested and evaluated through experiments by researchers and organizations. Various simulators have been developed to analyze and simulate P2P protocols before applying to real applications. However, selection of an appropriate simulator suitable for a given application requires a prior comprehensive survey of P2P simulators. The existing literature survey of P2P simulators has limitations viz. (i) all P2P related simulators have not been included, (ii) all design criteria for comparison and appropriate selection of the simulator may not be considered, (iii) appropriate practical application through the simulation has not been presented to enhance the outcome of a survey. To overcome these limitations, we survey existing simulators with classifications, additional design parameters, limitations and comparison using various criteria. In addition, we discuss about common interface concept that creates a generic application to make the implementation of targeted application portable. Not only that, we present a case study of implementation of BATON (BAlanced Tree Overlay Network) and BATON* using an event-driven model of PeerSim simulator that helps the developers to simulate the tree overlays efficiently.},
author = {Surati, Shivangi and Jinwala, Devesh C. and Garg, Sanjay},
doi = {10.1016/J.JESTCH.2016.12.010},
issn = {2215-0986},
journal = {Engineering Science and Technology, an International Journal},
mendeley-groups = {Peer-to-peer networks},
month = {apr},
number = {2},
pages = {705--720},
publisher = {Elsevier},
title = {{A survey of simulators for P2P overlay networks with a case study of the P2P tree overlay using an event-driven simulator}},
url = {https://www.sciencedirect.com/science/article/pii/S2215098616306012},
volume = {20},
year = {2017}
}
@article{Malatras2015,
author = {Malatras, Apostolos},
doi = {10.1016/j.jnca.2015.04.014},
file = {:Users/raul/Documents/Mendeley/Malatras - 2015 - State-of-the-art survey on P2P overlay networks in pervasive computing environments.pdf:pdf},
keywords = {top priority},
mendeley-groups = {Peer-to-peer networks},
mendeley-tags = {top priority},
title = {{State-of-the-art survey on P2P overlay networks in pervasive computing environments}},
url = {http://dx.doi.org/10.1016/j.jnca.2015.04.014},
year = {2015}
}
@book{,
doi = {10.1007/978-3-319-21840-3},
file = {:Users/raul/Documents/Mendeley/Unknown - 2015 - Polylogarithmic Fully Retroactive Priority Queues via Hierarchical Checkpointing.pdf:pdf},
isbn = {978-3-319-21839-7},
mendeley-groups = {Peer-to-peer networks},
title = {{Polylogarithmic Fully Retroactive Priority Queues via Hierarchical Checkpointing}},
year = {2015}
}
@article{Bloom1970,
abstract = {In this paper trade-offs among certain computational factors in hash coding are analyzed. The paradigm problem considered is that of testing a series of messages one-by-one for membership in a given set of messages. Two new hash-coding methods are examined and compared with a particular conventional hash-coding method. The computational factors considered are the size of the hash area (space), the time required to identify a message as a nonmember of the given set (reject time), and an allowable error frequency. The new methods are intended to reduce the amount of space required to contain the hash-coded information from that associated with conventional methods. The reduction in space is accomplished by exploiting the possibility that a small fraction of errors of commission may be tolerable in some applications, in particular, applications in which a large amount of data is involved and a core resident hash area is consequently not feasible using conventional methods. In such applications, it is envisaged that overall performance could be improved by using a smaller core resident hash area in conjunction with the new methods and, when necessary, by using some secondary and perhaps time-consuming test to “catch” the small fraction of errors associated with the new methods. An example is discussed which illustrates possible areas of application for the new methods. Analysis of the paradigm problem demonstrates that allowing a small number of test messages to be falsely identified as members of the given set will permit a much smaller hash area to be used without increasing reject time.},
archivePrefix = {arXiv},
arxivId = {arXiv:1011.1669v3},
author = {Bloom, Burton H.},
doi = {10.1145/362686.362692},
eprint = {arXiv:1011.1669v3},
file = {:Users/raul/Documents/Mendeley/Bloom - 1970 - Spacetime trade-offs in hash coding with allowable errors.pdf:pdf},
isbn = {0001-0782},
issn = {00010782},
journal = {Communications of the ACM},
mendeley-groups = {Computer Science,Peer-to-peer networks},
pmid = {25246403},
title = {{Space/time trade-offs in hash coding with allowable errors}},
year = {1970}
}
@article{Leitao2010,
abstract = {Gossip, or epidemic, protocols have emerged as a powerful strategy to implement highly scalable and resilient reliable broadcast primitives on large scale peer-to-peer networks. Epidemic protocols are scalable because they distribute the load among all nodes in the system and resilient because they have an intrinsic level of redundancy that masks node and network failures. This chapter provides an introduction to gossip-based broadcast on large- scale unstructured peer-to-peer overlay networks: it surveys the main results in the field, discusses techniques to build and maintain the overlays that support efficient dissemination strategies, and provides an in-depth discussion and experimental evaluation of two concrete protocols, named HyParView and Plumtree.},
author = {Leit{\~{a}}o, Jo{\~{a}}o and Pereira, Jos{\'{e}} and Rodrigues, Lu{\'{i}}s},
journal = {Handbook of Peer-to-Peer Networking},
mendeley-groups = {Computer Science,Peer-to-peer networks},
title = {{Gossip-based broadcast}},
year = {2010}
}
@article{Frey2009,
abstract = {Gossip-based information dissemination protocols are considered easy to deploy, scalable and resilient to network dynamics. Load-balancing is inherent in these protocols as the dissemination work is evenly spread among all nodes. Yet, large-scale distributed systems are usually heterogeneous with respect to network capabilities such as bandwidth. In practice, a blind load-balancing strategy might significantly hamper the performance of the gossip dissemination.$\backslash$n$\backslash$nThis paper presents HEAP, HEterogeneity-Aware gossip Protocol, where nodes dynamically adapt their contribution to the gossip dissemination according to their bandwidth capabilities. Using a continuous, itself gossip-based, approximation of relative bandwidth capabilities, HEAP dynamically leverages the most capable nodes by increasing their fanout, while decreasing by the same proportion that of less capable nodes. HEAP preserves the simple and proactive (churn adaptation) nature of gossip, while significantly improving its effectiveness. We extensively evaluate HEAP in the context of a video streaming application on a testbed of 270 PlanetLab nodes. Our results show that HEAP significantly improves the quality of the streaming over standard homogeneous gossip protocols, especially when the stream rate is close to the average available bandwidth.},
author = {Frey, Davide and Guerraoui, Rachid and Kermarrec, Anne Marie and Koldehofe, Boris and Mogensen, Martin and Monod, Maxime and Qu{\'{e}}ma, Vivien},
journal = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
mendeley-groups = {Computer Science,Peer-to-peer networks},
title = {{Heterogeneous gossip}},
year = {2009}
}
@article{Leitao2012,
abstract = {Gossip, or epidemic, protocols have emerged as a highly scalable and resilient approach to implement several application level services such as reliable multicast, data aggregation, publish-subscribe, among others. All these protocols organize nodes in an unstructured random overlay network. In many cases, it is interesting to bias the random overlay in order to optimize some efficiency criteria, for instance, to reduce the stretch of the overlay routing. In this paper we propose X-BOT, a new protocol that allows to bias the topology of an unstructured gossip overlay network. X-BOT is completely decentralized and, unlike previous approaches, preserves several key properties of the original (non-biased) overlay (most notably, the node degree and consequently, the overlay connectivity). Experimental results show that X-BOT can generate more efficient overlays than previous approaches.},
author = {Leit{\~{a}}o, Jo{\~{a}}o and Marques, Jo{\~{a}}o Pedro and Pereira, Jos{\'{e}} and Rodrigues, Lu{\'{i}}s},
journal = {IEEE Transactions on Parallel and Distributed Systems},
mendeley-groups = {Computer Science,Peer-to-peer networks},
title = {{X-BOT: A protocol for resilient optimization of unstructured overlay networks}},
year = {2012}
}
@techreport{Leitao,
abstract = {Gossip, or epidemic, protocols have emerged as a powerful strategy to implement highly scalable and resilient reliable broadcast primitives on large scale peer-to-peer networks.},
author = {Leit{\~{a}}o, Jo{\~{a}}o and Pereira, Jos{\'{e}} and Rodrigues, Lu{\'{i}}s},
file = {:Users/raul/Documents/Mendeley/Leit{\~{a}}o, Pereira, Rodrigues - Unknown - Gossip-Based Broadcast.pdf:pdf},
mendeley-groups = {Computer Science,Peer-to-peer networks},
title = {{Gossip-Based Broadcast}},
url = {http://www.springer.com/engineering/signals/book/978-0-387-09750-3}
}
@article{Tang2011,
abstract = {This paper presents a rigorous analytic study of gossip-based message dissemination schemes that can be employed for content/service dissemination or discovery in unstructured and distributed networks. When using random gossiping, communication with multiple peers in one gossiping round is allowed. The algorithms studied in this paper are considered under different network conditions, depending on the knowledge of the state of the neighboring nodes in the network. Different node behaviors, with respect to their degree of cooperation and compliance with the gossiping process, are also incorporated. From the exact analysis, several important performance metrics and design parameters are analytically determined. Based on the proposed metrics and parameters, the performance of the gossip-based dissemination or search schemes, as well as the impact of the design parameters, are evaluated. {\textcopyright} 2010 Elsevier B.V. All rights reserved.},
author = {Tang, Siyu and Jaho, Eva and Stavrakakis, Ioannis and Koukoutsidis, Ioannis and Mieghem, Piet Van},
doi = {10.1016/j.comcom.2010.10.001},
issn = {01403664},
journal = {Computer Communications},
keywords = {Content dissemination/search,Distributed networking,Gossip-based algorithms},
mendeley-groups = {Computer Science,Peer-to-peer networks},
title = {{Modeling gossip-based content dissemination and search in distributed networking}},
year = {2011}
}
@techreport{Mitzenmacher2012,
abstract = {Large data sets are increasingly common in cloud and virtualized environments. For example, transfers of multiple gigabytes are commonplace, as are replicated blocks of such sizes. There is a need for fast error-correction or data reconciliation in such settings even when the expected number of errors is small. Motivated by such cloud reconciliation problems, we consider error-correction schemes designed for large data, after explaining why previous approaches appear unsuitable. We introduce Biff codes, which are based on Bloom filters and are designed for large data. For Biff codes with a message of length L and E errors, the encoding time is O(L), decoding time is O(L + E) and the space overhead is O(E). Biff codes are low-density parity-check codes; they are similar to Tornado codes, but are designed for errors instead of erasures. Further, Biff codes are designed to be very simple, removing any explicit graph structures and based entirely on hash tables. We derive Biff codes by a simple reduction from a set reconciliation algorithm for a recently developed data structure, invertible Bloom lookup tables. While the underlying theory is extremely simple, what makes this code especially attractive is the ease with which it can be implemented and the speed of decoding. We present results from a prototype implementation that decodes messages of 1 million words with thousands of errors in well under a second.},
archivePrefix = {arXiv},
arxivId = {arXiv:1208.0798v1},
author = {Mitzenmacher, Michael and Varghese, George},
eprint = {arXiv:1208.0798v1},
file = {:Users/raul/Documents/Mendeley/Mitzenmacher, Varghese - 2012 - Biff (Bloom Filter) Codes Fast Error Correction for Large Data Sets.pdf:pdf},
keywords = {()},
mendeley-groups = {Computer Science,Peer-to-peer networks},
title = {{Biff (Bloom Filter) Codes: Fast Error Correction for Large Data Sets}},
url = {https://arxiv.org/pdf/1208.0798.pdf},
year = {2012}
}
@techreport{Bernier,
author = {Bernier, Yahn W},
file = {:Users/raul/Documents/Mendeley/Bernier - Unknown - Latency Compensating Methods in ClientServer In-game Protocol Design and Optimization.pdf:pdf},
mendeley-groups = {Computer Science,Peer-to-peer networks},
title = {{Latency Compensating Methods in Client/Server In-game Protocol Design and Optimization}},
url = {http://web.cs.wpi.edu/{~}claypool/courses/4513-B03/papers/games/bernier.pdf}
}
@techreport{Kermarrec,
abstract = {Gossip-based algorithms were first introduced for reliably disseminating data in large-scale distributed systems. However, their simplicity , robustness, and flexibility make them attractive for more than just pure data dissemination alone. In particular, gossiping has been applied to data aggregation, overlay maintenance, and resource allocation. Gossiping applications more or less fit the same framework, with often subtle differences in algorithmic details determining divergent emergent behavior. This divergence is often difficult to understand, as formal models have yet to be developed that can capture the full design space of gossiping solutions. In this paper, we present a brief introduction to the field of gossip-ing in distributed systems, by providing a simple framework and using that framework to describe solutions for various application domains. 1. THE GOSSIP REVIVAL Gossiping in distributed systems refers to the repeated probabilis-tic exchange of information between two members. Probabilis-tic choice is a key element of gossiping, and in general refers to the choice of member pairs that communicate. Repetition is also crucial: in principle, gossiping is the endless process of randomly choosing two members and subsequently letting these two exchange information. The effect of gossiping is that information can spread within a group just as it would in real life. In a sense, this is a strongly related to epidemics, by which a disease is spread by infecting members of a group, which in turn can infect others. In distributed systems, epidemics refers to information dissemination where a node randomly chooses another member, to which the information (i.e., the "disease") can be communicated (unless both had already been "contaminated"). Following common practice, we shall not make a distinction between gossip and epidemics in this paper. The first use of gossip in distributed systems appeared some twenty years ago in [5], where it was applied to ensure consistency in repli-cated databases. Since then, it has been steadily applied to solve a variety of problems, but has never received so much attention as in the past few years. There is a good reason for this increased interest. Just as in real life, gossiping is characterized by the fact that it can spread quickly and be extremely persistent, notably also in situations in which groups change with respect to their memberships and relations between group members. In the last decade, we have seen a dramatic shift in the scale of distributed systems: they have become larger, geographically more dispersed, and often cross multiple administrative boundaries. This shift in scale has forced us to revisit many of the assumptions underlying distributed systems, and hence the solutions we have developed for them. More specifically, we need to deal with near-continuous changes regarding the collection of nodes constituting a distributed system, as well as the existence and quality of the connections between those nodes. As a consequence, by being forced to pay attention to a system's behavior under continuous change, we have been forced to focus more on convergent behavior. Gos-siping solutions are often indifferent to changes in the group of communicating nodes, while at the same time exhibit strong con-vergent behavior. Moreover, many solutions are designed to let nodes take local-only decisions. As such, they are attractive for developing large-scale distributed systems. In this light, we present a brief overview of gossiping in modern distributed systems. We aim to accomplish two goals. First, we want to provide a framework that is easy and general enough to understand and compare gossiping solutions. Furthermore, although gossiping has been traditionally used for reliable information dissemination , its applicability goes way beyond in distributed systems. Our second goal is to provide an overview of traditional gossip-based dissemination, but also to have a look at other applications such as those for data aggregation and systems management. The rest of this paper is organized as follows. We start by providing a framework for gossiping protocols in Section 2. Section 3 provides the main results of probabilistic gossip-based data dissemination ; in Sections 4 and 5 we show that the same set of algorithms may be applied to build and maintain overlay networks from fully unstructured (random-based) to fully structured. In Section 7, we also show that the same techniques can be used to compute aggregates in a fully decentralized way and in Section 6 to slice the networks according to a given attribute metric. We conclude in Section 8 by stating that we believe that such approaches can be used in many other contexts which are either out of the scope of this paper (such as application to ad-hoc networks) or yet to be discovered. 2},
author = {Kermarrec, Anne-Marie and {Van Steen}, Maarten},
file = {:Users/raul/Documents/Mendeley/Kermarrec, Van Steen - Unknown - Gossiping in Distributed Systems.pdf:pdf},
mendeley-groups = {Computer Science,Peer-to-peer networks},
title = {{Gossiping in Distributed Systems}},
url = {https://www.distributed-systems.net/my-data/papers/2007.osr.pdf}
}
@techreport{Leitao2007,
abstract = {There is an inherent trade-off between epidemic and deterministic tree-based broadcast primitives. Tree-based approaches have a small message complexity in steady-state but are very fragile in the presence of faults. Gossip, or epidemic, protocols have a higher message complexity but also offer much higher resilience. This paper proposes an integrated broadcast scheme that combines both approaches. We use a low cost scheme to build and maintain broadcast trees embedded on a gossip-based overlay. The protocol sends the message payload preferably via tree branches but uses the remaining links of the gossip overlay for fast recovery and expedite tree healing. Experimental evaluation presented in the paper shows that our new strategy has a low overhead and that is able to support large number of faults while maintaining a high reliability.},
author = {Leit{\~{a}}o, Jo{\~{a}}o and Pereira, Jos{\'{e}} and Rodrigues, Lu{\'{i}}s},
file = {:Users/raul/Documents/Mendeley/Leit{\~{a}}o, Pereira, Rodrigues - 2007 - Epidemic Broadcast Trees Epidemic Broadcast Trees.pdf:pdf},
mendeley-groups = {Computer Science,Peer-to-peer networks},
title = {{Epidemic Broadcast Trees Epidemic Broadcast Trees *}},
url = {http://www.di.fc.ul.pt/tech-reports.},
year = {2007}
}