uu.seUppsala University Publications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • 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
Bittorent Simulator in Erlang
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology.
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology.
2010 (English)Independent thesis Advanced level (degree of Master (One Year)), 20 credits / 30 HE creditsStudent thesis
Abstract [en]

This master thesis examined how different behavior of bittorrent clients and trackers affect the simulation in various scenarios such as different network topologies, greedy behavior of downloading clients or choices of algorithms by the downloading clients. The thesis also includes the construction of a network simulator, a modular bittorrent client and a modular bittorrent tracker to support a wide range of options for the bittorrent simulator. These options can be combined to make new scenarios for the simulator to run and results will be presented graphically. Even the algorithms of the modular structure can be easily exchanged to try out new ideas of how things should work to find out how the algorithm behaves under certain circumstances and how it affects the swarm.

Simulations were made to examine behavior when clients had different configurations of the choking algorithm, clients had different sizes of their sub pieces, clients had different distance to the seeder, clients used different piece selection algorithm. In the case of the piece selection algorithms using only a few seeders, the algorithms performed similar to each other which was contrary to our initial expectation that the algorithm rarest first would perform better than the naive order algorithm.

Place, publisher, year, edition, pages
2010.
Series
IT ; 10 005
Identifiers
URN: urn:nbn:se:uu:diva-117559OAI: oai:DiVA.org:uu-117559DiVA, id: diva2:297971
Presentation
(English)
Uppsok
Technology
Supervisors
Examiners
Available from: 2010-02-19 Created: 2010-02-19 Last updated: 2010-02-19Bibliographically approved

Open Access in DiVA

fulltext(866 kB)1163 downloads
File information
File name FULLTEXT01.pdfFile size 866 kBChecksum SHA-512
ecf644287efc292e8807da108778e74ba31ff752e29c97c86e35289d57cc321042c3925ebcf80ef55c4aea1957c821c7b853a6725d28aac7297e004ddc0c5302
Type fulltextMimetype application/pdf

By organisation
Department of Information Technology

Search outside of DiVA

GoogleGoogle Scholar
Total: 1163 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

urn-nbn

Altmetric score

urn-nbn
Total: 971 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association
  • 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