Traffic Engineering for wireless connectionless access networks supporting QoS-demanding media applications

This paper focuses on the problem of optimal QoS Traffic Engineering (TE) in Co-Channel Interference (CCI)-affected power-limited wireless access networks that support connectionless services. By exploiting the analytical tool offered by nonlinear optimization and following the emerging ''Decomposition as Optimization'' paradigm [1], the approach pursued in this paper allows to develop a resource allocation algorithm that is distributed, asynchronous, scalable and self-adaptive. Interestingly, the proposed algorithm enables each node of the network to distribute its outgoing traffic among all feasible next-hops in an optimal way, as measured by an assigned global cost function of general form. This optimal traffic distribution complies with several subjective as well as objective QoS requirements advanced by the supported media flows and involves only minimum information exchange between neighboring nodes. Furthermore, it allows for load-balanced multiple forwarding paths and it is able to self-perform optimal traffic re-distribution (i.e., re-routing) in the case of failure of the underlying wireless links. Finally, actual effectiveness of the overall proposed algorithm is numerically tested via performance comparisons against both DSDV-based single-path routing algorithms and interference-aware multipath routing algorithms.

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

[2]  Mung Chiang,et al.  Towards Robust Multi-Layer Traffic Engineering: Optimization of Congestion Control and Routing , 2007, IEEE Journal on Selected Areas in Communications.

[3]  Lin Xiao,et al.  Cross-layer optimization of wireless networks using nonlinear column generation , 2006, IEEE Transactions on Wireless Communications.

[4]  Hao Che,et al.  Decentralized optimal traffic engineering in connectionless networks , 2005, IEEE Journal on Selected Areas in Communications.

[5]  Ian F. Akyildiz,et al.  Wireless mesh networks: a survey , 2005, Comput. Networks.

[6]  Fernando Paganini,et al.  Congestion control for high performance, stability, and fairness in general networks , 2005, IEEE/ACM Transactions on Networking.

[7]  H. Kushner,et al.  Analysis of adaptive step-size SA algorithms for parameter tracking , 1995, IEEE Trans. Autom. Control..

[8]  Rene L. Cruz,et al.  Optimal routing, link scheduling and power control in multihop wireless networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[9]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[10]  Murali S. Kodialam,et al.  On power efficient communication over multi-hop wireless networks: joint routing, scheduling and power control , 2004, IEEE INFOCOM 2004.

[11]  Bernhard Plattner,et al.  Media- and TCP-friendly congestion control for scalable video streams , 2006, IEEE Transactions on Multimedia.

[12]  Daniel Pérez Palomar,et al.  Exploiting Hidden Convexity For Flexible And Robust Resource Allocation In Cellular Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[13]  Cheng Jin,et al.  MATE: MPLS adaptive traffic engineering , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[14]  Daniel Pérez Palomar,et al.  Power Control By Geometric Programming , 2007, IEEE Transactions on Wireless Communications.

[15]  Mung Chiang,et al.  Cross-Layer Congestion Control, Routing and Scheduling Design in Ad Hoc Wireless Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[16]  Edmund M. Yeh,et al.  Node-Based Optimal Power Control, Routing, and Congestion Control in Wireless Networks , 2006, IEEE Transactions on Information Theory.

[17]  Jitendra Padhye,et al.  Comparison of routing metrics for static multi-hop wireless networks , 2004, SIGCOMM 2004.

[18]  Roch Guérin,et al.  Achieving near-optimal traffic engineering solutions for current OSPF/IS-IS networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[19]  Slawomir Stanczak,et al.  On the Convexity of Feasible QoS Regions , 2007, IEEE Transactions on Information Theory.

[20]  Slawomir Stanczak,et al.  Log-convexity of the minimum total power in CDMA systems with certain quality-of-service guaranteed , 2005, IEEE Transactions on Information Theory.

[21]  Stephen P. Boyd,et al.  Simultaneous routing and resource allocation via dual decomposition , 2004, IEEE Transactions on Communications.

[22]  Lili Qiu,et al.  Impact of Interference on Multi-Hop Wireless Network Performance , 2003, MobiCom '03.

[23]  R. Koetter,et al.  Scheduling for Network Coded Multicast: A Conflict Graph Formulation , 2008, 2008 IEEE Globecom Workshops.

[24]  David Tse,et al.  Fundamentals of Wireless Communication , 2005 .

[25]  Tim Roughgarden,et al.  How bad is selfish routing? , 2002, JACM.

[26]  Mokhtar S. Bazaraa,et al.  Nonlinear Programming: Theory and Algorithms , 1993 .

[27]  Xin Wang,et al.  Fair Energy-Efficient Network Design for Multihop Communications , 2010, 2010 7th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON).

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

[29]  Richard J. La,et al.  Measurement based optimal multi-path routing , 2004, IEEE INFOCOM 2004.

[30]  Hao Che,et al.  End-to-End Optimal Algorithms for Integrated QoS, Traffic Engineering, and Failure Recovery , 2007, IEEE/ACM Transactions on Networking.

[31]  Charles E. Perkins,et al.  Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for mobile computers , 1994, SIGCOMM.