TY - GEN
T1 - A GA-based approach to resource scheduling supporting flexible quality management of ubiquitous services
AU - Horng, Mong Fong
AU - Chan, Yen Ching
AU - Kuo, Yau-Hwang
AU - Yang, Chia Ming
AU - Hsu, Jang Pong
PY - 2011/12/1
Y1 - 2011/12/1
N2 - In ubiquitous services, concurrent requests from various services for limited service resources such as network bandwidth, easily lead to a problem of resource insufficiency. The resource scheduling for ubiquitous services is the key to improve the tradeoff between request admittance, resource utilization and service quality. In this paper, a GA-based approach to resource scheduling to enable a flexible quality management of ubiquitous services is proposed to solve the problem mentioned above. First, the relationships between service of quality and resource requirements are explored. There are four different types of relations including (1) linear with saturation (LWS), (2) linear with dead zone and saturation (LWDS), (3) shifted step (SS), and (4) exponential (EX). Based on the derivation of the resource-quality model with the four relations, we define the maximum and minimum of resource requirement and regard the scope as the negotiation criterion for quality guarantee in genetic algorithm. Experimental results show that the proposed approach definitely benefits quality guarantee of service and the increasing of service request admittance ratio.
AB - In ubiquitous services, concurrent requests from various services for limited service resources such as network bandwidth, easily lead to a problem of resource insufficiency. The resource scheduling for ubiquitous services is the key to improve the tradeoff between request admittance, resource utilization and service quality. In this paper, a GA-based approach to resource scheduling to enable a flexible quality management of ubiquitous services is proposed to solve the problem mentioned above. First, the relationships between service of quality and resource requirements are explored. There are four different types of relations including (1) linear with saturation (LWS), (2) linear with dead zone and saturation (LWDS), (3) shifted step (SS), and (4) exponential (EX). Based on the derivation of the resource-quality model with the four relations, we define the maximum and minimum of resource requirement and regard the scope as the negotiation criterion for quality guarantee in genetic algorithm. Experimental results show that the proposed approach definitely benefits quality guarantee of service and the increasing of service request admittance ratio.
UR - http://www.scopus.com/inward/record.url?scp=84862973365&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84862973365&partnerID=8YFLogxK
U2 - 10.1109/CICN.2011.6
DO - 10.1109/CICN.2011.6
M3 - Conference contribution
AN - SCOPUS:84862973365
SN - 9780769545875
T3 - Proceedings - 2011 International Conference on Computational Intelligence and Communication Systems, CICN 2011
SP - 27
EP - 31
BT - Proceedings - 2011 International Conference on Computational Intelligence and Communication Systems, CICN 2011
T2 - 2011 International Conference on Computational Intelligence and Communication Systems, CICN 2011
Y2 - 7 October 2011 through 9 October 2011
ER -