The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In an IaaS cloud, virtual machines (VMs), also called instances, may be classified as reserved instances and on-demand instances. The reserved instances having long-term commitments and one-time payment are appropriate for the steady or predictable workloads, while for short-term, spiky or unpredictable workloads, the on-demand instances having flexible hourly payment and no long-term commitments...
The growth of different types of applications in the Internet arises the need for supporting Quality of Service (QoS) for them. Differentiating services aims to differentiate among applications in order to provide their requirements based on the level of QoS they need and their characteristics. In this paper we introduce a dynamic QoS-Aware queuing algorithm to differentiate services in IP basednetworks,...
The distributed system's scale increases gradually so that traditional survivability evolution methods based on mathematical model can't be applied. Firstly, Quality of Service (QoS) being the manifestation of system viability is analyzed in this paper. Secondly, a calculation method for the correlations between Qos is presented, and then a quantifiable evolution method for key attributes and distributed...
There is the problem of absolute discrimination in current Active Queue Management (AQM) algorithms for Differentiated Services, the throughput and link utilization of network are decreased. In this paper we have presented an AQM algorithm, called Weighted-queue-length RIO-C (WRIO). WRIO realizes relative discrimination of different drop precedence, and improves link utilization, especially for the...
As an intelligent algorithm with the mechanism of positive feedback, the ant colony algorithm is useful in solving the optimal problem. Web service selection is the foundation of the Web service composition which is one of the most important ways to satisfy the users' personalized requirements. Firstly, analyzed the problem of Web service selection based on expounding the basic principle of ant colony...
In this paper, an admission control (AC) scheme is proposed for handling multiclass Grade of Service (GoS) and Quality of Service (QoS) in Uplink Long Term Evolution (LTE) systems. GoS requirement in conjunction with QoS has been seldom taken into account in previous admission control and resource allocation algorithms for LTE uplink. We propose a novel algorithm for handling the priorities while...
An efficient Call Admission Control (CAC) arithmetic is essential to guarantee QoS for enhancing the utilization of radio resource in multi-traffic CDMA systems. This paper presents a Multi-Class Services Dynamic Mixed Judgment CAC arithmetic. This arithmetic judges a new coming call whether to accept or not based on the remaining resource, the priority of all services and the resource reservation...
Mobility model and call admission control (CAC) algorithm are important for wireless mobility networks. This paper firstly sets a practical mobility model, and then presents a novel measurement-based CAC algorithm utilizing time series analysis under the random model. The algorithm updates the reservation threshold by directly forecasting the next possible number of handoff dropping calls, using ARMA...
In this paper we validate through simulations the convergence properties of our earlier proposed balls and bins channel allocation algorithm. The algorithm supports dynamic channel allocation based on local link quality information and does not require exchange of network information. Each radio evaluates periodically a cost function related to the desired QoS. Based on the calculated cost the radio...
In this paper we verify and study through implementation our earlier game theory algorithm for load balanced dynamic channel assignment. In our algorithm every cognitive radio is initially assigned a channel in a random fashion. The radios periodically evaluate a cost function related to a Quality of Service (QoS) parameter and may change the transmission channel with probability proportional to the...
Allocating bandwidth efficiently is an effective approach to guarantee QoS in ad hoc networks. A bandwidth allocation algorithm is proposed which based on traffic priority for ad hoc networks with clustered structures. The algorithm achieves QoS guarantee for the traffic with higher priority by upgrading or degrading QoS of the traffic. Simulation results are presented to demonstrate the performance...
High speed modern communication networks are required to integrate and support multimedia application which requires differentiated quality-of-service (QoS) guarantees. Routing mechanism is a key to success of future communication networking. However, it is often complicated by the notion of guaranteed QoS, which can either be related to time, cost, packet loss or bandwidth requirements. Communication...
To coordinate the various access technologies in the 4G-communication system, intelligent vertical handoff algorithms are required. This paper mainly deals with a novel vertical handoff decision algorithm based on fuzzy logic with the aid of grey theory and dynamic weights adaptation. The grey prediction algorithm (GPA) takes 4 sampled received signal strengths as input parameters, and calculates...
In order to provide service differentiation on OBS networks, a shared FDL bank architecture was considered. The shared FDL bank architecture can reduce the size of OBS nodes while accomplishing the service differentiation between classes and guaranteeing the target blocking probability for each calss. Especially, the shared feed-forward type output buffering architecture was considered, and a dynamic...
A principal factor in sensor network design is energy efficiency. In this work, we propose to extend the lifetime of sensor networks using appropriate choice of sensor node distribution. The key idea of our scheme is to deploy more nodes in areas of extensive energy usage. Using this scheme of sensor node distribution, we use probabilistic angular routing to route data packets from the sensor nodes...
A new way of solving the bandwidth, delay, delay jitter and packet loss constrained least-cost quality of service (QoS) multi-routing problem is presented. It harmonizes the intrinsic attributes of each constraint of QoS and in different stage, the algorithm updates pheromone according to different constraints, optimizes its control parameters to simplify the parameter selection process and to speed...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.