Toward Cloud Computing QoS Architecture:Analysis of Cloud Systems and Cloud Services

Cloud can be defined as a new computing paradigm that provides scalable, on-demand, and virtualized resources for users. In this style of computing, users can access a shared pool of computing resources which are provisioned with minimal management efforts of users. Yet there are some obstacles and concerns about the use of clouds. Guaranteeing quality of service(Qo S) by service providers can be regarded as one of the main concerns for companies tending to use it. Service provisioning in clouds is based on service level agreements representing a contract negotiated between users and providers. According to this contract, if a provider cannot satisfy its agreed application requirements, it should pay penalties as compensation. In this paper, we intend to carry out a comprehensive survey on the models proposed in literature with respect to the implementation principles to address the QoS guarantee issue.

Service allocation based on QoS evaluation in military organization cloud cooperation

The problem of cloud cooperation of military service providers（MSPs） is addressed for allocating limited resources to military service users（MSUs） that are geographically distributed. The MSPs, also called military organization clouds, are virtualized and encapsulated by the services they can offer and each of them contains different kinds of resources that MSU needs. The MSPs are also geographically dispersed. They are required to allocate their resources to the MSU complying with the corresponding quality of service（QoS）, so that each MSU gathers the services it needs to guarantee its task to be implemented. The outline of military organization cloud cooperation is discussed and the method of service optimal selection is proposed based on QoS evaluation. The QoS evaluation method based on exponential approximation is put forward to include the users＇ will. Simulation results verify the effectiveness of the proposed algorithm.

Constraint-based QoS-aware Web Service Composition in Cross-organizational Collaboration

To improve the Quality of Service (QoS)-aware Web service compositions considering constraints between cross-organizational business,this paper analyzes the types of constraints,and accordingly proposes a Chaos Genetic Algorithm (CGA). The algorithm creates an initial population of service compositions based on the chaos theory,and then processes individuals which violate constraints in the initial population using repair strategies. Next,a new fitness function is designed to gradually eliminate the infeasible compositions generated in evolution. Finally,the algorithm makes minor chaotic disturbances on the evolved group to accelerate convergence and avoid local optimum. Experimental results demonstrate the effectiveness of the proposed algorithm.

Hybrid Metaheuristics Web Service Composition Model for QoS Aware Services

Recent advancements in cloud computing(CC)technologies signified that several distinct web services are presently developed and exist at the cloud data centre.Currently,web service composition gains maximum attention among researchers due to its significance in real-time applications.Quality of Service(QoS)aware service composition concerned regarding the election of candidate services with the maximization of the whole QoS.But these models have failed to handle the uncertainties of QoS.The resulting QoS of composite service identified by the clients become unstable and subject to risks of failing composition by end-users.On the other hand,trip planning is an essential technique in supporting digital map services.It aims to determine a set of location based services(LBS)which cover all client intended activities quantified in the query.But the available web service composition solutions do not consider the complicated spatio-temporal features.For resolving this issue,this study develops a new hybridization of the firefly optimization algorithm with fuzzy logic based web service composition model(F3L-WSCM)in a cloud environment for location awareness.The presented F3L-WSCM model involves a discovery module which enables the client to provide a query related to trip planning such as flight booking,hotels,car rentals,etc.At the next stage,the firefly algorithm is applied to generate composition plans to minimize the number of composition plans.Followed by,the fuzzy subtractive clustering(FSC)will select the best composition plan from the available composite plans.Besides,the presented F3L-WSCM model involves four input QoS parameters namely service cost,service availability,service response time,and user rating.An extensive experimental analysis takes place on CloudSim tool and exhibit the superior performance of the presented F3L-WSCM model in terms of accuracy,execution time,and efficiency.

User-preferences based service selection model in large-scale services with various QoS properties

With the rapid growth of service scale, there are many services with the same functional properties but different non-flmctional properties on the Internet. There have been some global optimizing service selection algorithms for service selection. However, most of those approaches cannot fully reflect users＇ preferences or are not fully suitable for large-scale services selection. In this paper, an ant colony optimization （ACO） algorithm for the model of global optimizing service selection with various quality of srevice （QoS） properties is employed, and a user-preference based large-scale service selection algorithm is proposed. This algorithm aims at optimizing user-preferred QoS properties and selecting services that meet all user-defined QoS thresholds. Experiment results prove that this algorithm is very efficient in this regard.

BFS-SVM Classifier for QoS and Resource Allocation in Cloud Environment

In cloud computing Resource allocation is a very complex task.Handling the customer demand makes the challenges of on-demand resource allocation.Many challenges are faced by conventional methods for resource allocation in order tomeet the Quality of Service(QoS)requirements of users.For solving the about said problems a new method was implemented with the utility of machine learning framework of resource allocation by utilizing the cloud computing technique was taken in to an account in this research work.The accuracy in the machine learning algorithm can be improved by introducing Bat Algorithm with feature selection(BFS)in the proposed work,this further reduces the inappropriate features from the data.The similarities that were hidden can be demoralized by the Support Vector Machine(SVM)classifier which is also determine the subspace vector and then a new feature vector can be predicted by using SVM.For an unexpected circumstance SVM model can make a resource allocation decision.The efficiency of proposed SVM classifier of resource allocation can be highlighted by using a singlecell multiuser massive Multiple-Input Multiple Output(MIMO)system,with beam allocation problem as an example.The proposed resource allocation based on SVM performs efficiently than the existing conventional methods;this has been proven by analysing its results.

SOA的QoS研究综述

SOA是一种构建软件系统的设计方式,指导着软件设计的整个生命周期。随着SOA的广泛部署,用户在其服务功能需求得到满足的同时,也越来越关注非功能性需求,如服务质量属性。SOA的基本特征是服务。当前的SOA以Web Services技术实现,Web Services的QoS体现了SOA的QoS,也成为判定服务提供者能否成功的一个重要因素。为了提供有质量保证的Web Services,在服务发现、服务选择、服务组合时都需要考虑QoS的作用。对SOA的QoS属性进行了归纳,分析了关于SOA的QoS的研究主题,最后总结出上述主题需要继续研究的原因。

New Antenna Array Beamforming Techniques Based on Hybrid Convolution/Genetic Algorithm for 5G and Beyond Communications

Side lobe level reduction(SLL)of antenna arrays significantly enhances the signal-to-interference ratio and improves the quality of service(QOS)in recent and future wireless communication systems starting from 5G up to 7G.Furthermore,it improves the array gain and directivity,increasing the detection range and angular resolution of radar systems.This study proposes two highly efficient SLL reduction techniques.These techniques are based on the hybridization between either the single convolution or the double convolution algorithms and the genetic algorithm(GA)to develop the Conv/GA andDConv/GA,respectively.The convolution process determines the element’s excitations while the GA optimizes the element spacing.For M elements linear antenna array(LAA),the convolution of the excitation coefficients vector by itself provides a new vector of excitations of length N=(2M−1).This new vector is divided into three different sets of excitations including the odd excitations,even excitations,and middle excitations of lengths M,M−1,andM,respectively.When the same element spacing as the original LAA is used,it is noticed that the odd and even excitations provide a much lower SLL than that of the LAA but with amuch wider half-power beamwidth(HPBW).While the middle excitations give the same HPBWas the original LAA with a relatively higher SLL.Tomitigate the increased HPBWof the odd and even excitations,the element spacing is optimized using the GA.Thereby,the synthesized arrays have the same HPBW as the original LAA with a two-fold reduction in the SLL.Furthermore,for extreme SLL reduction,the DConv/GA is introduced.In this technique,the same procedure of the aforementioned Conv/GA technique is performed on the resultant even and odd excitation vectors.It provides a relatively wider HPBWthan the original LAA with about quad-fold reduction in the SLL.

基于改进蚁群算法的无线Mesh网QoS路由算法研究

目前,无线Mesh网络正成为无线网络研究中的一个热点。Quality of service(QoS)是无线Mesh网络中的一个非常重要问题,而QoS路由技术是解决这一问题的关键技术之一。本文就蚁群算法进行研究和改进,并将改进后的算法应用于无线Mesh网络QoS路由问题,进而提出了无线Mesh网络QoS路由算法,通过实验证明该算法能够对QoS提供较好的支持。

Trustworthy Assurance of Service Interoperation in Cloud Environment

Cloud computing can be realized by service interoperation and its essence is to provide cloud services through network. The development of effective methods to assure the trustworthiness of service interoperation in cloud environment is a very important problem. The essence of cloud security is trust and trust management. Combining quality of service （QoS） with trust model, this paper constructs a QoS-aware and quantitative trust-model that consists of initial trust value, direct trust value, and recommendatory trust value of service, making the provision, discovery, and aggregation of cloud services trustworthy. Hence, it can assure trustworthiness of service interoperation between users and services or among services in cloud environment. At the same time, based on this model, service discovery method based on QoS-aware and quantitative trust-model （TQoS-WSD） is proposed, which makes a solid trust relationship among service requestor, service provider and service recommender, and users can find trustworthy service whose total evaluation value is higher. Corapared to QoS-based service discovery （QoS-WSD） method, it is proved by the experiment for TQoS-WSD method that more accurate result of service discovery will be achieved by service requestor, while reasonable time cost is increased. Meanwhile, TQoS-WSD method strongly resists the effect of service discovery by untrustworthy QoS values and improves service invocation success-rate and thus assures trustworthiness of services interoperation.

WEB SERVICE SELECTION ALGORITHM BASED ON PRINCIPAL COMPONENT ANALYSIS

Existing Web service selection approaches usually assume that preferences of users have been provided in a quantitative form by users. However, due to the subjectivity and vagueness of preferences, it may be impractical for users to specify quantitative and exact preferences. Moreover, due to that Quality of Service (QoS) attributes are often interrelated, existing Web service selection approaches which employ weighted summation of QoS attribute values to compute the overall QoS of Web services may produce inaccurate results, since they do not take correlations among QoS attributes into account. To resolve these problems, a Web service selection framework considering user's preference priority is proposed, which incorporates a searching mechanism with QoS range setting to identify services satisfying the user's QoS constraints. With the identified service candidates, based on the idea of Principal Component Analysis (PCA), an algorithm of Web service selection named PCA-WSS (Web Service Selection based on PCA) is proposed, which can eliminate the correlations among QoS attributes and compute the overall QoS of Web services accurately. After computing the overall QoS for each service, the algorithm ranks the Web service candidates based on their overall QoS and recommends services with top QoS values to users. Finally, the effectiveness and feasibility of our approach are validated by experiments, i.e. the selected Web service by our approach is given high average evaluation than other ones by users and the time cost of PCA-WSS algorithm is not affected acutely by the number of service candidates.

Web Service Description and Discovery Based on Semantic Model

A novel semantic model of Web service descrip tion and discovery was proposed through an extension for profile model of Web ontology language for services （OWL-S） in this paper. Similarity matching of Web services was implemented through computing weighted summation of semantic similarity value based on specific domain ontology and dynamical satisfy extent evaluation for quality of service （QoS）. Experiments show that the provided semantic matching model is efficient.

Priority access for QoS support in distributed wireless networks

Guaranteed quality of service(QoS) support has been an open issue of distributed wireless networks for years. The IEEE802.11 e provides a valuable method for this purpose. However, it could only provide service differentiation, rather than service guarantee, for multi-priority traffic. Many studies have tried to improve its QoS ability, but still leave some problems. This paper investigates these problems and proposes a scheme called the priority access based on busy tone(PABT) to improve the Qo S performance. To guarantee the priority channel access, this scheme uses an in-band busy tone to limit the transmission of lower-priority traffic when higher-priority traffic has packets to send. Based on that, it also optimizes the contention window tuning according to the flows number of each traffic type individually, in order to improve the throughput as well as the traffic capacity. Simulation results show that the proposed scheme significantly improves the real-time traffic capacity, throughput, delay, fairness and packet loss rate.

Application-aware routing with QoS support in SDN networks

Software defined networking( SDN) offers programmable interface to effectively control their networks by decoupling control and data plane. The network operators utilize a centralized controller to deploy advanced network management strategies. An architecture for application-aware routing which can support dynamic quality of service( Qo S) in SDN networks is proposed. The applicationaware routing as a multi-constrained optimal path( MCOP) problem is proposed,where applications are treated as Qo S flow and best-effort flows. With the SDN controller applications,it is able to dynamically lead routing decisions based on application characteristics and requirements,leading to a better overall user experience and higher utilization of network resources. The simulation results show that the improvement of application-aware routing framework on discovering appropriate routes,which can provide Qo S guarantees for a specific application in SDN networks.

A Duplex Feedback Based Web Service Recommendation Method

In the most current Web Services recommendation methods,rating data from service users is rare and the accuracy of the recommendation results cannot be effectively guaranteed.To address this problem,this paper firstly presents a new web service recommendation framework.Based on the proposed framework,a duplex feedback based web service recommendation method( DFBWSRM) is then elaborated,which includes both implicit and explicit feedback data for the calculation of similarities of user preferences during the finding,binding and rating of services.A coordinated recommendation algorithm is also listed in detail.The simulation results demonstrate that the proposed method can satisfyingly increase the accuracy of recommendation results and better meet the requirements of service users.

STUDY ON STATISTICALLY-FAIR SERVICE IN STATISTICALLY-MULTIPLEXED NETWORKS

A new type of fair service, referred to as Statistically-Fair Service (SFS), is proposed in this paper. The SFS discipline is given based on the SFS criterion. Compared to "strict" fair service available, SFS is mainly characterized by its flexible suitability for the nature of statistically-multiplexed networks. By its statistically-fair service to users, therefore, SFS can ensure well end-to-end QoS requirements on a statistical basis with a benefit of enhancement in network utilization. Two useful properties of SFS is presented. One of them, the property of retaining Exponentially Bounded Burstiness(EBB), can facilitate end-to-end delay estimation of EBB-type traffic. Finally, some numerical results obtained from a simulation study on SFS shows that an SFS-equipped node in steady states will in deed retain the EBB attribute of any input flow.

A Multiobjective Optimization Algorithm for QoS-Aware Path Selection in DiffServ and MPLS Networks

A multiobjective quality of service (QoS) routing algorithm was proposed and used as the QoS-aware path selection approach in differentiated services and multi-protocol label switching (DiffServ-MPLS) networks. It simultaneously optimizes multiple QoS objectives by a genetic algorithm in conjunction with concept of Pareto dominance. The simulation demonstrates that the proposed algorithm is capable of discovering a set of QoS-based near optimal paths within in a few iterations. In addition, the simulation results also show the scalability of the algorithm with increasing number of network nodes.

A synthesizing control model of networked control systems to guarantee QoP and QoS

The whole performance of the networked control system （NCSs） depends on two interaction factors, namely the quality of control performance （QoP） and quality of network service （QoS）. So, to optimize the whole perfor-mance of NCSs, the problem of guaranteeing QoP and QoS plays an important role in the design of NCSs. However, up to now, little work has been done in this field. In this paper, a synthesizing control model of NCSs to guarantee QoP and QoS is proposed, and a feasible condition of optimizing whole performance of NCSs is also suggested. Finally, the simulation results show that the proposed model is effective.

Delivery Digital Television Services over Ethernet

A new architecture for digital television (DTV) delivery based on Ethernet was presented. In this architecture, new protocol stack and packet encapsulation were proposed to help implementation of DTV services over Ethernet link. A simple quality of service (QoS) structure was provided in traffic control of nodes to achieve QoS requirements of DTV delivery. Experiments were proceeded successfully to implement the idea. Finally, a short evaluation to QoS provisions was given, achieving good results.

An efficient QoS enhancement mechanism of VoIP using erasure array codes

In order to solve the problem of losing voice packets in voice over internet protocol(VoIP),a kind of lost packets double recovery algorithm is proposed. The algorithm is based on erasure coding technique which comes from highly available data storage systems. An efficient coding scheme with higher tolerance based on STAR and Reed-Solomon( RS) erasure code is described. An efficient method is also provided which could transform the voice data packets of one dimensional bit stream into two dimensional array according to given window size. If the lost rate has increased beyond the error correction capability,packet-loss concealment will be adopted. Under various conditions of packet-loss simulation during the experiments,the algorithm has proved its better performance on MOS rating and coding rate.