An Application-Level Routing Method with Transit Cost Reduction Based on a Distributed Heuristic Algorithm

Kazuhito MATSUDA  Go HASEGAWA  Masayuki MURATA  

IEICE TRANSACTIONS on Communications   Vol.E96-B   No.6   pp.1481-1491
Publication Date: 2013/06/01
Online ISSN: 1745-1345
DOI: 10.1587/transcom.E96.B.1481
Print ISSN: 0916-8516
Type of Manuscript: PAPER
Category: Network
overlay network,  overlay routing,  inter-ISP transit cost,  PlanetLab,  simulated annealing,  

Full Text: PDF(2MB)>>
Buy this Article

Application-level routing that chooses an end-to-end traffic route that relays other end hosts can improve user-perceived performance metrics such as end-to-end latency and available bandwidth. However, selfish route selection performed by each end user can lead to a decrease in path performance due to overload by route overlaps, as well as an increase in the inter-ISP transit cost as a result of utilizing more transit links compared with native IP routing. In this paper, we first strictly define an optimization problem for selecting application-level traffic routes with the aim of maximizing end-to-end network performance under a transit cost constraint. We then propose an application-level traffic routing method based on distributed simulated annealing to obtain good solutions to the problem. We evaluate the performance of the proposed method by assuming that PlanetLab nodes utilize application-level traffic routing. We show that the proposed routing method can result in considerable improvement of network performance without increasing transit cost. In particular, when using end-to-end latency as a routing metric, the number of overloaded end-to-end paths can be reduced by about 65%, as compared with that when using non-coordinated methods. We also demonstrate that the proposed method can react to dynamic changes in traffic demand and select appropriate routes.