Mathematical Programming in Computer Network Design.
Abstract
In this thesis, the design of a distributed packet-switched computer network is addressed. This design is based on the Egyptian environments and the use of mathematical programming techniques. Two equally important problems are presented: Network Topology, and Dynamic allocation of file and program copies in such network. A cost-effective structure for such a network topology is presented. The general design problem is stated and decomposed into simpler subproblems (backbone and local access design). The available mathematical programming techniques are applied. The second important design problem also addressed is how to get the optimal dynamic file and program allocation in that developed network topology, when more than one copy is allowed in the system at any given time. The evolution of the system is represented as a finite state Markov process and Dynamic Programming is used to developing a general model. This model assigns the locations of the F/P copies dynamically to mimimize the response time and operating costs (storage and transmission). Originator supplied keywords include: Distributed Computer Network; Mathematical Programming; File and Program Allocation; Dynamic Programming. (Author).
Document Details
- Document Type
- Technical Report
- Publication Date
- Dec 01, 1984
- Accession Number
- ADA152275
Entities
People
- M. H. Khalifa
Organizations
- Air Force Institute of Technology