Publications associées à Routage dynamique

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.

Space lower bounds for low-stretch greedy embeddings

Christos Kalaitzis

Greedy (geometric) routing is an important paradigm for routing in communication networks. It uses an embedding of the nodes of a network into points of a space (e.g., R-d) equipped with a distance function (e.g., the Euclidean distance l(2)) and uses as a ...

Elsevier Science Bv2016

A Full-Capacity Local Routing Architecture for FPGAs

Giovanni De Micheli, Pierre-Emmanuel Julien Marc Gaillardon, Xifan Tang

Reconfigurable systems employ highly-routable local routing architecture to interconnect generic fine-grain logic blocks. Commercial FPGAs employ 50% sparse crossbars rather than fully-connected crossbars in their local routing architecture to trade off be ...

2016

Hierarchical Routing Over Dynamic Wireless Networks

Matthias Grossglauser, Suhas Diggavi, Dominique Florian Tschopp

The topology of a mobile wireless network changes over time. Maintaining routes between all nodes requires the continuous transmission of control information, which consumes precious power and bandwidth resources. Many routing protocols have been developed ...

Wiley-Blackwell2015

Wireless Network Simplification: The Gaussian N-Relay Diamond Network

Christina Fragouli

We consider the Gaussian N-relay diamond network, where a source wants to communicate to destination node through a layer of N-relay nodes. We investigate the following question: what fraction of the capacity can we maintain using only k out of the N avail ...

Institute of Electrical and Electronics Engineers2014

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

Stable Routing And Unique-Max Coloring On Trees

Laura Sanità, Rico Zenklusen

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

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

Yield stress modelling of doped alumina suspensions for applications in freeze granulation: towards dry pressed transparent ceramics

Paul Bowen, Michael Stuer

Rheology of powder suspensions is a key factor in many processing routes, and better understanding of the parameters that control the rheology improves technical progress by reducing the empirical factors in the formulation of powder slurries. The strict r ...

Maney Publishing2012

Routage dynamique

Graph Chatbot

Chattez avec Graph Search

Space lower bounds for low-stretch greedy embeddings

A Full-Capacity Local Routing Architecture for FPGAs

Hierarchical Routing Over Dynamic Wireless Networks

Wireless Network Simplification: The Gaussian N-Relay Diamond Network

HYDROLOGY

Measuring and Controlling Energy Consumption of Sensor networks

Stable Routing And Unique-Max Coloring On Trees

On the efficiency of routing in sensor networks

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

Yield stress modelling of doped alumina suspensions for applications in freeze granulation: towards dry pressed transparent ceramics

Space lower bounds for low-stretch greedy embeddings

Hierarchical Routing Over Dynamic Wireless Networks

A Full-Capacity Local Routing Architecture for FPGAs

Wireless Network Simplification: The Gaussian N-Relay Diamond Network

HYDROLOGY

Measuring and Controlling Energy Consumption of Sensor networks

On the efficiency of routing in sensor networks

Yield stress modelling of doped alumina suspensions for applications in freeze granulation: towards dry pressed transparent ceramics

Stable Routing And Unique-Max Coloring On Trees

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