Exact and approximation algorithms for joint routing and flow rate optimization

This paper addresses the comparison of algorithms for a version of the Network Utility Maximization (NUM) problem. The joint formulation of routing and transmission rate control within the multi-user and single-path setting is assumed within the NUM. Since the problem is NP-hard, the efficient heuristics are designed, implemented and compared experimentally with other existing heuristics and exact linear programming solver. The linear approximation is applied for a nonlinear utility function. The results of the experiments demonstrate a trade-off between computing time and precision of goal value.

[1]  Maode Ma,et al.  Utility-Optimized Flow-Level Bandwidth Allocation in Hybrid SDNs , 2018, IEEE Access.

[2]  Jean C. Walrand,et al.  Fair end-to-end window-based congestion control , 2000, TNET.

[3]  A. Robert Calderbank,et al.  Layering as Optimization Decomposition: A Mathematical Theory of Network Architectures , 2007, Proceedings of the IEEE.

[4]  Frank Thomson Leighton,et al.  Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms , 1999, JACM.

[5]  Alon Itai,et al.  On the complexity of time table and multi-commodity flow problems , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[6]  Andrzej Karbowski,et al.  Simultaneous routing and flow rate optimization in energy–aware computer networks , 2016, Int. J. Appl. Math. Comput. Sci..

[7]  A. Robert Calderbank,et al.  Jointly optimal congestion and contention control based on network utility maximization , 2006, IEEE Communications Letters.

[8]  Guy Pujolle,et al.  Flow-Based Management For Energy Efficient Campus Networks , 2015, IEEE Transactions on Network and Service Management.

[9]  Ao Tang,et al.  Cost of Not Splitting in Routing: Characterization and Estimation , 2011, IEEE/ACM Transactions on Networking.

[10]  Marimuthu Palaniswami,et al.  Application-Oriented Flow Control: Fundamentals, Algorithms and Fairness , 2006, IEEE/ACM Transactions on Networking.

[11]  Lun Li,et al.  Cross-layer optimization in TCP/IP networks , 2005, IEEE/ACM Transactions on Networking.

[12]  Frank Kelly,et al.  Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..

[13]  Gurkan Tuna,et al.  Comparison of QoS-aware single-path vs. multi-path routing protocols for image transmission in wireless multimedia sensor networks , 2014, Ad Hoc Networks.

[14]  Jean-Louis Rougier,et al.  GRiDA: GReen Distributed Algorithm for energy-efficient IP backbone networks , 2012, Comput. Networks.

[15]  Marc E. Pfetsch,et al.  Multicommodity Flows and Column Generation , 2006 .

[16]  Jochen Könemann,et al.  Faster and simpler algorithms for multicommodity flow and other fractional packing problems , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[17]  Pravin R Satav,et al.  Review on single-path multi-path routing protocol in manet: A study , 2016, 2016 International Conference on Recent Advances and Innovations in Engineering (ICRAIE).

[18]  Lisa Fleischer,et al.  Approximating fractional multicommodity flow independent of the number of commodities , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[19]  Maciej Drwal.  Approximation algorithms for utility-maximizing network design problem , 2014, ICSEng.