Avoiding Routing Loops on the Internet |
| |
Authors: | Hiro Ito Kazuo Iwama Yasuo Okabe and Takuya Yoshihiro |
| |
Affiliation: | (1) School of Informatics, Kyoto University, Yoshida-Honmachi, Kyoto 606-8501, Japan;(2) Academic Center for Computing and Media Studies, Kyoto University, Yoshida-Honmachi, Kyoto 606-8501, Japan;(3) Faculty of Systems Engineering, Wakayama University, 930 Sakaedani, Wakayama 640-8510, Japan |
| |
Abstract: | Suppose that some particular link in the Internet is currently
congested.
A natural solution is to try to make packets bypass that link.
This can be done by increasing the cost of that link intentionally,
say from a
1 to a
2, since the Internet uses shortest-path
routing. Unfortunately, however, this often causes temporary loops
for packet traveling, called routing loops. In this paper
we show that routing loops can be avoided by increasing the cost
of the link not directly from a
1 to a
2 but through an
intermediate value, a
3, i.e., from a
1 to a
3 and then
to a
2.
We may need several
intermediate values.
We show that in this case
the greedy strategy,
namely, raising the cost as much as possible in each step,
is optimal. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|