適應變動與具恢復性的即時群體串流系統

Abstract

如何選擇路由路徑在peer-to-peer(P2P)的網路或是應用層的多重傳播可以當做是選擇父節點的行為。過去的演算法中大多使用單一的評定方法來選擇該節點的父節點群。本篇論文提出一個創新的方法，結合一個節點剩餘存活時間與其他衡量因素，來動態的選擇父節點。另外在資料傳輸部份，資料產生端使用rateless code與時間區段分割架構，如此一來接受者在網狀結構中，即便擁有多個資料來源，也不需要額外的協調控制機置。我們的父節點選擇演算法除了決定路由的路徑並且有減少浪費的頻寬以及降低端點到端點間的延遲的優點，能夠達到近乎即時的串流系統。模擬的結果可以說明我們所提出的方法有效而且有組織的使所有的用戶可以享受即時的串流節目。

Routing in peer-to-peer networks or application-layer multicast can be regarded as the process of parent locating and selecting. Many algorithms in the literature adopt some monotonic criterion to choose parents. In this paper, we propose a novel approach that utilizes the residual lifetime of peers, among other factors, to make the decision of time-dependent parent-selection dynamically. Moreover, the source is encoded in the fashion of digital fountain coding and proper segment scheme is included so that a peer makes as little effort as possible to coordinate the content distribution among its multiple parents for the live streaming applications. The parent selection algorithm also arranges the routing in the way of reducing the ineffective throughput and the viewing time difference known as synchronization property in a live streaming. The simulations show the robustness of the proposed method and good synchronization between peers for the live streaming scenario.