Routing Information Protocol

Applied sciences
Génie informatique
Réseau informatique
Routage IP

Publications associées (20)

À propos
Confidentialité
Mentions légales

Graph Chatbot

Stable Routing And Unique-Max Coloring On Trees

Laura Sanità, Rico Zenklusen, Nicolai Hähnle

Some of the routing protocols used in telecommunication networks route traffic on a shortest path tree according to configurable integral link weights. One crucial issue for network operators is finding a weight function that ensures a stable routing: when ...

SIAM Publications2013

On the efficiency of routing in sensor networks

Florian Huc

In sensor networks, a key efficiency measure for routing protocols is the stretch of the computed paths, where the stretch is the ratio of the path length and the Euclidean distance covered. In the literature, many protocols have been evaluated via extensi ...

2012

Efficient graph planarization in sensor networks and local routing algorithm

Florian Huc

In this paper, we propose an efficient planarization algorithm and a routing algorithm dedicated to Unit Disk Graphs whose nodes are localized using the Virtual Raw Anchor Coordinate system (VRAC). Our first algorithm computes a planar 2-spanner under ligh ...

Ieee2012

Pollution due to plastics and microplastics in Lake Geneva and in the Mediterranean Sea

Luiz Felippe De Alencastro, Florian Faure, Hadrien Baecher, Marie Corbaz

Aquatic pollution due to plastics, and especially microplastics, is becoming the subject of growing research together with an increasing awareness of their environmental harm. While most of the studies focus on oceans, the situation regarding lakes remains ...

2012

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

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

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

Signaling and Reciprocity : Robust Decentralized Information Flows in Social, Communication, and Computer Networks

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

On the capacity of non-coherent network coding

Christina Fragouli, Suhas Diggavi, Mahdi Jafari Siavoshani, Soheil Mohajerzefreh

We consider the problem of multicasting information from a source to a set of receivers over a network where interme- diate network nodes perform randomized linear network coding operations on the source packets. We propose a channel model for the noncoher ...

2011

Agent-Based Routing in Queueing Systems

Olivier Gallay

Waiting time in any network is often a costly and hence a bad experience. Therefore, to avoid jamming regions becomes essential in the optimization of traffic flows. In this regard, the conception and the control of complex networks supporting flows of uni ...

EPFL2010

Page 2 sur 2