Publication

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

Related publications (52)

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.

Signaling and Reciprocity

Wojciech Galuba

Complex networks exist for a number of purposes. The neural, metabolic and food networks ensure our survival, while the social, economic, transportation and communication networks allow us to prosper. Independently of the purposes and particularities of th ...

EPFL2011

Relational network-service clustering analysis with set evidences

Boi Faltings, Li Pu

Network administrators are faced with a large amount of network data that they need to sift through to analyze user behaviors and detect anomalies. Through a network monitoring tool, we obtained TCP and UDP connection records together with additional infor ...

2010

Context-adaptive information flow allocation and media delivery in online social networks

Pascal Frossard

This paper investigates context-driven flow allocation and media delivery in online social networks. We exploit information on contacts and content preferences found in social networking applications to provide efficient network services and operation at t ...

2010

SenseCode: Network Coding for Reliable Sensor Networks

Christina Fragouli, Lorenzo Keller, Emre Atsan

Designing a communication protocol for sensor networks often involves obtaining the "right" trade-off between energy efficiency and reliability. In this paper, we show that network coding provides a means to elegantly balance these two goals. We present th ...

2009

Robustness to failures in two-layer communication networks

Maciej Kurant

A close look at many existing systems reveals their two- or multi-layer nature, where a number of coexisting networks interact and depend on each other. For instance, in the Internet, any application-level graph (such as a peer-to-peer network) is mapped o ...

EPFL2009

Local restoration for trees and arborescences

Laura Sanità

Protocols belonging to the Spanning Tree Protocol (STP) route traffic demands on tree topologies that are evaluated through shortest path procedures. In this paper we deal with the problem of assigning costs to the arcs of a network in order to guarantee t ...

Springer Berlin / Heidelberg2009

Game Theoretic Modeling of Malicious Users in Collaborative Networks

Georgios Theodorakopoulos

If a network is to operate successfully, its users need to collaborate. Collaboration takes the form of following a network protocol and involves some resource expenditure on the part of the user. Therefore, users cannot automatically be expected to follow ...

Institute of Electrical and Electronics Engineers2008

Spectral coarse graining of complex networks

Paolo De Los Rios, David Gfeller

Reducing the complexity of large systems described as complex networks is key to understanding them and a crucial issue is to know which properties of the initial system are preserved in the reduced one. Here we use random walks to design a coarse graining ...

American Physical Society2007

Design, Synthesis, and Test of Network on Chips

Giovanni De Micheli

For networks on chips to succeed as the next generation of on-chip interconnect, researchers must solve the major problems involved in designing, implementing, verifying, and testing them. This article surveys the latest NoC architectures, methods, and too ...

2005

Assessing the Crash-Failure Assumption of Group Communication Protocols

André Schiper, Sergio Mena

Designing and correctly implementing Group Communication Systems (GCSs) is notoriously difficult. Assuming that processes fail only by crashing provides a powerful means to simplify the theoretical development of these systems. When making this assumption, ...

2005