Phishing is a security threat with serious effects on individuals as well as on the targeted brands. Although this threat has been around for quite a long time, it is still very active and successful. In fact, the tactics used by attackers have been evolving continuously in the years to make the attacks more convincing and effective. In this context, phishing detection is of primary importance. The literature offers many diverse solutions that cope with this issue and in particular with the detection of phishing websites. This paper provides a broad and comprehensive review of the state of the art in this field by discussing the main challenges and findings. More specifically, the discussion is centered around three important categories of detection approaches, namely, list-based, similarity-based and machine learning-based. For each category we describe the detection methods proposed in the literature together with the datasets considered for their assessment and we discuss some research gaps that need to be filled.
Workload characterization is a well-established discipline that plays a key role in many performance engineering studies. The large-scale social behavior inherent in the applications and services being deployed nowadays leads to rapid changes in workload intensity and characteristics and opens new challenging management and performance issues. A deep understanding of user behavior and workload properties and patterns is therefore compelling. This article presents a comprehensive survey of the state of the art of workload characterization by addressing its exploitation in some popular application domains. In particular, we focus on conventional web workloads as well as on the workloads associated with online social networks, video services, mobile apps, and cloud computing infrastructures. We discuss the peculiarities of these workloads and present the methodological approaches and modeling techniques applied for their characterization. The role of workload models in various scenarios (e.g., performance evaluation, capacity planning, content distribution, resource provisioning) is also analyzed.
Cloud technologies are being used nowadays to cope with the increased computing and storage requirements of services and applications. Nevertheless, decisions about resources to be provisioned and the corresponding scheduling plans are far from being easily made especially because of the variability and uncertainty affecting workload demands as well as technological infrastructure performance. In this paper we address these issues by formulating a multi-objective constrained optimization problem aimed at identifying the optimal scheduling plans for scientific workflows to be deployed in uncertain cloud environments. In particular, we focus on minimizing the expected workflow execution time and monetary cost under probabilistic constraints on deadline and budget. According to the proposed approach, this problem is solved offline, that is, prior to workflow execution, with the intention of allowing cloud users to choose the plan of the Pareto optimal set satisfying their requirements and preferences. The analysis of the combined effects of cloud uncertainty and probabilistic constraints has shown that the solutions of the optimization problem are strongly affected by uncertainty. Hence, to properly provision cloud resources, it is compelling to precisely quantify uncertainty and take explicitly into account its effects in the decision process.