Showing papers on "Multipath routing published in 1975"

The automatic printed wire routing system of BACKIS

Abstract: As the printed wiring density on circuit packs and equipment multilayer boards increases, it becomes increasingly difficult for the unaided human to route the printed wire paths needed to interconnect the terminals constituting an electrical node (i.e., a net). Thus, a large amount of effort has been devoted to providing computer aids to assist the designer with the routing problem. The ultimate aim is to provide an automatic routing system which will achieve complete net connectivity meeting all hardware and electrical constraints. While the system presented here does not completely reach these goals, it does represent one of a series of steps in attempting to achieve it. It does this by providing fast, cost effective routers embodied in a system design which permits the user wide latitude in controlling the routing strategy to be used. This paper discusses the concept of a routing strategy, what strategies may be used, and some comments on what has been found to be an effective strategy.

Improvements in Routing for Packet-Switched Networks

Abstract: : Adaptive routing algorithms in store-and-forward communication networks are demonstrated to decrease average message delay, to increase message throughput, and to decrease the number of undelivered messages Comparisons of existing adaptive routing techniques are presented to provide the basis for extension of the theory in two areas: priority assignment for messages reaching an assigned aging threshold, and prevention of messages looping within the network Optimization of a defined measurement parameter, throughput factor, phi (t,k) is performed in terms of the priority threshold setting k A closed form solution for phi (t,k) is obtained on a 3-node network assuming infinite buffers and fixed routing Included are simulations on damaged and undamaged systems for specific inter-connected networks with finite buffers and adaptive routing Comparisons are made for the predicted phi (t,k) versus the simulated results on an undamaged network

On the dynamics of a class of optimum routing problems

Abstract: A particular class of routing problems associated with demand actuated transportation systems requires the repeated regeneration of minimum or optimum routes as a part of the more general routing problem. The generation or regeneration of routes by methods other than classical minimum route solutions is discussed. A general system model for processing demands in a demand actuated transportation or routing system is presented and discussed.