Publications associées à Request for quotation

uKharon: A Membership Service for Microsecond Applications

Rachid Guerraoui, Antoine Murat, Javier Picorel Obando, Athanasios Xygkis

Modern data center fabrics open the possibility of microsecond distributed applications, such as data stores and message queues. A challenging aspect of their development is to ensure that, besides being fast in the common case, these applications react fa ...

USENIX Association2023

Thin Film Devices For 5G Communications

Luis Guillermo Villanueva Torrijo, Damien Maillard, Seniz Esra Küçük, Marco Liffredo, Soumya Yandrapalli, Muhammad Faizan

Piezoelectric-based resonators are some of the most used devices in the world. Invisible to most people, they constitute key elements for your mobile phone communications. With the advent of 50, the current technologies for piezoelectric resonators need to ...

IEEE2021

A Graph-structured Dataset for Wikipedia Research

Pierre Vandergheynst, Nicolas Aspert, Volodymyr Miz, Benjamin Ricaud

Wikipedia is a rich and invaluable source of information. Its central place on the Web makes it a particularly interesting object of study for scientists. Researchers from different domains used various complex datasets related to Wikipedia to study langua ...

ACM2019

A New Converse Bound for Coded Caching

Michael Christoph Gastpar, Sung Hoon Lim, Chien-Yi Wang

An information-theoretic lower bound is developed for the caching system studied by Maddah-Ali and Niesen. By comparing the proposed lower bound with the decentralized coded caching scheme of Maddah-Ali and Niesen, the optimal memory--rate tradeoff is char ...

2016

Information Theoretic Caching: The Multi-User Case

Michael Christoph Gastpar, Sung Hoon Lim, Chien-Yi Wang

In this paper, we present information theoretic inner and outer bounds on the fundamental tradeoff between cache memory size and update rate in a multi-user cache network. Each user is assumed to have individual caches, while upon users’ requests, an updat ...

Ieee2016

Zeta: Scheduling Interactive Services with Partial Execution

James Richard Larus, Sameh Mohamed Elnikety, Chenyu Yan

This paper presents a scheduling model for a class of interactive services in which requests are time bounded and lower result quality can be traded for shorter execution time. These applications include web search engines, finance servers, and other inter ...

ACM2012

Authentication-free fault-tolerant peer-to-peer service provisioning

Karl Aberer, Wojciech Galuba, Zoran Despotovic

The correct functioning of a peer-to-peer network relies on cooperative behavior of peers as service providers. Current approaches to detection and deterrence of non-cooperative behavior, such as reputation systems, rely on (1) global sharing of observatio ...

Springer2007

Congestion Control for Distributed Hash Tables

Jean-Yves Le Boudec, Karl Aberer, Fabius Klemm

Distributed Hash Tables (DHTs) provide a scalable mechanism for mapping identifiers to socket addresses. As each peer in the network can initiate lookup requests, a DHT has to process concurrently a potentially very large number of requests. In this paper, ...

IEEE2006

Optimistic Active Replication

André Schiper, Pascal Felber

Replication is a powerful technique for increasing availability of a distributed service. Algorithms for replicating distributed services do however face a dilemma: they should be (1) efficient (low latency), while (2) ensuring consistency of the replicas, ...

IEEE Computer Society2001

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Request for quotation

uKharon: A Membership Service for Microsecond Applications

Thin Film Devices For 5G Communications

A Graph-structured Dataset for Wikipedia Research

A New Converse Bound for Coded Caching

Information Theoretic Caching: The Multi-User Case

Zeta: Scheduling Interactive Services with Partial Execution

Concurrency and dynamic protocol update for group communication middleware

Authentication-free fault-tolerant peer-to-peer service provisioning

Congestion Control for Distributed Hash Tables

Optimistic Active Replication

Graph Chatbot

Chattez avec Graph Search

uKharon: A Membership Service for Microsecond Applications

Zeta: Scheduling Interactive Services with Partial Execution

A Graph-structured Dataset for Wikipedia Research

Concurrency and dynamic protocol update for group communication middleware

A New Converse Bound for Coded Caching

Information Theoretic Caching: The Multi-User Case

Optimistic Active Replication

Thin Film Devices For 5G Communications

Authentication-free fault-tolerant peer-to-peer service provisioning

Congestion Control for Distributed Hash Tables