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
Name server for CES
2008 (English)Independent thesis Advanced level (professional degree), 20 credits / 30 HE creditsStudent thesis
Abstract [en]

The use of name servers makes the communication between tasks easier and the benefits increases with the growth of the network. Since the CES platform developed by TietoEnator AB was made for networks placed in base stations and similar products the use of a name server was desirable. Since this master thesis only involves the communication within the base station the secure message passing was not need. And we could assume that all the messages arrived at some point. This assumption was based on that the distance between the name servers was small and the frequency of update messages was high. This master thesis describes the names server that we developed for CES. A name server main task is to translate names into address points. A requirement from TietoEnator was that all the name servers in the network have all the address point stored that is available in the network. The purpose of this thesis is to find a distributed algorithm that distributes all the address point around the network. The Name server problem was divided into two parts, Name server and Multicast transport protocol. We investigated several existing name server to find out if any of them could be use for our problem but they all failed to our requirements. We also looked at some existing multicast transport protocol but all of them seemed too advanced for our project and therefore we developed a solution that is tailor-made for CES and built upon multicast. We came up with two solutions the first one turned out to be very message intensive the messages sent and received during one clock cycle increase exponential and therefore not a very efficient. The other solutions messages increase linear and therefore a much better solution. Our implemented solution were tested in a small scale but it worked very well but needs to be tested in a bigger network.

Place, publisher, year, edition, pages
2008.
Keywords [en]
Technology, Name Server, algorithms
Keywords [sv]
Teknik
Identifiers
URN: urn:nbn:se:ltu:diva-48083ISRN: LTU-EX--08/124--SELocal ID: 58edefbb-7f66-435f-bf34-2f3dad453bb9OAI: oai:DiVA.org:ltu-48083DiVA, id: diva2:1021421
Subject / course
Student thesis, at least 30 credits
Educational program
Computer Science and Engineering, master's level
Examiners
Note
Validerat; 20101217 (root)Available from: 2016-10-04 Created: 2016-10-04Bibliographically approved

Open Access in DiVA

fulltext(481 kB)89 downloads
File information
File name FULLTEXT01.pdfFile size 481 kBChecksum SHA-512
fe9d03d4378bdbc736bd6dfb9c2a1a28a88601e46731c829da8d873fd0ba52755e5d6122497a4c2ee0d714e848fb4f1c71ac1a4216e130bfc4b874db23560818
Type fulltextMimetype application/pdf

Search outside of DiVA

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