Traffic engineering for backhaul networks with wireless link scheduling

Traffic engineering (TE) problem is a central component of the next generation cloud-based wireless networks. In this paper, we study a new resource allocation scheme for effective traffic engineering under practical constraints such as the finite buffer size at each node. To reduce the computational effort required in the existing single-slot TE approaches and to deal with practical hardware limitations on link flows and buffers, we propose a two time-scale, low-complexity TE algorithm which incorporates a novel link scheduling component. The algorithm can be distributedly implemented. Simulation results demonstrate the effectiveness of the proposed algorithm.

[1]  Walter Klotz.  Graph Coloring Algorithms , 2002 .

[2]  Jeffrey G. Andrews,et al.  User Association for Load Balancing in Heterogeneous Cellular Networks , 2012, IEEE Transactions on Wireless Communications.

[3]  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.

[4]  Murali S. Kodialam,et al.  Characterizing achievable rates in multi-hop wireless mesh networks with orthogonal channels , 2005, IEEE/ACM Transactions on Networking.

[5]  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).

[6]  Hang Su,et al.  Joint Link Scheduling and Routing for Directional-Antenna Based 60 GHz Wireless Mesh Networks , 2009, GLOBECOM 2009 - 2009 IEEE Global Telecommunications Conference.

[7]  Ludek Kucera,et al.  The Greedy Coloring Is a Bad Probabilistic Algorithm , 1991, J. Algorithms.

[8]  Vijay K. Bhargava,et al.  Unified and Distributed QoS-Driven Cell Association Algorithms in Heterogeneous Networks , 2014, IEEE Transactions on Wireless Communications.

[9]  Baruch Awerbuch,et al.  A simple local-control approximation algorithm for multicommodity flow , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[10]  Zhi-Quan Luo,et al.  Semi-asynchronous routing for large scale hierarchical networks , 2015, 2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).