Static routing

About: Static routing is a research topic. Over the lifetime, 25733 publications have been published within this topic receiving 576732 citations.

A comparison of routing strategies for vehicular ad-hoc networks

Abstract: On this paper we investigate the use of ad-hoc routing algorithms for the exchange of data between vehicles There are two main aspects that are of interest in this context: the specific characteristics of ad-hoc networks formed by vehicles and the applicability of existing ad-hoc routing schemes to networks that display these characteristics In order to address both aspects we generate realistic vehicular movement patterns of highway traffic scenarios using a well validated traffic simulation tool Based on these patterns we show that the characteristics of vehicular ad-hoc networks are quite different from the frequently used random waypoint model We then proceed to evaluate the performance of a reactive ad-hoc routing protocol (DSR) and of a position-based approach (greedy forwarding as done in GPSR) in combination with a simple reactive location service Our analysis suggests that for vehicular networks where communication spans more than 2 or 3 hops position-! based ad-hoc routing has significant advantages over reactive non-position-based approaches both in the number of successfully delivered packets and in routing overhead

An effective congestion driven placement framework

Abstract: We present a fast but reliable way to detect routing criticalities in VLSI chips. In addition, we show how this congestion estimation can be incorporated into a partitioning based placement algorithm. Different to previous approaches, we do not rerun parts of the placement algorithm or apply a post-placement optimization, but we use our congestion estimator for a dynamic avoidance of routability problems in one single run of the placement algorithm. Computational experiments on chips with up to 1,300,000 cells are presented: The framework reduces the usage of the most critical routing edges by 9.0% on average, the running time increase for the placement is about 8.7%. However, due to the smaller congestion, the running time of routing tools can be decreased drastically, so the total time for placement and (global) routing is decreased by 47% on average.

QoS routing in networks with uncertain parameters

Abstract: This article considers the problem of routing connections with QoS requirements across networks, when the information available for making routing decisions is inaccurate. This uncertainty about the actual state of a network component arises naturally in a number of different environments, which are reviewed in the paper. The goal of the route selection process is then to identify a path that is most likely to satisfy the QoS requirements. For end to end delay guarantees, this problem is intractable. However we show that by decomposing the end-to-end constraint into local delay constraints, efficient and tractable solutions can be established. We first consider the simpler problem of decomposing the end-to-end constraint into local constraints, for a given path. We show that, for general distributions, this problem is also intractable. Nonetheless, by defining a certain class of probability distributions, which posses a certain convexity property, and restricting ourselves to that class, we are able to establish efficient and exact solutions. Moreover, we show that typical distributions would belong to that class. We then consider the general problem, of combined path optimization and delay decomposition. We present an efficient solution scheme for the above class of probability distributions. Our solution is similar to that of the restricted shortest-path problem, which renders itself to near-optimal approximations of polynomial complexity. We also show that yet simpler solutions exist in the special case of uniform distributions.

The Deployment of a Smart Monitoring System Using Wireless Sensor and Actuator Networks

Abstract: In this paper, we explore the implementation of a smart monitoring system over a wireless sensor network, with particular emphasis on the creation of a solid routing infrastructure through the Routing Protocol for Low- power and lossy networks (RPL), whose definition is currently being discussed within the IETF ROLL working group. Our framework is based on a very lightweight implementation of the REpresentational State Transfer (REST) paradigm by means of a binary web service, and on a publish/subscribe mechanism, whereby every node makes a set of resources (e.g., environmental sensors) available to interested parties. Limited to the effectiveness in creating the routing structure, we provide a performance evaluation of RPL through an experimental campaign, aimed at showing how RPLs key parameters affect the performance of routing in a smart grid scenario.

Method for providing an efficient and adaptive management of message routing in a multi-platform and apparatus communication system

Abstract: The method for providing an efficient and adaptive management of message routing in a multi-platform, communication system having dynamically changing platform populations and dynamically changing connectivities between platforms where each of the platforms are capable of performing the steps of recognizing at least certain ones of the platforms in the system, deriving from at least one of the recognized platforms the quality of interconnectivities of the recognized platforms and certain others of the platforms in the system; and employing the derived quality of interconnectivities to make connectivity-based routing decisions using a selective one of a point-to-point routing algorithm, a point-to-multipoint routing algorithm and a broadcast routing algorithm.