Multihoming is widely used by Internet service providers (ISPs) to obtain improved performance and reliability when connecting to the Internet. Recently, the use of overlay routing for network application traffic is rapidly increasing. As a source of both routing oscillation and cost increases, overlay routing is known to bring challenges to ISPs. In this paper, we study the interaction between overlay routing and a multihomed ISP's routing strategy with a Nash game model, and propose a routing strategy for the multihomed ISP to alleviate the negative impact of overlay traffic. We prove that with the proposed routing strategy, the network routing game can always converge to a stable state, and the ISP can reduce costs to a relatively low level. From numerical simulations, we show the efficiency and convergence resulting from the proposed routing strategy. We also discuss the conditions under which the multihomed ISP can realize minimum cost by the proposed strategy.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Xun SHAO, Go HASEGAWA, Yoshiaki TANIGUCHI, Hirotaka NAKANO, "A Routing Strategy for Multihomed ISP to Mitigate the Impact of Overlay Traffic" in IEICE TRANSACTIONS on Information,
vol. E96-D, no. 2, pp. 193-201, February 2013, doi: 10.1587/transinf.E96.D.193.
Abstract: Multihoming is widely used by Internet service providers (ISPs) to obtain improved performance and reliability when connecting to the Internet. Recently, the use of overlay routing for network application traffic is rapidly increasing. As a source of both routing oscillation and cost increases, overlay routing is known to bring challenges to ISPs. In this paper, we study the interaction between overlay routing and a multihomed ISP's routing strategy with a Nash game model, and propose a routing strategy for the multihomed ISP to alleviate the negative impact of overlay traffic. We prove that with the proposed routing strategy, the network routing game can always converge to a stable state, and the ISP can reduce costs to a relatively low level. From numerical simulations, we show the efficiency and convergence resulting from the proposed routing strategy. We also discuss the conditions under which the multihomed ISP can realize minimum cost by the proposed strategy.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.E96.D.193/_p
Copy
@ARTICLE{e96-d_2_193,
author={Xun SHAO, Go HASEGAWA, Yoshiaki TANIGUCHI, Hirotaka NAKANO, },
journal={IEICE TRANSACTIONS on Information},
title={A Routing Strategy for Multihomed ISP to Mitigate the Impact of Overlay Traffic},
year={2013},
volume={E96-D},
number={2},
pages={193-201},
abstract={Multihoming is widely used by Internet service providers (ISPs) to obtain improved performance and reliability when connecting to the Internet. Recently, the use of overlay routing for network application traffic is rapidly increasing. As a source of both routing oscillation and cost increases, overlay routing is known to bring challenges to ISPs. In this paper, we study the interaction between overlay routing and a multihomed ISP's routing strategy with a Nash game model, and propose a routing strategy for the multihomed ISP to alleviate the negative impact of overlay traffic. We prove that with the proposed routing strategy, the network routing game can always converge to a stable state, and the ISP can reduce costs to a relatively low level. From numerical simulations, we show the efficiency and convergence resulting from the proposed routing strategy. We also discuss the conditions under which the multihomed ISP can realize minimum cost by the proposed strategy.},
keywords={},
doi={10.1587/transinf.E96.D.193},
ISSN={1745-1361},
month={February},}
Copy
TY - JOUR
TI - A Routing Strategy for Multihomed ISP to Mitigate the Impact of Overlay Traffic
T2 - IEICE TRANSACTIONS on Information
SP - 193
EP - 201
AU - Xun SHAO
AU - Go HASEGAWA
AU - Yoshiaki TANIGUCHI
AU - Hirotaka NAKANO
PY - 2013
DO - 10.1587/transinf.E96.D.193
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E96-D
IS - 2
JA - IEICE TRANSACTIONS on Information
Y1 - February 2013
AB - Multihoming is widely used by Internet service providers (ISPs) to obtain improved performance and reliability when connecting to the Internet. Recently, the use of overlay routing for network application traffic is rapidly increasing. As a source of both routing oscillation and cost increases, overlay routing is known to bring challenges to ISPs. In this paper, we study the interaction between overlay routing and a multihomed ISP's routing strategy with a Nash game model, and propose a routing strategy for the multihomed ISP to alleviate the negative impact of overlay traffic. We prove that with the proposed routing strategy, the network routing game can always converge to a stable state, and the ISP can reduce costs to a relatively low level. From numerical simulations, we show the efficiency and convergence resulting from the proposed routing strategy. We also discuss the conditions under which the multihomed ISP can realize minimum cost by the proposed strategy.
ER -