Showing papers on "Bounding overwatch published in 1984"

Bounding Fan-out in Logical Networks

Abstract: Algorithms are presented which modify logical networks of bounded fan-in to obtain functionally equivalent networks of bounded fan-m and fan-out, so that both size and depth are not increased by more than constant factors.

Bounding the solution of the continuous equilibrium network design problem

Abstract: The solution of the optimal equilibrium network design problem is perhaps the most computationally intensive problem encountered in transportation network analysis. This paper illustrates through the use of game-theoretic concepts how one can bound the solution of the continuous version of this problem by using two computationally efficient heuristics. This bounding procedure can then be used to assess whether or not it is necessary to solve for the exact solution to this problem. A numerical example is presented which illustrates this procedure. (Author/TRRL)

Bounding algorithms for queueing network models of computer systems

Abstract: This thesis is concerned with the problem of efficiently analyzing large separable queueing network models of computer systems. Obtaining the exact solution of such a network is often infeasible. Approximation techniques have been proposed that significantly reduce the cost of network analysis; however, these techniques lack bounds on the errors that they introduce. This thesis proposes algorithms that bound, rather than only estimate, the queueing network solution. Each bounding algorithm is based on the iterative structure of one of the exact solution algorithms, in which a queueing network solution is iteratively computed from the solutions of simpler networks. In an exact solution algorithm, the iteration is started from trivial networks whose solutions are known a priori. By starting from appropriate approximate solutions of more complex networks, the proposed bounding algorithms significantly reduce the cost of network analysis. Each bounding algorithm is analyzed with respect to its computational cost and its accuracy. A comparison is given among proposed and previous bounding algorithms, with the goal of determining appropriate bounding algorithms for various accuracy requirements, cost constraints, and queueing network types.