Quality Of Service Negotiation Research Articles

A novel QoS negotiation model based on intelligent learning technique in clouds

As more and more high-end applications have been deployed on cloud platforms, the quality-of-service (QoS) of cloud platform has become an important issue that need to be addressed. To achieve desirable QoS, an efficient negotiation model plays a critical role because cloud application often requires plenty of resource during their execution. In this paper, we propose a novel QoS negotiation model which applies intelligent learning technique to adjust the negotiation policy, in this way, QoS agreement between application and resource provider can be quickly achieved even when multiple resource requests are involved concurrently. The proposed negotiation model is implemented in an integrated QoS negotiation framework, in which negotiation agents help to make resource reservations while allocations agents are responsible for committing those reservation requests. The proposed framework is tested in a real cloud platform, and the results indicate that it can significantly improve the negotiation efficiency comparing with other negotiation methods. In addition, the experimental results also show that by using the proposed negotiation model, large-scale workflow applications can reduce their makespan by about 7%~11%.

Admission Control Scheme for Reducing Signaling Storm in Wireless Network

Reducing signaling storm in wireless networks has become a major goal in designing today’s wireless communication systems. In order to reduce signaling storm, this paper addresses the issues of scheduling the signaling resources in wireless networks subject to both quality of service (QoS) and priority constraints. The applications in wireless communication systems are divided into three types,namely always-on applications, voice applications and the other applications. For all the applications, an admission control scheme is proposed that incorporates the reconfiguration of idle resources and the QoS negotiation. The QoS negotiation usually contains the following parts, QoS reduction of the new application, QoS reduction of the applications which have accessed to the network and the resources compulsory possession. When the signaling resources are limited, the proposed admission control scheme can improve the successful access rate of voice applications and reduce the impact of signaling storm in wireless network.

Cloud service negotiation: a research report

As the cloud market becomes more open and competitive, Quality of Service (QoS) will be more important. To allow cloud consumers to express their QoS requirements, and negotiate them with cloud providers, we argue for cloud service negotiation. This paper outlines a research roadmap, reviews the state of the art and reports our work on cloud service negotiation. Three research problems that we formulate are QoS measurement, QoS negotiation and QoS assurance. To address QoS measurement, we initiate a quality model for cloud services, called CLOUDQUAL, which specifies six quality dimensions and five quality metrics. To address QoS negotiation, we present a mixed negotiation approach for cloud services, which is based on the ‘game of chicken’ and can balance utility and success rate. To address QoS assurance, we propose a QoS-driven resource allocation method for cloud services, which can meet users’ QoS requirements while minimising resources consumed.

Performance of E2E service negotiation models in the next generation internet

Evolution towards the next-generation Internet assumes dynamic end-to-end (E2E) quality of service negotiation on the path between the two providers, which are interconnected by a number of transit providers. Negotiation is performed by means of an appropriate signaling protocol. Basic models for E2E service negotiation include: (1) the cascade model, which assumes that a single provider controls service negotiation on the path, and (2) the third-party (3P) model, in which the trusted intermediary performs service negotiation on behalf of all domains on the path. This article presents a comparative study of the aforementioned negotiation models, regarding transport of signaling traffic. The three realistic topologies of interconnected networks have been simulated, using the network simulator NS2. Particularly, we point out the applicability and deployment of the 3P model.

QoS Negotiation and Service Differentiation by CAC Scheme for 3G Wireless Cellular Networks

In the 1G and 2G of wireless cellular systems, CAC has been worked only for a single service scenario. In the 3G and beyond wireless cellular systems, multimedia services such as video, data, and audio are to be offered with various QoS profiles. Hence, more sophisticated CAC schemes are needed to develop for dealing with these challenges. CAC is needed for admitting reasonable number of users in the sense that CAC can satisfy various QoS constraints for different services and also maximize the spectrum utilization for systems. CAC schemes play a vital role in the analysis of 3G wireless cellular network systems by controlling the users in a cell and thus limit the system interference. CAC has been extensively studied in wireless cellular networks as an essential tool for congestion control and QoS provisioning. CAC in wireless cellular networks has been achieving a huge pact of awareness during the existing generation due to the rising attractiveness of wireless cellular network and the fundamental role that CAC plays in QoS provisioning. Quality of service (QoS) plays a major role in wireless cellular networks and it is one of the most important issues from both the users and operators point of view. All the parameters related to QoS are not same important for all users and requested applications. The satisfaction level of different users also does not depend on same QoS parameters. Our proposed CAC scheme gives preferential treatment to higher priority calls, such as hand-off calls of all class of service (data, voice and video), by reserving some bandwidth to decrease handoff failure probability. Along with, mechanism of queuing is also used to improve the hand-off success probability. The admission principle depends upon the effective load of the scheme and allocates diverse thresholds for new and hand-off calls. Finally, we consider three types of services: video, voice and data calls. We assure that our scheme reduces the drop hand-off calls by queuing mechanism and increases the system capacity; hence the Grade-of-Service (GoS) and the system performance can significantly improve.

Optimizing QoS for Multimedia Services in Next Generation Network Based on ACO Algorithm

In Next Generation Network (NGN), the backbone of the overall network architecture will be IP network, supporting different access network technologies and types of traffics. NGN will provide advanced services, such as Quality of Service (QoS) guarantees, to users and their applications. Factors affecting the QoS in NGN are speech encoders, delay, jitter, packet loss and echo. The negotiation and dynamic adaptation of QoS is currently considered to be one of the key features of the NGN concept. In this paper, I propose a novel Ant Colony Optimization algorithm to solve model of the optimal QoS for multimedia services in the NGN. Simulation results show that my new approach has achieved near optimal solutions. Comparison of experimental results with a recently researches shows that the proposed algorithm is better performance and it can meets the demand of the optimal QoS for multimedia services in NGN.

An Auction-Based Pareto-Optimal Strategy for Dynamic and Fair Allotment of Resources in Wireless Mobile Networks

Ongoing advances in sophisticated mobile computing technologies and wireless communications have propelled substantial research work toward designing and implementing a new breed of mobile communications systems. One of the fundamental design objectives of such systems is to ensure complete roaming ability for the mobile users. In addition, upon handoff events, the mobile users also require to be able to perform renegotiations pertaining to their required quality-of-service (QoS) requirements with the concerned system. In this paper, we envision a fair and dynamic auction-based QoS negotiation scheme to deal with this issue. The envisioned scheme provides the mobile users with the flexibility to dynamically negotiate or renegotiate their preferred service levels with the corresponding service provider. The proposed technique has three crucial design objectives: First, it ensures a high level of fairness among the competing mobile users (each with a specific budget). Second, it ensures efficient utilization of the available network resources. Finally, its auction-based mechanism aims at maximizing the revenue of the service provider. A mathematical analysis is provided to demonstrate that, when the three design goals are taken into account, the resource allocation function that the proposed scheme provides represents a Pareto-optimal solution. The effectiveness of the proposed scheme is also verified through extensive simulations.

Context-Aware Vertical Handover Management Architecture with QoS Provision in Heterogeneous Wireless Networks

Handover management with Quality of Service (QoS) provision is the major challenge for the seamless mobility across heterogeneous wireless networks. In this paper, we propose the context-aware vertical handoff (VHO) management architecture with QoS provision, based on the extension of IEEE 802.21. In this proposed architecture, context information is collection from all layers of the protocol stack both mobile node side and network side as most as possible. Context-aware Adaptive Analytic Hierarchy Process Method (CAAHP) method is chosen to identify the most suitable network for the optimization of handover decision mechanism. For QoS provision, QoS Management Module is carefully designed to provide the various functionalities, especially, Dynamic QoS negotiation mechanism and Dynamic QoS Mapping mechanism to provide the QoS service continuity and adaptation. Finally, the Mobile-initiated Handover scheme integrating with our proposed architecture is detailedly illustrated through the messages and procedures.

Dynamic guard margin CAC algorithm with ensured QoS and low CDP in heterogeneous wireless networks

This paper proposes a dynamic guard margin algorithm for connection admission control in heterogeneous wireless networks, where UMTS and WLAN systems co-exist in different tiers. The algorithm works based on the idea that a network controller should down-grade the similar or lower Quality of Service (QoS) classes of traffic during the QoS negotiation phase in handovers, instead of rejecting handover connection requests of higher QoS class of traffic. The efficiency of the proposed algorithm is evaluated and compared with the other proposed algorithms using computer simulations. The obtained results demonstrated that the proposed algorithm performs much better than the existing algorithms in terms of resource saving, number of accepted connections, number of rejected connections during handovers, and total resource utilization.

QoS negotiation in service composition

Service composition in Service Oriented Computing concerns not only integration of heterogeneous distributed applications but also dynamic selection of services. Quality of Service (QoS) plays a key role in service composition as services providing the same functionalities can be differentiated according to their QoS guarantees. At subscription time, a service requester and a provider may sign a contract recording the QoS of the supplied service. The cc-pi calculus has been introduced as a constraint-based model of QoS contracts. In this work we propose a variant of the cc-pi calculus in which the alternatives in a choice rather than being selected non-deterministically have a dynamic priority. Basically, a guard c j : π j in a choice is enabled if the constraint c j is entailed by the store of constraints and the prefix π j can be consumed. Moreover, the j-th branch can be selected not only if the corresponding guard c j : π j is enabled but also if c j is weaker than the constraints c i of the other enabled alternatives. We prove that our choice operator is more general than a choice operator with static priority. Finally, we exploit some examples to show that our prioritised calculus allows arbitrarily complex QoS negotiations and that a static form of priority is strictly less expressive than ours.

Enhanced IMS Handoff Mechanism for QoS Support over Heterogeneous Network

IP multimedia subsystem (IMS) is over IP network architecture, but mobile IP cannot directly support session mobility controlled by session initiation protocol-based signaling. The long signaling delay for session reestablishment in application layer always results in session interruptions during the handoff. Therefore, handoff poses a challenge for quality of service (QoS) maintenance in IMS that targets to offer real-time multimedia applications over wireless mobile networks. The existing approaches to solve this problem depend on the advance resource reservation and the optimization of handoff control. Unfortunately, big cost of the advance resource reservation in neighboring domains is a major problem that leads to a serious signaling load and a waste of wireless bandwidth. To solve this issue, we present an enhanced IMS handoff mechanism (EHM) based on user mobility prediction to save network resources by avoiding multiple useless advance reservations. In addition, to support the heterogeneous access networks in IMS domain, EHM evolves a network selective scheme to utilize the network resources more efficiently. The architecture of EHM and the advance QoS negotiation signaling are also presented. We model the cost, the handoff delay and the session blocking probability for EHM and the previous work. Analytical and simulation results show that EHM can enhance the handoff performance, such as reducing resource reservation cost greatly, decreasing session reestablishment delay and making good use of multiple access network resources.

Bandwidth Aggregation-Aware Dynamic QoS Negotiation for Real-Time Video Streaming in Next-Generation Wireless Networks

In next generation wireless networks, Internet service providers (ISPs) are expected to offer services through several wireless technologies (e.g., WLAN, 3G, WiFi, and WiMAX). Thus, mobile computers equipped with multiple interfaces will be able to maintain simultaneous connections with different networks and increase their data communication rates by aggregating the bandwidth available at these networks. To guarantee quality-of-service (QoS) for these applications, this paper proposes a dynamic QoS negotiation scheme that allows users to dynamically negotiate the service levels required for their traffic and to reach them through one or more wireless interfaces. Such bandwidth aggregation (BAG) scheme implies transmission of data belonging to a single application via multiple paths with different characteristics, which may result in an out-of-order delivery of data packets to the receiver and introduce additional delays for packets reordering. The proposed QoS negotiation system aims to ensure the continuity of QoS perceived by mobile users while they are on the move between different access points, and also, a fair use of the network resources. The performance of the proposed dynamic QoS negotiation system is investigated and compared against other schemes. The obtained results demonstrate the outstanding performance of the proposed scheme as it enhances the scalability of the system and minimizes the reordering delay and the associated packet loss rate.

Quality of Service guarantees and fault-tolerant TCP services in mobile wireless optical networks

In this paper we address the problem for communications Quality of Service (QoS) in wireless networks of Mobile Optical Free-space networks. We propose an architecture for end-to-end statistical delay guarantees. A delay model using the concept of virtual traffic accommodates variations in link capacity variations as well as transient outages. The QoS architecture uses an admission control technique that limits link utilisation for real-time traffic flows in order to reduce queuing delay. Admission control uses a 2-phase commit protocol for handling QoS negotiation and adaptation. We also present a mechanism for deploying QoS-enabled dependable TCP services in this network. The primary-backup TCP replication mechanism is supported by the routing infrastructure and improves server deployment transparency compared to previous work. We illustrate application performance improvement with simulation results.

QoS-guaranteed realtime multimedia service provisioning on broadband convergence network (BcN) with IEEE 802.11e wireless LAN and Fast/Gigabit Ethernet

In broadband convergence network (BcN), heterogeneous broadband wired & wireless subnetworks and various terminal equipments will be interconnected. In order to provide end-to-end realtime multimedia services on such heterogeneous networking environment, as a result, two major problems should be resolved: i) Multimedia session establishment & negotiation that adjusts the differences in the capability of multimedia data processing at the end terminal nodes, ii) quality of service (QoS)-guaranteed connection establishment or resource reservation with connection admission control (CAC) in each heterogeneous subnetworks along the path. The session layer signaling (e.g., SIP/SDP) should be extended for QoS negotiation, and must be tightly cooperating with network layer signaling or resource reservation with CAC function. In this paper we propose a session and connection management architecture for the QoS-guaranteed realtime multimedia service provisioning on BcN, with Q-SIP/SDP, resource reservation protocol with traffic engineering extension, and CAC functions. The detailed interaction scenario and related algorithms for QoS-guaranteed realtime multimedia session, resource reservation and connection establishment are explained and analyzed. From the experimental implementation of the proposed scheme on a small scale BcN testbed, we verified that the proposed architecture is applicable for the realtime multimedia service provisioning. We analyze the network performance and QoS parameters in detail.

Streaming-Viability Analysis and Packet Scheduling for Video Over In-Vehicle Wireless Networks

State-of-the-art vehicles are now being equipped with multiple video channels for video-data transmission from multiple surveillance cameras mounted on the automobile, navigation videos reporting the traffic conditions on the planned route, as well as entertainment-multimedia streaming for passengers watching on rear-seat monitors. Wireless LANs provide a low-cost and flexible infrastructure for these emerging in-vehicle multimedia services aimed at the driver's and passengers' safety, convenience, and entertainment. To enable the successful simultaneous deployment of such applications over in-vehicle wireless networks, we propose delay-sensitive streaming and packet-scheduling algorithms that enable simple, flexible, and efficient adaptation of the video bitstreams to the instantaneously changing video source and wireless-channel characteristics while complying with the a priori negotiated quality-of-service (QoS) parameters for that video service. Our focus is on real-time low-cost solutions for multimedia transmission over in-vehicle wireless networks that are derived based on existing protocols defined by QoS-enabled networks, such as the IEEE 802.11e standard. In addition, the aim of this paper is to couple the proposed solutions with a novel multitrack-hinting method that is proposed as an extension of conventional MP4 hint tracks in order to provide real-time adaptation of multimedia streams to multiple quality levels for different in-vehicle applications, depending on their importance and delay constraints. First, the scheduling constraints for these simultaneous wireless video-streaming sessions are analytically expressed as a function of the negotiated QoS parameters. This is imperative because a video stream received from an in-vehicle road-surveillance camera will have a different set of delay and quality constraints in comparison to that of traffic monitoring received from remote video cameras located on the planned route. Hence, transmission parameters, such as peak data rate, maximum burst size, minimum transmission delay, maximum error rate, etc., will differ for the various video streams. For this reason, new low-complexity packet-scheduling algorithms that can fulfill diverse QoS streaming conditions are proposed and analyzed. The proposed algorithms produce viable schedules (i.e., strictly QoS-compliant) that jointly consider the delay constraints and the in-vehicle video-receiver-buffer conditions. Hence, these scheduling schemes can completely avoid the underflow or overflow event of the receiving-device buffer while guaranteeing the agreement between the real-time video traffic and the predetermined traffic specification reached during QoS negotiation for various in-vehicle video channels. When combined with multitrack hinting, an integrated flexible system for adaptive multimedia streaming over QoS-enabled in-vehicle wireless networks can be constructed. We demonstrate the viability of the proposed scheduling mechanisms experimentally by using real video traces under multiple quality levels, as derived by the multitrack-hinting design. In addition, simulations under realistic conditions are also performed to validate the ability of the method to satisfy buffer-occupancy constraints.

IP MULTIMEDIA SUBSYSTEM - Application-Level QoS Negotiation and Signaling for Advanced Multimedia Services in the IMS

The IP multimedia subsystem (IMS) has been recognized as a reference next-generation network architecture for offering multimedia services over an Internet Protocol (IP)-based infrastructure. One of the key benefits of the IMS is efficient and flexible introduction of new services and access to third-party application providers, thanks to standard interfaces and standardized service capabilities. To support novel media-rich applications across a wide range of user devices and access networks, IMS must support negotiable quality of service (QoS) for IP multimedia sessions. In this article, we describe the application-level QoS signaling as specified by the 3GPP and propose some enhancements based on advanced QoS parameter matching and optimization functionality to be included along the signaling path. We outline various signaling flow scenarios and discuss them in the context of a case study involving an IMS-supported 3D virtual environment, featuring a treasure-hunt-like game.

QoS-oriented negotiation in disk subsystems

Quality of service (QoS) has emerged as a new term in relation to adding innovation criteria in large scale applications such as network based services, multimedia applications, storage services, etc. QoS has been proposed in storage management towards effective disk space utilization and request servicing. This paper presents a QoS based storage model for effective client negotiation in terms of performance, cost and reliability. Clients can create their own profile with respect to certain QoS attributes in order to specify their profile and requirements. A QoS negotiation model is proposed based on an available disk simulator which is experimented under artificial request workload towards proposing improved system’s responsiveness, performance and functionality. Certain remarks and conclusions are raised with respect to meeting the clients’s QoS requirements under the negotiated scheduling algorithms, the redundancy scheme and the capacity available to the client’s environment according to the client’s QoS requirements.

End-to-end QoS support for SIP sessions in CDMA2000* networks

With the increasing demand for wireless packet data services, third-generation (3G) wireless carriers today are faced with the challenge of offering multimedia applications with quality of service (QoS) requirements while at the same time effectively utilizing precious wireless bandwidth. According to the IP Multimedia Subsystem (IMS) framework, end-to-end QoS support requires signaling, traffic regulation, and resource allocation capabilities. IMS uses Session Initiation Protocol (SIP) as the application-level signaling protocol to establish sessions. In this paper, we discuss how QoS parameters are negotiated in SIP. We explain how the policy decision point (PDP) determines the allowed QoS parameters based on SIP negotiation and local policy of the network. Further, we discuss how QoS parameters are enforced using the policy enforcement point (PEP) as part of PDSN in CDMA2000. <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">∗</sup> We also report a prototype implementation of the QoS control in IMS, including implementation of SIP related to QoS negotiation including SIP user agents (UAs), SIP proxy, SIP registrar, and an implementation of PEP in Linux <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">∗</sup> to conduct traffic regulation.

Mapping service-level agreements in distributed applications

In previous column, we discussed how to build distributed systems from quality-of-service (QoS)-aware software components. We also described a design by which individual components can engage in QoS negotiation and perform admission control so that new incoming requests don't violate committed QoS requirements. But what happens in a distributed application made up of several QoS-aware components and if the application has a global service-level agreement (SLA) for maximum end-to-end execution time. The problem we discuss in this paper is how to determine which SLAs should be negotiated at the component level so that the global SLA is satisfied at the minimum possible cost.

Proactive QoS negotiation in asynchronous real-time distributed systems

We present a fast, proactive, quality of service (QoS) negotiation algorithm called Best Effort Negotiation (or BEN), for asynchronous real-time distributed systems. BEN considers an application model where trans-node application timeliness and fault-tolerance requirements are expressed using benefit functions, and anticipated workload and system failure rates during future time intervals are expressed using adaptation functions and reliability functions, respectively. Furthermore, BEN considers an adaptation model where subtasks of application tasks are replicated at run-time for tolerating failures as well as for sharing workload increases. Given such models, the objective of the algorithm is to maximize the sum of aggregate real-time and fault-tolerance benefits during the time window of adaptation functions. Since determining the optimal solution is computationally intractable, BEN heuristically computes sub-optimal resource allocations in polynomial-time. To determine how well BEN performs, we describe another algorithm called HLC, that is inspired by the well-known Hill Climbing heuristic. We show that HLC is significantly slower than BEN. However, our experimental studies reveal that the performance of BEN, in general, is as good as that of HLC.