Abstract
AbstractIn this paper, we find the optimal transmission of messages in computer networks. This problem has been formulated as a nondelayed optimal control problem in several recent papers on TCP (transmission control protocol). Since the actual transmission of messages from origins to destinations should consist of both forward transmission delays of the buffers and latency of the links, we remodel the problem as a time-delayed optimal control problem consisting of both control-dependent time-delayed arguments and discrete time-delayed arguments. We then develop a modified control parameterization method for solving this time-delayed optimal control problem. The gradients of the new objective function and constraint functions generated by this modified control parametrization method are derived. A numerical example is solved by using the time-delayed version of the problem that we formulate, as well as the nondelayed version of the problem in the literature. Numerical results clearly illustrate the efficiency of the modified control parameterization method for solving both versions of this optimal transmission problem. Comparison of results of the two versions concerning the optimal transmission rates at the origins, the optimal output flow rates at the destination, and the queue sizes at the buffers are obtained. These comparison results clearly reflect how the optimal transmission of messages in computer networks in real life can be affected by both the forward transmission delays of the buffers and the latency of the links.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics,Analysis
Reference27 articles.
1. Kelly, F.P.: Charging and rate control for elastic traffic. Eur. Trans. Telecommun. 8(1), 33–37 (1997)
2. Kelly, F.P., Maullo, A., Tan, D.: Rate control in communication networks: shadow prices, proportional fairness and stability. J. Oper. Res. Soc. 49, 237–252 (1998)
3. Abolfazli, Shah-Mansouri, V.: Dynamic adjustment of queue levels in TCP legas-based networks. Electron. Lett. 52, 361–363 (2016)
4. Lai, K., Baker, M.: Measuring link bandwidths using a deterministic model of packet delay. Comput. Commun. Rev. 30, 283–294 (2000)
5. Lavaei, J., Doyle, J.C., Low, S.H.: Utility functionals associated with available congestion control algorithms. In: Proceeding of IEEE International Conference Computation Communication, pp. 1–9 (2010)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献