TY - JOUR

T1 - DYNAMIC FILE ASSIGNMENT IN A COMPUTER NETWORK - 2. RANDOM RATES OF DEMAND.

AU - Segall, Adrian

PY - 1975

Y1 - 1975

N2 - 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 and obtain the equation giving the control laws as a function of the current estimates and the present location of the file.

AB - 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 and obtain the equation giving the control laws as a function of the current estimates and the present location of the file.

UR - http://www.scopus.com/inward/record.url?scp=0016650565&partnerID=8YFLogxK

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???

AN - SCOPUS:0016650565

SN - 0191-2216

SP - 161

EP - 166

JO - Proceedings of the IEEE Conference on Decision and Control

JF - Proceedings of the IEEE Conference on Decision and Control

T2 - Proc IEEE Conf Decis Control Incl Symp Adapt Processes 14th

Y2 - 10 December 1975 through 12 December 1975

ER -