Multiple QoS modeling and algorithm in computational grid

Multiple QoS modeling and algorithm in grid system is considered. Grid QoS requirements can be formulated as a utility function for each task as a weighted sum of its each dimensional QoS utility functions. Multiple QoS constraint resource scheduling optimization in computational grid is distributed to two subproblems： optimization of grid user and grid resource provider. Grid QoS scheduling can be achieved by solving sub problems via an iterative algorithm.

A Fuzzy Directed Graph-Based QoS Model for Service Composition

Web service composition lets developers create applications on top of service-oriented computing and its native description, discovery, and communication capabilities. This paper mainly focuses on the QoS when the concrete composition structure is unknown. A QoS model of service composition is presented based on the fuzzy directed graph theory. According to the model, a recursive algorithm is also described for calculating such kind of QoS. And, the feasibility of this QoS model and the recursive algorithm is verified by a case study. The proposed approach enables customers to get a possible value of the QoS before they achieve the service.

Web services composition based on global semantics and QoS-aware aspect

A global semantics matching and QoS-awareness service selection are proposed when aimed at a web services composition process.Both QoS-aware matching and global semantic matching are considered during the global matching.When there are demands for global semantic matching and QoS of service composition,a concrete service set which meets the demands is selected for the whole service composition process and an optimal solution is also achieved.A QoS model is built and the corresponding evaluation method is given for the matching of the service composition process.Based on them,a genetic algorithm is proposed to achieve the maximal global semantic matching degree and fulfill the QoS requirements for the whole service composition process.Experimental results and analysis show that the algorithm is feasible and effective for semantics and QoS-aware service matching.

Virtualized Wireless SDNs:Modelling Delay Through the Use of Stochastic Network Calculus

Software-defined networks （SDN） have attracted much attention recently because of their flexibility in terms of network management. Increasingly, SDN is being introduced into wireless networks to form wireless SDN. One enabling technology for wireless SDN is network virtualization, which logically divides one wireless network element, such as a base station, into multiple slices, and each slice serving as a standalone virtual BS. In this way, one physical mobile wireless network can be partitioned into multiple virtual networks in a software-defined manner. Wireless virtual networks comprising virtual base stations also need to provide QoS to mobile end-user services in the same context as their physical hosting networks. One key QoS parameter is delay. This paper presents a delay model for software-defined wireless virtual networks. Network calculus is used in the modelling. In particular, stochastic network calculus, which describes more realistic models than deterministic network calculus, is used. The model enables theoretical investigation of wireless SDN, which is largely dominated by either algorithms or prototype implementations.

QoS Routing Algorithm with Multi-Dimensions for Overlay Networks

Overlay networks have emerged as a useful approach to providing a general framework for new applications and services that are to be implemented without significantly changing the IP-layer network infrastructure.Overlay routing has been used as an alternative to the default best effort Internet routing for the absence of end-to-end Quality of Service(QoS). While the former has recently been investigated, the conflict of QoS restraints and resource optimization remains unsolved. Recent studies have shown that overlay paths can give better latency, loss rate and TCP throughput. In this paper, a multi-dimensional QoS objective model based on the analysis of multiple QoS constraints has been presented, and a routing algorithm to optimise the overlay resource of its nodes and links is then proposed.In fact, the algorithm obtained multiple QoS values using probability theory to achieve the routing according to the multi-dimensional QoS objective vector of the QoS objective model. Simulation results reveals that the algorithm works better than other existing algorithms in balancing the network resources, and applications with stringent QoS requirements could be run.

Towards SDN Based Queuing Delay Estimation

As one of Qo S(Quality of Service) metrics, delay is critical important to delay sensitive applications, such as interactive video, network game and online surgery. In this paper, we exploit SDN(Software Defined Networking) advantages to solve delay Qo S problem. Our work mainly focuses on SDN based queuing delay estimation with real traffic and end-to-end delay control. First, we propose a queuing estimation model and extended it for end-to-end delay of the whole path. It is proved to be feasible and accurate with experimental results in SDN environment. Second, in order to demonstrate the use of our proposed model, we also implement an end-to-end delay control application in SDN. It fulfills specific delay Qo S requirements by dynamically switching flows to a suitable queue based on estimation results and delay requirements.