Showing papers on "Static routing published in 1972"

On the Ordering of Connections for Automatic Wire Routing

Abstract: Most wire-routing programs utilize a maze-running technique to route one connection at a time. Once routed, a wire cannot be moved even if it is subsequently discovered to interfere with the successful completion of other connections. The order in which the desired connections are presented to the routing algorithm has therefore been thought to be of critical importance. Experimental evidence is presented, however, to show that the performance of a router, when measured in terms of the total of the minimum (or ideal) lengths of the connections successfully completed, is, in fact, independent of the order in which connections are attempted.

Use of a multiple routing technique for one pass capacity restraint assignments

Abstract: MULTIPLE ROUTING, AS PRESENTED HERE, ADDS THROUGH ITS STOCHASTIC PRINCIPLE A LONG-SOUGHT ELEMENT OF REALISM TO THE TRAFFIC ASSIGNMENT PROCESS. THIS PRINCIPLE ELIMINATES THE PROBLEM ASSOCIATED WITH THE MINIMUM PATH PROCEDURE, WHICH LEADS TO EXTREMELY UNBALANCED FLOWS WHERE MORE THAN ONE ACCEPTABLE ROUTE EXISTS BETWEEN PAIRS OF NODES. WITH THE MULTIPLE ROUTING PRINCIPLE AS ITS BASIC FRAMEWORK, A ONE-PASS INCREMENTAL CAPACITY RESTRAINT PROCEDURE IS PRESENTED, WHICH PROVIDES A FLEXIBLE AND ECONOMICAL TOOL FOR PRODUCING TRAFFIC ASSIGNMENTS WITH STABLE SPEED-FLOW RELATIONSHIPS. RESULTS OBTAINED WITH THIS PROCEDURE INDICATE A LEVEL OF ASSIGNMENT ACCURACY WHICH IS EQUIVALENT OR SUPERIOR TO THAT OBTAINED WITH FOUR ITERATIONS OF THE FREQUENTLY USED AVERAGING PROCEDURE. /AUTHOR/