Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • 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
Accurate and efficient simulation of bandwidth dynamics for Peer-To-Peer overlay networks
KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture (Closed 20120101), Software and Computer Systems, SCS (Closed 20120101). Peerialism AB.
KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture (Closed 20120101), Software and Computer Systems, SCS (Closed 20120101).
KTH, School of Information and Communication Technology (ICT), Communication: Services and Infrastucture (Closed 20120101), Software and Computer Systems, SCS (Closed 20120101).ORCID iD: 0000-0002-6718-0144
2011 (English)In: VALUETOOLS '11 Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools, ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering) , 2011, 352-361 p.Conference paper, Published paper (Refereed)
Abstract [en]

When evaluating Peer-to-Peer content distribution systems by means of simulation, it is of vital importance to correctly mimic the bandwidth dynamics behaviour of the underlying network. In this paper, we propose a scalable and accurate flow-level network simulation model based on an evolution of the classical progressive filling algorithm which follows the max-min fairness idea. We build on top of the current state of the art by applying an optimization to reduce the cost of each bandwidth allocation/deallocation operation on a node-based directed network model. Unlike other works, our evaluation of the chosen approach focuses both on efficiency and on accuracy. Our experiments show that, in terms of scalability, our bandwidth allocation algorithm outperforms existing directed models when simulating large-scale structured overlay networks. In terms of accuracy we show that allocation dynamics of our proposed solution follow those of the NS-2 packet-level simulator by a small and nearly constant offset for the same scenarios. To the best of our knowledge, this is the first time that an accuracy study has been conducted on an improvement of the classical progressive filling algorithm.

Place, publisher, year, edition, pages
ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering) , 2011. 352-361 p.
Keyword [en]
bandwidth dynamics simulation, flow-level simulation, peer-to-peer systems, progressive filling
National Category
Computer Systems
Identifiers
URN: urn:nbn:se:kth:diva-134230DOI: 10.4108/icst.valuetools.2011.245721Scopus ID: 2-s2.0-84897392664ISBN: 978-1-936968-09-1 (print)OAI: oai:DiVA.org:kth-134230DiVA: diva2:665665
Conference
5th International ICST Conference on Performance Evaluation Methodologies and Tools, VALUETOOLS 2011, Cachan, France, 16 May 2011 through 20 May 2011
Note

QC 20131121

Available from: 2013-11-20 Created: 2013-11-20 Last updated: 2015-04-22Bibliographically approved
In thesis
1. A System, Tools and Algorithms for Adaptive HTTP-live Streaming on Peer-to-peer Overlays
Open this publication in new window or tab >>A System, Tools and Algorithms for Adaptive HTTP-live Streaming on Peer-to-peer Overlays
2013 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

In recent years, adaptive HTTP streaming protocols have become the de facto standard in the industry for the distribution of live and video-on-demand content over the Internet. In this thesis, we solve the problem of distributing adaptive HTTP live video streams to a large number of viewers using peer-to-peer (P2P) overlays. We do so by assuming that our solution must deliver a level of quality of user experience which is the same as a CDN while trying to minimize the load on the content provider’s infrastructure. Besides that, in the design of our solution, we take into consideration the realities of the HTTP streaming protocols, such as the pull-based approach and adaptive bitrate switching.

The result of this work is a system which we call SmoothCache that provides CDN-quality adaptive HTTP live streaming utilizing P2P algorithms. Our experiments on a real network of thousands of consumer machines show that, besides meeting the the CDN-quality constraints, SmoothCache is able to consistently deliver up to 96% savings towards the source of the stream in a single bitrate scenario and 94% in a multi-bitrate scenario. In addition, we have conducted a number of pilot deployments in the setting of large enterprises with the same system, albeit tailored to private networks. Results with thousands of real viewers show that our platform provides an average offloading of bottlenecks in the private network of 91.5%.

These achievements were made possible by advancements in multiple research areas that are also presented in this thesis. Each one of the contributions is novel with respect to the state of the art and can be applied outside of the context of our application. However, in our system they serve the purposes described below.

We built a component-based event-driven framework to facilitate the development of our live streaming application. The framework allows for running the same code both in simulation and in real deployment. In order to obtain scalability of simulations and accuracy, we designed a novel flow-based bandwidth emulation model.

In order to deploy our application on real networks, we have developed a network library which has the novel feature of providing on-the-fly prioritization of transfers. The library is layered over the UDP protocol and supports NAT Traversal techniques. As part of this thesis, we have also improved on the state of the art of NAT Traversal techniques resulting in higher probability of direct connectivity between peers on the Internet.

Because of the presence of NATs on the Internet, discovery of new peers and collection of statistics on the overlay through peer sampling is problematic. Therefore, we created a peer sampling service which is NAT-aware and provides one order of magnitude fresher samples than existing peer sampling protocols.

Finally, we designed SmoothCache as a peer-assisted live streaming system based on a distributed caching abstraction. In SmoothCache, peers retrieve video fragments from the P2P overlay as quickly as possible or fall back to the source of the stream to keep the timeliness of the delivery. In order to produce savings, the caching system strives to fill up the local cache of the peers ahead of playback by prefetching content. Fragments are efficiently distributed by a self-organizing overlay network that takes into account many factors such as upload bandwidth capacity, connectivity constraints, performance history and the currently being watched bitrate.

Place, publisher, year, edition, pages
Stockholm: KTH Royal Institute of Technology, 2013. xix, 41 p.
Series
TRITA-ICT-ECS AVH, ISSN 1653-6363 ; 13:18
Keyword
peer-to-peer, distributed caching, nat traversal, congestion control, adaptive HTTP streaming, live streaming
National Category
Computer Science
Research subject
SRA - ICT
Identifiers
urn:nbn:se:kth:diva-134351 (URN)978-91-7501-915-4 (ISBN)
Public defence
2013-12-12, Sal D, Forum, KTH-ICT, Isafjordsgatan 39, Stockholm, 13:00 (English)
Opponent
Supervisors
Note

QC 20131122

Available from: 2013-11-22 Created: 2013-11-21 Last updated: 2016-01-21Bibliographically approved

Open Access in DiVA

fulltext(544 kB)58 downloads
File information
File name FULLTEXT01.pdfFile size 544 kBChecksum SHA-512
6428a820b277da89f8a580fd7daad731277ed536bf83348f532e83de975fc6322de7766deeaf1b05d5c66d5b4a1604b5aab79fb05130e31fe57881904991e5c7
Type fulltextMimetype application/pdf

Other links

Publisher's full textScopusACM

Search in DiVA

By author/editor
Gkogkas, AlexandrosRoverso, RobertoHaridi, Seif
By organisation
Software and Computer Systems, SCS (Closed 20120101)
Computer Systems

Search outside of DiVA

GoogleGoogle Scholar
Total: 58 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
isbn
urn-nbn

Altmetric score

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

Direct link
Cite
Citation style
  • apa
  • 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