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

Concept

End-to-end principle

Related publications (29)

SenseCode: Network Coding for Reliable Sensor Networks

Christina Fragouli, Aikaterini Argyraki, Lorenzo Keller, Emre Atsan

Designing a communication protocol for sensor networks often involves obtaining the right trade-off between energy efficiency and end-to-end packet error rate. In this article, we show that network coding provides a means to elegantly balance these two goa ...

Assoc Computing Machinery2013

Multiuser Broadcast Erasure Channel With Feedback-Capacity and Algorithms

We consider the N-user broadcast erasure channel with unicast sessions (one for each user) where receiver feedback is regularly sent to the transmitter in the form of ACK/NACK messages. We first provide a generic outer bound to the capacity of this system; ...

Institute of Electrical and Electronics Engineers2013

Wireless Multi-hop Networks Beyond Capacity

Patrick Thiran, Adel Aziz

Wireless multi-hop local area networks use in general scheduling schemes that assume the network capacity to be known. Indeed in most of the throughput-optimal algorithms the sources are assumed to send at a rate within the capacity region. However, measur ...

IEEE2013

On Modeling Terrorist Frauds

Serge Vaudenay

Quite recently, distance-bounding protocols received a lot of attention as they offer a good solution to thwart relay attacks. Their security models at still unstable, especially when considering terrorist fraud. This considers the case where a malicious p ...

Springer2013

A NICE Way to Test OpenFlow Applications

Dejan Kostic, Marco Canini, Peter Peresini

The emergence of OpenFlow-capable switches enables exciting new network functionality, at the risk of programming errors that make communication less reliable. The centralized programming model, where a single controller program manages the network, seems ...

2012

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

Bringing Stability to Wireless Mesh Networks

Adel Aziz

Wireless mesh networks were designed as a mean to rapidly deliver large-scale communication capabilities without the support of any prior infrastructure. Among the different properties of mesh networks, the self-organizing feature is particularly interesti ...

EPFL2011

Multi-Graph Regularization For Efficient Delivery Of User Generated Content In Online Social Networks

We present a methodology for enhancing the delivery of user-generated content in online social networks. To this end, we first regularize the social graph via node capacity and link cost information associated with the underlying data network. We then desi ...

2011

In-Network Packet Scheduling and Rate Allocation: A Content Delivery Perspective

We investigate two important problems in media delivery via active network agents. First, we consider streaming multiple video assets over a shared backbone network through an intermediate proxy-server to a set of receiving clients. The proxy is located at ...

2011

Related publications (29)