Concept

Link-state routing protocol

Related publications (140)

A Tutorial-Cum-Survey on Percolation Theory With Applications in Large-Scale Wireless Networks

Connectivity is an important key performance indicator and a focal point of research in large-scale wireless networks. Due to path-loss attenuation of electromagnetic waves, direct wireless connectivity is limited to proximate devices. Nevertheless, connec ...

Ieee-Inst Electrical Electronics Engineers Inc2024

IIBLAST: Speeding Up Commercial FPGA Routing by Decoupling and Mitigating the Intra-CLB Bottleneck

Mirjana Stojilovic, Stefan Nikolic, Shashwat Shrivastava

We identified that in modern commercial FPGAs, routing signals from the general interconnect to the configurable logic blocks (CLBs) through a very sparse input interconnect block (IIB) represents a significant runtime bottleneck. This is despite academic ...

2023

Synthesis and chemical transformations of diazolyl alpha,alpha-difluoroacetates

Pavlo Khodakivskyi

Optimized protocols for the synthesis of diazolyl alpha,alpha-difluoroacetates via deoxofluorination of the corresponding glyoxylates with Morph-DAST are described. The method allowed the preparation of the title fluoridated building blocks in 73-96 % yiel ...

ELSEVIER SCIENCE SA2020

Routing for Wireless Sensor Networks: From Collection to Event-Triggered Applications

Daniel Camilo Rojas Quirós

Wireless Sensor Networks (WSNs) are collections of sensing devices using wireless communication to exchange data. In the past decades, steep advancements in the areas of microelectronics and communication systems have driven an explosive growth in the depl ...

EPFL2018

Stability-Aware Integrated Routing and Scheduling for Control Applications in Ethernet Networks

Amir Aminifar

Real-time communication over Ethernet is becoming important in various application areas of cyber-physical systems such as industrial automation and control, avionics, and automotive networking. Since such applications are typically time critical, Ethernet ...

2018

A general framework for routing problems with stochastic demands

Michel Bierlaire, Sacha Varone, Mohammad Yousef Maknoon, Iliya Dimitrov Markov

We introduce a unified modeling and solution framework for various classes of rich vehicle and inventory routing problems as well as other probability-based routing problems with a time-horizon dimension. Demand is assumed to be stochastic and non-stationa ...

2017

Parallel FPGA routing: Survey and challenges

Mirjana Stojilovic

As transistor scaling is slowing down [1], other opportunities for ensuring continuous performance increase have to be explored. Field programmable gate arrays (FPGAs) are in the spotlight these days: not only due to their malleability and energy efficienc ...

2017

A Linear Programming Approach to Routing Control in Networks of Constrained Nonlinear Positive Systems with Concave Flow Rates

Nicolas Dousse

We consider control design for positive compartmental systems in which each compartment's outflow rate is described by a concave function of the amount of material in the compartment. We address the problem of determining the routing of material between co ...

Elsevier2016

Dynamic Routing for Flying Ad Hoc Networks

Dario Floreano, Bixio Rimoldi, Stefano Rosati, Grégoire Hilaire Marie Heitz, Karol Jacek Kruzelecki

This paper reports experimental results on self-organizing wireless networks carried by small flying robots. Flying ad hoc networks (FANETs) composed of small unmanned aerial vehicles (UAVs) are flexible, inexpensive and fast to deploy. This makes them a v ...

Ieee-Inst Electrical Electronics Engineers Inc2016

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

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.