The DOI matches its Crossref record.
Non-convex optimization and rate control for multi-class services in the Internet
Abstract
In this paper, we investigate the problem of distributively allocating transmission data rates to users in the Internet. We allow users to have concave as well as sigmoidal utility functions as appropriate for different applications. In the literature, for simplicity, most works have dealt only with the concave utility function. However, we show that applying rate control algorithms developed for concave utility functions in a more realistic setting (with both concave and sigmoidal types of utility functions) could lead to instability and high network congestion. We show that a pricing-based mechanism that solves the dual formulation can be developed based on the theory of subdifferentials with the property that the prices "self-regulate" the users to access the resources based on the net utility. We discuss convergence issues and show that an algorithm can be developed that is efficient in the sense of achieving the global optimum when there are many users.
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
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
Luong, N. C., Hoang, D. T., Wang, P., Niyato, D., Kim, D. I., & Han, Z. (2016) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2016.2582841 · Cited by 357
Optimal Resource Allocation in Coordinated Multi-Cell Systems
Björnson, E., & Jorswieck, E. (2013) · Foundations and Trends® in Communications and Information Theory · doi:10.1561/0100000069 · Cited by 349
Path Planning for UAV-Mounted Mobile Edge Computing With Deep Reinforcement Learning
Liu, Q., Shi, L., Sun, L., Li, J., Ding, M., & Shu, F. S. (2020) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2020.2982508 · Cited by 323
Toward Delay-Efficient Game-Aware Data Centers for Cloud Gaming
Amiri, M., Osman, H. A., Shirmohammadi, S., & Abdallah, M. (2016) · ACM Transactions on Multimedia Computing, Communications, and Applications · doi:10.1145/2983639 · Cited by 40
Metadata
- Authors
- Lee, J.-W., Mazumdar, R. R., & Shroff, N. B.
- Venue
- IEEE/ACM Transactions on Networking
- Published
- 2005-08
- Volume
- 13
- Issue
- 4
- Pages
- 827-840
- ISSN
- 1063-6692 (ISSN-L)
- OpenAlex
- W2112947567
- Cited by
- 281
- References
- 0
- FWCI
- 20.45
- 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: Non-convex optimization and rate control for multi-class services in the Internet. https://app.cochat.ai/papers/10.1109/tnet.2005.852876
- The paper
- Lee, J.-W., Mazumdar, R. R., & Shroff, N. B. (2005). Non-convex optimization and rate control for multi-class services in the Internet. IEEE/ACM Transactions on Networking. https://doi.org/10.1109/tnet.2005.852876
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.