Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Ping (networking utility)

Related publications (12)

Time vs. Truth: Age-Distortion Tradeoffs and Strategies for Distributed Inference

Yunus Inan

In 1948, Claude Shannon laid the foundations of information theory, which grew out of a study to find the ultimate limits of source compression, and of reliable communication. Since then, information theory has proved itself not only as a quest to find the ...

EPFL2023

Contribution of macromolecules to brain H-1 MR spectra: Experts' consensus recommendations

Rolf Gruetter, Cristina Ramona Cudalbu Moldovan, Lijing Xin, Hongxia Lei, Dunja Simicic, Veronika Rackayová

Proton MR spectra of the brain, especially those measured at short and intermediate echo times, contain signals from mobile macromolecules (MM). A description of the main MM is provided in this consensus paper. These broad peaks of MM underlie the narrower ...

WILEY2020

In Search of Lost Bandwidth: Extensive Reordering of DRAM Accesses on FPGA

Paolo Ienne, Mikhail Asiatici, Gabor Andras Csordas

For efficient acceleration on FPGA, it is essential for external memory to match the throughput of the processing pipelines. However, the usable DRAM bandwidth decreases significantly if the access pattern causes frequent row conflicts. Memory controllers ...

IEEE COMPUTER SOC2019

Flow control for Latency-Critical RPCs

Edouard Bugnion, Evangelos Marios Kogias

In today’s modern datacenters, the waiting time spent within a server’s queue is a major contributor of the end-to-end tail latency of μs-scale remote procedure calls. In traditional TCP, congestion control handles in-network congestion, while flow control ...

2018

Automated Synthesis of Adversarial Workloads for Network Functions

Aikaterini Argyraki, Luis David Figueiredo Mascarenhas Moreira Pedrosa, Arseniy Zaostrovnykh, Rishabh Ramesh Iyer, Jonas Fietz

Software network functions promise to simplify the deployment of network services and reduce network operation cost. However, they face the challenge of unpredictable performance. Given this performance variability, it is imperative that during deployment, ...

ACM2018

Prioritized Distributed Video Delivery with Randomized Network Coding

Pascal Frossard, Nikolaos Thomos, Jakov Cakareski

We address the problem of prioritized video streaming over lossy overlay networks. We propose to exploit network path diversity via a novel Randomized Network Coding (RNC) approach that provides unequal error protection (UEP) to the packets conveying the v ...

2011

Automating the Testing of OpenFlow Applications

Dejan Kostic, Marco Canini

Software-defined networking, and the emergence of OpenFlow-capable switches, enables a wide range of new network functionality. However, enhanced programmability inevitably leads to more software faults (or bugs). We believe that tools for testing OpenFlow ...

2011

Utility-based Packet Scheduling in P2P Mesh-based Multicast

Pascal Frossard

We consider streaming video content over an overlay network of peer nodes. We propose a novel streaming strategy that is built on utility-based packet scheduling and proportional resource sharing in order to fight against free- riders. Each of the peers em ...

2009

Optimizing TCP Receive Performance

Willy Zwaenepoel

The performance of the networking stack in an operating system depends on the overhead incurred by two of its components: the per-byte overhead incurred in data-touching operations, and the per-packet overhead of protocol processing and other operating sys ...

2008

Multi-hop Broadcast from Theory to Reality: Practical Design for Ad Hoc Networks

Jean-Yves Le Boudec, Alexandre Fawal

We propose a complete design for a scope limited, multi-hop broadcast middleware, which is adapted to the variability of the ad-hoc environment and works in unlimited ad-hoc networks such as a crowd in a city, or car passengers in a busy highway system. We ...

2007

A delay optimal policy for symmetric broadcast channels

Stéphane Musy

We consider the rate allocation problem when two users (each one associated with one receiver) send packets through a symmetric broadcast channel. Under the assumption that the packet lengths are exponentially distributed, we establish the delay optimality ...

2006

Lucky Read/Write Access to Robust Atomic Storage

Rachid Guerraoui, Ron Levy

This paper establishes tight bounds on the \emph{best-case} time-complexity of distributed atomic read/write storage implementations that tolerate \emph{worst-case} conditions. We study asynchronous robust implementations where a writer and a set of reader ...

2006