本文選題：MGM + 編碼參數(shù)��； 參考：《西安電子科技大學(xué)》2014年碩士論文

【摘要】：相比于傳統(tǒng)網(wǎng)絡(luò)的存儲(chǔ)轉(zhuǎn)發(fā)模式，通過網(wǎng)絡(luò)編碼可以得到更好的網(wǎng)絡(luò)傳輸性能，它允許我們以最大流-最小割定理得出的最大容量傳輸信息。但是由于傳統(tǒng)網(wǎng)絡(luò)編碼存在解碼計(jì)算量大、實(shí)時(shí)響應(yīng)能力差、緩存空間需求大等缺點(diǎn)，因此出現(xiàn)了代內(nèi)網(wǎng)絡(luò)編碼。然而當(dāng)網(wǎng)絡(luò)丟包率較大時(shí)，部分代的分組丟失導(dǎo)致接收不到足夠的分組，以至于無法恢復(fù)出該代的原始信息，于是提出了多代混合(MGM,Multi-Generation Mixing)網(wǎng)絡(luò)編碼——“代”間網(wǎng)絡(luò)編碼，將文件分成多個(gè)混合集，每個(gè)混合集包含若干代，同一個(gè)混合集中位置編號(hào)大的代總是和編號(hào)小的代混合編碼。 本文對(duì)MGM網(wǎng)絡(luò)編碼的基本原理和算法進(jìn)行研究，取得了以下關(guān)鍵成果： (1)首次針對(duì)發(fā)送端在發(fā)送分組之前如何確定MGM網(wǎng)絡(luò)編碼參數(shù)(混合集容量，“代”集容量，冗余率)這一問題，定義了數(shù)據(jù)有效投遞率、探討了在解碼成功率達(dá)到99%以上數(shù)據(jù)有效投遞率最優(yōu)的準(zhǔn)則下的參數(shù)取值。 (2)本文利用泊松模型，首次從時(shí)延的角度分析了Internet網(wǎng)絡(luò)中MGM的編/解碼成功率。提出了編/解碼等待時(shí)延的具體算法、證明了編碼節(jié)點(diǎn)的分組輸出依然服從泊松過程、通過仿真驗(yàn)證了當(dāng)?shù)却龝r(shí)延在合理區(qū)間內(nèi)時(shí)，Internet網(wǎng)絡(luò)的網(wǎng)絡(luò)編/解碼成功率接近于1。 (3)針對(duì)“代”間網(wǎng)絡(luò)編碼方案解碼計(jì)算量及解碼時(shí)延較大的問題，提出了一種新穎的“代”間網(wǎng)絡(luò)編碼方案，即鄰“代”混合(AGM,Adjacent-Generation Mixing)網(wǎng)絡(luò)編碼，將混合集中的每一代與它的前一代進(jìn)行混合編碼，編碼過程與它的相鄰兩代有關(guān)，與混合集中的其他代無關(guān)。理論分析和仿真結(jié)果表明AGM編碼方案相比于MGM以及已有的MGM改進(jìn)方案能夠大量減少解碼計(jì)算量和解碼時(shí)延，同時(shí)并保持與MGM相當(dāng)?shù)慕獯a成功概率。
[Abstract]:Compared with the traditional network storage and forwarding mode, the network coding can get better network transmission performance, which allows us to obtain the maximum capacity of transmission information based on the maximum flow-minimum cut theorem. However, the traditional network coding has many disadvantages, such as large decoding computation, poor real-time response and large cache space, so the intra-generation network coding appears. However, when the packet loss rate of the network is high, the packet loss of some generations results in insufficient packets being received, so that the original information of the generation can not be recovered. Therefore, the MGMU Multi-Generation Mixing network coding, "intergenerational" network coding, is proposed. The file is divided into multiple mixed sets, each of which contains several generations, the generation with large number in the same hybrid set is always and the generation with small number is always mixed. In this paper, the basic principles and algorithms of MGM network coding are studied, and the following key achievements are obtained: (1) for the first time, how to determine the MGM network coding parameters (mixed set capacity, "generation" set capacity) before sending packets is the first time for the sender to determine the MGM network coding parameters. (2) in this paper, we define the effective delivery rate of data, and discuss the parameter value under the criterion of the optimal effective delivery rate of data over 99% of the decoding success rate. (2) in this paper, we use Poisson's model. The success rate of encoding / decoding of MGM in Internet network is analyzed for the first time from the point of view of delay. A specific algorithm of coding / decoding waiting delay is proposed, and it is proved that the packet output of the coding node still follows the Poisson process. The simulation results show that the network coding / decoding success rate of Internet network is close to 1 when the waiting delay is within a reasonable range. (3) the problem of large decoding computation and decoding delay for the "intergenerational" network coding scheme is discussed. In this paper, a novel "generation" network coding scheme is proposed, that is, the adjacent "generation" hybrid network coding, in which each generation in the hybrid set is mixed with the previous generation, and the coding process is related to its adjacent two generations. It has nothing to do with other generations in a mixed set. The theoretical analysis and simulation results show that the AGM coding scheme can greatly reduce the decoding computation and decoding delay compared with MGM and the existing MGM improved scheme, while maintaining the same probability of success as MGM.
【學(xué)位授予單位】：西安電子科技大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2014
【分類號(hào)】：TP393.01

【參考文獻(xiàn)】

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

1 梅崢,李錦濤;一種自適應(yīng)的視頻流化前向糾錯(cuò)算法[J];軟件學(xué)報(bào);2004年09期

2 蒲保興;王偉平;;線性網(wǎng)絡(luò)編碼運(yùn)算代價(jià)的估算與分析[J];通信學(xué)報(bào);2011年05期

3 徐奎;戴彬;黃本雄;張波;;基于無線網(wǎng)絡(luò)編碼的信道利用率研究[J];微電子學(xué)與計(jì)算機(jī);2010年01期

4 陶少國(guó);黃佳慶;楊宗凱;喬文博;熊志強(qiáng);;網(wǎng)絡(luò)編碼研究綜述[J];小型微型計(jì)算機(jī)系統(tǒng);2008年04期

，

本文編號(hào)：2086027