Unequal Erasure Protection Capability of Randomized Linear Network Codes - an Empirical Study.

• Main Authors: Claude, Nicolas, 柯子東
• Other Authors: Zao, John Kar-Kin
• Format: Others
• Language: en_US
• Published: 2011
• Online Access: http://ndltd.ncl.edu.tw/handle/42667095240842131647

碩士 === 國立交通大學 === 電機資訊國際學位學程 === 99 === We investigate in this thesis how Random Linear Network Codes can achieve Unequal Erasure Protection. In many data streams, some layers of data have priority over the others. In order to enhance protection of particular layers with RLNC, we need to nullify local encoding coefficients at some specific nodes. The resulting coding schemes can be quantified by using Separation Vector. Furthermore, granted a finite Field large enough to have high theoretical decoding probability, evaluating and generating those coding schemes can be achieved using Graph Theory. Besides this model, our main contribution is an actual implementation of UEP-RLNC in JAVA. Some simulations were performed to verify the validity of our UEP mechanism as well as its quantification. The results obtained show the profiles of retrieval rate with respect to packet error loss for both hotspot losses and background losses scenarios.