Showing papers on "Static routing published in 1973"

The design of store-and-forward (s/f) networks for computer communications

Abstract: : The emphasis of this research is on the development of mathematical programming tools for the design of S/F communication networks. An analytical model for the system is first presented and discussed. The design variables (routing of messages, channel capacities, topology, etc.) are then defined and proper design criteria (delay, cost, thruput, etc.) are established and expressed in terms of the variables. Next, various design problems are defined and investigated; the most significant of them here follow: (1) Find the minimum cost channel capacity assignment, given the routing of the messages and the maximum admissible delay T; (2) Find the routing which minimizes the delay, given the channel capacities (and therefore the cost); (3) Find the routing and capacities assignment which minimizes the cost, given the maximum admissible delay T. (4) Find the topology, routing and capacities assignment which minimizes the cost, given the maximum admissible delay T. (Author Modified Abstract)

Deterministic and adaptive routing policies in packet-switched computer networks

Abstract: Efficient routing policies are required for both design and operation of distributed, packet-switched computer networks. In the network design process, deterministic policies, which are time invariant, easy to analyze and simple to represent, are generally used. For the routing of packets in a real network, on the other hand, adaptive policies, which can adjust to traffic fluctuations and component failures are implemented. Therefore, a computer network is typically optimized with respect to a deterministic policy and then operated with an adaptive policy.In the first part of this paper the two policies are compared using analytical and simulation methods, and it is shown that, in uniform traffic situations, the flow patterns generated are very similar. This result justifies the use of deterministic policy in the design phase.In the second part of the paper, the inadequacy of traditional adaptive policies in handling particular traffic situations is pointed out. As a solution, a new centralized adaptive policy is proposed, which combines the positive features of both deterministic and adaptive routing. The feasibility of such centralized policy implementation on a real network, and its efficiency with respect to the traditional implementation is discussed.