Concept

Routing loop

Publications associées (77)

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

HYDROLOGY

André Musy

This book presents the main hydrological methods and techniques used in the design and operation of hydraulic projects and the management of water resources and associated natural risks. It covers the key topics of water resources engineering, from the est ...

CRC Press Taylor & Francis Group2014

Optimal Dynamic Route Guidance: A Model Predictive Approach Using the Macroscopic Fundamental Diagram

Since centralized control of urban networks with detailed modeling approaches is computationally complex and inefficient, hierarchical decentralized methods based on aggregate models are of great importance. In this paper, we use an aggregate modeling appr ...

IEEE2013

Active flood management in Alpine catchment areas equipped with storage hydropower schemes

Anton Schleiss, Martin Peter Bieri, Frédéric Jordan

The simulation of runoff in Alpine catchment areas is essential for the optimal operation of high-head storage hydropower plants (HPP) under normal flow conditions, but also in case of flood events. A semi-distributed conceptual numerical approach has been ...

Crc Press-Taylor & Francis Group2013

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

Polynomial Approximations for Continuous Linear Programs

Daniel Kuhn

Continuous linear programs have attracted considerable interest due to their potential for modeling manufacturing, scheduling, and routing problems. While efficient simplex-type algorithms have been developed for separated continuous linear programs, crude ...

2012

Implementation of a Wireless Mesh Network of Ultra Light MAVs with Dynamic Routing

Dario Floreano, Bixio Rimoldi, Jean-Christophe Zufferey, Alberto Jimenez Pacheco, Yannick Gasser

This paper describes the implementation and characterisation of a mobile ad-hoc network (MANET) of ultra-light intelligent flying robots. The flying nature of the network makes it suitable to collect or disseminate content in urban areas or challenging ter ...

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

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

Joint Sink Mobility and Routing to Maximize the Lifetime of Wireless Sensor Networks: The Case of Constrained Mobility

Jean-Pierre Hubaux, Jun Luo

The longevity of wireless sensor networks (WSNs) is a major issue that impacts the application of such networks. While communication protocols are striving to save energy by acting on sensor nodes, recent results show that network lifetime can be prolonged ...

2010

On the Age of Pseudonyms in Mobile Ad Hoc Networks

Jean-Yves Le Boudec, Jean-Pierre Hubaux, Julien Freudiger

In many envisioned mobile ad hoc networks, nodes are expected to periodically beacon to advertise their presence. In this way, they can receive messages addressed to them or participate in routing operations. Yet, these beacons leak information about the n ...

2010