Showing papers on "Hazy Sighted Link State Routing Protocol published in 1986"

Distributed asynchronous optimal routing in data networks

Abstract: In this paper we study the performance of a class of distributed optimal routing algorithms of the gradient projection type under weaker and more realistic assumptions than those considered thus far. In particular, we show convergence to an optimal routing without assuming synchronization of computation at all nodes and measurement of link lengths at all links, while taking into account the possibility of link flow transients caused by routing updates. This demonstrates the robustness of these algorithms in a realistic distributed operating environment.

State-dependent routing for telephone traffic: Theory and results

Abstract: In the modern telephone network, it has become feasible to consider sophisticated call-routing schemes in order to minimize network blocking --- in particular, routing schemes which select a route for a call on the basis of the network 'state' at the time of call-arrival. In this paper, we construct an analytical model for such state-dependent routing in the framework of Markov decision processes, and derive a simple state-dependent routing scheme called 'separable' routing. The performance of this routing scheme in two network designs for a metropolitan network model is compared over a range of loads, by means of call-by-call simulations of traffic flow, with that of two other schemes: the 'sequential' routing used in the Dynamic Non-Hierarchical Routing (DNHR) network, and the 'Least-Loaded Routing' (LLR) proposed for the Trunk Status Map. In one case, separable routing achieves lower network blocking than the other schemes at normal load and overloads, while, in the other case, the improvement occurs only above a certain level of overload. However, a modified version of separable routing (to be presented in a future paper) achieves better performance than the other schemes in both networks over the entire range of loads.

Proposed Routing Algorithms for the U.S. Army Mobile Subscriber Equipment (MSE) Network

Abstract: The US Army Mobile Subscriber Equipment (MSE) Network consists of a large number of geographically dispersed, mobile radio terminals which require secure communications The network is also subject to attacks by the enemy In this paper, we propose and analyze alternative network routing algorithms for the MSE

Routing as a flow control strategy in an integrated circuit/packet switched communications network

Abstract: This research addresses the analysis of an event-driven FORTRAN Simulation Model that simulates a special kind of Computer-Communication network. The network modeled has a circuit-switched communication subnet whose trunk lines carry both voice and data traffic simultaneously. This effort considers the viability of routing strategies as a mechanism for reducing congestion. The performance of seven alternative routing strategies are measured in terms of user-visible metrics.Based on the experimental results obtained, this research concludes that fixed routing, the technique assumed by most models, is not as effective a tool for reducing congestions as would be a strategy based on link utilization. Minimization of congestion can be realized only if the routing strategy is adjusted as workload varies. Experimental data supporting these conclusions is presented.

A routing algorithm with candidate shortest path

Abstract: An improved algorithm based on the next node routing principle is proposed in this paper. In this algorithm there is a column added to the classical routing table, in which the candidate shortest distance to the destination node is the entry. When a link fails, the new shortest path in the nodes connected directly with the failure link can be found immediately (it is just the candidate shortest path before failure). For all other nodes in which routing tables should be changed, the required number of control messages and time for convergence are also less than Tajibnapis‖ algorithm and Predecessor algorithm. The message looping problem does not exist in duplex loop networks and is radically improved in mesh networks. These statements are proved by the analysis and simulation in this paper. From the simulation results of a 30-node mesh network, when one link goes down, the total number of control messages generated during convergence with this algorithm on the average is about 30% of Tajibnapis‖ algorithm. The iterations required is 50% of Tajibnapis‖ algorithm. The memory space required and computation complexity in nodes are almost the same as the two algorithms mentioned above and the algorithm implementation is as easy as well.