TY - GEN
T1 - Centralized and distributed heuristic algorithms for application-level traffic routing
AU - Matsuda, Kazuhito
AU - Hasegawa, Go
AU - Kamei, Satoshi
AU - Murata, Masayuki
PY - 2012/5/11
Y1 - 2012/5/11
N2 - Recent studies have revealed that the adoption of application-level routing that chooses an end-to-end traffic route relaying other end-hosts can improve certain user-perceived performance factors. However, selfish route selection performed by each application user can lead to a decrease in the route performance due to route overlaps, as well as an increase in the inter-ISP transit cost as a result of utilizing more transit links than in the case of IP routing. In the present paper, we strictly define an optimization problem for selecting application-level traffic routes with the aim to improve end-to-end network performance and reduce transit cost. We then propose centralized and distributed heuristic algorithms based on simulated annealing in order to obtain near-optimal solutions to the problem. We evaluate the performance of the proposed method by assuming that the PlanetLab nodes utilize application-level traffic routing. We show that application-level traffic routing with the proposed algorithms can result in a considerable improvement of network performance. In particular, in the case of using the available bandwidth as the routing metric, the end-to-end network performance can be improved by 87% on average.
AB - Recent studies have revealed that the adoption of application-level routing that chooses an end-to-end traffic route relaying other end-hosts can improve certain user-perceived performance factors. However, selfish route selection performed by each application user can lead to a decrease in the route performance due to route overlaps, as well as an increase in the inter-ISP transit cost as a result of utilizing more transit links than in the case of IP routing. In the present paper, we strictly define an optimization problem for selecting application-level traffic routes with the aim to improve end-to-end network performance and reduce transit cost. We then propose centralized and distributed heuristic algorithms based on simulated annealing in order to obtain near-optimal solutions to the problem. We evaluate the performance of the proposed method by assuming that the PlanetLab nodes utilize application-level traffic routing. We show that application-level traffic routing with the proposed algorithms can result in a considerable improvement of network performance. In particular, in the case of using the available bandwidth as the routing metric, the end-to-end network performance can be improved by 87% on average.
KW - Inter-ISP transit cost
KW - Network optimization
KW - Overlay network
KW - Routing
KW - Simulated annealing
UR - http://www.scopus.com/inward/record.url?scp=84860664775&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84860664775&partnerID=8YFLogxK
U2 - 10.1109/ICOIN.2012.6164376
DO - 10.1109/ICOIN.2012.6164376
M3 - Conference contribution
AN - SCOPUS:84860664775
SN - 9781467302517
T3 - International Conference on Information Networking
SP - 193
EP - 198
BT - International Conference on Information Networking 2012, ICOIN 2012 - Conference Program
T2 - 26th International Conference on Information Networking 2012, ICOIN 2012
Y2 - 1 February 2012 through 3 February 2012
ER -