Utility-oriented adaptive QoS and bandwidth allocation in wireless networks

Effective support of real‐time multimedia applications in wireless access networks, viz. cellular networks and wireless LANs, requires a dynamic bandwidth adaptation framework where the bandwidth of an ongoing call is continuously monitored and adjusted. Since bandwidth is a scarce resource in wireless networking, it needs to be carefully allocated amidst competing connections with different Quality of Service (QoS) requirements. In this paper, we propose a new framework called QoS‐adaptive multimedia wireless access (QoS‐AMWA) for supporting heterogeneous traffic with different QoS requirements in wireless cellular networks. The QoS‐AMWA framework combines the following components: (i) a threshold‐based bandwidth allocation policy that gives priority to handoff calls over new calls and prioritizes between different classes of handoff calls by assigning a threshold to each class, (ii) an efficient threshold‐type connection admission control algorithm, and (iii) a bandwidth adaptation algorithm that dynamically adjusts the bandwidth of an ongoing multimedia call to minimize the number of calls receiving lower bandwidth than the requested. The framework can be modeled as a multi‐dimensional Markov chain, and therefore, a product‐form solution is provided. The QoS metrics—new call blocking probability (NCBP), handoff call dropping probability (HCDB), and degradation probability (DP)—are derived. The analytical results are supported by simulation and show that this work improves the service quality by minimizing the handoff call dropping probability and maintaining the bandwidth utilization efficiently. Copyright © 2006 John Wiley & Sons, Ltd.

A generic video telephony may require more than 40 kbps whereas a low motion video telephony may require about 25 kbps for data transmission. From the designing point of view these requirements demands for an alternative resource planning, especially for bandwidth allocation in wireless networks. In wireless network where bandwidth is a scare resource, the system may need to block incoming user if all of the bandwidth has been used to provide highest quality of service to existing users. However this bandwidth resource planning may be unacceptable for larger application. This work aims towards a realization of a mobile network using W-CDMA multi access technique supporting multilevel quality of services. The bandwidth allocation to multiple users is adjusted dynamically according to the required network condition so as to increase bandwidth utilization. The work analyzes the performance deriving the degradation period ratio, mean degradation time and degradation state for the implemented wireless network. The proposed work is aim to implement on Matlab tool for its functional verification considering various mobility patterns. Full Text: PDF DOI: http://dx.doi.org/10.11591/telkomnika.v16i2.8426

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.

Bandwidth allocation plays an important role to guarantee the quality of service (QoS) in streaming real-time scalable video to multiuser over wireless time-varying channels. In this letter, an adaptive bandwidth allocation (ABA) scheme is presented to maximize the bandwidth utilization while provisioning each individual user’s QoS. Cooperated with traffic rate adaptation, it jointly addresses the spatial diversity among multiuser and the temporal fluctuation of the individual channel condition. A continuous-time Markov decision processes model is introduced to formulate the QoS-guaranteed ABA problem as constrained stochastic optimization. Based on performance sensitivity analysis, a policy iteration algorithm is developed to find the optimal ABA policy online without any prior knowledge of channel statistics. The adaptability to unknown environments and high computation efficiency make it feasible to implement in running-time. Simulations results demonstrate the effectiveness of the proposed method.

Fuzzy-based dynamic bandwidth allocation for heterogeneous sources in ATM networks

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.

In this paper a global control system for admission control, routing and bandwidth allocation in the ATM environment is presented. The traffic is divided into classes, characterized by statistical parameters and by quality of service (QoS) requirements, as the rates of lost and delayed cells. At connection set-up, a strategy decides if a connection request has to be accepted or rejected and which is the best route that all the cells of that connection have to follow. The decision about acceptance guarantees the QoS requirements for each class, while the routing strategy is aimed at minimizing the number of blocked calls in the network. The whole system provides also a mechanism to achieve a fair and adaptive bandwidth allocation for each traffic class; the bandwidth allocation control has a longer intervention period than the admission and routing control. In fact, the global strategy can be regarded as a hierarchical one. Several simulation results are reported, to verify the effectiveness both of the admission and routing mechanism and of the allocation strategy.

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.

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.

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.

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