Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Delay and playout probability trade-off in mesh-based peer-to-peer streaming with delayed buffer map updates
KTH, School of Electrical Engineering (EES), Communication Networks. (Kommunikationsnät)
KTH, School of Electrical Engineering (EES), Communication Networks.ORCID iD: 0000-0002-4876-0223
KTH, School of Electrical Engineering (EES), Communication Networks.ORCID iD: 0000-0002-2764-8099
2009 (English)In: Peer-to-Peer Networking and Applications, ISSN 1936-6442, E-ISSN 1936-6450, Vol. 3, no 3, 208-221 p.Article in journal (Refereed) Published
Abstract [en]

In mesh-based peer-to-peer streaming systemsdata is distributed among the peers according tolocal scheduling decisions. The local decisions affecthow packets get distributed in the mesh, the probabilityof duplicates and consequently, the probabilityof timely data delivery. In this paper we proposean analytic framework that allows the evaluation ofscheduling algorithms. We consider four solutions inwhich scheduling is performed at the forwarding peer,based on the knowledge of the playout buffer contentat the neighbors. We evaluate the effectiveness of thesolutions in terms of the probability that a peer can playout a packet versus the playback delay, the sensitivityof the solutions to the accuracy of the knowledge of theneighbors’ playout buffer contents, and the scalabilityof the solutions with respect to the size of the overlay.We also show how the model can be used to evaluatethe effects of node arrivals and departures on the overlay’sperformance.

Place, publisher, year, edition, pages
2009. Vol. 3, no 3, 208-221 p.
Keyword [en]
Mesh-based streaming, Delay performance
National Category
Telecommunications
Identifiers
URN: urn:nbn:se:kth:diva-12695DOI: 10.1007/s12083-009-0049-3ISI: 000284095100004Scopus ID: 2-s2.0-77955176963OAI: oai:DiVA.org:kth-12695DiVA: diva2:318100
Note
QC 20100506Available from: 2010-05-06 Created: 2010-05-06 Last updated: 2017-12-12Bibliographically approved
In thesis
1. P2P Live Video Streaming
Open this publication in new window or tab >>P2P Live Video Streaming
2010 (English)Licentiate thesis, comprehensive summary (Other academic)
Abstract [en]

The ever increasing demand for video content directed the focus of researchfrom traditional server-based schemes to peer-to-peer systems for videodelivery. In such systems, video data is delivered to the users by utilizing theresources of the users themselves, leading to a potentially scalable solution.Users connect to each other, forming a p2p overlay network on top of theInternet and exchange the video segments among themselves. The performanceof a p2p system is characterized by its capability to deliver the videocontent to all peers without errors and with the smallest possible delay. Thisconstitutes a challenge since peers dynamically join and leave the overlay andalso contribute different amounts of resources to the system.The contribution of this thesis lies in two areas. The first area is theperformance evaluation of the most prominent p2p streaming architectures.We study the streaming quality in multiple-tree-based systems. We derivemodels to evaluate the stability of a multiple tree overlay in dynamic scenariosand the efficiency of the data distribution over the multiple trees. Then, westudy the data propagation in mesh-based overlays. We develop a generalframework for the evaluation of forwarding algorithms in such overlays anduse this framework to evaluate the performance of four different algorithms.The second area of the thesis is a study of streaming in heterogeneous p2poverlays. The streaming quality depends on the aggregate resources that peerscontribute to the system: low average contribution leads to low streamingquality. Therefore, maintaining high streaming quality requires mechanismsthat either prohibit non-contributing peers or encourage contribution. In thisthesis we investigate both approaches. For the former, we derive a model tocapture the evolution of available capacity in an overlay and propose simpleadmission control mechanisms to avoid capacity drainage. For the latter, inour last work, we propose a novel incentive mechanism that maximizes thestreaming quality in an overlay by encouraging highly contributing peers tooffer more of their resources.

Place, publisher, year, edition, pages
Stockholm: KTH Royal Institute of Technology, 2010. v, 30 p.
Series
Trita-EE, ISSN 1653-5146 ; 2010:010
Keyword
p2p systems, live streaming, mesh-based systems
National Category
Telecommunications
Identifiers
urn:nbn:se:kth:diva-12373 (URN)
Presentation
2010-03-22, Q21, Osquldas väg 10, KTH, Stockholm, 15:15 (English)
Opponent
Supervisors
Note
QC 20100506Available from: 2010-05-06 Created: 2010-04-12 Last updated: 2013-09-09Bibliographically approved
2. Live Streaming Performance of Peer-to-Peer Systems
Open this publication in new window or tab >>Live Streaming Performance of Peer-to-Peer Systems
2012 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

In peer-to-peer (P2P) live streaming systems peers organize themselves in an overlay and contributewith their resources to help diffuse live content to all peers in a timely manner. The performanceof such systems is usually characterized by the delay-loss curve, which quantifies theplayback delay required for achieving a certain streaming quality, expressed as the chunk missingratio at the peers. The streaming quality is determined by the overlay construction algorithm, theforwarding algorithm, the loss process in the underlying network, the number of peers in the overlayand their bandwidth distribution, the willingness of the peers to contribute with their resourcesand the viewing behavior of the peers (churn). The overlay construction and forwarding algorithmsare inherent characteristics of a P2P protocol, while the remaining factors are artifacts of thedeployment of the P2P system over a best-effort network such as the Internet, as well as the factthat peers act as independent agents. The current thesis addresses the problem of evaluating andimproving the performance of P2P streaming protocols based on models of the network and of thepeers' behavior. The first part of the thesis is devoted to the performance evaluation of P2P overlay constructionand forwarding algorithms and offers three contributions. First, we study the efficiency of datadistribution in multiple tree-based overlays employing forward error correction. We deriveanalytical expressions for the average packet possession probability as well as its asymptoticbounds and verify our results through simulations. Second, we evaluate the performance of astreaming system in the presence of free-riders. We define two admission control policies and studythe streaming feasibility using an analytical model and via simulations. Third, we present ananalytic framework for the evaluation of forwarding algorithms in mesh-based systems. We validate itvia simulations and use it to evaluate and to compare four push-based forwarding algorithms in termsof their delay-loss curves. The second part of the thesis investigates potential improvements to the operation of P2P streamingsystems and offers three contributions in that area. First, we study the impact of selfish peerbehavior on streaming quality in overlays where a fraction of peers has limited contribution due tophysical constraints. We show that selfish peer behavior results in suboptimal streaming quality andwe propose an incentive mechanism that increases the streaming quality by using the server uploadcapacity to reward high contributing peers. Second, we study the problem of building network aware P2P streaming overlays, taking into accountrecent measurement results that indicate that the AS-level topology of the Internet is flattening.Through extensive simulations on regular and measured topologies we show that it is possible tocreate better than random overlays relying on information about the underlying topology. Finally, westudy the problem of playout adaptation in P2P streaming systems under churn. We propose andevaluate two algorithms that tune the playback delay of the peers in such a way that the streamingquality of the peers is maintained within predetermined limits. We use simulations to show thecorrectness of the proposed algorithms and the benefits from their use.

Place, publisher, year, edition, pages
Stockholm: KTH Royal Institute of Technology, 2012. vii, 43 p.
Series
Trita-EE, ISSN 1653-5146
National Category
Telecommunications
Identifiers
urn:nbn:se:kth:diva-70153 (URN)978-91-7501-241-4 (ISBN)
Public defence
2012-02-09, F3, Lindstedtsvägen 26, Stockholm, 13:15 (English)
Opponent
Supervisors
Note
QC 20120130Available from: 2012-01-30 Created: 2012-01-30 Last updated: 2012-01-30Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Authority records BETA

Dán, GyörgyFodor, Viktória

Search in DiVA

By author/editor
Chatzidrossos, IliasDán, GyörgyFodor, Viktória
By organisation
Communication Networks
In the same journal
Peer-to-Peer Networking and Applications
Telecommunications

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 102 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf