The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Fair scheduling in wireless packet networks
Abstract
Fair scheduling of delay and rate-sensitive packet flows over a wireless channel is not addressed effectively by most contemporary wireline fair-scheduling algorithms because of two unique characteristics of wireless media: (1) bursty channel errors and (2) location-dependent channel capacity and errors. Besides, in packet cellular networks, the base station typically performs the task of packet scheduling for both downlink and uplink flows in a cell; however, a base station has only a limited knowledge of the arrival processes of uplink flows. We propose a new model for wireless fair-scheduling based on an adaptation of fluid fair queueing (FFQ) to handle location-dependent error bursts. We describe an ideal wireless fair-scheduling algorithm which provides a packetized implementation of the fluid mode, while assuming full knowledge of the current channel conditions. For this algorithm, we derive the worst-case throughput and delay bounds. Finally, we describe a practical wireless scheduling algorithm which approximates the ideal algorithm. Through simulations, we show that the algorithm achieves the desirable properties identified in the wireless FFQ model.
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
Cites
Parekh, A. K., & Gallager, R. G. (1993) · IEEE/ACM Transactions on Networking · doi:10.1109/90.234856 · Cited by 3,705
Analysis and simulation of a fair queueing algorithm
Demers, A., Keshav, S., & Shenker, S. (1989) · ACM SIGCOMM Computer Communication Review · doi:10.1145/75247.75248 · Cited by 2,614
Bharghavan, V., Demers, A. J., Shenker, S. J., & Zhang, L. (1994) · ACM SIGCOMM Computer Communication Review · doi:10.1145/190809.190334 · Cited by 1,771
Self-citationAnalysis and simulation of a fair queueing algorithm
Demers, A., Keshav, S., & Shenker, S. (1989) · Symposium proceedings on Communications architectures & protocols · doi:10.1145/75246.75248 · Cited by 1,729
Finite-state Markov channel-a useful model for radio communication channels
Wang, H. S., & Moayeri, N. (1995) · IEEE Transactions on Vehicular Technology · doi:10.1109/25.350282 · Cited by 1,647
Service disciplines for guaranteed performance service in packet-switching networks
Zhang, H. (1995) · Proceedings of the IEEE · doi:10.1109/5.469298 · Cited by 1,109
A self-clocked fair queueing scheme for broadband applications
Golestani, S. J. (2002) · Proceedings of INFOCOM '94 Conference on Computer Communications · doi:10.1109/infcom.1994.337677 · Cited by 1,100
VirtualClock: a new traffic control algorithm for packet-switched networks
Zhang, L. (1991) · ACM Transactions on Computer Systems · doi:10.1145/103720.103721 · Cited by 509
Start-time fair queueing: a scheduling algorithm for integrated services packet switching networks
Goyal, P., Vin, H. M., & Chen, H. (1996) · Conference proceedings on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/248156.248171 · Cited by 442
Solutions to hidden terminal problems in wireless networks
Fullmer, C. L., & Garcia-Luna-Aceves, J. J. (1997) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/263105.263137 · Cited by 323
Cited by
A survey on wireless multimedia sensor networks
Akyildiz, I. F., Melodia, T., & Chowdhury, K. R. (2007) · Computer Networks · doi:10.1016/j.comnet.2006.10.002 · Cited by 2,308
Achieving MAC layer fairness in wireless packet networks
Nandagopal, T., Kim, T.-E., Gao, X., & Bharghavan, V. (2000) · Proceedings of the 6th annual international conference on Mobile computing and networking · doi:10.1145/345910.345925 · Cited by 659
Self-citationNVS: A Substrate for Virtualizing Wireless Resources in Cellular Networks
Kokku, R., Mahindra, R., Zhang, H., & Rangarajan, S. (2012) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2011.2179063 · Cited by 329
Cell-Throughput Analysis of the Proportional Fair Scheduler in the Single-Cell Environment
Choi, J.-G., & Bahk, S. (2007) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2006.889570 · Cited by 265
A Wireless Optical Backhaul Solution for Optical Attocell Networks
Kazemi, H., Safari, M., & Haas, H. (2019) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2018.2883465 · Cited by 42
Metadata
- Authors
- Lu, S., Bharghavan, V., & Srikant, R.
- Venue
- IEEE/ACM Transactions on Networking
- Published
- 1999
- Volume
- 7
- Issue
- 4
- Pages
- 473-489
- ISSN
- 1063-6692 (ISSN-L)
- OpenAlex
- W2120086682
- Cited by
- 638
- References
- 10
- FWCI
- 21.36
- 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: Fair scheduling in wireless packet networks. https://app.cochat.ai/papers/10.1109/90.793003
- The paper
- Lu, S., Bharghavan, V., & Srikant, R. (1999). Fair scheduling in wireless packet networks. IEEE/ACM Transactions on Networking. https://doi.org/10.1109/90.793003
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.