A comprehensive study of delivery strategies with chunk scheduling for mesh P2P live streaming

Kuo, Jun-Li; Shih, Chun–Hsiung; Chen, Yaw-Chung

doi:10.1145/1968613.1968739

Cited by 2 publications

(3 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This policy guarantees higher video chunk availability and prevents peer starvation [3]. The push and pull mechanism in rarest first algorithm relies on chunk rarity, which represents the occurrence of an individual chunk among the neighbors.…”

Section: Rarest First Push-pullmentioning

confidence: 99%

A Push-Pull Chunk Delivery for Mesh-Based P2P Live Streaming

Keong

Hoong

Ting

2012

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

SUMMARYIn this paper, we propose an adaptive chunk scheduling for mesh-based peer-to-peer live streaming system, a hybrid class of push and pull chunk delivery approach. The proposed rule-based push-pull scheduler simultaneously pull video chunk from lower latency peers to fill up missing chunks and push video chunk adaptively for rapid chunk delivery. We performed comparative simulation study against rarest first pushpull and status-wise push-pull to prove the efficiency of our proposed algorithm. Mesh-push is made possible by effectively exploiting the information through buffer map exchange. The findings of performance evaluation have suggested a better video continuity and achieved lower source to end delay. key words: P2P live streaming, mesh-based network, chunk scheduling, hybrid push-pull

show abstract

Section: Rarest First Push-pullmentioning

confidence: 99%

A Push-Pull Chunk Delivery for Mesh-Based P2P Live Streaming

Keong

Hoong

Ting

2012

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

show abstract

“…LSF prevents that any chunk could be shared more times than the others, as a result, the availability of every piece is the same. To achieve this strategy requires global knowledge about the distribution of all chunks in the whole network [23] [19].…”

Section: Least-shared Firstmentioning

confidence: 99%

“…Respectively peers always selects the available chunk with the higher priority, i.e., a peer never downloads a chunk with priority i if it has not a chunk with priority i+1. Given that the download/upload scheduling policy strictly obeys a sequential priority, peers can not accept out-of-order chunks even if the bandwith utilization allows it [22] [23].…”

Section: Sequentialmentioning

confidence: 99%

What Users Want (WUW): un servicio de satisfacción de usuarios orientado a aplicaciones de distribución de contenidos

Espinosa

View full text Add to dashboard Cite

List of Figures vii List of Tables ixAcronyms xii ObjectivesThis thesis propose a P2P service, which has no dependence with the P2P-CDA. Such service allows users to define their personal preferences to be considered by the P2P-CDA. For this, the main objectives are:• To analyze some existing P2P content delivery applications in order to determine how they consider users preferences.• To design and to implement a service that considers users preferences, other than QoS related, in order to improve their satisfaction.• To design a web interface that allows the communications between to users and the service.

show abstract

A comprehensive study of delivery strategies with chunk scheduling for mesh P2P live streaming

Cited by 2 publications

References 5 publications

A Push-Pull Chunk Delivery for Mesh-Based P2P Live Streaming

A Push-Pull Chunk Delivery for Mesh-Based P2P Live Streaming

What Users Want (WUW): un servicio de satisfacción de usuarios orientado a aplicaciones de distribución de contenidos

Contact Info

Product

Resources

About