Abstract
A communication network usually has data packets and acknowledge (ACK) packets being transmitted in opposite directions. ACK packet flows may affect the performance of data packet flows, which is unfortunately not considered in the usual network utility maximization (NUM) model. This paper presents a NUM model in networks with two-way flows (NUMtw) by adding a routing matrix to cover ACK packet flows. The source rates are obtained by solving the dual model and the relation to the routing matrix of ACK packet flows is disclosed. Furthermore, the source rates in networks with one-way flows by the usual NUM model are compared to those in networks with two-way flows by the NUMtw model.
- M. Avriel. Nonlinear Programming: Analysis and Methods. Dover Publishing, 2003.Google Scholar
- H. Balakrishnan and V. Padmanabhan. How network asymmetry affects TCP. IEEE Communications Magazine, 39(4):60--67, 2001. Google ScholarDigital Library
- N. Brownlee, C. Mills, and G. Ruth. RFC 2722 - Traffic Flow Measurement: Architecture, October 1999. Google ScholarDigital Library
- M. Chiang, S. Low, A. Calderbank, and J. Doyle. Layering as optimization decomposition: A mathematical theory of network architectures. Proceedings of the IEEE, 95(1):255--312, 2007.Google ScholarCross Ref
- S. Floyd, A. Arcia, D. Ros, and J. Iyengar. RFC 5690 - adding acknowledgement congestion control to TCP, February 2010.Google Scholar
- F. Ge, S. Chan, L. L. H. Andrew, F. Li, L. Tan, and M. Zukerman. Performance effects of two-way FAST TCP. Computer Networks, 55:2976--2984, 2011. Google ScholarDigital Library
- L. Kalampoukas, A. Varma, and K. K. Ramakrishnan. Two-way TCP traffic over rate controlled channels: effects and analysis. IEEE/ACM Transactions on Networking, 6(6):729--743, 1998. Google ScholarDigital Library
- F. P. Kelly. Charging and rate control for elastic traffic. European Transactions on Telecommunications, 8(1):33--37, 1997.Google ScholarCross Ref
- F. P. Kelly, A. K. Maulloo, and D. K. H. Tan. Rate control for communication networks: shadow prices, proportional fairness and stability. Journal of the Operational Research Society, 49(9):237--252, 03/14 1998.Google ScholarCross Ref
- F. P. Kelly and T. Voice. Stability of end-to-end algorithms for joint routing and rate control. Computer Communication Review, 35(2):5--12, 2005. Google ScholarDigital Library
- S. H. Low. A duality model of TCP and queue management algorithms. IEEE/ACM Transactions on Networking, 11(4):525--536, 2003. Google ScholarDigital Library
- S. H. Low and D. E. Lapsley. Optimization ow control I: basic algorithm and convergence. IEEE/ACM Transactions on Networking, 7:861--874, 1999. Google ScholarDigital Library
- D. Palomar and M. Chiang. A tutorial on decomposition methods for network utility maximization. IEEE Journal on Selected Areas in Communications, 24(8):1439--1451, 2006. Google ScholarDigital Library
- L. Tan, P. Yang, W. Zhang, and F. Ge. On utility-optimised router-level bandwidth allocation. Transactions on Emerging Telecommunications Technologies, 24(3):303--316, 2013.Google ScholarCross Ref
- A. Tang, J. Wang, S. H. Low, and M. Chiang. Equilibrium of heterogeneous congestion control: existence and uniqueness. IEEE/ACM Transactions on Networking, 15:824--837, 2007. Google ScholarDigital Library
- A. Tang, X. Wei, S. H. Low, and M. Chiang. Equilibrium of heterogeneous congestion control: optimality and stability. IEEE/ACM Transactions on Networking, 18:844--857, 2010. Google ScholarDigital Library
- D. X. Wei, C. Jin, S. H. Low, and S. Hegde. FAST TCP: Motivation, architecture, algorithms, performance. IEEE/ACM Transactions on Networking, 14(6):1246--1259, 2006. Google ScholarDigital Library
Index Terms
- Network utility maximization in two-way flow scenario
Recommendations
Price-based distributed algorithms for rate-reliability tradeoff in network utility maximization
The current framework of network utility maximization for rate allocation and its price-based algorithms assumes that each link provides a fixed-size transmission "pipe" and each user's utility is a function of transmission rate only. These assumptions ...
Network Utility Maximization with Unknown Utility Functions: A Distributed, Data-Driven Bilevel Optimization Approach
MobiHoc '23: Proceedings of the Twenty-fourth International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile ComputingFair resource allocation is one of the most important topics in communication networks. Existing solutions almost exclusively assume each user utility function is known and concave. This paper seeks to answer the following question: how to allocate ...
Passive measurement of one-way and two-way flow lifetimes
Flow based analysis has been considered a simple and effective approach in network analysis. 5-tuple (unidirectional) flows are used in many network traffic, however, often these analyses require bidirectional packet matching to observe the ...
Comments