Max-Flow Min-Cost Routing in a Future-Internet with Improved QoS Guarantees

A Constrained Multicommodity Maximum-Flow-Minimum-Cost routing algorithm is presented. The algorithm computes maximum-flow routings for all smooth unicast traffic demands within the Capacity Region of a network subject to routing cost constraints. The edge cost can be a distance, reliability, congestion or an energy metric. It is shown that every network has a finite Bandwidth-Cost capacity. The Bandwidth-Distance and the Bandwidth-Energy capacities are explored. The routing algorithm requires the formulation of two Linear Programs (LPs). The first LP finds a multicommodity Maximum-Flow, when the flows are constrained to a sub-graph of the network to enforce cost constraints. The second LP minimizes the routing cost, given that the maximum-flow is fixed. A related Constrained Multicast-Max-Flow-Min-Cost algorithm is also presented, to maximize the throughput of a multicast tree using network coding, subject to routing cost constraints. These algorithms have polynomial-time solutions, whereas traditional multipath routing algorithms can be NP-Hard. The addition of routing cost constraints can significantly reduce the size of the LPs, resulting in faster solutions, with lower edge utilizations and with higher energy efficiencies. The application of these algorithms to route aggregated video streams from cloud data centers in a Future-Internet network, with improved throughput, energy-efficiency and QoS guarantees is presented.

[1]  Franco Davoli,et al.  Energy Efficiency in the Future Internet: A Survey of Existing Approaches and Trends in Energy-Aware Fixed Network Infrastructures , 2011, IEEE Communications Surveys & Tutorials.

[2]  Rudolf Ahlswede,et al.  Network information flow , 2000, IEEE Trans. Inf. Theory.

[3]  Clifford Stein,et al.  Improved approximation algorithms for unsplittable flow problems , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[4]  Alexander Sprintson,et al.  Efficient Congestion Mitigation Using Congestion-Aware Steiner Trees and Network Coding Topologies , 2011, VLSI Design.

[5]  Dave Gilbert,et al.  Provisioning mission-critical telerobotic control systems over internet backbone networks with essentially-perfect QoS , 2010, IEEE Journal on Selected Areas in Communications.

[6]  Xipeng Xiao,et al.  Internet QoS: a big picture , 1999, IEEE Netw..

[7]  Ted H. Szymanski,et al.  Achieving minimum-routing-cost maximum-flows in infrastructure wireless mesh networks , 2012, 2012 IEEE Wireless Communications and Networking Conference (WCNC).

[8]  Nick McKeown,et al.  Designing Packet Buffers for Router Linecards , 2008, IEEE/ACM Transactions on Networking.

[9]  Dave Gilbert,et al.  Internet Multicasting of IPTV With Essentially-Zero Delay Jitter , 2009, IEEE Transactions on Broadcasting.

[10]  Aref Meddeb,et al.  Internet QoS: Pieces of the puzzle , 2010, IEEE Communications Magazine.

[11]  Donald F. Towsley,et al.  Smoothing, Statistical Multiplexing, and Call Admission Control for Stored Video , 1997, IEEE J. Sel. Areas Commun..

[12]  Kun Yuan,et al.  BoxRouter 2.0: architecture and implementation of a hybrid and robust global router , 2007, 2007 IEEE/ACM International Conference on Computer-Aided Design.

[13]  Martin Reisslein,et al.  The Effects of Priority Levels and Buffering on the Statistical Multiplexing of Single-Layer H.264/AVC and SVC Encoded Video Streams , 2010, IEEE Transactions on Broadcasting.

[14]  Venkatesan Guruswami,et al.  Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems , 1999, STOC '99.

[15]  David A. Patterson,et al.  Computer Architecture - A Quantitative Approach, 5th Edition , 1996 .

[16]  Deep Medhi,et al.  Routing, flow, and capacity design in communication and computer networks , 2004 .

[17]  Jon Crowcroft,et al.  Congestion control mechanisms and the best effort service model , 2001, IEEE Netw..

[18]  Edith Cohen,et al.  Optimal oblivious routing in polynomial time , 2003, STOC '03.

[19]  Kun Yuan,et al.  BoxRouter 2.0: A hybrid and robust global router with layer assignment for routability , 2009, TODE.

[20]  Deep Medhi,et al.  Network routing - algorithms, protocols, and architectures , 2007 .

[21]  Martin Reisslein,et al.  Network performance evaluation using frame size and quality traces of single-layer and two-layer video: A tutorial , 2004, IEEE Communications Surveys & Tutorials.

[22]  Martin Reisslein,et al.  Implications of Smoothing on Statistical Multiplexing of H.264/AVC and SVC Video Streams , 2009, IEEE Transactions on Broadcasting.

[23]  Fang Zhao,et al.  Minimum-cost multicast over coded packet networks , 2005, IEEE Transactions on Information Theory.

[24]  Brett Chapman,et al.  Deploying QoS for Cisco IP and Next Generation Networks: The Definitive Guide , 2009 .

[25]  Venkatesan Guruswami,et al.  Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems , 2003, J. Comput. Syst. Sci..

[26]  Alexander Sprintson,et al.  Efficient Rerouting Algorithms for Congestion Mitigation , 2009, 2009 IEEE Computer Society Annual Symposium on VLSI.

[27]  L.G. Roberts.  A radical new router , 2009, IEEE Spectrum.

[28]  Zongpeng Li,et al.  On achieving maximum multicast throughput in undirected networks , 2006, IEEE Transactions on Information Theory.

[29]  Jon M. Peha,et al.  Streaming video over the Internet: approaches and directions , 2001, IEEE Trans. Circuits Syst. Video Technol..

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

[31]  Chin-Tau A. Lea,et al.  Network-Coding Multicast Networks With QoS Guarantees , 2011, IEEE/ACM Transactions on Networking.

[32]  Ted H. Szymanski,et al.  Future Internet video multicasting with essentially perfect resource utilization and QoS guarantees , 2011, 2011 IEEE Nineteenth IEEE International Workshop on Quality of Service.

[33]  Farhad Shahrokhi,et al.  The maximum concurrent flow problem , 1990, JACM.

[34]  Andrea J. Goldsmith,et al.  Capacity regions for wireless ad hoc networks , 2003, IEEE Trans. Wirel. Commun..

[35]  Paolo Giaccone,et al.  Throughput Region of Finite-Buffered Networks , 2007, IEEE Transactions on Parallel and Distributed Systems.

[36]  Alberto Leon-Garcia,et al.  Communication Networks: Fundamental Concepts and Key Architectures , 1999 .

[37]  Michal Pióro,et al.  SNDlib 1.0—Survivable Network Design Library , 2010, Networks.

[38]  Barath Raghavan,et al.  The energy and emergy of the internet , 2011, HotNets-X.

[39]  Christoph Albrecht,et al.  Global routing by new approximation algorithms for multicommodityflow , 2001, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[40]  David A. Patterson,et al.  Computer Architecture: A Quantitative Approach , 1969 .