English  |  正體中文  |  简体中文  |  Items with full text/Total items : 26988/38789
Visitors : 2341991      Online Users : 43
RC Version 4.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Adv. Search

Please use this identifier to cite or link to this item: http://ntour.ntou.edu.tw:8080/ir/handle/987654321/18089

Title: 基於點對點網路上的多媒體串流激勵機制的研究
A study of incentive mechanisms for media streaming on peer-to-peer networks
Authors: Yong-Cheng Hou
Contributors: NTOU:Department of Computer Science and Engineering
Keywords: 點對點網路;多媒體串流;便車者;激勵機制
Peer-to-peer networks;Mutimedia streaming;Freeriding;Incentive mechanism
Date: 2008
Issue Date: 2011-07-04
Abstract: 隨著網路技術的發展,人們從網路上獲得的多媒體資訊也急速增多,其中的串流技術,因為其快速、節省空間等特性而受到歡迎。在結合了點對點網路技術後,新的點對點多媒體串流系統也成了熱門的網路多媒體資訊發佈系統。但同樣的新的系統也有了點對點網路的一些問題,如使用者限制上傳頻寬、自私者不願轉送資料的便車者問題等。 本篇論文提出了一套激勵機制,嘗試讓使用者能貢獻更多的頻寬上傳,並解決便車者問題,提高社會效益。另外再依據此激勵機制探討使用者謊報、傳送資料量變動、斷線相關問題。
With the development of network technology, people obtain more multimedia information from network. Among these technologies , multimedia streaming is a popluar one for its nice characteristics. Recently, after combining the peer-to-peer technology, the streaming system has become the killer application in multimedia metworks. But the problems occured in peer-to-peer network, such as that users dose not relay data, limit their uploading bandwidth, are also inheritated in the peer-to-peer streaming system. The thesis proposes a set of incentive mechanisms, trying to enable the user to contribute more bandwidth to upload, and then improves the social utility. The associated problem, that user may lie about their activities are also studied. We show that user can benefit from the honest policy.
URI: http://ethesys.lib.ntou.edu.tw/cdrfb3/record/#G0M94570033
Appears in Collections:[資訊工程學系] 博碩士論文

Files in This Item:

File Description SizeFormat

All items in NTOUR are protected by copyright, with all rights reserved.


著作權政策宣告: 本網站之內容為國立臺灣海洋大學所收錄之機構典藏,無償提供學術研究與公眾教育等公益性使用,請合理使用本網站之內容,以尊重著作權人之權益。
網站維護: 海大圖資處 圖書系統組
DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback