Gossip-Based Peer Sampling

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Decentralized storage networks offer services with intriguing possibilities to reduce inequalities in an extremely centralized market. Fair distribution of rewards, however, is still a persistent problem in the current generation of decentralized applicati ...

Peer-to-peer (P2P) sharing may foster sustainability synergistically by saving resources, reducing costs and promoting satisfaction of consumer needs and social connectivity. A survey of Swiss and Swedish consumers (N = 1522) was conducted to analyze drive ...

Biphoton frequency combs (BFCs) are promising quantum sources for large-scale and high-dimensional quantum information and networking systems. In this context, the spectral purity of individual frequency bins will be critical for realizing quantum networki ...

The notion of adversary is a staple of distributed computing. An adversary typically models “hostile” assumptions about the underlying distributed environment, e.g., a network that can drop messages, an operating system that can delay processes or an attac ...

Online services have become ubiquitous in technological society, the global demand for which has driven enterprises to construct gigantic datacenters that run their software. Such facilities have also recently become a substrate for third-party organizatio ...

Peer-to-peer (p2p) networks are not independent of their peers, and the network efficiency depends on peers contributing resources. Because shared resources are not free, this contribution must be rewarded. Peers across the network may share computation po ...

Decentralized signal control of congested traffic networks based on the Max-Pressure (MP) controller is theoretically proven to maximize throughput, stabilize the system and balance queues for single intersections under specific conditions. However, its pe ...

Nanoparticles (NPs) have wide applications in physical and chemical processes, and their individual properties (e.g., shape, size, and composition) and ensemble properties (e.g., distribution and homogeneity) can significantly affect the performance. Howev ...

Design exploration is a creative process that consists of the incremental generation of design candidates. Supported by digital means or not, the process handles the ill-structured nature of design and allows creativity to flourish through diversity of des ...

The booming popularity of online services has led to a major evolution in the way these services are built and deployed. To cope with such online data-intensive services, service providers deploy several massive-scale datacenters, also referred to as wareh ...

Most communication systems (e.g., e-mails, instant messengers, VPNs) use encryption to prevent third parties from learning sensitive information. However, encrypted communications protect the contents but often leak metadata: the amount of data sent and th ...

Computational protein design has emerged as a powerful tool capable of identifying sequences compatible with pre-defined protein structures. The sequence design protocols, implemented in the Rosetta suite, have become widely used in the protein engineering ...

In distributed optimization, parameter updates from the gradient computing node devices have to be aggregated in every iteration on the orchestrating server. When these updates are sent over an arbitrary commodity network, bandwidth and latency can be limi ...

Datacenters are the heart of our digital lives. Online applications, such as social-networking and e-commerce, run inside datacenters under strict Service Level Objectives for their tail latency. Tight latency SLOs are necessary for such services to remain ...

Modern online services are shifting away from monolithic applications to loosely-coupled microservices because of their improved scalability, reliability, programmability and development velocity. Microservices communicating over the datacenter network req ...

In distributed computing, many papers try to evaluate the message complexity of a distributed system as a function of the number of nodes n. But what about the cost of building the distributed system itself? Assuming that we want to reliably connect n node ...

Remote Procedure Calls are widely used to connect datacenter applications with strict tail-latency service level objectives in the scale of µs. Existing solutions utilize streaming or datagram-based transport protocols for RPCs that impose overheads and li ...

Current online applications, such as search engines, social networks, or file sharing services, execute across a distributed network of machines. They provide non-stop services to their users despite failures in the underlying network. To achieve such a hi ...

In the last decades the Internet traffic has greatly evolved. The advent of new Internet services and applications has, in fact, led to a significant growth of the amount of data transmitted, as well as to a transformation of the data type. As a matter of ...

Adapting the transmission rate of video telephony Internet applications in order to guarantee the maximal communication quality is still an open and extremely challenging problem. The congestion control algorithm, which is the algorithm responsible for adj ...

Gossip-Based Peer Sampling

Chat with Graph Search

Altruism, reciprocity, and tokens to reward forwarding data: Is that fair?

Promoting synergies for sustainability through peer-to-peer sharing: an analysis of drivers and barriers

Time-Resolved Hanbury Brown-Twiss Interferometry of On-Chip Biphoton Frequency Combs Using Vernier Phase Modulation

The Universal Gossip Fighter

Hardware and Software Support for RPC-Centric Server Architecture

Fair Incentivization of Bandwidth Sharing in Decentralized Storage Networks

Critical node selection method for efficient Max-Pressure traffic signal control in large-scale congested networks

High-Throughput Sizing, Counting, and Elemental Analysis of Anisotropic Multimetallic Nanoparticles with Single-Particle Inductively Coupled Plasma Mass Spectrometry

Policy-based Exploration of Equilibrium Representations (PEER): A topology grammar for generative conceptual structural design

Hardware-Software Co-Design of an RPC Processor

Analyzing and Protecting Communication Metadata

A Rosetta-based protein design protocol converging to natural sequences

LENA: Communication-Efficient Distributed Learning with Self-Triggered Gradient Uploads

Operating System and Network Co-Design for Latency-Critical Datacenter Applications

Optimus Prime: Accelerating Data Transformation in Servers

The Cost of Scaling a Reliable Interconnection Topology

R2P2: Making RPCs first-class datacenter citizens

System Support for Efficient Replication in Distributed Systems

Network utility maximization for delay-sensitive applications in unknown communication settings

A Bayesian Bandit Approach to Adaptive Delay-based Congestion Control