Publications related to Routing loop

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 ...

IEEE2023

Security-aware Routing and Scheduling for Control Applications on Ethernet TSN Networks

Amir Aminifar

Today, it is common knowledge in the cyber-physical systems domain that the tight interaction between the cyber and physical elements provides the possibility of substantially improving the performance of these systems that is otherwise impossible. On the ...

ASSOC COMPUTING MACHINERY2020

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

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

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

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

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

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 : 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

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

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

Neighbor discovery with reception status feedback to transmitters

Ramin Khalili

Neighbor discovery is essential for the process of self-organization of a wireless network, where almost all routing and medium access protocols need knowledge of one-hop neighbors. In this paper we study the problem of neighbor discovery in a static and s ...

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

Collaborative routing in mobile partitioned networks

Natasa Sarafijanovic-Djukic

Embedded wireless networks find a broad spectrum of applications in transportation, environmental monitoring, logistics, supply chain management, and "pocketswitched" communication. The node mobility patterns in these applications tend to give rise to spat ...

EPFL2010

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

Self-organized fault-tolerant routing in peer-to-peer overlays

Karl Aberer, Wojciech Galuba, Zoran Despotovic

In sufficiently large heterogeneous overlays message loss and delays are likely to occur. This has a significant impact on overlay routing, especially on longer paths. The existing solutions to this problem rely on message redundancy to mask the loss and d ...

IEEE2009

Distributed RWA tools via Web Services

Sébastien Rumley, Christian Gaumier

Several computer tools addressing the routing and wavelength assignment (RWA) problem are available today within the research community. However, these tools have low flexibility and are difficult to use for remote or casual users. This paper shows how to ...

IEEE2008

Routing in large-scale buses ad hoc networks

Michel Sède, Da Li

A Disruption-Tolerant Network (DTN) attempts to route packets between nodes that are temporarily connected. Difficulty in such networks is that nodes have no information about the network status and contact opportunities. The situation is different in publ ...

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