Overlay networks have emerged as a promising paradigm for providing customizable and reliable services at the application layer, such as fault-resilient routing, multicast, and content delivery. Among the overlay network architecture, overlay routing is an important aspect of the overlay network design. In this paper, we develop a one-hop source routing, called heuristic-K algorithm using Ant Colony Optimization, to allow individual nodes to optimize route selection based on specific metrics like delay, loss rate, or throughput. Moreover, due to the selfish operating manner of overlay routing, we also take the traffic engineering element into consideration in the design process of our proposal. The experimental results demonstrate the effectiveness of the routing algorithm.
展开▼