Incorporating service and user information and latent features to predict QoS for selecting and recommending cloud service compositions

The rapid growth of published cloud services in the Internet makes the service selection and recommendation a challenging task for both users and service providers. In cloud environments, software re services collaborate with other complementary services to provide complete solutions to end users. The service selection is performed based on QoS requirements submitted by end users. Software providers alone cannot guarantee users’ QoS requirements. These requirements must be end-to-end, representing all collaborating services in a cloud solution. In this paper, we propose a prediction model to compute end-to-end QoS values for vertically composed services which are composed of three types of cloud services: software (SaaS), infrastructure (IaaS) and data (DaaS) services. These values can be used during the service selection and recommendation process. Our model exploits historical QoS values and cloud service and user information to predict unknown end-to-end QoS values of composite services. The experiments demonstrate that our proposed model outperforms other prediction models in terms of the prediction accuracy. We also study the impact of different parameters on the prediction results. In the experiments, we used real cloud services’ QoS data collected using our developed QoS monitoring and collecting system.     

The effects of the distribution of training on learning feedback-assisted cardiac acceleration

In order to test a hypothesis derived from a motor skills learning model of cardiac acceleration control, groups of subjects were given biofeedback training for four sessions to learn cardiac acceleration under four different training schedules: (1) all sessions in one day, (2) daily sessions, (3) sessions every other day, and (4) weekly sessions. Ability to accelerate heart rate both with and without feedback was determined at each session. Also ability to accelerate heart rate without feedback was determined 1 week after the last training session as a measure of retention. Although there was highly significant (p less than.0001) evidence of heart rate control both with and without feedback, there were no differences in degree of control attributable to distribution of training sessions. There was, however, a trend (p less than .10) for subjects trained under the most distributed training schedule (weekly) to show more retention than subjects trained under a less distributed schedule (daily).     

Adaptive resource utilization and remote access capabilities in high‐performance distributed systems: The Open HPC++ approach

Development of high-performance distributed applications, called metaapplications, is extremely challenging because of their complex runtime environment coupled with their requirements of high-performance and Quality of Service (QoS). Such applications typically run on a set of heterogeneous machines with dynamically varying loads, connected by heterogeneous networks possibly supporting a wide variety of communication protocols. In spite of the size and complexity of such applications, they must provide the high-performance and QoS mandated by their users. In order to achieve the goal of high-performance, they need to adaptively utilize their computational and communication resources. Apart from the requirements of adaptive resource utilization, such applications have a third kind of requirement related to remote access QoS. Different clients, although accessing a single server resource, may have differing QoS requirements from their remote connections. A single server resource may also need to provide different QoS for different clients, depending on various issues such as the amount of trust between the server and a given client. These QoS requirements can be encapsulated under the abstraction of remote access capabilities. Metaapplications need to address all the above three requirements in order to achieve the goal of high-performance and satisfy user expectations of QoS. This paper presents Open HPC++, a programming environment for high-performance applications running in a complex and heterogeneous run-time environment. Open HPC++ provides application level tools and mechanisms to satisfy application requirements of adaptive resource utilization and remote access capabilities. Open HPC++ is designed on the lines of CORBA and uses an Object Request Broker (ORB) to support seamless communication between distributed application components. In order to provide adaptive utilization of communication resources, it uses the principle of open implementation to open up the communication mechanisms of its ORB. By virtue of its open architecture, the ORB supports multiple, possibly custom, communication protocols, along with automatic and user controlled protocol selection at run-time. An extension of the same mechanism is used to support the concept of remote access capabilities. In order to support adaptive utilization of computational resources, Open HPC++ also provides a flexible yet powerful set of load-balancing mechanisms that can be used to implement custom load-balancing strategies. The paper also presents performance evaluations of Open HPC++ adaptivity and load-balancing mechanisms. This revised version was published online in July 2006 with corrections to the Cover Date.     

Resource Management for Ad-Hoc Wireless Networks with Cluster Organization

Boosted by technology advancements, government and commercial interest, ad-hoc wireless networks are emerging as a serious platform for distributed mission-critical applications. Guaranteeing QoS in this environment is a hard problem because several applications may share the same resources in the network, and mobile ad-hoc wireless networks (MANETs) typically exhibit high variability in network topology and communication quality. In this paper we introduce DYNAMIQUE, a resource management infrastructure for MANETs. We present a resource model for multi-application admission control that optimizes the application admission utility, defined as a combination of the QoS satisfaction ratio. A method based on external adaptation (shrinking QoS for existing applications and later QoS expansion) is introduced as a way to reduce computation complexity by reducing the search space. We designed an application admission protocol that uses a greedy heuristic to improve application utility. For this, the admission control considers network topology information from the routing layer. Specifically, the admission protocol takes benefit from a cluster network organization, as defined by ad-hoc routing protocols such as CBRP and LANMAR. Information on cluster membership and cluster head elections allows the admission protocol to minimize control signaling and to improve application quality by localizing task mapping.     

Service platform and monitoring architecture for network function virtualization (NFV)

With the advent of cloud and virtualization technologies and the integration of various computer communication technologies, today’s computing environments can provide virtualized high quality services. The network traffic has also continuously increased with remarkable growth. Software defined networking/network function virtualization (SDN/NFV) enhancing the infrastructure agility, thus network operators and service providers are able to program their own network functions on vendor independent hardware substrate. However, in order for the SDN/NFV to realize a profit, it must provide a new resource sharing and monitoring procedures among the regionally distributed and virtualized computers. In this paper, we proposes a NFV monitoring architecture based practical measuring framework for network performance measurement. We also proposes a end-to-end connectivity support platform across a whole SDN/NFV networks has not been fully addressed.     

Dynamic Quality of Service Model for Improving Performance of Multimedia Real-Time Transmission in Industrial Networks

Nowadays, quality of service (QoS) is very popular in various research areas like distributed systems, multimedia real-time applications and networking. The requirements of these systems are to satisfy reliability, uptime, security constraints and throughput as well as application specific requirements. The real-time multimedia applications are commonly distributed over the network and meet various time constraints across networks without creating any intervention over control flows. In particular, video compressors make variable bit-rate streams that mismatch the constant-bit-rate channels typically provided by classical real-time protocols, severely reducing the efficiency of network utilization. Thus, it is necessary to enlarge the communication bandwidth to transfer the compressed multimedia streams using Flexible Time Triggered- Enhanced Switched Ethernet (FTT-ESE) protocol. FTT-ESE provides automation to calculate the compression level and change the bandwidth of the stream. This paper focuses on low-latency multimedia transmission over Ethernet with dynamic quality-of-service (QoS) management. This proposed framework deals with a dynamic QoS for multimedia transmission over Ethernet with FTT-ESE protocol. This paper also presents distinct QoS metrics based both on the image quality and network features. Some experiments with recorded and live video streams show the advantages of the proposed framework. To validate the solution we have designed and implemented a simulator based on the Matlab/Simulink, which is a tool to evaluate different network architecture using Simulink blocks.     

Supporting high‐performance I/O in QoS‐enabled ORB middleware

To be an effective platform for high‐performance distributed applications, off-the-shelf Object Request Broker (ORB) middleware, such as CORBA, must preserve communication-layer quality of service (QoS) properties both vertically (i.e., network interface ↔ application layer) and horizontally (i.e., end-to-end). However, conventional network interfaces, I/O subsystems, and middleware interoperability protocols are not well-suited for applications that possess stringent throughput, latency, and jitter requirements. It is essential, therefore, to develop vertically and horizontally integrated ORB endsystems that can be (1) configured flexibly to support high-performance network interfaces and I/O subsystems and (2) used transparently by performance-sensitive applications. This paper provides three contributions to research on high-performance I/O support for QoS-enabled ORB middleware. First, we outline the key research challenges faced by high-performance ORB endsystem developers. Second, we describe how our real-time I/O (RIO) subsystem and pluggable protocol framework enables ORB endsystems to preserve high-performance network interface QoS up to applications running on off-the-shelf hardware and software. Third, we illustrate empirically how highly optimized ORB middleware can be integrated with real-time I/O subsystem to reduce latency bounds on communication between high-priority clients without unduly penalizing low-priority and best-effort clients. Our results demonstrate how it is possible to develop ORB endsystems that are both highly flexible and highly efficient. This revised version was published online in July 2006 with corrections to the Cover Date.     

Connection re–routing method for QoS guarantee in the ATM–based wired/wireless integrated network

On the ATM-based wired/wireless integrated network, we propose a connection re-routing method which reduces the inter-cluster handoff delay by reserving VPI/VCIs for possible inter-cluster handoff calls in advance. Additionally, we propose wired resource reservation methods, which are the auxiliary method and the split method, for handoff QoS guarantee of various expected services. The characteristics of these methods reserve wired connection resources based on the information on the possible inter-cluster handoff calls. With mathematical analysis, we also propose an algorithm and cost function for deciding the optimal amount in reserving resources. With numerical examples, we can see that the auxiliary method effectively reduces the cost in all cases (α > β, α ≔ β, and α < β). The split method, however, has good effects on cost reduction, only in case that the capacity of total resource C _T is relatively small and handoff calls have priority over new calls. The numerical results show that these reservation methods can flexibly cope with the time-variant environment and meet the QoS requirements on the inter–cluster handoff calls. This revised version was published online in August 2006 with corrections to the Cover Date.     

A Synchronous Co-Allocation Mechanism for Grid Computing Systems

Grid computing systems are emerging as a computing infrastructure that will enable the use of wide-area network computing systems for a variety of challenging applications. One of these is the ever increasing demand for multimedia from users engaging in a wide range of activities such as scientific research, education, commerce, and entertainment. To provide an adequate level of service to multimedia applications, it is often necessary to simultaneously allocate resources including predetermined capacities from interconnecting networks to the applications. The simultaneous allocation of resources is often referred to as co-allocation in the Grid literature. In this paper, we formally define the co-allocation problem and propose a novel scheme called synchronous queuing (SQ) for implementing co-allocation with quality of service (QoS) assurances in Grids. Unlike existing approaches, SQ does not require advance reservation capabilities at the resources. This enables an SQ-based approach to over subscribe the resources and hence improve resource utilization. The simulation studies performed to evaluate SQ indicate that it outperforms an QoS-based scheme with strict admission control by a significant margin.     

An adaptive dual control framework for QoS design

The widespread deployment of the advanced computer technology in business and industries has demanded the high standard on quality of service (QoS). For example, many Internet applications, i.e. online trading, e-commerce, and real-time databases, etc., execute in an unpredictable general-purpose environment but require performance guarantees. Failure to meet performance specifications may result in losing business or liability violations. As systems become distributed and complex, it has become a challenge for QoS design. The ability of on-line identification and auto-tuning of adaptive control systems has made the adaptive control theoretical design an attractive approach for QoS design. However, there is an inherent constraint in adaptive control systems, i.e. a conflict between asymptotically good control and asymptotically good on-line identification. This paper first identifies and analyzes the limitations of adaptive control for network QoS by extensive simulation studies. Secondly, as an approach to mitigate the limitations, we propose an adaptive dual control framework. By incorporating the existing uncertainty of on-line prediction into the control strategy and accelerating the parameter estimation process, the adaptive dual control framework optimizes the tradeoff between the control goal and the uncertainty, and demonstrates robust and cautious behavior. The experimental study shows that the adaptive dual control framework mitigate the limitations of the conventional adaptive control framework. Compared with the conventional adaptive control framework under the medium uncertainty, the adaptive dual control framework reduces the deviation from the desired hit-rate ratio from 40% to 13%.

A multi-strategy collaborative prediction model for the runtime of online tasks in computing cluster/grid

An efficient function of a complicated or dynamic high performance computing environment requires the scheduler to dispatch the submitted tasks according to the identification of the idling resources. A derivative problem is to provide accurate forecasts of the tasks runtimes. This is usually needed to assist scheduling policies and fine tune scheduling decisions, and also used for future planning of resource allocation when conducting advance reservation. However, the characteristics of the existing prediction strategies determine that the sole strategy is not appropriate for all kinds of heterogeneous tasks. Aiming at this problem, a multi-strategy collaborative prediction model (MSCPM) for the runtime of online tasks is proposed, and a novel concept named Prediction Accuracy Assurance (PAA) as a criterion is introduced to quantitatively evaluate the precision of the prediction runtime provided by a specific prediction strategy.     

GEMS: Gossip-Enabled Monitoring Service for Scalable Heterogeneous Distributed Systems

Gossip protocols have proven to be effective means by which failures can be detected in large, distributed systems in an asynchronous manner without the limitations associated with reliable multicasting for group communications. In this paper, we discuss the development and features of a Gossip-Enabled Monitoring Service (GEMS), a highly responsive and scalable resource monitoring service, to monitor health and performance information in heterogeneous distributed systems. GEMS has many novel and essential features such as detection of network partitions and dynamic insertion of new nodes into the service. Easily extensible, GEMS also incorporates facilities for distributing arbitrary system and application-specific data. We present experiments and analytical projections demonstrating scalability, fast response times and low resource utilization requirements, making GEMS a potent solution for resource monitoring in distributed computing.     

VNF-EQ: dynamic placement of virtual network functions for energy efficiency and QoS guarantee in NFV

With the advances of network function virtualization and cloud computing technologies, a number of network services are implemented across data centers by creating a service chain using different virtual network functions (VNFs) running on virtual machines. Due to the complexity of network infrastructure, creating a service chain requires high operational cost especially in carrier-grade network service providers and supporting stringent QoS requirements from users is also a complicated task. There have been various research efforts to address these problems that only focus on one aspect of optimization goal either from users such as latency minimization and QoS based optimization, or from service providers such as resource optimization and cost minimization. However, meeting the requirements both from users and service providers efficiently is still a challenging issue. This paper proposes a VNF placement algorithm called VNF-EQ that allows users to meet their service latency requirements, while minimizing the energy consumption at the same time. The proposed algorithm is dynamic in a sense that the locations or the service chains of VNFs are reconfigured to minimize the energy consumption when the traffic passing through the chain falls below a pre-defined threshold. We use genetic algorithm to formulate this problem because it is a variation of the multi-constrained path selection problem known as NP-complete. The benchmarking results show that the proposed approach outperforms other heuristic algorithms by as much as 49% and reduces the energy consumptions by rearranging VNFs.     

End-to-end security scheme for Machine Type Communication based on Generic Authentication Architecture

Machine Type Communication (MTC) and its related services have become the new business growth-point of mobile communication. However, application market with the size of about a hundred of million makes end-to-end security facing grand challenges, especially the repeated construction of authentication facilities for different applications. According to features of MTC, an end-to-end security scheme is proposed, which is based on the Generic Authentication Architecture (GAA), and is thus suitable for MTC communication in application layer. User authentication and session key agreement are achieved by the assistance of operator network in this scheme. Hence, the MTC server can only focus on service delivery. Performance of the proposal is also analyzed, and from this procedure, we obtain the function of lifetime of master session key against expected number of bootstrapping request. Finally, it is shown how the operator could set an optimized lifetime of master session key.     

P-Aware: a proportional multi-resource scheduling strategy in cloud data center

Concentrating on a single resource cannot efficiently cope with the overall high utilization of resources in cloud data centers. Nowadays multiple resource scheduling problem is more attractive to researchers. Some studies achieve progresses in multi-resource scenarios. However, these previous heuristics have obvious limitations in complex software defined cloud environment. Focusing on energy conservation and load balancing, we propose a preciousness model for multiple resource scheduling in this paper. We give the formulation of the problem and propose an innovative strategy (P-Aware). In P-Aware, a special algorithm PMDBP (Proportional Multi-dimensional Bin Packing) is applied in the multi-dimensional bin packing approach. In this algorithm, multiple resources are consumed in a proportional way. Structure and details of PMDBP are discussed in this paper. Extensive experiments demonstrate that our strategy outperforms others both in efficiency and load balancing. Now P-Aware has been implemented in the resource management system in our cooperative company to cut energy consumption and reduce resource contention.     

Repeated exercise paired with "imperceptible" dead space loading does not alter VE of subsequent exercise in humans.

We employed an associative learning paradigm to test the hypothesis that exercise hyperpnea in humans arises from learned responses forged by prior experience. Twelve subjects undertook a "conditioning" and a "nonconditioning" session on separate days, with order of performance counterbalanced among subjects. In both sessions, subjects performed repeated bouts of 6 min of treadmill exercise, each separated by 5 min of rest. The only difference between sessions was that all the second-to-penultimate runs of the conditioning session were performed with added dead space in the breathing circuit. Cardiorespiratory responses during the first and last runs (the "control" and "test" runs) were compared for each session. Steady-state exercise end-tidal PCO(2) was significantly lower (P = 0.003) during test than during control runs for both sessions (dropping by 1.8 +/- 2 and 1.4 +/- 3 Torr during conditioning and nonconditioning sessions, respectively). This and all other test-control run differences tended to be greater during the first session performed regardless of session type. Our data provide no support for the hypothesis implicating associative learning processes in the ventilatory response to exercise in humans.     

A Consistent Framework for Assessing the Impacts from Resource Use - A focus on resource functionality (8 pp)

Background The quantification of resource depletion in Life Cycle Assessment has been the topic of much debate; to date no definitive approach for quantifying effects in this impact category has been developed. In this paper we argue that the main reason for this extensive debate is because all methods for quantifying resource depletion impacts have focussed on resource extraction. - Aim and Scope. To further the state of the debate we present a general framework for assessing the impacts of resource use across the entire suite of biotic and abiotic resources. The main aim of this framework is to define the necessary and sufficient set of information required to quantify the effects of resources use. Method logy. Our method is based on a generic concept of the quality state of resource inputs and outputs to and from a production system. Using this approach we show that it is not the extraction of materials which is of concern, but rather the dissipative use and disposal of materials. Using this as a point of departure we develop and define two key variables for use in the modelling of impacts of resource use, namely the ultimate quality limit, which is related to the functionality of the material, and backup technology. Existing methodologies for determining the effects of resource depletion are discussed in the context of this framework. Results We demonstrate the ability of the general framework to describe impacts related to all resource categories: metallic and non-metallic minerals, energy minerals, water, soil, and biotic resources (wild or domesticated plants and animals). Recommendation focus on suggestions for a functionality measure for each of these categories; and how best the two modelling variables derived can be determined.     

Cooperative detection and protection against network attacks using decentralized information sharing

Network attacks, such as distributed denial of service (DDoS) and Internet worms, are highly distributed and well coordinated offensive assaults on services, hosts, and the infrastructure of the Internet, and can have disastrous effects including financial losses and disruption of essential services. Consequently, effective defensive countermeasures against these attacks must provide equally sophisticated and well coordinated mechanisms for monitoring, analysis, and response. In this paper, we investigate techniques for cooperative attack detection and countermeasures using decentralized information sharing. The key underlying idea is the use of epidemic algorithms to share attack information and achieve quasi-global knowledge about attack behaviors. This paper first presents a conceptual model that defines the relationships between the level of knowledge in the distributed system and the accuracy of attack detection. The design of a cooperative attack detection and defense framework is then presented, and its use for detecting and defending against DDoS attacks and Internet worms is described. Simulation results are presented to demonstrate the feasibility and effectiveness of the framework against these attacks.     

The architecture of a middleware layer for controlling the quality of multimedia sessions

Collaborative multimedia systems demand overall session quality control beyond the level of Quality of Service (QoS) as pertaining to individual streams in isolation of others. To this end, we have recently introduced the concept of Quality of Session (QoSess) control. At every instant in time, the quality of the session depends on the actual QoS offered by the system to each of the application streams, as well as on the relative priorities of these streams according to the application semantics. In this paper, we present the architecture of a middleware layer for controlling the quality of a session. In addition, we describe the inter-stream bandwidth adaptation mechanisms, which are used by the QoSess layer to dynamically control the bandwidth shares of the streams belonging to a session. This revised version was published online in July 2006 with corrections to the Cover Date.     

A Novel Utility Function for Energy-Efficient Power Control Game in Cognitive Radio Networks

Spectrum scarcity is a major challenge in wireless communications systems requiring efficient usage and utilization. Cognitive radio network (CRN) is found as a promising technique to solve this problem of spectrum scarcity. It allows licensed and unlicensed users to share the same licensed spectrum band. Interference resulting from cognitive radios (CRs) has undesirable effects on quality of service (QoS) of both licensed and unlicensed systems where it causes degradation in received signal-to-noise ratio (SIR) of users. Power control is one of the most important techniques that can be used to mitigate interference and guarantee QoS in both systems. In this paper, we develop a new approach of a distributed power control for CRN based on utility and pricing. QoS of CR user is presented as a utility function via pricing and a distributed power control as a non-cooperative game in which users maximize their net utility (utility-price). We define the price as a real function of transmit power to increase pricing charge of the farthest CR users. We prove that the power control game proposed in this study has Nash Equilibrium as well as it is unique. The obtained results show that the proposed power control algorithm based on a new utility function has a significant reduction in transmit power consumption and high improvement in speed of convergence.