Showing papers on "Destination-Sequenced Distance Vector routing published in 1970"

Routing Algorithm of Mobile Agents for Query Retrieval Using Genetic Algorithm

Abstract: Mobile agents often have a task to collect data from several predefined sites. This should be done in an efficient way by minimising the elapsed time. Usually these agents only know the list of sites but not the distances between them. This paper proposes a method to minimise a network routing time taken by the mobile agents to collect information from different sites using genetic algorithm (GA). The mobile agents repeat travelling over short routes and avoid longer ones. Mobile agents for query retrieval have used the GA to select the best routes that minimise the query retrieval time. The result shows that the proposed method provides good time minimisation in retrieving the query results by the mobile agents based on different GA parameters.

Adaptive routing in a large communications network

Abstract: This paper is concerned with the behavior of an adaptive routing system in a large communications network. The adaptive routing algorithm described uses stochastic switching matrices to automatically find and complete the traffic paths through a system. A realistic network and traffic which were derived from military field exercises are used to illustrate the real time behavior of the algorithm. Simulation experiments indicate that adaptive routing techniques can be effective in large communications networks.

A branch-and-bound algorithm for the solution of sequence dependent routing problems

Abstract: A branch -and -bound algorithm, which finds the optimal route through n nodes when a different cost matrix occurs after each arc in the sequence is traversed, is presented. The route may begin at any node and must pass through each of the n nodes exactly once. The objective is to minimize total cost in traversing (n-1) arcs of the route. The cost of traversing each arc is r.., which is a function of the distance between nodes i and i and a function of the k position in the sequence of arcs forming the route. The algorithm is presented in step-by-step detail and illustrated by flow chart and examples. A modification for symmetric (r..) improves the efficiency of the algorithm. A trade-off between computation time and storage requirements may be accomplished by alternate branching policies. Suboptimal solutions may be obtained with reduced computation. !fPOSTGRADUATE SCHOOS HAVAL p0bi l,7; ir 93940 HTEBEY, CALIF. V* TABLE OF CONTENTS