Optimal allocation of resources in distributed information networks
ACM Transactions on Database Systems (TODS) - Special issue: papers from the international conference on very large data bases: September 22–24, 1975, Framingham, MA
Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
Journal of the ACM (JACM)
Guest Editor's Overview… Queuing Network Models of Computer System Performance
ACM Computing Surveys (CSUR)
Queueing Network Modeling of Computer Communication Networks
ACM Computing Surveys (CSUR)
Optimal program and data locations in computer networks
Communications of the ACM
Systems Analysis for Data Transmission
Systems Analysis for Data Transmission
Presentation and major design aspects of the CYCLADES computer network
DATACOMM '73 Proceedings of the third ACM symposium on Data communications and Data networks: Analysis and design
File allocation for distributed computer communication networks
File allocation for distributed computer communication networks
Communication nets; stochastic message flow and delay
Communication nets; stochastic message flow and delay
Graph theory: An algorithmic approach (Computer science and applied mathematics)
Graph theory: An algorithmic approach (Computer science and applied mathematics)
Optimal File Allocation in a Multiple Computer System
IEEE Transactions on Computers
Allocation of copies of a file in an information network
AFIPS '72 (Spring) Proceedings of the May 16-18, 1972, spring joint computer conference
Exact calculation of computer network reliability
AFIPS '72 (Fall, part I) Proceedings of the December 5-7, 1972, fall joint computer conference, part I
Computer and Database Location in Distributed Computer Systems
IEEE Transactions on Computers
Optimization models for configuring distributed computer systems
IEEE Transactions on Computers
Location of computers and multiple files in distributed computer systems
Mathematical and Computer Modelling: An International Journal
| Hi-index | 14.99 |
An algorithm is presented to determine locations for the storage of copies of files in store-and-forward computer communications networks. The algorithm determines storage locations which minimize the sum of network file storage costs and message transmission costs. Networks that use adaptive routing techniques are the primary focus. Feasible file locations must satisfy network performance requirements for file availability and delay by message class. An effective method of evaluating delay constraints for networks using adaptive routing techniques is introduced. The algorithm uses the solution to a p-median problem to identify initial candidate file placements. Interaction between a set of file movement rules and a network simulator is employed to modify initial placements to fmd near-optimal locations which satisfy the network performance constraints.