Abstract
The optimal file allocation in a loop topology local area network is investigated. The model, formulated as a 0–1 programming problem, takes into consideration several constraints that the objective function is subjected to. The model is initially a non-linear program which is reduced to linear form by a heuristic simplification. Results are presented for three typical situations.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.