Random Overlay Routing
Overlay networks allow node source routing.But due to selfish routing and out-dated information,source routing sometimes results in bad performance.We propose a routing scheme based on randomization to avoid the routing conflicts.It is interesting to find that,in random routing method,choosing two route candidates will gain comparatively better performance without bringing too much cost.By testing random routing and traditional selfish scheme under different network conditions,we find that traffic load has little impact on the comparison of these two methods,which method is better mainly depends on the topology they are running on.Selfish method is indeed more efficient in topologies with low connectivity,but as the connection degree increases,random routing scheme can obtain dramatic improvement over selfish routing.