Concept

HTTP

Related publications (62)

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

When to Hedge in Interactive Services

Edouard Bugnion, Mia Primorac

In online data-intensive (OLDI) services, each client request typically executes on multiple servers in parallel; as a result, “system hiccups”, although rare within a single server, can interfere with many client requests and cause violations of service-l ...

USENIX2021

Encrypted DNS double right arrow Privacy? A Traffic Analysis Perspective

Carmela González Troncoso, Sandra Deepthy Siby, Narseo Vallina Rodriguez

Virtually every connection to an Internet service is preceded by a DNS lookup. Lookups are performed without any traffic-level protection, thus enabling manipulation, redirection, surveillance, and censorship. To address these issues, large organizations s ...

INTERNET SOC2020

Understanding and Mitigating Latency Variability of Latency-Critical Applications

Mia Primorac

A major theme of IT in the past decade has been the shift from on-premise hardware to cloud computing. Running a service in the public cloud is practical, because a large number of resources can be bought on-demand, but this shift comes with its own set of ...

EPFL2020

Dynamic Balanced Graph Partitioning

Andreas Loukas

This paper initiates the study of the classic balanced graph partitioning problem from an online perspective: Given an arbitrary sequence of pairwise communication requests between n nodes, with patterns that may change over time, the objective is to servi ...

2020

Scrub: Online TroubleShooting for Large Mission-Critical Applications

Willy Zwaenepoel

Scrub is a troubleshooting tool for distributed applications that operate under strict SLOs common in production environments. It allows users to formulate queries on events occurring during execution in order to assess the correctness of the application’s ...

2018

Rack-Scale Memory Pooling for Datacenters

Stanko Novakovic

The rise of web-scale services has led to a staggering growth in user data on the Internet. To transform such a vast raw data into valuable information for the user and provide quality assurances, it is important to minimize access latency and enable in-me ...

EPFL2017

Information-Theoretic Caching: The Multi-User Case

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

In this paper, we consider a cache aided network in which each user is assumed to have individual caches, while upon users’ requests, an update message is sent through a common link to all users. First, we formulate a general information theoretic setting ...

Institute of Electrical and Electronics Engineers2017

Image-Based Localisation | A Fast and Robust Smartphone to MATLAB Interface

Raffaele Lauro

Smartphone to Matlab interface, consisting of an iOS application, a Python Server to handle HTTP requests from the app, and a Matlab function developed previously by the LCAV. ...

2016

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

Graph Chatbot

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.