The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
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.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Cites
Applied Probability and Queues
Dave, U. (1987) · Journal of the Operational Research Society · doi:10.1057/jors.1987.184 · Cited by 2,704
Kemeny, J. G., Snell, J. L., & Knapp, A. W. (1976) · Graduate Texts in Mathematics · doi:10.1007/978-1-4684-9455-6 · Cited by 647
Spatial reuse in multihop packet radio networks
Kleinrock, L., & Silvester, J. A. (1987) · Proceedings of the IEEE · doi:10.1109/proc.1987.13711 · Cited by 150
Cited by
Stochastic Network Optimization with Application to Communication and Queueing Systems
Neely, M. J. (2010) · Synthesis lectures on communication networks · doi:10.2200/s00271ed1v01y201006cnt007 · Cited by 2,218
Layering as Optimization Decomposition: A Mathematical Theory of Network Architectures
Chiang, M., Low, S. H., Calderbank, A. R., & Doyle, J. C. (2007) · Proceedings of the IEEE · doi:10.1109/jproc.2006.887322 · Cited by 1,352
Achieving 100% throughput in an input-queued switch
McKeown, N., Mekkittikul, A., Anantharam, V., & Walrand, J. (1999) · IEEE Transactions on Communications · doi:10.1109/26.780463 · Cited by 838
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
Information Theoretic Security
Liang, Y., Poor, H. V., & Shamai (Shitz), S. (2007) · now publishers, Inc. eBooks · doi:10.1561/9781601982414 · Cited by 686
A Distributed CSMA Algorithm for Throughput and Utility Maximization in Wireless Networks
Jiang, L., & Walrand, J. (2010) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2009.2035046 · Cited by 635
Dynamic power allocation and routing for time-varying wireless networks
Neely, M. J., Modiano, E., & Rohrs, C. E. (2005) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2004.837349 · Cited by 596
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
Information Theoretic Security
Liang, Y., Poor, H. V., & Shamai (Shitz), S. (2009) · Foundations and Trends in Communications and Information Theory · doi:10.1561/0100000036 · Cited by 570
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
Control Techniques for Complex Networks
Meyn, S. (2007) · Cambridge University Press eBooks · doi:10.1017/cbo9780511804410 · Cited by 528
Maximizing Queueing Network Utility Subject to Stability: Greedy Primal-Dual Algorithm
Stolyar, A. L. (2005) · Queueing Systems · doi:10.1007/s11134-005-1450-0 · Cited by 505
Cell Association and Interference Coordination in Heterogeneous LTE-A Cellular Networks
Madan, R., Borran, J., Sampath, A., Bhushan, N., Khandekar, A., & Ji, T. (2010) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2010.101209 · Cited by 459
Fairness and Optimal Stochastic Control for Heterogeneous Networks
Neely, M. J., Modiano, E., & Li, C.-P. (2008) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2007.900405 · Cited by 433
Joint congestion control, routing, and MAC for stability and fairness in wireless networks
Eryilmaz, A., & Srikant, R. (2006) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2006.879361 · Cited by 370
The impact of imperfect scheduling on cross-layer congestion control in wireless networks
Lin, X., & Shroff, N. B. (2006) · doi:10.1109/tent.2006.872546 · Cited by 306
A˚ström, K. J., & Kumar, P. R. (2014) · Automatica · doi:10.1016/j.automatica.2013.10.012 · Cited by 304
Utility-based resource allocation and scheduling in OFDM-based wireless broadband networks
Song, G., & Li, Y. (2005) · IEEE Communications Magazine · doi:10.1109/mcom.2005.1561930 · Cited by 290
The impact of imperfect scheduling on cross-Layer congestion control in wireless networks
Lin, X., & Shroff, N. B. (2006) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2006.872546 · Cited by 268
Throughput and Fairness Guarantees Through Maximal Scheduling in Wireless Networks
Chaporkar, P., Kar, K., Luo, X., & Sarkar, S. (2008) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.913537 · Cited by 253
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
- 3
- 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
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.