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
GPU-based heuristic solver for linear sum assignment problems under real-time constraints
KTH, School of Information and Communication Technology (ICT), Electronic, Computer and Software Systems, ECS. (SCS)
Cairo University, Egypt.
Cario University, Egypt.
Nile University, Egypt.
Show others and affiliations
2010 (English)In: Proceedings of Informatics and Systems (INFOS), 2010 The 7th International Conference, 2010Conference paper, Published paper (Other academic)
Place, publisher, year, edition, pages
2010.
National Category
Other Electrical Engineering, Electronic Engineering, Information Engineering Computer Engineering
Identifiers
URN: urn:nbn:se:kth:diva-32892OAI: oai:DiVA.org:kth-32892DiVA: diva2:412774
Note
QC 20110426Available from: 2011-04-26 Created: 2011-04-26 Last updated: 2011-04-26Bibliographically approved
In thesis
1. Design and Implementation of Centrally-Coordinated Peer-to-Peer Live-streaming
Open this publication in new window or tab >>Design and Implementation of Centrally-Coordinated Peer-to-Peer Live-streaming
2011 (English)Licentiate thesis, comprehensive summary (Other academic)
Abstract [en]

In this thesis, we explore the use of a centrally-coordinated peer-to-peer overlay as a possible solution to the live streaming problem. Our contribution lies in showing that such approach is indeed feasible given that a number of key challenges are met.

The motivation behind exploring an alternative design is that, although a number of approaches have been investigated in the past, e.g. mesh-pull and tree-push, hybrids and best-of-both-worlds mesh-push, no consensus has been reached on the best solution for the problem of peer-to-peer live streaming, despite current deployments and reported successes.

In the proposed system, we model sender/receiver peer assignments as an optimization problem. Optimized peer selection based on multiple utility factors, such as bandwidth availability, delays and connectivity compatibility, make it possible to achieve large source bandwidth savings and provide high quality of user experience. Clear benefits of our approach are observed when Network Address Translation constraints are present on the network.

We have addressed key scalability issues of our platform by parallelizing the heuristic which is the core of our optimization engine and by implementing the resulting algorithm on commodity Graphic Processing Units (GPUs). The outcome is a Linear Sum Assignment Problem (LSAP) solver for time-constrained systems which produces near-optimal results and can be used for any instance of LSAP, i.e. not only in our system.

 

As part of this work, we also present our experience in working with Network Address Translators (NATs) traversal in peer-to-peer systems. Our contribution in this context is threefold. First, we provide a semi-formal model of state of the art NAT behaviors. Second, we use our model to show which NAT combinations can be theoretically traversed and which not. Last, for each of the combinations, we state which traversal technique should be used. Our findings are confirmed by experimental results on a real network.

Finally, we address the problem of reproducibility in testing, debugging and evaluation of our peer-to-peer application. We achieve this by providing a software framework which can be transparently integrated with any already-existing software and which is able to handle concurrency, system time and network events in a reproducible manner.

 

Place, publisher, year, edition, pages
Stockholm: KTH Royal Institute of Technology, 2011. viii, 78 p.
Series
Trita-ICT-ECS AVH, ISSN 1653-6363 ; 2011:03
Keyword
peer-to-peer, live-streaming, nat traversal
National Category
Other Electrical Engineering, Electronic Engineering, Information Engineering Computer Engineering
Research subject
SRA - ICT
Identifiers
urn:nbn:se:kth:diva-32387 (URN)978-91-7415-957-8 (ISBN)
Presentation
2011-05-05, Sal D, Forum 105, Kista, Stockholm, 14:00 (English)
Opponent
Supervisors
Note
QC 20110426Available from: 2011-04-26 Created: 2011-04-13 Last updated: 2011-04-26Bibliographically approved

Open Access in DiVA

No full text

Authority records BETA

Haridi, Seif

Search in DiVA

By author/editor
Roverso, RobertoHaridi, Seif
By organisation
Electronic, Computer and Software Systems, ECS
Other Electrical Engineering, Electronic Engineering, Information EngineeringComputer Engineering

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

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