請用此 Handle URI 來引用此文件:
http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/31529
完整後設資料紀錄
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.advisor | 朱浩華(Hao-Hua Chu) | |
dc.contributor.author | Ming-Tsang Tsai | en |
dc.contributor.author | 蔡明倉 | zh_TW |
dc.date.accessioned | 2021-06-13T03:14:18Z | - |
dc.date.available | 2006-08-09 | |
dc.date.copyright | 2006-08-09 | |
dc.date.issued | 2006 | |
dc.date.submitted | 2006-08-02 | |
dc.identifier.citation | Bibliography
[1] H. Tangmunarunkit, R. Govindan, and S. Shenker, “Internet path inflation due to policy routing,” the SPIE ITCom, pp. 188–195, August 2001. [2] H. Tangmunarunkit, R. Govindan, S. Shenker, and D. Estrin, “The impact of routing policy on internet paths,” the IEEE INFOCOM, pp. 736–742, April 2001. [3] L. Gao and F. Wang, “The extent of as path inflation by routing policies,” IEEE Global Internet Symposium, 2002. [4] N. Spring, R. Mahajan, and T. Anderson, “Quantifying the causes of path inflation,” ACM SIGCOMM, August 2003. [5] Z. M. Mao, J. Rexford, J. Wang, and R. H. Katz, “Towards an accurate as-level traceroute tool,” ACM SIGCOMM, August 2003. [6] Z. M. Mao, D. Johnson, J. Rexford, J. Wang, and R. H. Katz, “Scalable and accurate identification of as-level forwarding paths,” IEEE INFOCOM, March 2004. [7] Z. M. Mao, L. Qiu, J.Wang, and Y. Zhang, “On as-level path inference,” ACM SIGMETRICS, pp. 339–349, June 2005. [8] D. Blazakis, M. Karir, and J. S.Baras, “Analyzing bgp aspath behavior in the internet,” IEEE Global Internet, 2006. [9] University of Oregon Route Views Project, http://www.routeviews.org/. [10] Ripe NCC, http://www.ripe.net/projects/ris/rawdata.html. [11] L. Gao, “On inferring automonous system relationships in the internet,” ACM/IEEE Transactions on Networking, vol. 9(6), pp. 733–745, December 2001. [12] M. Faloutsos, P. Faloutsos, and C. Faloutsos, “On power-law relationships of the internet topology,” SIGCOMM, 1999. | |
dc.identifier.uri | http://tdr.lib.ntu.edu.tw/jspui/handle/123456789/31529 | - |
dc.description.abstract | 網際網路路徑的特徵化是重要的,因為它可以幫助網路研究員更加瞭解封包是如何在網路上傳送的,以及讓他們可以更具信心地在真實網路路徑產生的情況下,加以評估所提出來的機制。先前的研究中指出,以路徑長度的觀點來研究大規模的網路路徑行為時,最短路徑是一個合理且簡單的模型。然而,最短路徑路由是否適合一般性的網路模擬,仍是一個公開的問題。
藉由此問題所引發的動機,我們分析網際網路在自治系統層級的路徑,並且發現,即使最短路徑與自治系統層級的路徑長度很相似,但是它們所經過的自治系統層級的連結是不一樣的。進一步的測試顯示,它們會造成不同的網路流量分佈,而且無論代表性的最短路徑與最短決策路徑如何被選擇,此種差異性會一直持續著。我們發現,無論是最短路徑路由或是最短決策路徑路由都無法正確地符合自治系統層級的路徑所造成的網路流量分佈。 為了幫助真實網路路徑的產生,我們提出一個「偏好比率、隨機移動」的模型。此模型是利用 BGP table 來取得偏好比率,藉此選擇路徑的下一步。評估的結果顯示,此模型可以有效地特徵化網際網路在自治系統層級的路徑。 | zh_TW |
dc.description.abstract | Characterization of Internet paths is important because it helps network operators and researchers better understand how packets travel over the Internet, and allows them to evaluate proposed mechanisms with confidence under realistic network path generating conditions. Some researchers have concluded that shortest path routes are reasonable for studying large-scale behavior of network paths in terms of path length. However, whether shortest path routing is suitable for general network simulations remains an open question.
Motivated by this question, we analyze Internet AS-level paths and find that, although shortest paths and Internet AS-level paths are similar in length, they are very different in the AS-level links traversed. Further examination of the distribution of traffic by shortest paths and Internet AS-level paths shows that the difference persists irrespective of whether representative shortest paths or shortest policy paths are chosen. We find that neither shortest path routing nor shortest policy path routing accurately capture the distribution of traffic generated by Internet AS-level paths. To facilitate the generation of realistic Internet AS-level paths, we propose a preference-ratio random-walk model that leverages BGP routing tables to obtain preference ratios for the selection of subsequent hops. The results of our evaluations show that the proposed model can characterize Internet AS-level paths effectively. | en |
dc.description.provenance | Made available in DSpace on 2021-06-13T03:14:18Z (GMT). No. of bitstreams: 1 ntu-95-R93922064-1.pdf: 1864340 bytes, checksum: 8a30a9ac9f2edbc87ab1d789c2a5ac5d (MD5) Previous issue date: 2006 | en |
dc.description.tableofcontents | Contents
Abstract i 1 Introduction 1 1.1 Background . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1 1.2 Motivation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 1.3 Our Approach . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 2 Related Work 5 3 Mechanism 7 3.1 Data Set Collection . . . . . . . . . . . . . . . . . . . . . . . . 7 3.2 Real Path . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 8 3.3 Shortest Path . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 3.4 Shortest Policy Path . . . . . . . . . . . . . . . . . . . . . . . 9 4 Analysis 11 4.1 Path Similarity . . . . . . . . . . . . . . . . . . . . . . . . . . 14 4.1.1 Length Similarity . . . . . . . . . . . . . . . . . . . . . 14 4.1.2 Link Similarity . . . . . . . . . . . . . . . . . . . . . . 15 4.2 Traffic Distribution . . . . . . . . . . . . . . . . . . . . . . . . 19 5 Preference-Ratio Random-Walk Model 22 5.1 Preference Ratio . . . . . . . . . . . . . . . . . . . . . . . . . 22 5.2 Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 23 5.3 Evaluation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 24 5.3.1 One-hop Aware Preference Ratios . . . . . . . . . . . . 26 5.3.2 Two-hop Aware Preference Ratios . . . . . . . . . . . . 26 6 Discussion 31 6.1 Two-hop Aware Preference Ratios . . . . . . . . . . . . . . . . 31 6.2 Memory Storage Space . . . . . . . . . . . . . . . . . . . . . . 32 7 Conclusions and Future Work 33 | |
dc.language.iso | en | |
dc.title | 在網際網路下自治系統層級的路徑特性分析研究 | zh_TW |
dc.title | Characterization of Internet AS-Level Paths | en |
dc.type | Thesis | |
dc.date.schoolyear | 94-2 | |
dc.description.degree | 碩士 | |
dc.contributor.coadvisor | 黃寶儀(Polly Huang) | |
dc.contributor.oralexamcommittee | 呂學一(Hsueh-I Lu),陳伶志(Ling-Jyh Chen) | |
dc.subject.keyword | 網路,自治系統,路由, | zh_TW |
dc.subject.keyword | Network,Automonous System,Routing, | en |
dc.relation.page | 36 | |
dc.rights.note | 有償授權 | |
dc.date.accepted | 2006-08-03 | |
dc.contributor.author-college | 電機資訊學院 | zh_TW |
dc.contributor.author-dept | 資訊工程學研究所 | zh_TW |
顯示於系所單位: | 資訊工程學系 |
文件中的檔案:
檔案 | 大小 | 格式 | |
---|---|---|---|
ntu-95-1.pdf 目前未授權公開取用 | 1.82 MB | Adobe PDF |
系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。