The DOI matches its Crossref record.
Optimal allocation of resources in distributed information networks
Abstract
The problems of file allocation and capacity assignment in a fixed topology distributed computer network are examined. These two aspects of the design are tightly coupled by means of an average message delay constraint. The objective is to allocate copies of information files to network nodes and capacities to network links so that a minimum cost is achieved subject to network delay and file availability constraints. A model for solving the problem is formulated and the resulting optimization problem is shown to fall into a class of nonlinear integer programming problems. Deterministic techniques for solving this class of problems are computationally cumbersome, even for small size problems. A new heuristic algorithm is developed, which is based on a decomposition technique that greatly reduces the computational complexity of the problem. Numerical results for a variety of network configurations indicate that the heuristic algorithm, while not theoretically convergent, yields practicable low cost solutions with substantial savings in computer processing time and storage requirements. Moreover, it is shown that this algorithm is capable of solving realistic network problems whose solutions using deterministic techniques are computationally intractable.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Comparative Models of the File Assignment Problem
Dowdy, L. W., & Foster, D. V. (1982) · ACM Computing Surveys · doi:10.1145/356876.356883 · Cited by 472
Vertical partitioning algorithms for database design
Navathe, S., Ceri, S., Wiederhold, G., & Dou, J. (1984) · ACM Transactions on Database Systems · doi:10.1145/1994.2209 · Cited by 420
A microeconomic approach to optimal resource allocation in distributed computer systems
Kurose, J. F., & Simha, R. (1989) · IEEE Transactions on Computers · doi:10.1109/12.24272 · Cited by 276
Analytic Queueing Network Models for Parallel Processing of Task Systems
Thomasian, & Bay (1986) · IEEE Transactions on Computers · doi:10.1109/tc.1986.1676712 · Cited by 104
Metadata
- Authors
- Mahmoud, S., & Riordon, J. S.
- Venue
- ACM Transactions on Database Systems
- Published
- 1976-03
- Volume
- 1
- Issue
- 1
- Pages
- 66-78
- ISSN
- 0362-5915 (ISSN-L)
- 1557-4644
- OpenAlex
- W2140234885
- Cited by
- 174
- References
- 0
- FWCI
- 10.66
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Optimal allocation of resources in distributed information networks. https://app.cochat.ai/papers/10.1145/320434.320449
- The paper
- Mahmoud, S., & Riordon, J. S. (1976). Optimal allocation of resources in distributed information networks. ACM Transactions on Database Systems. https://doi.org/10.1145/320434.320449
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.