Summary: | 碩士 === 國立交通大學 === 網路工程研究所 === 99 === The demand of end-to-end communications is growing rapidly on Internet. The performance of end-to-end communications highly depends on the underlying Internet architecture. However, current Internet architecture, which has been used for several decades, architecture, was originally designed for data transmission purpose, instead end-to-end communications. Therefore, end-to-end communications do not perform well on Internet.
Previously researches show that end-to-end communications can adopt the relay node, which is another node used to forward traffic between two ends, to greatly enhance the performance. But these researches introduce extremely huge probe overhead in the process of locating relays, or can not handle the large scale network well. This paper designs a Transit AS-Based Relay Path Selection Mechanism (TAB) for relay selection. The underlying idea of TAB is to use the characteristic of Internet architecture; that is, most of the ASs in Internet AS topology are Tasnit ASs. By applying TAB, we can reduce the probe overhead significantly in the Relay Path Selection process.
Experiment results show that the proposed schemes can improve 70%of Direct Path, and 47% of Direct Path can reduced RTT by half. Furthermore, the overhead caused by TAB is only 11% of the one in the current most precise Relay Path Selection method, and the ratio of overhead decreases as the session number increases.
Therefore, TAB is an effective Relay Path Selection method that can find nearly optimal path with lower probe overhead. Furthermore, TAB can adopt other metrics of path quality and find paths that fulfill various quality requirements.
|