Errors in Low and Lapsley's article "Optimization Flow Control, I: Basic Algorithm and Convergence"
Andrzej Karbowski
TL;DR
This paper identifies and discusses two errors in Low and Lapsley's 1999 article on optimization flow control, highlighting incomplete proofs and incorrect assessments resulting from these errors.
Contribution
It provides a critical correction to the original work by pinpointing specific errors affecting the validity of the theorems and conclusions.
Findings
Two errors in the original proofs are identified.
The errors lead to incomplete proofs and incorrect assessments.
Corrections are proposed to address these issues.
Abstract
In the note two errors in Low and Lapsley's article "Optimization Flow Control, I: Basic Algorithm and Convergence", "IEEE/ACM Transactions on Networking", 7(6), pp. 861-874, 1999, are shown. Because of these errors the proofs of both theorems presented in the article are incomplete and some assessments are wrong.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNetwork Traffic and Congestion Control · Traffic control and management · Advanced Queuing Theory Analysis