Publication

Securing the Internet Routing Infrastructure

Related publications (47)

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.

Signaling and Reciprocity

Wojciech Galuba

Complex networks exist for a number of purposes. The neural, metabolic and food networks ensure our survival, while the social, economic, transportation and communication networks allow us to prosper. Independently of the purposes and particularities of th ...

EPFL2011

Adaptive Fuzzy Spray and Wait: Efficient Routing for Opportunistic Networks

Hamza Harkous

The technological advancement in the area of wireless networking is ultimately envisioned to reach complete and seamless ubiquity, where every point on earth will need to be covered by Internet access. Low connectivity environments have emerged as a major ...

2011

Adaptive Fuzzy Spray and Wait: Efficient Routing for Opportunistic Networks

Hamza Harkous

2011

Energy-Proportional and Scalable Networks

Nedeljko Vasic

The power consumption of the Internet and datacenter networks is already significant due to a large degree of redundancy and high idle power consumption of the network elements. Therefore, dynamically matching network resources to the actual load is highly ...

EPFL2011

Scalable Routing Easy as PIE: a Practical Isometric Embedding Protocol

Patrick Thiran, Julien Pierre Sacha Herzen

We present PIE, a scalable routing scheme that achieves 100% packet delivery and low path stretch. It is easy to implement in a distributed fashion and works well when costs are associated to links. Scalability is achieved by using virtual coordinates in a ...

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

Ambush avoidance in Vehicle Routing for valuable delivery

Matteo Salani, Gaëtan Duyckaerts, Peter Swartz

In this work we consider route planning for valuable delivery in an urban environment under the threat of ambushes in which a vehicle, starting from a depot, has to serve a set of predetermined destinations during the day. We provide a method to plan for h ...

2009

Circulation of Autonomous Agents in Production and Service Networks

Max-Olivier Hongler, Olivier Gallay

The inherent complexity characterizing the production and/or service networks strongly favors decentralized and self-organizing mechanisms to regulate the flows of matter and information in circulation. This basic observation motivates us to study the flow ...

Elsevier2009

BARP-A Dynamic Routing Protocol for Balanced Distribution of Traffic in NoCs to Avoid Congestion

Pejman Lotfi Kamran

A novel routing algorithm, named Balanced Adaptive Routing Protocol (BARP), is proposed for NoCs to provide adaptive routing and ensure deadlock-free and livelock-free routing at the same time. By evenly distributing input packets of a router among all its ...

2008

On Clustering Phenomenon in Mobile Partitioned Networks

Matthias Grossglauser, Natasa Sarafijanovic-Djukic

According to different kinds of connectivity, we can distinguish three types of mobile ad-hoc networks: dense, sparse and clustered networks. This paper is about modeling mobility in clustered networks, where nodes are concentrated into clusters of dense c ...

ACM2008

Mobility-Centric Geocasting For Mobile Partitioned Networks

We describe our design of a geocast service for mobile partitioned networks (MPNs). We focus mainly on minimizing the delivery latency. Our approach exploits the time-stability of the collective mobility pattern. In MPNs, in contrast to MANETs, the end-to- ...

IEEE2008