A GA-Based Approach to Resource Scheduling Supporting Flexible Quality Management of Ubiquitous Services

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.

[1]  Mark Weiser,et al.  The Computer for the 21st Century: Specialized elements of hardware and software, connected by wires, radio waves and infrared, will be so ubiquitous that no one will notice their presence , 1995 .

[2]  Neil Genzlinger.  A. and Q , 2006 .

[3]  Oscar H. Ibarra,et al.  Heuristic Algorithms for Scheduling Independent Tasks on Nonidentical Processors , 1977, JACM.

[4]  Jeng-Shyang Pan,et al.  An Extensible Particles Swarm Optimization for Energy-Effective Cluster Management of Underwater Sensor Networks , 2010, ICCCI.

[5]  R. F. Freund,et al.  Scheduling resources in multi-user, heterogeneous, computing environments with SmartNet , 1998, Proceedings Seventh Heterogeneous Computing Workshop (HCW'98).

[6]  Jean-Yves Chouinard,et al.  Optimal Image Watermarking Algorithm Based on LWT-SVD via Multi-objective Ant Colony Optimization , 2011, J. Inf. Hiding Multim. Signal Process..

[7]  Mark Weiser.  The computer for the 21st century , 1991 .

[8]  Qingsheng Zhu,et al.  An Optimized Strategy of Service Negotiation , 2006, 2006 Second IEEE International Symposium on Service-Oriented System Engineering (SOSE'06).

[9]  Y. Mukaigawa,et al.  Large Deviations Estimates for Some Non-local Equations I. Fast Decaying Kernels and Explicit Bounds , 2022 .

[10]  Ajith Abraham,et al.  Human Perception-Based Color Image Segmentation Using Comprehensive Learning Particle Swarm Optimization , 2009, 2009 Second International Conference on Emerging Trends in Engineering & Technology.

[11]  Munindar P. Singh.  Trustworthy Service Composition: Challenges and Research Questions , 2002, Trust, Reputation, and Security.

[12]  John Levine,et al.  A fast, effective local search for scheduling independent jobs in heterogeneous computing environments , 2003 .

[13]  Yau-Hwang Kuo,et al.  An effective approach to adaptive bandwidth allocation with QoS enhanced on IP networks , 2009, ICUIMC '09.

[14]  Ladislau Bölöni,et al.  A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing Systems , 2001, J. Parallel Distributed Comput..

[15]  R. F. Freund,et al.  Guest Editor's Introduction: Heterogeneous Processing , 1993 .

[16]  Soumya Banerjee,et al.  Digital Watermarking using Ant Colony Optimization in Fractional Fourier Domain , 2010, J. Inf. Hiding Multim. Signal Process..

[17]  Debra A. Hensgen,et al.  The relative performance of various mapping algorithms is independent of sizable variances in run-time predictions , 1998, Proceedings Seventh Heterogeneous Computing Workshop (HCW'98).

[18]  Hans Albrecht Schmid,et al.  Service Congestion: The Problem, and an Optimized Service Composition Architecture as a Solution , 2006, 2006 IEEE International Conference on Web Services (ICWS'06).