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
Service Level Achievments - Test Data for Optimal Service Selection
Linnaeus University, Faculty of Technology, Department of Computer Science.
2016 (English)Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
Abstract [en]

This bachelor’s thesis was written in the context of a joint research group, which developed a framework for finding and providing the best-fit web service for a user. The problem of the research group lays in testing their developed framework sufficiently. The framework can either be tested with test data produced by real web services which costs money or by generated test data based on a simulation of web service behavior. The second attempt has been developed within this scientific paper in the form of a test data generator. The generator simulates a web service request by defining internal services, whereas each service has an own internal graph which considers the structure of a service. A service can be atomic or can be compose of other services that are called in a specific manner (sequential, loop, conditional). The generation of the test data is done by randomly going through the services which result in variable response times, since the graph structure changes every time the system has been initialized. The implementation process displayed problems which have not been solved within the time frame. Those problems are displaying interesting challenges for the dynamical generation of random graphs. Those challenges should be targeted in further research.

Place, publisher, year, edition, pages
2016. , 62 p.
Keyword [en]
Service Level Achievments, Best-Fit Web Service, Random Generated Graphs, Response Time Generation, Weighted Edge Problem
National Category
Computer and Information Science
Identifiers
URN: urn:nbn:se:lnu:diva-50538OAI: oai:DiVA.org:lnu-50538DiVA: diva2:910586
Supervisors
Examiners
Available from: 2016-03-10 Created: 2016-03-09 Last updated: 2016-03-10Bibliographically approved

Open Access in DiVA

fulltext(1410 kB)39 downloads
File information
File name FULLTEXT01.pdfFile size 1410 kBChecksum SHA-512
ac775b52121c12190e5c34a3f70a54e36b1c5f49b18435970c4f75184e5816b1db02a0ced53225106e1af09f7f8951ac0103b6718ec526ae7eb21ef5a72b6a01
Type fulltextMimetype application/pdf

By organisation
Department of Computer Science
Computer and Information Science

Search outside of DiVA

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