Routing Internet traffic in heterogeneous mesh networks: Analysis and algorithms

• Published in: Performance evaluation Vol. 68; no. 9; pp. 841 - 858
• Main Authors: Bruno, Raffaele, Conti, Marco, Pinizzotto, Antonio
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 01.09.2011
• Subjects: Algorithms; Capacity modeling; Computer networks; Finite element method; Internet; Load balancing; Networks; Performance evaluation; Routing; Routing (telecommunications); Traffic engineering; Traffic flow; Wireless mesh networks; Performance evaluation; Routing; Load balancing; Wireless mesh networks; Capacity modeling
• ISSN: 0166-5316; 1872-745X
• DOI: 10.1016/j.peva.2011.01.006

In practical wireless mesh networks (WMNs), gateways are subject to hard capacity limits on the aggregate number of flows (in terms of bit rate) that they can support. Thus, if traffic is routed in the mesh network without considering those constraints, as well as the traffic distribution, some gateways or intermediate mesh routers may rapidly get overloaded, and the network resources can be unevenly utilized. To address this problem, in this paper we firstly develop a multi-class queuing network model to analyze feasible throughput allocations, as well as average end-to-end delay, in heterogeneous WMNs. Guided by our analysis, we design a Capacity-Aware Route Selection algorithm ( CARS), which allocates network paths to downstream and upstream Internet flows so as to ensure a more balanced utilization of wireless network resources and gateways’ fixed connections. Through simulations in a number of different network scenarios we show that the CARS scheme significantly outperforms conventional shortest path routing, as well as an alternative routing method that distributes the traffic load on the gateway nodes to minimize its variance.