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
Small-world Streaming: Network-aware Streaming Overlay Construction Policies for a Flat Internet
KTH, School of Electrical Engineering (EES), Communication Networks.
KTH, School of Electrical Engineering (EES), Communication Networks.ORCID iD: 0000-0002-4876-0223
INRIA, FRANCE. (Planete)
2011 (English)Manuscript (preprint) (Other academic)
Abstract [en]

Recent measurements indicate that the peering agreements betweenAutonomous Systems (AS) are flattening the AS level topology of theInternet. The transition to a more flat AS topology opens up for newpossibilities for proximity-aware peer-to-peer overlay construction. Inthis paper we consider the problem of the construction of overlays  forlive peer-to-peer streaming  that leverage peering connections tothe maximum extent possible, and investigate how a limited number ofoverlay connections over transit links should be chosen such as tomaximize the streaming performance. We define a set of transit overlaylink establishment policies that leverage topological characteristics ofthe AS graph. We evaluate their performance over regular AS topologiesusing extensive simulations, and show that the performance difference between the policies can be up to an order of magnitude. Thus, it is possible to maximize the system performance by leveraging the characteristics of the AS graph. Based on our results we also argue that the average loss probability is not an adequate measure of the performance of proximity-aware overlays.  We confirm our findings via simulations over a graph of the peering AS topology of over 600 ASs obtained from a large measurement data set.

Place, publisher, year, edition, pages
2011.
National Category
Telecommunications
Identifiers
URN: urn:nbn:se:kth:diva-66453OAI: oai:DiVA.org:kth-66453DiVA: diva2:484089
Note

QC 20121221

Available from: 2012-01-30 Created: 2012-01-26 Last updated: 2012-12-21Bibliographically approved
In thesis
1. 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

Authority records BETA

Dán, György

Search in DiVA

By author/editor
Chatzidrossos, IliasDán, György
By organisation
Communication Networks
Telecommunications

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 113 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