Concept

End-to-end principle

Related publications (77)

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.

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

Detecting leak regions through model falsification

Ian Smith, Gaudenz Moser

Pressurized fluid-distribution networks are strategic elements of infrastructure. In the case of fresh-water distribution networks, advanced sensor-based diagnostic methodologies have the potential to provide enhanced management support. Since a significan ...

2013

A NICE Way to Test OpenFlow Applications

Dejan Kostic, Marco Canini, Peter Peresini, Jennifer Rexford

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

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

Castor: Scalable Secure Routing for Ad Hoc Networks

Karl Aberer, Panagiotis Papadimitratos, Marcin Poturalski, Wojciech Galuba, Zoran Despotovic

Wireless ad hoc networks are inherently vulnerable, as any node can disrupt the communication of potentially any other node in the network. Many solutions to this problem have been proposed. In this paper, we take a fresh and comprehensive approach that ad ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2010

A Little Feedback Can Simplify Sensor Network Cooperation

Michael Christoph Gastpar

Shannon's discovery of digital communication has shaped the architecture of virtually all communication systems in use today. The digital communication paradigm is built around the notion of bits and uses careful coding to deliver bits reliably end-to-end. ...

2010

More on Castor: the Scalable Secure Routing for Ad-hoc Networks

Karl Aberer, Panagiotis Papadimitratos, Marcin Poturalski, Wojciech Galuba, Zoran Despotovic

2009

Potentials of Opportunistic Routing in Energy-Constrained Wireless Sensor Networks

Martin Vetterli, François Ingelrest

The low quality of wireless links leads to perpetual packet losses. While an acknowledgment mechanism is generally used to cope with these losses, multiple retransmissions nevertheless occur. Opportunistic routing limits these retransmissions by taking adv ...

Springer Berlin / Heidelberg2009