Sender-based resource allocation for multi-hop routing networks

Abstract

As a consequence of providing Internet access to many clients over a multi-hop topology network with multiple backhauls, performance is affected by the number of hops that a client is from its backhaul. This spatial bias problem is formulated as a mixed-integer nonlinear programming problem that takes into consideration the end-to-end delay, both in terms of least-hop and load-balanced routing, and in terms of link capacity constraints in mesh structures in this paper. Accordingly, we proposed a sender-based load-balanced routing algorithm that minimizes the maximum end-to-end delay at the network layer, algorithms that achieve load-balanced on each backhaul, each branch of the backhaul, and each flow in multi-hop networks with orthogonal channels. Our experiment results demonstrate that this approach reduced end-to-end delay and outperforms other general routing algorithms.