hig.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard-cite-them-right
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • sv-SE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • de-DE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
DistroFS: En lösning för distribuerad lagring av filer
University of Gävle, Department of Mathematics, Natural and Computer Sciences.
University of Gävle, Department of Mathematics, Natural and Computer Sciences.
2007 (Swedish)Independent thesis Basic level (degree of Bachelor), 10 points / 15 hpStudent thesisAlternative title
DistroFS: A Solution For Distributed File Storage (English)
Abstract [sv]

Nuvarande implementationer av distribuerade hashtabeller (DHT) har en begränsad storlek för data som kan lagras, som t.ex. OpenDHTs datastorleks gräns på 1kByte. Är det möjligt att lagra filer större än 1kByte med DHT-tekniken? Finns det någon lösning för att skydda de data som lagrats utan att försämra prestandan? Vår lösning var att utveckla en klient- och servermjukvara. Mjukvaran använder sig av DHT tekniken för att dela upp filer och distribuera delarna över ett serverkluster. För att se om mjukvaran fungerade som tänkt, gjorde vi ett test utifrån de inledande frågorna. Testet visade att det är möjligt att lagra filer större än 1kByte, säkert med DHT tekniken utan att förlora för mycket prestanda.

Abstract [en]

Currently existing distributed hash table (DHT) implementations use a small storage size for data, such as OpenDHT’s storage size limitation of 1kByte. Is it possible to store larger files than 1kByte using the DHT technique? Is there a way to protect the data without losing to much performance? Our solution was to develop a client and server software. This software uses the DHT technique to split files and distribute their parts across a cluster of servers. To see if the software worked as intended we created a test based on our opening questions. This test shows that it indeed is possible to store large files securely using the DHT technique without losing any significant performance.

Place, publisher, year, edition, pages
2007. , p. 24
Keywords [en]
Distributed Hash Table, Hash Table, Distributed File Storage
Keywords [sv]
Distribuerad Hashtabell, Hashtabell, Distribuerad fillagring
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:hig:diva-177Archive number: NEX970OAI: oai:DiVA.org:hig-177DiVA, id: diva2:119730
Uppsok
teknik
Supervisors
Examiners
Available from: 2007-08-15 Created: 2007-08-15 Last updated: 2018-01-13

Open Access in DiVA

fulltext(180 kB)456 downloads
File information
File name FULLTEXT01.pdfFile size 180 kBChecksum MD5
2cf5ddeff98960622993578f406e67c00cfcbb66f57d6d445000ceb88412c564559596b1
Type fulltextMimetype application/pdf

By organisation
Department of Mathematics, Natural and Computer Sciences
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar
Total: 456 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: 329 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard-cite-them-right
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • sv-SE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • de-DE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf