QoS-aware service evaluation and selection

DSpace/Manakin Repository

Show simple item record

dc.contributor.author Tsesmetzis, D en
dc.contributor.author Roussaki, I en
dc.contributor.author Sykas, E en
dc.date.accessioned 2014-03-01T01:29:04Z
dc.date.available 2014-03-01T01:29:04Z
dc.date.issued 2008 en
dc.identifier.issn 0377-2217 en
dc.identifier.uri https://dspace.lib.ntua.gr/xmlui/handle/123456789/19107
dc.subject Integer programming en
dc.subject Profit maximisation en
dc.subject QoS-aware service selection en
dc.subject Selective multiple choice knapsack problem en
dc.subject.classification Management en
dc.subject.classification Operations Research & Management Science en
dc.subject.other Algorithms en
dc.subject.other Bandwidth en
dc.subject.other Constraint theory en
dc.subject.other Integer programming en
dc.subject.other Problem solving en
dc.subject.other Profit maximization en
dc.subject.other QoS-aware service selection en
dc.subject.other Selective multiple choice knapsack problem en
dc.subject.other Quality of service en
dc.title QoS-aware service evaluation and selection en
heal.type journalArticle en
heal.identifier.primary 10.1016/j.ejor.2007.07.015 en
heal.identifier.secondary http://dx.doi.org/10.1016/j.ejor.2007.07.015 en
heal.language English en
heal.publicationDate 2008 en
heal.abstract Making the provision of services QoS-aware is to the advantage of both clients and providers in the e-business domain. This paper studies the problem of providers that receive multiple concurrent requests for services demonstrating different QoS properties. It introduces the ""Selective Multiple Choice Knapsack Problem"" that aims to identify the services, which should be delivered in order to maximise the provider's profit, subject to maximum bandwidth constraints. This problem is solved by a proposed algorithm that has been empirically evaluated via numerous experiments. © 2007 Elsevier B.V. All rights reserved. en
heal.publisher ELSEVIER SCIENCE BV en
heal.journalName European Journal of Operational Research en
dc.identifier.doi 10.1016/j.ejor.2007.07.015 en
dc.identifier.isi ISI:000257637300036 en
dc.identifier.volume 191 en
dc.identifier.issue 3 en
dc.identifier.spage 1101 en
dc.identifier.epage 1112 en

Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record