Live Streaming with Gossip

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.

The scale and pervasiveness of the Internet make it a pillar of planetary communication, industry and economy, as well as a fundamental medium for public discourse and democratic engagement. In stark contrast with the Internet's decentralized infrastructur ...

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 ...

The expansive production of data in materials science, their widespread sharing and repurposing requires educated support and stewardship. In order to ensure that this need helps rather than hinders scientific work, the implementation of the FAIR-data prin ...

Interactive mobile applications like web browsing and gaming are known to benefit significantly from low latency networking, as applications communicate with cloud servers and other users' devices. Emerging mobile channel standards have not met these needs ...

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 ...

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 ...

In the domains of machine learning, data science and signal processing, graph or network data, is becoming increasingly popular. It represents a large portion of the data in computer, transportation systems, energy networks, social, biological, and other s ...

Personalized ranking methods are at the core of many systems that learn to produce recommendations from user feedbacks. Their primary objective is to identify relevant items from very large vocabularies and to assist users in discovering new content. These ...

Timely insights lead to business growth and scientific breakthroughs but require analytical engines that cope with the ever-increasing data processing needs. Analytical engines relied on rapid CPU improvements, yet the end of Dennard scaling stopped the fr ...

The exponential growth in computing power and multimedia services has caused a tremendous increase in data traffic in recent years. This increase in data traffic brings a strong demand for data bandwidth of electrical input/output (I/O) links and pushes th ...

The time-bandwidth limit is a mathematical tenet that affects all reciprocal resonators, stating that the product of the spectral bandwidth that can couple into a resonant system and its characteristic energy decay time is always equal to 1. Here, we devel ...

Harnessing quantum randomness for the generation of random numbers is an important concept crucial for information security and many other computer-related applications. Quantum random number generators (QRNGs) are evolving from bulky, slow, and expensive ...

As the volume of produced data is exponentially increasing, companies tend to rely on distributed systems to meet the surging demand for storage capacity. With the business workflows becoming more and more complex, such systems often consist of or are acce ...

An important prerequisite for developing trustworthy artificial intelligence is high quality data. Crowdsourcing has emerged as a popular method of data collection in the past few years. However, there is always a concern about the quality of the data thus ...

Most present-day resonant systems, throughout physics and engineering, are characterized by a strict time-reversal symmetry between the rates of energy coupled in and out of the system, which leads to a trade-off between how long a wave can be stored in th ...

We establish probabilistic small data global well-posedness of the energy-critical Maxwell-Klein-Gordon equation relative to the Coulomb gauge for scaling super-critical random initial data. The proof relies on an induction on frequency procedure and a mod ...

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 ...

A new scheme for the problem of centralized coded caching with non-uniform demands is proposed. The distinguishing feature of the proposed placement strategy is that it admits equal sub-packetization for all files while allowing the users to allocate more ...

A simple task of storing a database or transferring it to a different point via a communication channel turns far more complex as the size of the database grows large. Limited bandwidth available for transmission plays a central role in this predicament. I ...

The booming popularity of online services is rapidly raising the demands for modern datacenters. In order to cope with data deluge, growing user bases, and tight quality of service constraints, service providers deploy massive datacenters with tens to hund ...

Live Streaming with Gossip

Chat with Graph Search

Planetary-Scale Byzantine Fault Tolerance

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

Shared metadata for data-centric materials science

DChannel: Accelerating Mobile ApplicationsWith Parallel High-bandwidth and Low-latency Channels

Fair Incentivization of Bandwidth Sharing in Decentralized Storage Networks

The Universal Gossip Fighter

Quantization for Distributed Processing and Learning of Structured Data

Dynamic Personalized Ranking

Efficient Analytical Query Processing on CPU-GPU Hardware Platforms

Energy-Efficient Design Techniques for High-Speed Wireline Serial Links

Unconventional time-bandwidth performance of resonant cavities with nonreciprocal coupling

Random flip-flop: adding quantum randomness to digital circuits for improved cyber security, artificial intelligence and more

Clouseau: Blockchain-based Data Integrity for HDFS Clusters

Truthful, Transparent and Fair Data Collection Mechanisms

Arbitrarily high time bandwidth performance in a nonreciprocal optical resonator with broken time invariance

Probabilistic small data global Well-Posedness of the energy-critical Maxwell-Klein-Gordon equation

System Support for Efficient Replication in Distributed Systems

The Optimal Memory-Rate Trade-Off for the Non-Uniform Centralized Caching Problem With Two Files Under Uncoded Placement

Caching and Distributed Storage : Models, Limits and Designs

Network-Compute Co-Design for Distributed In-Memory Computing