Correction to Low and Lapsley's article "Optimization Flow Control, I: Basic Algorithm and Convergence"
Andrzej Karbowski
Abstract
In the note an error 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) is pointed out. Because of this error the proof of the Theorem 2 presented in the article is incomplete and some assessments are wrong. In the second part of the note the author proposes a correction to this proof.
Create a lesson
Related papers
RUN-O-RAN: An O-RAN-Native Architecture Enabling Cooperative Uplink Localization
Viola Bernazzoli, Alberto Ceresoli, Ilario Filippini
NS3Learn: Transferring 5G NR Mode-2 Reception Realism from ns-3 to the Veins/SUMO Stack for Connected-Vehicle Safety Assessment
Rasheed Bello, Arthur Mukwaya, Gurcan Comert et al.
Value-Based Massive Access through Goal-Oriented Irregular Repetition Slotted ALOHA
Pietro Talli, Andrea Munari, Federico Mason et al.
STR-Agent: An LLM-Driven Agent for QoS-Aware Routing in LEO Satellite Networks
Bowen Lu, Mugen Peng, Yaohua Sun et al.
PyStream: Enhancing Video Streaming Evaluation
Samuel Radler, Leon Prüller, Emanuele Artioli et al.
Taming the Agentic RAN: Stability-Guaranteed Arbitration of Autonomous AI Agents in O-RAN
Seyed Bagher Hashemi Natanzi, Bo Tang