Employing Vertical Elasticity for Efficient Big Data Processing in Container-Based Cloud Environments

Recently, “Big Data” platform technologies have become crucial for distributed processing of diverse unstructured or semi-structured data as the amount of data generated increases rapidly. In order to effectively manage these Big Data, Cloud Computing has been playing an important role by providing scalable data storage and computing resources for competitive and economical Big Data processing. Accordingly, server virtualization technologies that are the cornerstone of Cloud Computing have attracted a lot of research interests. However, conventional hypervisor-based virtualization can cause performance degradation problems due to its heavily loaded guest operating systems and rigid resource allocations. On the other hand, container-based virtualization technology can provide the same level of service faster with a lightweight capacity by effectively eliminating the guest OS layers. In addition, container-based virtualization enables efficient cloud resource management by dynamically adjusting the allocated computing resources (e.g., CPU and memory) during the runtime through “Vertical Elasticity”. In this paper, we present our practice and experience of employing an adaptive resource utilization scheme for Big Data workloads in container-based cloud environments by leveraging the vertical elasticity of Docker, a representative container-based virtualization technique. We perform extensive experiments running several Big Data workloads on representative Big Data platforms: Apache Hadoop and Spark. During the workload executions, our adaptive resource utilization scheme periodically monitors the resource usage patterns of running containers and dynamically adjusts allocated computing resources that could result in substantial improvements in the overall system throughput.

A multi-phased statistical learning based classification for network traffic

Application Traffic Identification is an imperative device for sorting out the system as it is the most popular approach to distinguish and characterize the network traffic created from different applications. The classification using conventional Port-based and Payload-based techniques has become counterproductive due to inconsistencies. However, in recent times, approaches with machine learning and statistical techniques have guaranteed higher accuracy. However, learning techniques are inadequate for solving problems with Time and Memory intricacies in vast datasets. Hence, the proposed paper presents a novel scheme of Statistical based traffic classification named Multi-Phased Statistical Based Classification methodology that renders Semi-supervised machines with advanced K-medoid clustering and C5.0 Classification algorithm. The proposed system displays a classic competence in observing the known and unknown application flows by statistical features utilization scheme that enhances the classification preciseness. Further, the trial results show that the proposed work outperforms previous approaches by achieving a higher granularity of 98–99% and reducing complexities. Ultimately, the new proposed work is evaluated on our campus traffic traces (AU-IDS). It is proven that the proposed approach accomplishes a higher exactness rate and thus encourages its implementation in real-time.