Formal process algebraic modeling,verification, and analysis of an abstract Fuzzy Inference Cloud Service

In cloud computing, services play key roles. Services are well defined and autonomous components. Nowadays, the demand of using Fuzzy inference as a service is increasing in the domain of complex and critical systems. In such systems, along with the development of the software, the cost of detecting and fixing software defects increases. Therefore, using formal methods, which provide clear, concise, and mathematical interpretation of the system, is crucial for the design of these Fuzzy systems. To obtain this goal, we introduce the Fuzzy Inference Cloud Service (FICS) and propose a novel discipline for formal modeling of the FICS. The FICS provides the service of Fuzzy inference to the consumers. We also introduce four novel formal verification tests, which allow strict analysis of certain behavioral disciplines in the FICS as follows: (1) Internal consistency, which analyzes the service in a strict and delicate manner; (2) Deadlock freeness; (3) Divergence freeness; and (4) Goal reach ability. The four tests are discussed and the FICS is verified to ensure that it can pass all these tests.     

Abstraction and approximation in fuzzy temporal logics and models

Recently, by defining suitable fuzzy temporal logics, temporal properties of dynamic systems are specified during model checking process, yet a few numbers of fuzzy temporal logics along with capable corresponding models are developed and used in system design phase, moreover in case of having a suitable model, it suffers from the lack of a capable model checking approach. Having to deal with uncertainty in model checking paradigm, this paper introduces a fuzzy Kripke model (FzKripke) and then provides a verification approach using a novel logic called Fuzzy Computation Tree Logic* (FzCTL*). Not only state space explosion is handled using well-known concepts like abstraction and bisimulation, but an approximation method is also devised as a novel technique to deal with this problem. Fuzzy program graph, a generalization of program graph and FzKripke, is also introduced in this paper in consideration of higher level abstraction in model construction. Eventually modeling, and verification of a multi-valued flip-flop is studied in order to demonstrate capabilities of the proposed models.     

MC-MLAS: Multi-channel Minimum Latency Aggregation Scheduling in Wireless Sensor Networks

Data aggregation is a key, yet time-consuming functionality in wireless sensor networks (WSNs). Multi-channel design is a promising technique to alleviate interference as a primary reason for long latency of TDMA aggregation scheduling. Indeed, it provides more potential of parallel transmissions over different frequency channels, thus minimizing time latency. In this paper, we focus on designing a multi-channel minimum latency aggregation scheduling protocol, named MC-MLAS, using a new joint approach for tree construction, channel assignment, and transmission scheduling. To our best knowledge, this is the first work in the literature which combines orthogonal channels and partially overlapping channels to consider the total latency involved in data aggregation. Extensive simulations verify the superiority of MC-MLAS in WSNs.     

Dynamic routing of real-time jobs among parallel EDF queues: A performance study

This paper introduces an analytical method for approximating the performance of a firm real-time system consisting of a number of parallel infinite-capacity single-server queues. The service discipline for the individual queues is earliest-deadline-first (EDF). Real-time jobs with exponentially distributed relative deadlines arrive according to a Poisson process. Jobs either all have deadlines until the beginning of service or deadlines until the end of service. Upon arrival, a job joins a queue according to a state-dependent stationary policy, where the state of the system is the number of jobs in each queue. Migration among the queues is not allowed. An important performance measure to consider is the overall loss probability of the system. The system is approximated by a Markovian model in the long run. The resulting model can then be solved analytically using standard Markovian solution techniques. Comparing numerical and simulation results for at least three different stationary policies, we find that the existing errors are relatively small.     

Negotiation strategies considering market, time and behavior functions for resource allocation in computational grid

Providing an efficient resource allocation mechanism is a challenge to computational grid due to large-scale resource sharing and the fact that Grid Resource Owners (GROs) and Grid Resource Consumers (GRCs) may have different goals, policies, and preferences. In a real world market, various economic models exist for setting the price of grid resources, based on supply-and-demand and their value to the consumers. In this paper, we discuss the use of multiagent-based negotiation model for interaction between GROs and GRCs. For realizing this approach, we designed the Market- and Behavior-driven Negotiation Agents (MBDNAs). Negotiation strategies that adopt MBDNAs take into account the following factors: Competition, Opportunity, Deadline and Negotiator’s Trading Partner’s Previous Concession Behavior. In our experiments, we compare MBDNAs with MDAs (Market-Driven Agent), NDF (Negotiation Decision Function) and Kasbah in terms of the following metrics: total tasks complementation and budget spent. The results show that by taking the proposed negotiation model into account, MBDNAs outperform MDAs, NDF and Kasbah.     

Task scheduling mechanisms in cloud computing: A systematic review

Today, cloud computing has developed as one of the important emergent technologies in communication and Internet. It offers on demand, pay per use access to infrastructure, platforms, and applications. Due to the increase in its popularity, the huge number of requests need to be handled in an efficient manner. Task scheduling as one of the challenges in the cloud computing supports the requests for assigning a particular resource so as to perform effectively. In the resource management, task scheduling is performed where there is the dependency between tasks. Many approaches and case studies have been developed for the scheduling of these tasks. Up to now, a systematic literature review (SLR) has not been presented to discover and evaluate the task scheduling approaches in the cloud computing environment. To overcome, this paper presents an SLR‐based analysis on the task scheduling approaches that classify into (a) single cloud environments that evaluate cost‐aware, energy‐aware, multi‐objective, and QoS‐aware approaches in task scheduling; (b) multicloud environment that evaluates cost‐aware, multi‐objective, and QoS‐aware task scheduling; and (c) mobile cloud environment that is energy‐aware and QoS‐aware task scheduling. The analytical discussions are provided to show the advantages and limitations of the existing approaches.