This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
March 1983 (vol. 32 no. 3)
pp. 232-244
L.J. Laning, Management Systems Division, Procter & Gamble
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.
Index Terms:
simulation, Adaptive routing, algorithm, computer communication network, distributed data management, file'allocation, heuristic, mathematical programming, network delay, P-median
Citation:
L.J. Laning, M.S. Leonard, "File Allocation in a Distributed Computer Communication Network," IEEE Transactions on Computers, vol. 32, no. 3, pp. 232-244, March 1983, doi:10.1109/TC.1983.1676215
Usage of this product signifies your acceptance of the Terms of Use.