Microservice Workflow Scheduling with a Resource Configuration Model Under Deadline and Reliability Constraints.

The Grid can be seen as a collection of services each of which performs some functionality. Grid users often submit their applications in the form of workflows with certain Quality of Service (QoS) requirements imposed on the workflows. These workflows detail the composition of Grid services and the level of service required from the Grid. This paper addresses workload allocation techniques for Grid workflows. We model a Grid service as a G/G/1 queue and minimise failures (QoS requirement violation) of jobs by solving a mixed-integer non-linear program (MINLP). The novel approach is evaluated through an experimental simulation and the results confirm that the proposed workload allocation strategy performs considerably better in terms of satisfying QoS requirements of Grid workflows than scheduling algorithms that don?t employ such workload allocation techniques.

Wireless mobile radio systems have to serve users with different quality of service (QoS) requirements. Scheduling algorithms like weighted proportional fair (WPF) have been proposed considering channel gains to improve the system capacity in terms of sector throughput as well as user priorities to fulfill QoS requirements. These scheduling algorithms allow assigning different priority factors to users and services so that different QoS requirements can be fulfilled. This paper provides an analysis of the influence of users with different priorities on the sector and user throughput. It is shown analytically and by system level simulations that the average user throughput can be adjusted by choosing a specific priority factor. Furthermore, it is shown that the sector throughput decreases if WPF scheduling for users with different priorities and full buffer model are considered compared to a scenario with users having equal priority. If QoS requirements for realistic traffic models, e.g. FTP, have to be fulfilled, for each high priority user low priority users have to be removed from the system in order not to exceed an acceptable number of unsatisfied users. It is shown that the decrease in sector throughput with a realistic traffic model and QoS requirements is higher than for the full buffer model.

End-to-end network slicing in unmanned aerial vehicle (UAV) networks has attracted significant attention for delivering differentiated services tailored to the quality of service (QoS) requirements of user terminals (UTs). In a sliced UAV network, the dual mobility of both UTs and UAVs, combined with the three-layer association of UT-UAV-network slice (NS), makes handoff a critical and challenging problem for maintaining the communication performance of UTs. This paper proposes a sequential handoff process where a central controller makes handoff decisions for each UT sequentially according to the UT queue. This process is modeled as a Markov decision process (MDP). In the MDP, the state space includes NS available resources, UTs' QoS requirements, and UT queue information. Additionally, the reward function accounts for UTs' QoS and handoff overhead. The double deep Q-network (DDQN) technique is then employed to design a handoff algorithm. This algorithm achieves the optimization goal of ensuring UTs' QoS requirements while avoiding frequent handoffs by maximizing the total reward of the MDP. Additionally, a state-dependent exploration technique with adaptive intensity adjustment, called noisy network (NoisyNet), is utilized to drive the DDQN for effective exploration, thereby enhancing the performance of the handoff algorithm. Finally, the runtime complexity of the proposed NoisyNet-DDQN-based sequential handoff (NoisyNet-DDQN-SH) algorithm is analyzed. The simulation results show that the NoisyNet-DDQN-SH algorithm converges well. Moreover, it exhibits strong robustness. Additionally, the NoisyNet technique effectively enhances the algorithm's performance, making the NoisyNet-DDQN-SH algorithm superior to the vanilla DDQN (with an ϵ-greedy strategy), greedy, maximum signal-to-interference-plus-noise ratio (MaxSINR), and random algorithms.

Component-based development (CBD) techniques have been widely used to enhance the productivity and reduce the cost for software systems development. However, applying CBD techniques to embedded software development faces additional challenges. For embedded systems, it is crucial to consider the quality of service (QoS) attributes, such as timeliness, memory limitations, output precision, battery constraints. Frequently, multiple components implementing the same functionality with different QoS properties can be used to compose a system. Also, software components may have parameters that can be configured to satisfy different QoS requirements. Composition analysis, which is used to determine the most suitable component selections and parameter settings to best satisfy the system QoS requirement, is very important in embedded software development process. In this paper, we present a model and the methodologies to facilitate composition analysis. We define QoS requirements as constraints and objectives. Composition analysis is performed based on the QoS properties and requirements to find solutions (component selections and parameter settings) that can optimize the QoS objectives while satisfying the QoS constraints. We use a multiobjective concept to model the composition analysis problem and use an evolutionary algorithm to determine the Pareto-optimal solutions efficiently.

The growing emergence of a variety of network applications have stringent Quality of Service (QoS) requirements which cannot be always met by the best-effort Internet. To provide QoS, several QoS frameworks have been explored over last two decades, but none of them has been truly successful and globally implemented. This paper proposes QOF, a novel QoS framework based on the OpenFlow. It uses the superior control capabilities of OpenFlow network to transmit business having QoS requirements. On receiving QoS requirements of an application, QOF employs network status information provided by the measurement system (bandwidth, delay, packet loss), then uses QoS routing algorithm implemented by path computation module to guarantee QoS. Finally, QOF is simulated and verified, simulation results show that QOF can find a path satisfying QoS requirements of application according to network status information, and can improve resource usage.

IEEE 802.16 is a standardisation for a broadband wireless access in metropolitan area networks (MAN). Since the IEEE 802.16 standard defines the concrete quality of service (QoS) requirement, a scheduling scheme is necessary to achieve the QoS requirement. Many scheduling schemes are proposed with the purpose of throughput optimisation and fairness enhancement, however, few scheduling schemes support the delay requirement. In this study, the authors propose a new scheduling scheme reflecting the delay requirement. Specifically, the authors add the delay requirement term in the proportional fair scheduling scheme and the scheduling parameters are optimised with respect to the QoS requirement. Therefore the QoS requirement is achieved without the excessive resource consumption.

A 3rd Generation Partnership Project (3GPP) Long Term Evolution (LTE) system uses the concept of two-tier heterogeneous networks (HetNets), where low-power and short-range femtocells are laid under macrocells to fulfill the quality of service (QoS) requirements of users and to boost overall network capacity. However, co-channel interference is one of the major issues that need to be resolved for the successful deployment of HetNets. To overcome this problem, fractional frequency reuse (FFR) schemes have been proposed that can efficiently utilize the available spectrum. Nevertheless, these schemes waste limited frequency resources owing to their static allocation and lack of following QoS requirements, network loading conditions, and service priority of users. In this paper, a QoS-based dynamic FFR (QoS-DFFR) scheme is proposed that efficiently allocates the non-occupied center-zone frequency bands, i.e., bonus bandwidth (BBW), to cell-edge users by considering their QoS requirements. Consequently, the proposed QoS-DFFR scheme can optimize cell-edge user throughput and sector throughput and reduce co-channel interference by dynamically allocating the BBW to the most demanding cell-edge users. The proposed QoS-DFFR scheme improves performance because of its ability to dynamically allocate the limited portion of the frequency bands based on the service priorities of users. The system-level simulation results show that the proposed QoS-DFFR scheme performs remarkably well in a HetNet environment. Compared with the usual FFR schemes, the proposed scheme almost doubles the cell-edge user's throughput and reduces the user's packet loss rate.

In the Internet of Things (IoT) paradigm, data is gathered for treatment from locals, machines, vehicles, etc. Cloud computing is providing suitable hardware and software for data processing. Thus, the integration of IoT with cloud capabilities offers several benefits for many applications. However, challenges persist for some use-cases like delay-sensitive services due to the huge amount of information collected by IoT devices and to be processed by cloud servers. Fog computing is expected to overcome several limits and challenges in cloud computing concerning the Quality of Service (QoS) requirements like latency, bandwidth and location awareness. Nevertheless, researchers still have to deal with several issues namely the architectural level and the energetic aspect. In this paper, we investigate fog system architectures and energy consumption in literature, while considering QoS requirements in the synthesis. A system model is then introduced with a potential solution for QoS management for fog computing environment.

The joint design of the multi-stream in MIMO relay sigle/multiple user system is investigated. Under the inter-stream interference, a constrained optimization problem with respect to the unknown relay precoder matrix is formulated with a goal of minimizing the total relay transmit power subject to quality of service (QoS) requirement on each data stream. As the original opitimization problem is non-convex, the matrix expression of the cost function and constrained requirement is converting to a scalar optimization problem and the optimal relay precoder and receive filter are obtained. The optimal design of the multiple user relay system under QoS requirement is also provided. By using a reasonable approximation and converting to the generalized Rayleigh form for the cost function, a suboptimal relay precoder matrix for QoS optimization with relay transmit power constraint is obtained. Simulation results demonstrate that for single user model, the minimize relay power will increase with Signal to Interference plus Noise Ratio(SINR) constraint value becoming larger, and for multiple users model, more users in our algorithm will make the MSE gain more obvious as increasing transmitting SNR.

QoS routing in GMPLS-capable integrated IP/WDM networks with router cost constraints

Bayesian optimization has been used for the global optimization of communication parameters of Vehicular Ad Hoc Networks (VANETs) for safety applications with stringent quality of service (QoS) requirements. However, the effectiveness of the methodology relies on an accurate analytic model for querying a distribution over functions, which is not practical. Furthermore, incorporating QoS requirements as constraints into the search process is cumbersome, timeconsuming, and even unreliable. In this paper, we present a new approach to the constrained Bayesian optimization of IEEE 802.11 based VANETs for safety messaging with the help of deep learning neural networks (DLNNs). First, we design and train a DLNN using data collected from the analytic models or channel measurements to approximate a mapping from the search parameter space to the QoS metrics. The QoS constraints are naturally incorporated into the DLNN through preprocessing data pairs that cannot meet the QoS requirements. Then, the Bayesian optimization is conducted to find the optimal communication parameters for the best channel usage on the condition that all QoS requirements are met. Accordingly, experiments are carried out on the Google Colab platform where the impact of DLNN structure, data sampling rate, and other optimization parameters are investigated. In comparison to other optimization approaches, utilizing a DLNN in the Bayesian optimization process is more time efficient and flexible.

A third‐generation partnership project long‐term evolution system uses the concept of a 2‐tier heterogeneous network, where low‐power and short‐range femtocells are laid under macrocells to fulfill the quality of service (QoS) requirements of users and to boost overall network throughput. However, cochannel deployment gives rise to the problem of cross‐tier interference that significantly deteriorates the performance of the cellular network. The coordinated multipoint (CoMP) transmission scheme is proposed as a promising solution to alleviate cross‐tier interference by doing cooperation among the neighbor base stations. In this paper, we propose a QoS priority‐based coordinated scheduling and hybrid spectrum access (QoS‐CSaHSA) scheme for downlink CoMP transmission in 2‐tier networks. The proposed QoS‐CSaHSA scheme dynamically reduces the femtocells' power requirements by considering the neighbor cell interference, and it also balances the macrocell load by switching the femtocells to HA mode. Moreover, it can reduce unnecessary muting of the base stations because it only enables the coordinated scheduling CoMP when there is no other possibility to reduce the cross‐tier interference. System‐level simulation results prove the validity of the proposed QoS‐CSaHSA scheme in a heterogeneous network environment. Compared with the existing schemes that operate the femtocells in a closed‐subscriber group without considering users' QoS requirements, the proposed scheme almost doubles the cell‐edge user throughput and reduces the packet loss rate and call‐blocking probability.

Wireless Body Area Network (WBAN) represents one of the most promising networks to provide health applications for improving the quality of life, such as ubiquitous e-Health services and real-time health monitoring. The resource allocation of an energy-constrained, heterogeneous WBAN is a critical issue that should consider both energy efficiency and Quality of Service (QoS) requirements with the dynamic link characteristics, especially when the limited resource cannot satisfy the expected QoS requirements. In this paper, a buffer aware Energy-efficient and QoS-effective resource allocation scheme is proposed in which the sensor queue buffer states, constraints of QoS metrics and the characteristics of dynamic links are considered. Specifically, a buffer aware sensor evaluation method is designed to dynamically evaluate the sensor state with considering the sensor buffer states for improving the system performance. We then formulate the resource allocation problem for optimizing the transmission power, the transmission rate and the allocated time slots for each sensor to minimize the sum mix-cost, which is defined to characterize the energy cost and QoS cost between attainable QoS support and QoS requirements. Simulation results demonstrate the effectiveness of the buffer aware sensor evaluation method and the proposed energy-efficient and QoS-effective resource allocation scheme.

Although cloud storage service (CSS) is convenient to access data, the cost, security, and performance are the issues to users who consider to adopt CSS. For example, CSS could be unavailable due to technical issues or natural disaster. In order to avoid single point of failure, many users duplicate data into multiple CSS providers (CSPs). However, this will increase cost; decrease security; and is difficult to maintain data consistency. In this paper, we propose a QoS-aware Distributed Cloud Storage Service (QDCSS) which aims to provide users with the appropriate CSS according to their quality of service (QoS) requirements. In QDCSS, the data will be encoded into code words by applying erasure code and then the code words will be smartly distributed to multiple CSPs to meet users' QoS requirements. Compared with data duplication, the numerical analysis show that QdCSS can reduce cost by 73% and improve security by 63%. Moreover, the simulation results show that QDCSS can adapt to different users' QoS requirements.

Utility computing enables the use of computational resources and services by consumers with service obligations and expectations defined in Service Level Agreements (SLAs). Parallel applications and workflows can be executed across multiple sites to benefit from access to a wide range of resources and to respond to dynamic runtime requirements. A utility computing provider has the difficult role of ensuring that all current SLAs are provisioned, while concurrently forming new SLAs and providing multiple services to numerous consumers. Scheduling to satisfy SLAs can result in a low return from a provider's resources due to trading off Quality of Service (QoS) guarantees against utilisation. One technique is to employ advance reservations so that an SLA aware scheduler can properly manage and schedule its resources. To improve system utilisation we exploit the principle that some consumers will be more flexible than others in relation to the starting or completion time, and that we can juggle the execution schedule right up until each execution starts. In this paper we present a QoS scheduler that uses SLAs to efficiently schedule advance reservations for computation services based on their flexibility. In our SLA model users can reduce or increase the flexibility of their QoS requirements over time according to their needs and resource provider policies. We introduce our scheduling algorithms, and show experimentally that it is possible to use flexible advance reservations to meet specified QoS while improving resource utilisation.