Minimum Queue Length Load-Balancing in Planned Wireless Mesh Networks

Abstract

Wireless Mesh Networks (WMNS) have emerged in the last years as a cost-efficient alternative to traditional wired access networks. In order to fully exploit the intrinsically scarce resources WMNS possess, the use of dynamic routing has been proposed. We argue instead in favour of separating routing from forwarding (i.e. a la MPLS) and implementing a dynamic load-balancing scheme that forwards incoming packets along several pre-established paths in order to minimize a certain congestion function. In this paper, we consider a particular but very important scenario: a planned WMN where all bidirectional point-to-point links do not interfere with each other. Due to its versatility and simplicity, we use the sum over all links of the mean queue length as congestion function. A method to learn this function from measurements is presented, whereas simulations illustrate the framework.