An Evaluation of Piece-Picking Algorithms for LayeredContent in Bittorrent-based Peer-To-Peer Systems<br />ICME 2011<br />...
Overview<br />Introduction to PiecePicking<br />AlgorithmforLayeredPiecePicking<br />Evaluation Results<br />Single/Multi ...
Piece-Picking in P2P Networks<br />When streaming layered videos in a P2P network, the piece-picking algorithm needs to de...
Piece-Picking Buffer<br />Michael Eberhard<br />Piece-Picking Algorithm Evaluation<br />4<br /><ul><li>The piece-picking a...
The sliding window contains the pieces that are required for playback in the near future.</li></li></ul><li>Piece-Picking ...
Piece Utility Calculation<br />For each piece within the sliding window, the utility is defined as<br />Michael Eberhard<b...
PieceMapping (1)<br />GOPs of 64 framesareconsidered as a unit<br />2.56 seconds of contentareprovidedcommonlyforeachlayer...
PieceMapping (2)<br />Michael Eberhard<br />Piece-Picking Algorithm Evaluation<br />8<br />
Simulation Setup<br />Omnet++/Oversimwithnew P2P protocol and applications (piecepickingalgorithms)<br />Swarm of 100 peer...
Multi/Single LayerComparison<br />Bothareencodedwiththesameconstantbitrate and split to fixed-sizepieces<br />Qualityforsi...
Full Bandwidth, No Churn<br />Michael Eberhard<br />Piece-Picking Algorithm Evaluation<br />11<br />
Full Bandwidth, 10% Churn<br />Michael Eberhard<br />Piece-Picking Algorithm Evaluation<br />12<br />
LimitedBandwidth, 10% Churn<br />Michael Eberhard<br />Piece-Picking Algorithm Evaluation<br />13<br />
Min/Max Quality/Peer for SL<br />Michael Eberhard<br />Piece-Picking Algorithm Evaluation<br />14<br />
Full Bandwidth, IncreasingChurn<br />Michael Eberhard<br />Piece-Picking Algorithm Evaluation<br />15<br />
Full Bandwidth, 10% Churn, Frame Loss<br />Michael Eberhard<br />Piece-Picking Algorithm Evaluation<br />16<br />
Conclusion<br />Layered Video Codecscanbeintegrated in Bittorrent-based P2P system in a backwards-compatible way<br />Ifth...
Thankyouforyour Attention!<br />Michael Eberhard<br />Piece-Picking Algorithm Evaluation<br />18<br />
Upcoming SlideShare
Loading in …5
×

An evaluation of piece picking algorithms for layered content in bittorrent-based peer-to-peer systems

1,187 views

Published on

Published in: Technology
0 Comments
0 Likes
Statistics
Notes
  • Be the first to comment

  • Be the first to like this

No Downloads
Views
Total views
1,187
On SlideShare
0
From Embeds
0
Number of Embeds
2
Actions
Shares
0
Downloads
6
Comments
0
Likes
0
Embeds 0
No embeds

No notes for slide

An evaluation of piece picking algorithms for layered content in bittorrent-based peer-to-peer systems

  1. 1. An Evaluation of Piece-Picking Algorithms for LayeredContent in Bittorrent-based Peer-To-Peer Systems<br />ICME 2011<br />Special Session on Hot Topics in Multimedia Delivery<br />Michael Eberhard<br />1<br />Piece-Picking Algorithm Evaluation<br />Michael Eberhard<br />Hermann Hellwagner<br />Christian Timmerer<br />AAU Klagenfurt<br />TiborSzkaliczki Laszlo Szobonya<br />MTA SZTAKI<br />
  2. 2. Overview<br />Introduction to PiecePicking<br />AlgorithmforLayeredPiecePicking<br />Evaluation Results<br />Single/Multi LayerComparison<br />Michael Eberhard<br />Piece-Picking Algorithm Evaluation<br />2<br />
  3. 3. Piece-Picking in P2P Networks<br />When streaming layered videos in a P2P network, the piece-picking algorithm needs to decide which piece to download at which point in time.<br />The main goal is to provide the best possible quality with the available bandwidth while ensuring continuous playback and minimizing changes in quality.<br />Michael Eberhard<br />Piece-Picking Algorithm Evaluation<br />3<br />
  4. 4. Piece-Picking Buffer<br />Michael Eberhard<br />Piece-Picking Algorithm Evaluation<br />4<br /><ul><li>The piece-picking algorithm provides a download strategy for all pieces within the sliding window.
  5. 5. The sliding window contains the pieces that are required for playback in the near future.</li></li></ul><li>Piece-Picking Sliding Window<br />Michael Eberhard<br />Piece-Picking Algorithm Evaluation<br />5<br />
  6. 6. Piece Utility Calculation<br />For each piece within the sliding window, the utility is defined as<br />Michael Eberhard<br />Piece-Picking Algorithm Evaluation<br />6<br />lj: thelayer of thepiece<br />ti: the point in time at whichthepieceisdisplayed<br />tk: the point in time of the actualdecision<br />dj: thedistortionreductionimportanceof thepiece<br />dpijk: theprobability to receivetheusefulpiece in time<br />
  7. 7. PieceMapping (1)<br />GOPs of 64 framesareconsidered as a unit<br />2.56 seconds of contentareprovidedcommonlyforeachlayer (at 25 fps)<br />A unitisalwaysentirelydownloaded<br />Onlysupportslayeredscalability<br />For singlelayercontent, ~16 frames of contentaremapped to a unit<br />Michael Eberhard<br />Piece-Picking Algorithm Evaluation<br />7<br />
  8. 8. PieceMapping (2)<br />Michael Eberhard<br />Piece-Picking Algorithm Evaluation<br />8<br />
  9. 9. Simulation Setup<br />Omnet++/Oversimwithnew P2P protocol and applications (piecepickingalgorithms)<br />Swarm of 100 peers, streaming a onehourvideo<br />Peer arrivals and departuresaremodeledaccording to a poissondistribution<br />Michael Eberhard<br />Piece-Picking Algorithm Evaluation<br />9<br />
  10. 10. Multi/Single LayerComparison<br />Bothareencodedwiththesameconstantbitrate and split to fixed-sizepieces<br />Qualityforsinglelayerishigherdue to SVC overhead<br />Comparisonbased on PSNR, as piecesizeisequalforbothencodings (receivedbitrateis ~equal)<br />Thesinglelayer PSNR formissingpiecesisweightedwiththe PSNR of a blackframes<br />Michael Eberhard<br />Piece-Picking Algorithm Evaluation<br />10<br />
  11. 11. Full Bandwidth, No Churn<br />Michael Eberhard<br />Piece-Picking Algorithm Evaluation<br />11<br />
  12. 12. Full Bandwidth, 10% Churn<br />Michael Eberhard<br />Piece-Picking Algorithm Evaluation<br />12<br />
  13. 13. LimitedBandwidth, 10% Churn<br />Michael Eberhard<br />Piece-Picking Algorithm Evaluation<br />13<br />
  14. 14. Min/Max Quality/Peer for SL<br />Michael Eberhard<br />Piece-Picking Algorithm Evaluation<br />14<br />
  15. 15. Full Bandwidth, IncreasingChurn<br />Michael Eberhard<br />Piece-Picking Algorithm Evaluation<br />15<br />
  16. 16. Full Bandwidth, 10% Churn, Frame Loss<br />Michael Eberhard<br />Piece-Picking Algorithm Evaluation<br />16<br />
  17. 17. Conclusion<br />Layered Video Codecscanbeintegrated in Bittorrent-based P2P system in a backwards-compatible way<br />Ifthebandwidthconditionsare not optimal, layeredcodecsprovide a clearlybetterperformance in terms of PSNR<br />Michael Eberhard<br />Piece-Picking Algorithm Evaluation<br />17<br />
  18. 18. Thankyouforyour Attention!<br />Michael Eberhard<br />Piece-Picking Algorithm Evaluation<br />18<br />

×