Publications associées à IO-Lite: A Unified I/O Buffering and Caching System

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.

Relaxed Wyner's Common Information

Michael Christoph Gastpar, Erixhen Sula

In the problem of coded caching for media delivery, two separate coding opportunities have been identified. The first opportunity is a multi-user advantage and crucially hinges on a public broadcast link in the delivery phase. This has been explored in a p ...

IEEE2019

Security of Distance-Bounding: A Survey

Serge Vaudenay, Gildas Avoine, Martin Benjamin, Srdan Capkun, Aslan Tchamkerten

Distance-bounding protocols allow a verifier to both authenticate a prover and evaluate whether the latter is located in his vicinity. These protocols are of particular interest in contactless systems, e.g. electronic payment or access control systems, whi ...

2018

Three's a Crowd?

Christopher Tucci, Gianluigi Viscusi

According to conventional wisdom on crowdsourcing, the number of people defines the crowd and maximization of this number is often assumed to be the goal of any crowdsourcing exercise. However, some structural characteristics of the crowd might be more imp ...

Oxford University Press2018

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

K Users Caching Two Files: An Improved Achievable Rate

Michael Christoph Gastpar, Saeid Sahraei

Caching is an approach to smoothen the variability of traffic over time. Recently it has been proved that the local memories at the users can be exploited for reducing the peak traffic in a much more efficient way than previously believed. In this work we ...

Ieee2016

VNToR: Network Virtualization at the Top-of-Rack Switch

Edouard Bugnion, Georgios Ioannidis, Sam David Whitlock, Jonas Fietz

Cloud providers typically implement abstractions for net- work virtualization on the server, within the operating sys- tem that hosts the tenant virtual machines or containers. Despite being flexible and convenient, this approach has funda- mental problems ...

2016

Privacy-Preserving Photo Sharing based on a Public Key Infrastructure

Touradj Ebrahimi, Lin Yuan, David Mc Nally

A significant number of pictures are posted to social media sites or exchanged through instant messaging and cloud-based sharing services. Most social media services offer a range of access control mechanisms to protect users privacy. As it is not in the b ...

Spie-Int Soc Optical Engineering2015

DISTINGUISHING “CROWDED” ORGANIZATIONS FROM GROUPS AND COMMUNITIES: IS THREE A CROWD?

Christopher Tucci, Gianluigi Viscusi

In conventional wisdom on crowdsourcing, the number of people define the crowd and maximizing this number is often assumed to be the goal of any crowdsourcing exercise. However, we propose that there are structural characteristics of the crowd that might b ...

SSRN2015

IO-Lite: A Unified I/O Buffering and Caching System

Graph Chatbot

Chattez avec Graph Search

Relaxed Wyner's Common Information

Security of Distance-Bounding: A Survey

Three's a Crowd?

Contactless Access Control Based on Distance Bounding

A New Converse Bound for Coded Caching

Information Theoretic Caching: The Multi-User Case

K Users Caching Two Files: An Improved Achievable Rate

VNToR: Network Virtualization at the Top-of-Rack Switch

Privacy-Preserving Photo Sharing based on a Public Key Infrastructure

DISTINGUISHING “CROWDED” ORGANIZATIONS FROM GROUPS AND COMMUNITIES: IS THREE A CROWD?

Relaxed Wyner's Common Information

K Users Caching Two Files: An Improved Achievable Rate

Three's a Crowd?

Security of Distance-Bounding: A Survey

Contactless Access Control Based on Distance Bounding

VNToR: Network Virtualization at the Top-of-Rack Switch

A New Converse Bound for Coded Caching

Privacy-Preserving Photo Sharing based on a Public Key Infrastructure

DISTINGUISHING “CROWDED” ORGANIZATIONS FROM GROUPS AND COMMUNITIES: IS THREE A CROWD?

Information Theoretic Caching: The Multi-User Case