The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Charging and rate control for elastic traffic
Abstract
This paper addresses the issues of charging, rate control and routing for a communication network carrying elastic traffic, such as an ATM network offering an available bit rate service. A model is described from which max‐min fairness of rates emerges as a limiting special case; more generally, the charges users are prepared to pay influence their allocated rates. In the preferred version of the model, a user chooses the charge per unit time that the user will pay; thereafter the user's rate is determined by the network according to a proportional fairness criterion applied to the rate per unit charge. A system optimum is achieved when users' choices of charges and the network's choice of allocated rates are in equilibrium.
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
Bertsekas, D. P., & Gallager, R. G. (1987) · Cited by 5,561
Fundamental design issues for the future Internet
Shenker, S. (1995) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.414637 · Cited by 1,097
Mathematical Programming: Theory and Algorithms.
Smith, D. K., Minoux, M., & Vajda, S. (1987) · The Journal of the Operational Research Society · doi:10.2307/2582404 · Cited by 563
Kahin, B., & Keller, J. H. (1995) · Cited by 107
Cited by
Rate control for communication networks: shadow prices, proportional fairness and stability
Kelly, F. P., Maulloo, A. K., & Tan, D. K. H. (1998) · Journal of the Operational Research Society · doi:10.1057/palgrave.jors.2600523 · Cited by 5,021
Self-citationStochastic 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
Fair end-to-end window-based congestion control
Mo, J., & Walrand, J. (2000) · IEEE/ACM Transactions on Networking · doi:10.1109/90.879343 · Cited by 2,095
Optimization flow control. I. Basic algorithm and convergence
Low, S. H., & Lapsely, D. E. (1999) · IEEE/ACM Transactions on Networking · doi:10.1109/90.811451 · Cited by 1,972
Multiagent systems: algorithmic, game-theoretic, and logical foundations
(2009) · Choice Reviews Online · doi:10.5860/choice.46-5662 · Cited by 1,756
Athuraliya, S., Low, S. H., Li, V. H., & Yin, Q. (2001) · IEEE Network · doi:10.1109/65.923940 · Cited by 1,011
The Mathematics of Internet Congestion Control
(2005) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2004.841398 · Cited by 821
(2002) · IEEE Control Systems · doi:10.1109/37.980245 · Cited by 796
Application of Machine Learning in Wireless Networks: Key Techniques and Open Issues
Sun, Y., Peng, M., Zhou, Y., Huang, Y., & Mao, S. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2019.2924243 · Cited by 678
“Moreover, a simple way of resource block allocation is the proportional fair algorithm [150] that is utilized as a baseline in [64], where the proposed RNN based resource allocation approach significantly outperforms the proportional fair algorithm, in terms”
MethodHIGUCHI, K., & BENJEBBOUR, A. (2015) · IEICE Transactions on Communications · doi:10.1587/transcom.e98.b.403 · Cited by 666
Xu, Y., Gui, G., Gacanin, H., & Adachi, F. (2021) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2021.3059896 · Cited by 648
Full-Duplex Wireless Communications: Challenges, Solutions, and Future Research Directions
Zhang, Z., Long, K., Vasilakos, A. V., & Hanzo, L. (2016) · Proceedings of the IEEE · doi:10.1109/jproc.2015.2497203 · Cited by 620
Chiang, M. (2005) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2004.837347(410 · Cited by 615
A survey on networking games in telecommunications
Altman, E., Boulogne, T., El-Azouzi, R., Jiménez, T., & Wynter, L. (2006) · Computers & Operations Research · doi:10.1016/j.cor.2004.06.005 · Cited by 552
Resource pricing and the evolution of congestion control
Gibbens, R. J., & Kelly, F. P. (1999) · Automatica · doi:10.1016/s0005-1098(99)00135-1 · Cited by 544
Self-citationFair multiuser channel allocation for OFDMA networks using Nash bargaining solutions and coalitions
Han, Z., Ji, Z., & Liu, K. J. R. (2005) · IEEE Transactions on Communications · doi:10.1109/tcomm.2005.852826 · Cited by 540
Efficiency Loss in a Network Resource Allocation Game
Johari, R., & Tsitsiklis, J. N. (2004) · Mathematics of Operations Research · doi:10.1287/moor.1040.0091 · Cited by 537
Fair Resource Allocation in Federated Learning
Li, T., Sanjabi, M., Beirami, A., & Smith, V. (2019) · arXiv · doi:10.48550/arxiv.1905.10497 · Cited by 475
Joint Load Balancing and Offloading in Vehicular Edge Computing and Networks
Dai, Y., Xu, D., Maharjan, S., & Zhang, Y. (2019) · IEEE Internet of Things Journal · doi:10.1109/jiot.2018.2876298 · Cited by 464
End-to-end congestion control schemes: utility functions, random losses and ecn marks
Kunniyur, S., & Srikant, R. (2003) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2003.818183 · Cited by 448
Fairness in wireless networks: Issues, measures and challenges
Shi, H., Prasad, R. V., Onur, E., & Niemegeers, I. G. M. M. (2014) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2013.050113.00015 · Cited by 446
Di, B., Song, L., & Li, Y. (2016) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2016.2606100 · Cited by 444
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
Fei, Z., Li, B., Yang, S., Xing, C., Chen, H., & Hanzo, L. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2016.2610578 · Cited by 433
Foundations of MIMO Communication
Heath Jr, R. W., & Lozano, A. (2018) · Cambridge University Press eBooks · doi:10.1017/9781139049276 · Cited by 426
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
Congestion-dependent pricing of network services
Paschalidis, I. C., & Tsitsiklis, J. N. (2000) · IEEE/ACM Transactions on Networking · doi:10.1109/90.842140 · Cited by 352
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
The Unreasonable Fairness of Maximum Nash Welfare
Caragiannis, I., Kurokawa, D., Moulin, H., Procaccia, A. D., Shah, N., & Wang, J. (2016) · Proceedings of the 2016 ACM Conference on Economics and Computation · doi:10.1145/2940716.2940726 · Cited by 342
Volatility of power grids under real-time pricing
Roozbehani, M., Dahleh, M. A., & Mitter, S. K. (2012) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2012.2195037 · Cited by 335
Network Optimization and Control
Shakkottai, S., & Srikant, R. (2007) · Foundations and Trends® in Networking · doi:10.1561/1300000007 · Cited by 320
Coding Techniques for Repairability in Networked Distributed Storage Systems
Oggier, F., & Datta, A. (2013) · Foundations and Trends in Communications and Information Theory · doi:10.1561/0100000068 · Cited by 305
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 Unreasonable Fairness of Maximum Nash Welfare
Caragiannis, I., Kurokawa, D., Moulin, H., Procaccia, A. D., Shah, N., & Wang, J. (2019) · ACM Transactions on Economics and Computation · doi:10.1145/3355902 · Cited by 289
Active Queue Management: A Survey
Adams, R. (2013) · IEEE Communications Surveys & Tutorials · doi:10.1109/surv.2012.082212.00018 · Cited by 283
Non-convex optimization and rate control for multi-class services in the Internet
Lee, J.-W., Mazumdar, R. R., & Shroff, N. B. (2005) · IEEE/ACM Transactions on Networking · doi:10.1109/tnet.2005.852876 · Cited by 281
Chen, M., Saad, W., & Yin, C. (2018) · IEEE Transactions on Communications · doi:10.1109/tcomm.2018.2850303 · Cited by 281
On Optimizing VLC Networks for Downlink Multi-User Transmission: A Survey
Obeed, M., Salhab, A. M., Alouini, M.-S., & Zummo, S. A. (2019) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2019.2906225 · Cited by 267
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
(2005) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2004.837347 · Cited by 259
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
Non-Discriminatory Machine Learning through Convex Fairness Criteria
Goel, N., Yaghini, M., & Faltings, B. (2018) · Proceedings of the 2018 AAAI/ACM Conference on AI, Ethics, and Society · doi:10.1145/3278721.3278722 · Cited by 79
Metadata
- Authors
- Kelly, F.
- Venue
- European Transactions on Telecommunications
- Publisher
- Wiley
- Published
- 1997-01
- Volume
- 8
- Issue
- 1
- Pages
- 33-37
- ISSN
- 1124-318X (ISSN-L)
- 1541-8251
- OpenAlex
- W1987497363
- Cited by
- 2,936
- References
- 4
- FWCI
- 24.74
- 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.