QoS-aware service evaluation and selection

被引:20
作者
Tsesmetzis, Dimitrios [1 ]
Roussaki, Ioanna [1 ]
Sykas, Efstathios [1 ]
机构
[1] Natl Tech Univ Athens, Div Comp Sci, GR-15773 Athens, Greece
关键词
integer programming; profit maximisation; QoS-aware service selection; selective multiple choice knapsack problem;
D O I
10.1016/j.ejor.2007.07.015
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
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. (C) 2007 Elsevier B.V. All rights reserved.
引用
收藏
页码:1101 / 1112
页数:12
相关论文
共 28 条
[1]  
*AM CONS, 2006, AMIGOD33
[2]   AN ALGORITHM FOR LARGE ZERO-ONE KNAPSACK-PROBLEMS [J].
BALAS, E ;
ZEMEL, E .
OPERATIONS RESEARCH, 1980, 28 (05) :1130-1154
[3]  
BONATTI PA, 2005, P 14 INT WORLD WID W
[4]  
CORMEN TH, 1990, INITRO ALGORITHMS
[5]   DISCRETE-VARIABLE EXTREMUM PROBLEMS [J].
DANTZIG, GB .
OPERATIONS RESEARCH, 1957, 5 (02) :266-277
[6]   COMPARISON OF HEURISTIC AND OPTIMUM SOLUTIONS IN RESOURCE-CONSTRAINED PROJECT SCHEDULING [J].
DAVIS, EW ;
PATTERSON, JH .
MANAGEMENT SCIENCE SERIES B-APPLICATION, 1975, 21 (08) :944-955
[7]  
DEMBO RS, 1980, METHODS OPERATIONS R, V36, P49
[8]  
Garey MR, 1979, Computers and Intractablity: A Guide to the Theoryof NP-Completeness
[9]   Toward principles for the design of ontologies used for knowledge sharing [J].
Gruber, TR .
INTERNATIONAL JOURNAL OF HUMAN-COMPUTER STUDIES, 1995, 43 (5-6) :907-928
[10]  
HECKBERT P, 1995, CMUCS95194