Spelling suggestions: "subject:"295105.386 .226 2014eb"" "subject:"295105.386 .626 2014eb""
1 |
Multi-source scheduling in streaming erasure-coded video over P2P networks / CUHK electronic theses & dissertations collectionJanuary 2014 (has links)
The efficient scheduling of streaming data delivery in a peer-to-peer (P2P) network is a hard problem due to the Internet’s lack of support for resource allocation and performance guarantees. In particular, the bandwidth resources available to a peer is constantly in flux and the future bandwidth availability is very difficult, if not impossible, to predict accurately. This thesis proposes to tackle this problem from a different angle. We investigate the use of erasure codes to encode the media data and then schedule multiple peers to stream the encoded data simultaneously to a receiver. By exploiting the order-invariant property of erasure codes this approach enables the sending peers to fully utilize their available bandwidth resources and yet does not need to estimate or predict their bandwidth availability. Moreover, we develop distributed scheduling algorithms to juxtapose the data transmissions from multiple peers so that the coding and storage complexities can be kept at practical level in scaling up the system. / 在互聯網中變動的可用頻寬和網路的延遲變異等問題,對點對點網絡上的串流傳輸品質造成嚴重的影響。由於每一個用戶端的網絡傳輸速度都是不穩定,而且是難以預測的,這是很困難去制定一個高效率的傳輸排程。在本論文中,我們從另一個角度去解決這個問題。首先,利用抹除碼把訊息變成足夠數量的區塊,讓多個訊息源可以同時傳送不同部分的區塊給受信者。由於抹除碼擁有糾錯能力,訊息源之間便不再需要任何協調及傳輸排程,提升整體的傳輸速度。另外,我們開發了一個排程算法來演算每一個訊息源的區塊傳送次序,盡可能的節省計算抹除碼時所需的資源,以能夠在具規模的環境中運作。 / Ma, Man Lok. / Thesis (Ph.D.)--Chinese University of Hong Kong, 2014. / Includes bibliographical references (leaves 72-75). / Abstracts also in Chinese. / Title from PDF title page (viewed on 26, September, 2016). / Detailed summary in vernacular field only.
|
Page generated in 0.0597 seconds