Task deployment has become a research hotspot for load balancing in joint “cloud-edge” datacenter. In view of the problem that most of the hosts are overloaded in the current joint “cloud-edge” datacenter, which may cause unbalanced load in the center, existing research mainly pay attention to the problem of unilateral load balancing of cloud computing center or edge computing center. In order to realize efficient deployment of “cloud-edge” tasks and overall load balancing, on the basis of the deployment mode of joint “cloud-edge”, this paper proposes a resource management and task deployment strategy JCETD (Joint Cloud-Edge Task Deployment) based on pruning algorithm and deep reinforcement learning. The main idea consists of two parts: firstly, the set of “cloud-edge” hosts is pruned according to the attribute value of the physical host. Then, there will be a non-dominated set of joint hosts which reduces the computational complexity of the whole algorithm and improve the computational efficiency of the system. Secondly, the problem of task deployment is simulated as a deep reinforcement learning process under the “cloud-edge” model. Through the continuous exploration and utilization of the system environment, the tasks are reasonably and efficiently deployed in the cloud computing center and edge computing center. Finally, the “cloud-edge” system can achieve an efficient computing performance and overall load balancing. The experimental results show that the proposed algorithm significantly reduces the total completion time and average response time compared with the existing research, which effectively optimizes the service ability and realizes the load balancing of the joint “cloud-edge” system.
Outsourcing image search services to public clouds is an ever-increasing trend. However, directly outsourcing image datasets to untrusted clouds introduces privacy concerns. Several secure image retrieval schemes have been proposed recently. However, most of them require participation from image owners when building secure indexes, which wastes many computational resources of the image owners. Several schemes are proposed to solve this problem, but they suffer from low search accuracy on large datasets. In this paper, we propose the first secure image retrieval scheme that simultaneously solves these two problems. To obtain higher search accuracy, we extract image features via fine-tuned convolutional neural networks. Then, the image features are encrypted by using the secure k-Nearest Neighbor algorithm. To improve search speed and reduce the cost of image owners, we let cloud servers locally build a secure hierarchical index graph by using the encrypted image features. Besides, the secure index can be built and updated in parallel. We provide security analysis for the proposed scheme. Performance evaluations on the CIFAR-10 dataset show that the proposed scheme is practical. Moreover, compared with a recent scheme, our scheme can save more index construction time and cost of image owners when building secure indexes.
15 February 2010 in Information Processing Letters
The "double-cut-and-join" (DCJ) model of genome rearrangement proposed by Yancopoulos et al. uses the single DCJ operation to account for all genome rearrangement events. Given three signed permutations, the DCJ median problem is to find a fourth permutation that minimizes the sum of the pairwise DCJ distances between it and the three others. In this paper, we present a branch-and-bound method that provides accurate solution to the multichromosomal DCJ median problems. We conduct extensive simulations and the results show that the DCJ median solver performs better than other median solvers for most of the test cases. These experiments also suggest that DCJ model is more suitable for real datasets where both reversals and transpositions occur.
Deep packet inspection (DPI) is widely used in detecting abnormal traffic and suspicious activities in networks. With the growing popularity of secure hypertext transfer protocol (HyperText Transfer Protocol over Secure Socket Layer, HTTPS), inspecting the encrypted traffic is necessary. The traditional decryption-and-then-encryption method has the drawback of privacy leaking. Decrypting encrypted packets for inspection violates the confidentiality goal of HTTPS. Now, people are faced with a dilemma: choosing between the middlebox’s ability to perform detection functions and protecting the privacy of their communications. We propose OTEPI, a system that simultaneously provides both of those properties. The approach of OTEPI is to perform the deep packet inspection directly on the encrypted traffic. Unlike machine and deep learning methods that can only classify traffic, OTEPI is able to accurately identify which detection rule was matched by the encrypted packet. It can facilitate network managers to manage their networks at a finer granularity. OTEPI achieves the function through a new protocol and new encryption schemes. Compared with previous works, our approach achieves rule encryption with oblivious transfer (OT), which allows our work to achieve a better balance between communication traffic consumption and computational resource consumption. And our design of Oblivious Transfer and the use of Natural Language Processing tools make OTEPI outstanding in terms of computational consumption.