Cloud computing provides access to various services such as servers, storage and applications to the customers' as and when required. The services on the cloud can be accessed with minimum efforts... Show More

Cloud computing provides access to various services such as servers, storage and applications to the customers' as and when required. The services on the cloud can be accessed with minimum efforts through any handheld devices that are connected to the Internet. In IaaS cloud, the services to the customers are provided in the form of two leases, AR and BE. Here, a running BE lease can be preempted upon arrival of an AR lease as BE has lower priority. However, frequent preemption of the BE lease causes an overhead to the system and leads to customer dissatisfaction. In this paper, we propose a fairness algorithm called TATA to provide fairness among the leases. We evaluate the proposed algorithm on various synthetic datasets and compare the results with an existing fairness algorithm. The results of simulation show that TATA produces better response time for both the leases than the existing algorithm.

Being a good software testing engineer, one should have the responsibility towards environment sustainability. By using green principles and regulations, we can perform Green Software Testing. In... Show More

Being a good software testing engineer, one should have the responsibility towards environment sustainability. By using green principles and regulations, we can perform Green Software Testing. In this paper, we present a new approach to enhance Branch Coverage and Modified Condition/Decision Coverage uses concolic testing. We have proposed a novel transformation technique to improve these code coverage metrics. We have named this new transformation method Double Refined Code Transformer (DRCT). Then, using JoulMeter, we compute the power consumption and energy consumption in this testing process. We have developed a tool named Green-DRCT to measure energy consumption while performing the testing process.

Sentiment Analysis intends to get the basic perspective of the content, which may be anything that holds a subjective supposition, for example, an online audit, Comments on Blog posts, film rating... Show More

Sentiment Analysis intends to get the basic perspective of the content, which may be anything that holds a subjective supposition, for example, an online audit, Comments on Blog posts, film rating and so forth. These surveys and websites might be characterized into various extremity gatherings, for example, negative, positive, and unbiased keeping in mind the end goal to concentrate data from the info dataset. Supervised machine learning strategies group these reviews. In this paper, three distinctive machine learning calculations, for example, Support Vector Machine (SVM), Maximum Entropy (ME) and Naive Bayes (NB), have been considered for the arrangement of human conclusions. The exactness of various strategies is basically inspected keeping in mind the end goal to get to their execution on the premise of parameters, e.g. accuracy, review, f-measure, and precision.

The ability to recover the control logic after a failure is detected in specific time window is called resiliency. The Software Defined Network (SDN) is an emerged and powerful architecture which... Show More

The ability to recover the control logic after a failure is detected in specific time window is called resiliency. The Software Defined Network (SDN) is an emerged and powerful architecture which allow to separate the control plane from forwarding. This decoupling architecture brings new difficulties to the network resiliency because link failure between switch and controller could defunct the forwarding plane. It has been identified that the resiliency of the network can be improved by choosing the correct place for the controller and by choosing proper routing tree once the controller location is known. In this work, we have analysed the performance of various Routing Tree algorithms on different network topology generated by Bernoulli Random Graph model and found that Greedy Routing Tree (GRT) provides the maximum resiliency. The Closeness Centrality Theorem has proposed to find the best controller position and later analysed the performance of various single controller placement algorithms on GRT for finding the overall improvement of the resiliency of the network.

Outliers in the database are the objects that deviate from the rest of the dataset by some measure. The Nearest Neighbor Outlier Factor is considering to measure the degree of outlier-ness of the... Show More

Outliers in the database are the objects that deviate from the rest of the dataset by some measure. The Nearest Neighbor Outlier Factor is considering to measure the degree of outlier-ness of the object in the dataset. Unlike the other methods like Local Outlier Factor, this approach shows the interest of a point from both neighbors and reverse neighbors, and after that, an object comes into consideration. We have observed that in GBBK algorithm that based on K-NN, used quick sort to find k nearest neighbors that take O (N log N) time. However, in proposed method, the time required for searching on K times which complete in O (KN) time to find k nearest neighbors (k < < log N). As a result, the proposed method improves the time complexity. The NSL-KDD and Fisher iris dataset is used, and experimental results compared with the GBBK method. The result is same in both the methods, but the proposed method takes less time for computation.

In the current era, Internet is the fastest growing technology. It is a global network of distributed systems that interconnects with each other to share various resources and computation. The... Show More

In the current era, Internet is the fastest growing technology. It is a global network of distributed systems that interconnects with each other to share various resources and computation. The complexity of the distributed systems is rapidly increasing, which leads to an increased susceptibility of failure to the participating computers such as clients and servers and their interconnections. Therefore, the main challenge is to address such failures and develop efficient algorithms to tolerate such failures. In this paper, four fault tolerant algorithms, namely server-based fault tolerant (SFT), client-based fault tolerant (CFT), client-server fault tolerant (CSFT) and connection fault tolerant (CoFT) are proposed to deal with the above challenge. The proposed algorithms are evaluated in terms of number of failures (NOF), load factor (LF) and load standard deviation (LSD) and compared with an existing algorithm. The comparison results show the superior performance of the proposed algorithms.

This research presents a novel distributed strategy for actuation of reduced number of cameras motivated by scalar controller selection for eliminating the amount of redundant data transmission... Show More

This research presents a novel distributed strategy for actuation of reduced number of cameras motivated by scalar controller selection for eliminating the amount of redundant data transmission taking place in any geographic zone under speculation. The proposed framework is based on dividing the monitored region into a number of virtual compartments. A scalar controller is selected in each of the compartments, which is chosen in such a manner that its distance is the minimum among all the scalars from the central point of the concerned compartment. Further, all the cameras are arranged in a predetermined circular fashion. Whenever, an event takes place, the scalar controllers inform their respective cameras regarding its occurrence. The cameras collaboratively exchange information among themselves for deciding which among them are to be actuated. The least camera activation, enhanced coverage ratio, minimized redundancy ratio, reduced energy and power expenditure obtained from the experimental outcomes affirm the effectiveness of our proposed method over other approaches.