Concept

Packet forwarding

Publications associées (53)

Graph Chatbot

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.

Connectez-vous pour utiliser Chat avec Graph Search

Cooperative data exchange based on MDS codes

Michael Christoph Gastpar, Su Li

The coded cooperative data exchange problem is studied for the fully connected network. In this problem, each node initially only possesses a subset of the K packets making up the file. Nodes make broadcast transmissions that are received by all other node ...

2017

Improved Utility-based Congestion Control for Low-Delay Communication

Pascal Frossard, Laura Toni, Sergio Mena, Stefano D'Aronco

Due to the presence of buffers in the inner network nodes, each congestion event leads to buffer queueing and thus to an increasing end-to-end delay. In the case of delay sensitive applications, a large delay might not be acceptable and a solution to prope ...

Ieee-Inst Electrical Electronics Engineers Inc2017

Measuring and Managing Switch Diversity in Software Defined Networks

Maciej Leszek Kuzniar

Software Defined Networking (SDN) is a novel approach to building computer networks. Improved flexibility, simplified management and cost reduction promised by SDN makes many see it as the future of networking. The main insight of SDN is the separation of ...

EPFL2016

Building Evolvable Networks

Mihai Dobrescu

Software packet-processing platforms--network devices running on general-purpose servers--are emerging as a compelling alternative to the traditional high-end switches and routers running on specialized hardware. Their promise is to enable the fast dep ...

EPFL2015

Maximum Throughput Gain of Compute-and-Forward for Multiple Unicast

Michael Christoph Gastpar, Jasper Goseling

Compute-and-Forward (CF), also known as reliable physical layer network coding, is a technique that provides the possibility of exploiting the features of broadcast and superposition in wireless networks. It has been shown that the throughput for multiple ...

Institute of Electrical and Electronics Engineers2014

Creating Secrets out of Erasures

Christina Fragouli, Suhas Diggavi, Panagiotis Kostopoulos

Current security systems often rely on the adversary's computational limitations. Wireless networks offer the opportunity for a different, complementary kind of security, which relies on the adversary's limited network presence (i.e., that the adversary ca ...

2013

Empirical Performance Evaluation of Data Dissemination Mechanisms for Spot Applications

Jean-Yves Le Boudec, Alaeddine El Fawal, Adel Aziz

We evaluate, by measurements on a real testbed, the performance of networking services required for spot applications. We call a “spot application” an application for smartphones (such as “Ad-hoc Flash Sales”) that disseminates information in a local neigh ...

2012

The capacity of a wireless lattice network with local interference is studied. In particular, the transport capacity under a multiple unicast traffic pattern is studied for a network of nodes placed on a hexagonal lattice. Different ways of handling broadc ...

IEEE2012

Line and Lattice Networks Under Deterministic Interference Models

Michael Christoph Gastpar, Jasper Goseling

Capacity bounds are compared for four different deterministic models of wireless networks, representing four different ways of handling broadcast and superposition in the physical layer. In particular, the transport capacity under a multiple unicast traffi ...

2011

Valuable Detours: Least-Cost Anypath Routing

Martin Vetterli, Matthias Grossglauser, Henri Julien Dubois-Ferrière

In many networks, it is less costly to transmit a packet to any node in a set of neighbors than to one specific neighbor. This observation was previously exploited by opportunistic routing protocols by using single-path routing metrics to assign to each no ...

2011