Publication

Measuring Network Service Latencies with a Programmable Dataplane

Related publications (33)

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.

An Application-Specific Design Methodology for STbus Crossbar Generation

Giovanni De Micheli, Srinivasan Murali

As the communication requirements of current and future Multiprocessor Systems on Chips (MPSoCs) continue to increase, scalable communication architectures are needed to support the heavy communication demands of the system. This is reflected in the recent ...

2005

Controlled Use of Excess Backbone Bandwidth for Providing New Services in IP-Over-WDM Networks

Patrick Thiran

We study an approach to quality-of-service (QoS) that offers end-users the choice between two service classes defined according to their level of transmission protection. The fully protected (FP) class offers end-users a guarantee of survivability in the c ...

2004

Creating Advanced Functions on Network Processors: Experience and Perspectives

In this paper, we present five case studies of advanced networking functions and how a network processor (NP) can provide high-performance and exible support for each of them. We first review the basic NP system architectures, and describe in more detail t ...

2003

Performance analysis of packet switched all-optical networks

All-optical packet switching has been intensively investigated in recent years as an alternative to static, crossconnect based networks. Several switch architectures have been proposed, all of them using buffers made of fibre delay lines. The paper address ...

IEEE2003

Load sharing for multiprocessor network nodes

This thesis discusses techniques for sharing the processing load among multiple processing units within systems that act as nodes in a data communications network. Load-sharing techniques have been explored in the field of computer science for many years a ...

EPFL2003

Load Sharing for Multiprocessor Network Nodes

2003

Analysis of power consumption on switch fabrics in network routers

Giovanni De Micheli, Luca Benini

In this paper, we introduce a framework to estimate the power consumption on switch fabrics in network routers. We propose different modeling methodologies for node switches, internal buffers and interconnect wires inside switch fabric architectures. A sim ...

2002

The Asymmetric Best-Effort Service

Jean-Yves Le Boudec, Ljubica Blazevic

We present Asymmetric Best-Effort, a novel service to provide a ``throughput versus delay jitter'' differentiated service for IP packets. With this service, every best effort packet is marked as either green or blue. Green packets, typically sent by real-t ...

1999

The Asymmetric Best-Effort Service

Jean-Yves Le Boudec, Patrick Thiran, Paul Hurley, Ljubica Blazevic

We present Asymmetric Best-Effort, a novel service to provide a throughput versus delay jitter differentiated service for IP packets. With this service, every best effort packet is marked as either green or blue. Green packets, typically sent by real-t ...

1999

Circuit Emulation over IP Networks

Jean-Pierre Hubaux

Recent developments in transmission and switching technology has made available low-cost gigabit network capacity forpacket-based WANs (e.g., IP over WDM), that will not require the intermediate SONET/SDH multiplexing layer. For competitive operators that ...

1999