Dynamic File Assignment in a Computer Network Part II: Random Rates of Demand,
Abstract
The problem of dynamic file allocation in a computer network is treated in the case when the time-pattern of the file demand rates is not perfectly known in advance to the designer. Instead, only a prior distribution and a statistical behavior are assumed, and the rates have to be estimated on-line from the incoming requests. It is shown that these estimates are sufficient statistics for the optimal control. The equations giving the control laws as a function of the current estimates and the present location of the file are obtained.
Document Details
- Document Type
- Technical Report
- Publication Date
- Feb 01, 1975
- Accession Number
- ADA008645
Entities
People
- Adrian Segall
Organizations
- Massachusetts Institute of Technology