This paper presents an adaptive routeing algorithm that avoids deadlocks and starvation. It is a general store-and-forward packet router that has been developed to be used as part of a distributed runtime system for Concurrent Clean, an experimental, lazy, higher-order parallel functional programming language based on term graph rewriting. The routeing algorithm is based on the one used by the ...

We analyze the unit-demand Euclidean vehicle routeing problem, where n customers are modeled as independent, identically distributed uniform points and have unit demand. We show new lower bounds on the optimal cost for the metric vehicle routeing problem and analyze them in this setting. We prove that there exists a constant ĉ > 0 such that the iterated tour partitioning heuristic given by Haim...

Recently, a basic pattern of coast seaway system networking has been established in China. As a result, a large number of precautionary areas will be gradually established. Because of the high frequency of ships’ encounters and accidents, these precautionary areas have been a weak but important facet of ships’ routeing. Navigational Traffic Conflict Technique (NTCT) was introduced to quantitati...

In a recent paper, Kleinberg (2000) considered a small-world network model consisting of a d-dimensional lattice augmented with shortcuts. The probability of a shortcut being present between two points decays as a power, r−α , of the distance, r , between them. Kleinberg showed that greedy routeing is efficient if α = d and that there is no efficient decentralised routeing algorithm if α = d. T...

This paper deals with the development of a computer model for flood routing in narrow rivers. Equations describing the propagation of a flood wave in a channel-flood plain system are presented and solved using an implicit finite difference scheme. Particular emphasis has been given to the treatment of the friction term in the governing equation of motion.