Shortest path routing schemes like Open Shortest Path First (OSPF) have shortcomings when networks are highly loaded. Traffic engineering of IP networks is required to avoid this problem. Current efforts suggest the optimisation of OSPF weights to balance the network load more evenly. Also more advanced technologies like Multiprotocol Label Switching (MPLS) are proposed. One major problem of dy...

DAR, dynamic alternative routing, is a simple but effective form of dynamic routing which is decentralised and which uses only a small amount of local information. This paper examines the modelling and behaviourial aspects of such a scheme. In particular various bounds are presented which hold for any kind of dynamic routing scheme, and can be used to assess the performance of DAR. DAR can be i...

This paper presents results from the IST Phosphorus project that studies and implements an optical Grid test-bed. A significant part of this project addresses scheduling and routing algorithms and dimensioning problems of optical grids. Given the high costs involved in setting up actual hardware implementations, simulations are a viable alternative. In this paper we present an initial study whi...

The objective is a routing scheme that chooses almost the shortest path but requires few rerouting changes when some link’s length changes. We construct a probabilistic routing where the probability a path is chosen depends on the path’s length. This probability can be computed recursively using only neighboring nodes. Moreover, when a path’s length changes, one resamples the original random ch...

Alternative fuel vehicles may pose challenges to evacuation planning because of their short driving range and the sparse refueling infrastructure existing on transportation networks. Deployment strategic siting emergency stations are needed support alternative reach a shelter. This study proposes location-routing problem with hop constraints that optimize placement each type routing. We develop...

Most routing protocols for delay tolerant networks resort to the sufficient state information, including trajectory and contact information, to ensure routing efficiency. However, state information tends to be dynamic and hard to obtain without a global and/or long-term collection process. In this paper, we use the internal social features of each node in the network to perform the routing proc...

Most routing protocols for delay tolerant networks resort to the sufficient state information, including trajectory and contact information, to ensure routing efficiency. However, state information tends to be dynamic and hard to obtain without a global and/or long-term collection process. In this paper, we use the internal social features of each node in the network to perform the routing proc...

Dynamic routing in WDM (Wavelength Division Multiplexing) networks is achieving increasing interest due to the expected traffic growth for future optical networks. This contribution concentrates on network performance issues occurring for network operation under dynamic traffic load. In this context, routing strategies play a central role. We show that a new strategy achieves very good performa...

We design a coordination mechanism for truck drivers that uses pricing-and-routing schemes can help alleviate traffic congestion in general transportation network. consider the user heterogeneity Value-Of-Time (VOT) by adopting multi-class model with stochastic Origin-Destination (OD) demands drivers. The main characteristic of is coordinator asks to declare their desired OD pair and pick indiv...

We compare the long-term, steady-state performance of a variant of the standard Dynamic Alternative Routing (DAR) technique commonly used in telephone and ATM networks, to the performance of a path-selection algorithm based on the “balanced-allocation” principle [3, 16]; we refer to this new algorithm as the Balanced Dynamic Alternative Routing (BDAR) algorithm. While DAR checks alternative rou...