Cloud computing (ClC) has become a more popular computer paradigm in the preceding few years. Quality of Service (QoS) is becoming a crucial issue in service alteration because of the rapid growth in the number of cloud services. When evaluating cloud service functioning using several performance measures, the issue becomes more complex and non-trivial. It is therefore quite difficult and crucial for consumers to choose the best cloud service. The user's choices are provided in a (...) quantifiable manner in the current methods for choosing cloud services. Hence, this study attempts to achieve this objective through construction. decision-making framework so-called cloud services evaluator (CSsEv). The main indicator and its sub-indicators are formed as nodes at levels(n) in tree soft sets (TSSs). Thereafter Single Value Neutrosophic Sets (SVNSs) as branch of neutrosophic sets which conjunction with the Multi-Criteria Decision Making (MCDM) technique to facilitate analysis and evaluation process for the available Cloud services providers. Hence, entropy is employed to obtain indicators and sub_indicators weights and Complex Proportional Assessment utilizes these weights to facilitate the decision process of selecting optimal ClSPs. (shrink)

Web services are self-describing and self-contained modular applications based on the network. With the deepening of web service applications, service consumers have gradually increased their requirements for service functions and service quality. Aiming at how to select the optimal plan from a large number of execution plans with the same function and different QoS characteristics, this paper proposes a web service selection algorithm that supports QoS global optimization and dynamic replanning. The algorithm uses position (...) matrix coding to represent all execution paths and replanning information of the service combination. By calculating the Hamming distance of the service quality between individuals, the quality of the service portfolio is improved. By specifying the total user time limit and implementing a good solution retention strategy, the problem of the impact of algorithm running time on service quality is solved. The experimental results show that the method proposed in this paper is effectively integrated into the development trend of QoS and close to the requester’s needs and can better meet user needs. This algorithm improves the user’s satisfaction with the returned service to a certain extent and improves the efficiency of service invocation. (shrink)

In a communication network with a source node, a multicast tree is defined as a tree rooted at the source node and all its leaves being recipients of the multicast originating at the source. The tree or bandwidth cost is normally measured by its utilization of tree links along with the quality of service measures such as delay constraint and end-to-end delay. However, if nodes are allowed to join or leave the multicast group at any time during the (...) lifetime of the multicast connection, then the problem is known as dynamic multicast routing problem. In this article, we combine a greedy approach with static multicast routing using Tabu Search to find a low-cost dynamic multicast tree with desirable QoS parameters. The proposed algorithm is then compared with several static multicast routing algorithms. The simulation results show that, on a large number of events, i.e., where nodes are leaving or joining, the proposed algorithm is able to find multicast trees of lower cost and more desirable QoS properties. (shrink)

Most of the IoT-based smart systems require low latency and crisp response time for their applications. Achieving the demand of this high Quality of Service becomes quite challenging when computationally intensive tasks are offloaded to the cloud for execution. Edge computing therein plays an important role by introducing low network latency, quick response, and high bandwidth. However, offloading computations at a large scale overwhelms the edge server with many requests and the scalability issue originates. To address the above (...) issues, an efficient resource management technique is required to maintain the workload over the edge and ensure the reduction of response time for IoT applications. Therefore, in this paper, we introduce a metaheuristic and nature-inspired Artificial Bee Colony optimization technique that effectively manages the workload over the edge server under the strict constraints of low network latency and quick response time. The numerical results show that the proposed ABC algorithm has outperformed Particle Swarm Optimization, Ant Colony Optimization, and Round-Robin Scheduling algorithms by producing low response time and effectively managing the workload over the edge server. Furthermore, the proposed technique scales the edge server to meet the demand of high QoS for IoT applications. (shrink)

With the rapid development of Internet of Things technology, the energy consumption of service composition in the IoT environment is a key problem to be studied. At present, the problems of service composition in the IoT environment mostly focus on the evaluation research based on quality of service, ignoring the overall energy consumption in the process of dynamic configuration of service composition. Therefore, we construct the service composition structure for the IoT and propose the (...) QoS evaluation model and energy evaluation model for the service composition in the IoT environment. Considering that the service composition in the Internet of things environment is NP hard, moth algorithm is successfully applied to the QoS evaluation model and energy evaluation model. The simulation results reveal that MFO has good optimization effect in the abovementioned models, and the optimization effect of MFO is improved by 8% and 6% compared with the genetic algorithm and particle swarm optimization, so as to realize the green energy strategic management of QoS composition in the environment of IoT. (shrink)

This paper examines flexibility in ad hoc networks and suggests that, even with cross-layer design as a mechanism to improve adaptation, a fundamental limitation exists in the ability of a single optimization function, defined a priori, to adapt the network to meet all quality-of-service requirements. Thus, code implementing multiple algorithms will have to be positioned within the network. Active networking and programmable networking enable unprecedented autonomy and flexibility for ad hoc communication networks. However, in order to best leverage (...) the results of active and programmable networking, metrics that indicate the nature and location of required flexibility need to be developed. The primary contribution of this paper is to propose a metric that couples network topological rate of change with the ability of a generic service to move itself to an optimal location in concert with the changing network. This metric points to a fundamental tradeoff among adaptation (changing service location), performance (sophistication or estimated minimum code size of the service), and the network’s ability to tune itself to a changing ad hoc network topology. (shrink)

Mechanisms for QoS provisioning in communication networks range from flow-based resource reservation schemes, providing QoS guarantees, through QoS differentiation based on reservation aggregation techniques to adaptation of applications, compensating for incomplete reservations. Scalable, aggregation-based reservations can also be combined with adaptations for a more flexible and robust overall QoS provisioning. Adaptation is particularly important in wireless networks, where reservations schemes are more difficult to realize. It is widely accepted that usability of Cellular or Mobile IP can be largely improved if (...) adaptation is incorporated. Adaptation, in turn, depends on coding techniques involved and on user requirements. Those impose certain preferences and ordering relations on QoS hierarchies or degradation paths to be followed along when adaptation is performed. With the advent of MPEG4 coding techniques, more sophisticated adaptation schemes are more likely to be supported in the future. (shrink)