Load-balanced one-hop overlay source routing over shortest path

In one-hop overlay source routing, when the given primary path suffers from the link failure or performance degradation, the source can reroute the traffic to the destination through one intermediate overlay node. However, the over-heavy traffic passing through the same intermediate node would cause frequent package loss and network delay, which can degrade the throughput and utilization of network. To overcome this problem, we propose a Load-Balanced One-hop Overlay Source Routing based on shortest path. To reduce the complexity of the algorithm, we first introduce a heuristic method to compute the relay nodes for constructing one-hop overlay routing paths, and then formulate the problem as a linear programming (LP) problem for load balancing, whose goal is to minimize the worse-case network congestion ratio. Simulations results show that our proposed scheme reduces the network congestion ratio dramatically, and can achieve high-quality overlay routing service.