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
Sepidar: Incentivized market-based P2P live-streaming on the Gradient overlay network
KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.
KTH, School of Information and Communication Technology (ICT).
KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture, Software and Computer Systems, SCS.ORCID iD: 0000-0002-6718-0144
Swedish Institute of Computer Science (SICS).
2010 (English)In: Proceedings - 2010 IEEE International Symposium on Multimedia, ISM 2010, Taichung, 2010, 1-8 p.Conference paper, Published paper (Refereed)
Abstract [en]

Live streaming of video content using overlay networks has gained widespread adoption on the Internet. This paper presents Sepidar, a distributed market-based model, that builds and maintains overlay network trees, which are approximately minimal height, for delivering live media as a number of substreams. A streaming tree is constructed for each substream such that nodes that contribute higher amounts of upload bandwidth are located increasingly closer to the media source at the root of the tree. While our distributed market model can be run against a random sample of nodes, we improve its convergence time to stabilize a tree by executing against a sample of nodes that contribute similar amounts of upload bandwidth. We use the Gradient overlay network to generate samples of such nodes. We address the problem of free-riding through parent nodes auditing the behaviour of their child nodes. We evaluate Sepidar by comparing it in simulation with state-of-the-art NewCoolstreaming. Our results show significantly improved playback latency and playback continuity under churn, flash-crowd, and catastrophic failure experiment scenarios. We also show that using the Gradient improves convergence time of our distributed market model compared to a random overlay network. Finally, we show that Sepidar punishes the performance of free-riders, and that nodes are incentivized to contribute more upload bandwidth by relatively improved performance. © 2010 IEEE.

Place, publisher, year, edition, pages
Taichung, 2010. 1-8 p.
Keyword [en]
Distributed market model, Gradient overlay, Live streaming, P2P overlay, Catastrophic failures, Child node, Convergence time, Free-riders, Free-riding, Live media, Market model, P2P overlays, Parent node, Random sample, Sub-streams, Video contents, Bandwidth, Commerce, Overlay networks, Peer to peer networks, Video streaming, Media streaming
National Category
Other Electrical Engineering, Electronic Engineering, Information Engineering Information Science
Identifiers
URN: urn:nbn:se:kth:diva-33776DOI: 10.1109/ISM.2010.11Scopus ID: 2-s2.0-79951742010ISBN: 9780769542171 (print)OAI: oai:DiVA.org:kth-33776DiVA: diva2:417504
Note
QC 20110517Available from: 2011-05-17 Created: 2011-05-17 Last updated: 2011-05-17Bibliographically approved
In thesis
1. Distributed Optimization of P2P Media Delivery Overlays
Open this publication in new window or tab >>Distributed Optimization of P2P Media Delivery Overlays
2011 (English)Licentiate thesis, comprehensive summary (Other academic)
Abstract [en]

Media streaming over the Internet is becoming increasingly popular. Currently, most media is delivered using global content-delivery networks, providing a scalable and robust client-server model. However, content delivery infrastructures are expensive. One approach to reduce the cost of media delivery is to use peer-to-peer (P2P) overlay networks, where nodes share responsibility for delivering the media to one another. The main challenges in P2P media streaming using overlay networks include: (i) nodes should receive the stream with respect to certain timing constraints, (ii) the overlay should adapt to the changes in the network, e.g., varying bandwidth capacity and join/failure of nodes, (iii) nodes should be intentivized to contribute and share their resources, and (iv) nodes should be able to establish connectivity to the other nodes behind NATs. In this work, we meet these requirements by presenting P2P solutions for live media streaming, as well as proposing a distributed NAT traversal solution. First of all, we introduce a distributed market model to construct an approximately minimal height multiple-tree streaming overlay for content delivery, in gradienTv. In this system, we assume all the nodes are cooperative and execute the protocol. However, in reality, there may exist some opportunistic nodes,  free-riders, that take advantage of the system, without contributing to content distribution. To overcome this problem, we extend our market model in Sepidar to be effective in deterring free-riders. However, gradienTv and Sepidar are tree-based solutions, which are fragile in high churn and failure scenarios. We present a solution to this problem in GLive that provides a more robust overlay by replacing the tree structure with a mesh. We show in simulation, that the mesh-based overlay outperforms the multiple-tree overlay. Moreover, we compare the performance of all our systems with the state-of-the-art NewCoolstreaming, and observe that they provide better playback continuity and lower playback latency than that of NewCoolstreaming under a variety of experimental scenarios. Although our distributed market model can be run against a random sample of nodes, we improve its convergence time by executing it against a sample of nodes taken from the Gradient overlay. The Gradient overlay organizes nodes in a topology using a local utility value at each node, such that nodes are ordered in descending utility values away from a core of the highest utility nodes. The evaluations show that the streaming overlays converge faster when our market model works on top of the Gradient overlay. We use a gossip-based peer sampling service in our streaming systems to provide each node with a small list of live nodes. However, in the Internet, where a high percentage of nodes are behind NATs, existing gossiping protocols break down. To solve this problem, we present Gozar , a NAT-friendly gossip-based peer sampling service that: (i) provides uniform random samples in the presence of NATs, and (ii) enables direct connectivity to sampled nodes using a fully distributed NAT traversal service. We compare Gozar with the state-of-the-art NAT-friendly gossip-based peer sampling service, Nylon, and show that only Gozar supports one-hop NAT traversal, and its overhead is roughly half of Nylon’s.

  

 

 

 

 

 

 

 

Place, publisher, year, edition, pages
Stockholm: KTH Royal Institute of Technology, 2011. x, 31 p.
Series
Trita-ICT-ECS AVH, ISSN 1653-6363 ; 2011:04
Keyword
P2P overlay networks, P2P live streaming, Distributed optimization
National Category
Other Electrical Engineering, Electronic Engineering, Information Engineering Information Science
Identifiers
urn:nbn:se:kth:diva-33287 (URN)978-91-7415-970-7 (ISBN)
Presentation
2011-06-03, Sal D, KTH-Forum, Isafjordsgatan 39, Kista, 14:17 (English)
Opponent
Supervisors
Note
QC 20110517Available from: 2011-05-17 Created: 2011-05-02 Last updated: 2011-05-18Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopushttp://www.scopus.com/inward/record.url?eid=2-s2.0-79951742010&partnerID=40&md5=617807801ecaf44acc19f76a28345cd9

Authority records BETA

Haridi, Seif

Search in DiVA

By author/editor
Payberah, Amir H.Rahimian, FatemehHaridi, Seif
By organisation
Software and Computer Systems, SCSSchool of Information and Communication Technology (ICT)
Other Electrical Engineering, Electronic Engineering, Information EngineeringInformation Science

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 100 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