Equal-cost multi-path routing

About: Equal-cost multi-path routing is a research topic. Over the lifetime, 10472 publications have been published within this topic receiving 249362 citations.

High-performance adaptive routing

Abstract: A method for communication includes routing a first packet, which belongs to a given packet flow, over a first routing path through a communication network A second packet, which follows the first packet in the given packet flow, is routed using a time-bounded Adaptive Routing (AR) mode, by evaluating a time gap between the first and second packets, routing the second packet over the first routing path if the time gap does not exceed a predefined threshold, and, if the time gap exceeds the predefined threshold, selecting a second routing path through the communication network that is potentially different from the first routing path, and routing the second packet over the second routing path

Avoid 'void' in geographic routing for data aggregation in sensor networks

Abstract: Wireless sensor networks have attracted great attention in research and industrial development due to their fast-growing application potentials. New techniques must be developed for sensor networks due to their lack of infrastructure support and the constraints on computation capability, memory space, communication bandwidth and above all, energy supply. To prolong the life time of a battery-powered sensor network, an energy efficient routing algorithm for data collection is essential. We propose a new geographic routing algorithm that forwards packets from sensors to base stations along efficient routes. The algorithm eliminates the voids that cause non-optimal routing paths in geographic routing. It replaces the right-hand rule by distance upgrading. It is fully distributed and responds to topology changes instantly with localised operations. We formally prove the correctness of the algorithm and evaluate its performance by simulations.

From NoC security analysis to design solutions

Abstract: This paper addresses a new kind of security vulnerable spots introduced by network-on-chip (NoC) use in system-on-chip (SoC) design. This study is based on the experience of a CAD framework for NoC design and proposes a classification of weaknesses with regard to usual routing and interface techniques. Finally design strategies are proposed and a new path routing technique (SCP) is introduced with the aim to enforce security.

Implementation of Gradient Routing in Wireless Sensor Networks

Abstract: IETF ROLL has recently proposed gradient routing as a fundamental building block for data collection in Wireless Sensor Networks. This paper seconds this choice by presenting an implementation of gradient routing on current hardware, and by showing experimentally that gradient routing is robust against topological changes. To stress its self-healing quality, we design and implement a complete communication stack in which neighbor tables are built in a purely reactive fashion. We quantify the resulting topological changes, and show how gradient routing elegantly handles these dynamics. This paper presents, to the best of our knowledge, the first experimental study on gradient routing as advocated by IETF ROLL.