The DOI matches its Crossref record.
Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks
Abstract
The stability of a queueing network with interdependent servers is considered. The dependency among the servers is described by the definition of their subsets that can be activated simultaneously. Multihop radio networks provide a motivation for the consideration of this system. The problem of scheduling the server activation under the constraints imposed by the dependency among servers is studied. The performance criterion of a scheduling policy is its throughput that is characterized by its stability region, that is, the set of vectors of arrival and service rates for which the system is stable. A policy is obtained which is optimal in the sense that its stability region is a superset of the stability region of every other scheduling policy, and this stability region is characterized. The behavior of the network is studied for arrival rates that lie outside the stability region. Implications of the results in certain types of concurrent database and parallel processing systems are discussed.>
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
A tutorial on cross-layer optimization in wireless networks
Lin, X., Shroff, N. B., & Srikant, R. (2006) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2006.879351 · Cited by 833
Bio-inspired computation: Where we stand and what's next
Del Ser, J., Osaba, E., Molina, D., Yang, X.-S., Salcedo-Sanz, S., Camacho, D., Das, S., Suganthan, P. N., Coello Coello, C. A., & Herrera, F. (2019) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2019.04.008 · Cited by 593
Cross-Layer Congestion Control, Routing and Scheduling Design in Ad Hoc Wireless Networks
Chen, L., Low, S. H., Chiang, M., & Doyle, J. C. (2006) · Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications · doi:10.1109/infocom.2006.142 · Cited by 532
A Utility Optimization Approach to Network Cache Design
Dehghan, M., Massoulie, L., Towsley, D., Menasche, D. S., & Tay, Y. C. (2019) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2019.2913677 · Cited by 81
Metadata
- Authors
- Tassiulas, L., & Ephremides, A.
- Venue
- IEEE Transactions on Automatic Control
- Published
- 1992
- Volume
- 37
- Issue
- 12
- Pages
- 1936-1948
- ISSN
- 0018-9286 (ISSN-L)
- OpenAlex
- W2105177639
- Cited by
- 2,834
- References
- 0
- FWCI
- 2.40
- 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: Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks. https://app.cochat.ai/papers/10.1109/9.182479
- The paper
- Tassiulas, L., & Ephremides, A. (1992). Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks. IEEE Transactions on Automatic Control. https://doi.org/10.1109/9.182479
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.
