【摘要】：網(wǎng)絡(luò)時延測量是網(wǎng)絡(luò)性能監(jiān)測、網(wǎng)絡(luò)行為分析、網(wǎng)絡(luò)應(yīng)用設(shè)計的基礎(chǔ)，，也是測量時延抖動、網(wǎng)絡(luò)帶寬等網(wǎng)絡(luò)性能指標(biāo)的基礎(chǔ)。但是現(xiàn)有的網(wǎng)絡(luò)時延估算中還存在估算精度不高和檢測點部署不合理的情況。因此如何準(zhǔn)確、快速地進行網(wǎng)絡(luò)時延估測已經(jīng)成為網(wǎng)絡(luò)時延估算領(lǐng)域的研究熱點，具有重要的研究價值和現(xiàn)實意義。 目前針對網(wǎng)絡(luò)時延估算的研究主要包括基于網(wǎng)絡(luò)結(jié)構(gòu)和基于網(wǎng)絡(luò)坐標(biāo)的時延估算技術(shù)的研究�；诰W(wǎng)絡(luò)結(jié)構(gòu)的估算技術(shù)由于充分考慮了網(wǎng)絡(luò)的路由拓?fù)浜吐窂竭x擇等網(wǎng)絡(luò)內(nèi)部特性，具有較高的估測精度。本文主要對基于網(wǎng)絡(luò)拓?fù)涞臅r延估算進行研究，取得了如下研究成果： 首先提出基于網(wǎng)絡(luò)拓?fù)涞娜龑訒r延估測架構(gòu)。目前的基于網(wǎng)絡(luò)拓?fù)涞臅r延估算方法中沒有考慮兩個具有公有路徑的RTT序列之間的關(guān)系。為了研究這種關(guān)系，本文引入RTT相似度的概念。在NS2網(wǎng)絡(luò)仿真中通過改變網(wǎng)絡(luò)拓?fù)渲新窂介L度，分析了不同的路徑長度與RTT相似度的關(guān)系，得到公有路徑長度和RTT相似度的關(guān)系：公有路徑越長，RTT相似度越大。然后，針對每種拓?fù)鋱鼍巴ㄟ^線性回歸分析得到時延估算公式的參數(shù)和估算精度。 在時延估測架構(gòu)和仿真分析的基礎(chǔ)上，本文提出一種從檢測點集合中選擇最優(yōu)的時延檢測點的時延估算模型。該模型首先通過網(wǎng)絡(luò)的測量節(jié)點集合中選擇所形成拓?fù)鋱鼍爸泄浪憔茸畲蟮臋z測點，并利用對應(yīng)拓?fù)鋱鼍暗木�性回歸參數(shù)得到時延估算方程及估算精度。然后根據(jù)這些數(shù)據(jù)給出動態(tài)時延估算方法，該方法可以根據(jù)不同的估算精度要求動態(tài)地選取檢測點進行時延估算，從而使時延估測系統(tǒng)更加靈活和高效。 本文最后研究了針對不同的估測精度要求，確定盡可能小的檢測點集合的問題。將時延檢測點的選擇問題在多項式時間內(nèi)可以轉(zhuǎn)化成最小頂點覆蓋問題，證明該問題是NP完全問題。然后提出一種基于可估算路徑最多的貪婪選擇原則的貪婪算法，得到近似最優(yōu)的檢測點集合。
[Abstract]:Network delay measurement is the basis of network performance monitoring, network behavior analysis, network application design, and measurement of delay jitter, network bandwidth and other network performance indicators. However, in the existing network delay estimation, the estimation accuracy is not high and the detection point deployment is unreasonable. Therefore, how to estimate the network delay accurately and quickly has become a research hotspot in the field of network delay estimation, which has important research value and practical significance. At present, the research of network delay estimation mainly includes network structure and network coordinate based delay estimation technology. The estimation technology based on network structure has high estimation accuracy due to the full consideration of the network internal characteristics such as routing topology and path selection. In this paper, the time delay estimation based on network topology is studied, and the research results are as follows: firstly, a three-layer time-delay estimation architecture based on network topology is proposed. The relationship between two RTT sequences with public paths is not considered in the current network topology based delay estimation method. In order to study this relationship, this paper introduces the concept of RTT similarity. In NS2 network simulation, by changing the path length in network topology, the relationship between different path length and RTT similarity is analyzed, and the relationship between public path length and RTT similarity is obtained: the longer the public path, the greater the RTT similarity. Then, the parameters and accuracy of the time delay estimation formula are obtained by linear regression analysis for each topological scenario. On the basis of time delay estimation architecture and simulation analysis, this paper presents a time delay estimation model for selecting the best time delay detection points from the set of detection points. The model firstly selects the detection points with the highest estimation accuracy from the set of measurement nodes of the network and obtains the time delay estimation equation and the estimation accuracy by using the linear regression parameters of the corresponding topological scene. Then the dynamic time delay estimation method is given according to these data. The method can dynamically select the detection points to estimate the time delay according to different estimation accuracy requirements, thus making the time delay estimation system more flexible and efficient. Finally, the problem of determining the set of detection points as small as possible for different estimation accuracy requirements is studied. The problem of time delay detection point selection can be transformed into a minimum vertex covering problem in polynomial time. It is proved that the problem is a NP complete problem. Then a greedy algorithm based on the principle of greedy selection with the most estimable paths is proposed to obtain an approximate optimal set of detection points.
【學(xué)位授予單位】：北京工業(yè)大學(xué)
【學(xué)位級別】：碩士
【學(xué)位授予年份】：2014
【分類號】：TP393.02

【參考文獻】

相關(guān)期刊論文 前6條

1 焦程波;鄭輝;黃宇;;互聯(lián)網(wǎng)中網(wǎng)絡(luò)時延與物理距離關(guān)聯(lián)性分析[J];電子科技大學(xué)學(xué)報;2012年05期

2 黃瓊;劉熙;陽小龍;隆克平;;T-Vivaldi:TIV感知的IP網(wǎng)絡(luò)坐標(biāo)系統(tǒng)[J];電子科技大學(xué)學(xué)報;2012年01期

3 鄔春學(xué);韓文冬;;基于Internet的網(wǎng)絡(luò)控制系統(tǒng)端到端時延分析[J];計算機工程;2007年22期

4 馬建國;席明賢;林益民;李幼平;;中國Internet路由級跳數(shù)測量與分析[J];計算機應(yīng)用研究;2008年07期

5 蔡志平;劉芳;趙文濤;劉湘輝;殷建平;;網(wǎng)絡(luò)測量部署模型及其優(yōu)化算法[J];軟件學(xué)報;2008年02期

6 王意潔;李小勇;;網(wǎng)絡(luò)距離預(yù)測技術(shù)研究[J];軟件學(xué)報;2009年06期

相關(guān)博士學(xué)位論文 前2條

1 朱娜斐;基于RTT相似度的網(wǎng)絡(luò)延遲估測理論和方法[D];北京工業(yè)大學(xué);2012年

2 陳陽;網(wǎng)絡(luò)坐標(biāo)計算模型與應(yīng)用研究[D];清華大學(xué);2009年

本文編號：2407617