Web services composition with QoS bound based on simulated annealing algorithm

In order to enable quality-aware web services selection in the process of service composition,this paper first describes the non-functional requirements of service consumers and the quality of elementary service or composite service as a quality vector,and then models the QoS（quality of service）-aware composition as a multiple criteria optimization problem in extending directed graph.A novel simulated annealing algorithm for QoS-aware web services composition is presented.A normalizing for composite service QoS values is made,and a secondary iterative optimization is used in the algorithm.Experimental results show that the simulated annealing algorithm can satisfy the multiple criteria and global QoS requirements of service consumers.The algorithm produces near optimum solution with much less computation cost.

QoS-based MAC protocol for cognitive radio networks

In order to improve the throughput performance of the secondary users （SUs） in the cognitive radio （CR） environment, a quality of service （QoS） based media access control （MAC） protocol is proposed. In this protocol, the CR node maps the channel state as a vector, and the transmitter and the receiver obtain the final channel map through an AND operation to prepare for an optional channel set. Data from the upper application layer are classified into two priority levels according to the QoS requirement. The data of each level relate to different contention windows so that the priority of real time data can be guaranteed. A two-dimensional discrete-time Markov chain is utilized to evaluate the system performance, and mathematical expressions of the system throughput are derived. Simulation results show that compared with the IEEE 802. 11 distributed coordination function （DCF）, the proposed MAC protocol can achieve higher throughput.

SI-INSPIRED ENERGY AWARE QoS ROUTING TREE FOR WSN

A heuristic theoretical optimal routing algorithm （TORA） is presented to achieve the data-gathering structure of location-aided quality of service （QoS） in wireless sensor networks （WSNs）. The construction of TORA is based on a kind of swarm intelligence （SI） mechanism, i. e. , ant colony optimization. Firstly, the ener- gy-efficient weight is designed based on flow distribution to divide WSNs into different functional regions, so the routing selection can self-adapt asymmetric power configurations with lower latency. Then, the designs of the novel heuristic factor and the pheromone updating rule can endow ant-like agents with the ability of detecting the local networks energy status and approaching the theoretical optimal tree, thus improving the adaptability and en- ergy-efficiency in route building. Simulation results show that compared with some classic routing algorithms, TORA can further minimize the total communication energy cost and enhance the QoS performance with low-de- lay effect under the data-gathering condition.

Modeling and performance evaluation of QoS-aware job scheduling of computational grids

To achieve high quality of service （QoS） on computational grids, the QoS-aware job scheduling is investigated for a hierarchical decentralized grid architecture that consists of multilevel schedulers. An integrated QoS-aware job dispatching policy is proposed, which correlates priorities of incoming jobs used for job selecting at the local scheduler of the grid node with the job dispatching policies at the global scheduler for computational grids. The stochastic high-level Petri net （SHLPN） model of a two-level hierarchy computational grid architecture is presented, and a model refinement is made to reduce the complexity of the model solution. A performance analysis technique based on the SHLPN is proposed to investigate the QoS-aware job scheduling policy. Numerical results show that the QoS-aware job dispatching policy outperforms the QoS-unaware job dispatching policy in balancing the high-priority jobs, and thus enables priority-based QoS.

Interactive Web service choice-making based on extended QoS model

Quality of Service (QoS) is a key factor in Web service advertising, choosing and runtime monitoring. Web service QoS is multi-faceted, fuzzy and dynamic. Current researches focus on implementation level performance assurance, ignoring domain specific or application level metrics which are also very important to service users. Industry Web service standards lack QoS expression. The support for QoS based service choice-making is very limited. We proposed an extended Web service QoS model based on configurable fuzzy synthetic evaluation system. Web service QoS is evaluated dynamically according to the service context. A QoS requirement description model is also given for service QoS requirement definition. An interactive Web service choice-making process is described, which takes QoS as a key factor when choosing from functionally equivalent services.

Autonomic QoS Management Mechanism in Software Defined Network

With the increase of network complexity,the flexibility of network control and management becomes a nontrivial problem.Both Software Defined Network(SDN) and Autonomic Network technologies are sophisticated technologies for the network control and management.These two technologies could be combined together to construct a software defined self-managing solution for the future network.An autonomic QoS management mechanism in Software Defined Network(AQSDN) is proposed in this paper.In AQSDN,the various QoS features can be configured autonomically in an OpenFlow switch through extending the OpenFlow and OF-Config protocols.Based on AQSDN,a novel packet context-aware QoS model(PCaQoS) is also introduced for improving the network QoS.PCaQoS takes packet context into account when packet is marked and managed into forwarding queues.The implementation of a video application's prototype which evaluates the self-configuration feature of the AQSDN and the enhancement ability of the PCaQoS is presented in order to validate this design.

A QoS-aware vertical handoff algorithm based on predictive network information

In converged heterogeneous wireless networks, vertical handoff is an important issue in radio resource management and occurs when an end user switches from one network to another （e.g., from wireless local area network to wideband code division multiple access）. Efficient vertical handoff should allocate network resources efficiently and maintain good quality of service （QoS） for the end users. The objective of this work is to determine conditions under which vertical handoff can be performed. The channel usage situation of each access network is formulated as a birth-death process with the objective of predicting the avaliable bandwidth and the blocking probability. A reward function is used to capture the network bandwidth and the blocking probability is expressed as a cost function. An end user will access the certain network which maximizes the total function defined as the combination of the reward fimction and the cost function. Simulation results show that the proposed algorithm can significantly improve the network performance, including higher bandwidth for end users and lower new call blocking and handoff call blocking probability for networks.

A QoS-Aware Packet Scheduling Mechanism in Cognitive Radio Networks for Smart Grid Applications

Cognitive radio sensor network is applied to facilitate network monitoring and management, and achieves high spectrum efficiencies in smart grid. However, the conventional traffic scheduling mechanisms are hard to provide guaranteed quality of service for the secondary users. It is because that they ignore the influence of diverse transition requirements in heterogeneous traffi c. Therefore, a novel Qo S-aware packet scheduling mechanism is proposed to improve transmission quality for secondary users. In this mechanism, a Qo S-based prioritization model is established to address data classification firstly. And then, channel quality and the effect of channel switch are integrated into priority-based packet scheduling mechanism. At last, the simulation is implemented with MATLAB and OPNET. The results show that the proposed scheduling mechanism improves the transmission quality of high-priority secondary users and increase the whole system utilization by 10%.

Study on QOS Routing in Network Centric Warfare

The concept of network centric warfare （NCW） and the distributed equal-node network architecture in NCW are introduced in this paper. The data flow requirement model in NCW is presented. Based on synthetic analysis of network resource, the QOS （Quality of Service） parameters and their characters, the high requirement of real-time synchronization in NCW, the single QOS routing constraint, and the network latency between the detector and weapon control station, are presented. To take an example for 3-node brigade （regiment） level NCW demonstration platform, the algorithm of end-to-end network latency and path information in NCW are presented. The algorithm program based on Server/Client architecture is developed. The optimal path is the link whose latency between the detector and weapon control station is the smallest. This paper solves the key issue and satisfies the needs on network latency in NCW. The study results can be widely applied in the decision of the optimal path which is based on multiple service provision points.

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.

QOS-BASED MULTICAST ROUTING OPTIMIZATION ALGORITHMS FOR INTERNET

Most of the multimedia applications require strict Quality-of-Service (QoS) guarantee during the communication between a single source and multiple destinations. The paper mainly presents a QoS Multicast Routing algorithms based on Genetic Algorithm (QMRGA). Simulation results demonstrate that the algorithm is capable of discovering a set of QoS-based near optimized, non-dominated multicast routes within a few iterations, even for the networks environment with uncertain parameters.

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.

SIMULATED ANNEALING BASED POLYNOMIAL TIME QOS ROUTING ALGORITHM FOR MANETS

Multi-constrained Quality-of-Service (QoS) routing is a big challenge for Mobile Ad hoc Networks (MANETs) where the topology may change constantly. In this paper a novel QoS Routing Algorithm based on Simulated Annealing (SA_RA) is proposed. This algorithm first uses an energy function to translate multiple QoS weights into a single mixed metric and then seeks to find a feasible path by simulated annealing. The pa- per outlines simulated annealing algorithm and analyzes the problems met when we apply it to Qos Routing (QoSR) in MANETs. Theoretical analysis and experiment results demonstrate that the proposed method is an effective approximation algorithms showing better performance than the other pertinent algorithm in seeking the (approximate) optimal configuration within a period of polynomial time.

A NEW SCHEDULING ALGORITHM TO PROVIDE PROPORTIONAL QOS IN OPTICAL BURST SWITCHING NETWORKS

A new scheduling algorithm, which aims to provide proportional and controllable QoS (Quality of Service) in terms of burst loss probability for OBS (Optical Burst Switching) networks, is proposed on the ba- sis of a survey of QoS schemes in current OBS networks. With simulations, performance analysis and com- parisons are carried out in detail. The results show that, in the proposed scheme, burst loss probabilities are proportional to the given factors and the control of QoS performance can be achieved with better performance. This scheme will be beneficial to the OBS network management and the tariff policy making.

A novel QoS supported cooperative diversity algorithm for IEEE 802.11 WLAN

A new cooperative diversity algorithm with quality of service （QoS） awareness for wireless local area network （WLAN） is proposed. According to this protocol, cooperation is invoked only if a direct transmission cannot meet user-specific QoS requirements. If cooperation is implemented, partner choice depends on who can achieve the minimum data rate required to have a successful transmission. The closed-form expressions for the system throughput and the power consumption are provided. Theoretical analysis and simulation results indicate that the QoS-aware cooperative scheme can significantly improve the system performance in terms of throughput and energy efficiency by avoiding negative effect of unconditional cooperation.

Context-aware end-to-end QoS diagnosis and guarantee based on Bayesian network

A systematic approach for end-to-end QoS qualitative diagnosis and quantitative guarantee is proposed to support quality of service （QoS） management on current Internet. An automatic unwatched discretization algorithm for discretizing continuous numeric-values is brought forth to reshape these QoS metrics and contexts into their discrete forms. For QoS qualitative diagnosis, causal relationships between a QoS metric and its contexts are exploited with K2 Bayesian network （BN） structure learning by treating QoS metrics and contexts as BN nodes. A QoS metric node is qualitatively diagnosed to be causally related to its parent context nodes. To guarantee QoS quantitatively, those causal relationships are next modeled quantitatively by BN parameter learning. Then, BN inference can be carried out on the BN. Finally, the QoS metric is guaranteed to a specific value with certain probability by tuning its causal contexts to suitable values suggested by the BN inference. Our approach is validated to be sound and effective by simulations on a peer-to-peer （P2P） network.

NEW ARCHITECTURE OF IP QOS MANAGEMENT SYSTEM

Based on the analysis of current Quality of Service (QoS) management on IP network, new genera-tion of QoS architecture QoSAF is proposed. QoSAF is divided into three layers: resource control layer, net-work service layer and business layer. QoS management is accomplished by interactivity of layers. In this ar-chitecture, mechanism of feedback control enhances the functions of resource management and system moni-toring. The principle of design and logical architecture of system is discussed in detail.

A QoS Mobicast-based dynamic clustering secure multicast scheme for large-scale tracking sensornets

Most of the existing security Mobicast routing protocols are not suitable for the monitoring applications with higher quality of service （QoS） requirement. A QoS dynamic clustering secure multicast scheme （QoS-DCSMS） based on Mobicast and multi-level IxTESLA protocol for large-scale tracking sensornets is presented in this paper. The multicast clusters are dynamically formed according to the real-time status of nodes, and the cluster-head node is responsible for status review and certificating management of cluster nodes to ensure the most optimized QoS and security of multicast in this scheme. Another contribution of this paper is the optimal QoS security authentication algorithm, which analyzes the relationship between the QoS and the level Mofmulti-level oTESLA. Based on the analysis and simulation results, it shows that the influence to the network survival cycle （＇NSC） and real-time communication caused by energy consumption and latency in authentication is acceptable when the optimal QoS security authentication algorithm is satisfied.

QoS Negotiation and Renegotiation Based on Mobile Agents

The Quality of Service （QoS） has received more and more attention since QoS becomes increasingly important in the Internet development. Mobile software agents represent a valid alternative to the implementation of strategies for the negotiation. In this paper, a QoS negotiation and renegotiation system architecture based on mobile agents is proposed. The agents perform the task in the whole process. Therefore, such a system can reduce the network load, overcome latency, and avoid frequent exchange information between clients and server. The simulation results show that the proposed system could improve the network resource utility about 10%.

An approach for QoS measurement and web service selection sureness

Web services have gained popularity m recent years anu prowue a new moue, u~ w^u, w,,,~,, ,^- cilitates interaction of scientific and business applications through the Internet. More often, several services with similar functionality are available from a large and changing number of service provid- ers. Quality of Service （QoS） is the dominant factor in service selection and is of great importance to users. In this paper, we propose a model for QoS measurement and web services selection. The model consists of QoS model, QoS monitoring, QoS comparison and service selection with a QoS feedback mechanism. The most suitable service is to take into account the agreed QoS, monitoring is done during invocation phase and if any deviation is recorded, next suitable service is selected. Fi- nally the model is proved to be feasible and effective by simulation experiments.