Bandwidth Efficient Multicast File-Sharing using Network Coding
Date Issued
2006
Date
2006
Author(s)
Jheng, Yu-Syuan
DOI
en-US
Abstract
Peer-to-peer (P2P) file-sharing has become the leading growth application since its emergence in the late 90's. However, current approaches lead to high bandwidth consumption in Internet. In this thesis, we propose a bandwidth efficient file-sharing system using network coding which leverages P2P user storage in file transfer. Previous works on network coding mainly adopt random coding, and the coding decision thereby does not consider the heterogeneity of the data stored in users. In our approach, however, we avoid encoding unnecessary data by leveraging the variety of the caching files in the clients, and our approach thereby can effectively reduce the number of transmission in sender and result in minimal bandwidth consumption. We formulate the selection of coding data as Minimum Bandwidth P2P Coding Problem and prove that it is NP-complete. We also propose Maximal Entropy Selection (MES) algorithm in the thesis to find the solution of the problem. Finally, we demonstrate the algorithm performance through extensive simulations and show that MES is able to significantly reduce the bandwidth consumption.
Subjects
點對點
檔案分享
網路編碼
P2P
file-sharing
network coding
Type
thesis
File(s)![Thumbnail Image]()
Loading...
Name
ntu-95-R93942040-1.pdf
Size
23.31 KB
Format
Adobe PDF
Checksum
(MD5):cd6d7540a990fd6be7164224a2df8480
