scispace - formally typeset
Search or ask a question

Showing papers on "Routing table published in 1972"


Journal ArticleDOI
TL;DR: Experimental evidence is presented 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.
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.

47 citations


01 Dec 1972
TL;DR: The use of microcomputers in a message-switching network is introduced through a discussion of store-and-forward routing techniques and a modification of a routing algorithm is offered, which makes the microcomputer useable in message- Switching networks.
Abstract: The use of microcomputers in a message-switching network is introduced through a discussion of store-and-forward routing techniques. Algorithms that utilize both deterministic and stochastic principles are explained and those parameters which determine the computing machinery necessary are identified. INTEL Corporations MSC-8 microcomputing system is presented as a possible candidate for use in message-switching networks and some applications of these networks are discussed. A modification of a routing algorithm is offered, which makes the microcomputer useable in message-switching networks.