Search

Virtualization as one of the leading technologies has assisted datacenters to cloudify their products and provide versatile platforms and variety of Internet services. This technology also has facilitated agile deployment of complex Internet services such as Cloud-based multi-tier applications. However implementing multi-tier applications assists providers to set up flexible and scalable services, deploying such applications in virtualized environments faces challenges, which harden collocation of disparate multi-tier applications in a shared environment. In this article, we propose a placement strategy to consolidate multi-tier applications' tiers in a virtualized datacenter regarding workload demands of individual tiers, utilization of physical hosts' resources and operational status of virtual machines. The placement strategy identifies over-utilized hosts based on the birth--death stochastic process and ranks tiers based on Data Envelopment Analysis-Analytic Hierarchy Process modeling to be placed on target hosts. A prioritized tier will be placed on an appropriate host though least operational interference with hosted tiers incurred. The efficiency of the proposed model is evaluated using a series of in-depth experiments. We introduce results derived from quantitative and qualitative analyses that are useful for multi-tier applications placement in virtualized datacenters. Simulation results reveal that the proposed solution excels in terms of both load distribution and energy consumption in the datacenter, while the number of unnecessary migrations and consecutive Service Level Agreement violations is considerably reduced. [ABSTRACT FROM AUTHOR]

ABSTRACT Quality of service (QoS) provisioning in mobile ad hoc networks (MANETs) is one of the fundamental concerns in this area. Autonomous mobility of nodes is one of the main factors affecting the network QoS. A lack of fixed infrastructure and central control on the nodes complicate guaranteeing the QoS in MANETs. Security is a major factor affecting the QoS in such networks. This paper proposes a new routing method based on trust among the nodes and applies a clustering approach to MANETs. This routing scheme can calculate the trustworthiness of the route and the shortest routes to the destination by avoiding identified malicious nodes. The effects of node mobility and number of malicious nodes on routing performances are investigated in the reported research. Simulation is used to show the effectiveness of the proposed approach in comparison with a categorized trust method, Ad hoc On-demand Distance Vector, trust vector-based Ad hoc On-demand Distance Vector, and trust vector-based dynamic source routing in terms of end-to-end delay, network throughput, and packet delivery ratio at the expense of a moderate increase in the routing overhead. The proposed trust-based routing method finds the trustworthy route by applying end-to-end trust calculation and finds the optimal route by performing clustering scheme from the source node to the destination node. In the extended proposed routing method, adding a nonce-based encryption scheme results in improved packet delivery ratio, network throughput, and malicious node detection rate. Copyright © 2013 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

Thanks to the efforts of our reviewers in 2022, the median time to first decision was 17 days and the median time to publication was 37 days. Regardless of whether the articles they examined were ultimately published, the editors would like to express their appreciation and thank the following reviewers for the time and dedication that they have shown I Mathematics i : those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). I Mathematics i was able to uphold its high standards for published papers due to the outstanding efforts of our reviewers. [Extracted from the article]