arXiv subjects

Deke Guo

Publications and source records attributed to Deke Guo.

22 records · Page 2Linked to original sources

arXiv2019

HyEdge: Optimal Request Scheduling in Hybrid Edge Computing Environment

With the widespread use of Internet of Things (IoT) devices and the arrival of the 5G era, edge computing has become an attractive paradigm to serve end-users and provide better QoS. Many efforts have been done to provision some merging public network services at the edge. We reveal that it is very common that specific users call for private and isolated edge services to preserve data privacy and enable other security intentions. However, it still remains open to fulfill such kind of mixed requests in edge computing. In this paper, we propose the framework of hybrid edge computing to offer both public and private edge services systematically. To fully exploit the benefits of this novel framework, we define the problem of optimal request scheduling over a given placement solution of hybrid edge servers, so as to minimize the response delay. This problem is further modeled as a mixed integer non-linear problem (MINLP), which is typically NP-hard. Accordingly, we propose the partition-based optimization method, which can efficiently solve this NP-hard problem via the problem decomposition and the branch and bound strategies. We finally conduct extensive evaluations with a real-world dataset to measure the performance of our methods. The results indicate that the proposed method achieves elegant performance with low computation complexity.

cs.DC↗

arXiv2019

Simultaneous Clustering and Optimization for Evolving Datasets

Simultaneous clustering and optimization (SCO) has recently drawn much attention due to its wide range of practical applications. Many methods have been previously proposed to solve this problem and obtain the optimal model. However, when a dataset evolves over time, those existing methods have to update the model frequently to guarantee accuracy; such updating is computationally infeasible. In this paper, we propose a new formulation of SCO to handle evolving datasets. Specifically, we propose a new variant of the alternating direction method of multipliers (ADMM) to solve this problem efficiently. The guarantee of model accuracy is analyzed theoretically for two specific tasks: ridge regression and convex clustering. Extensive empirical studies confirm the effectiveness of our method.

cs.LG↗

arXiv2019

Optimizing Bloom Filter: Challenges, Solutions, and Comparisons

Bloom filter (BF) has been widely used to support membership query, i.e., to judge whether a given element x is a member of a given set S or not. Recent years have seen a flourish design explosion of BF due to its characteristic of space-efficiency and the functionality of constant-time membership query. The existing reviews or surveys mainly focus on the applications of BF, but fall short in covering the current trends, thereby lacking intrinsic understanding of their design philosophy. To this end, this survey provides an overview of BF and its variants, with an emphasis on the optimization techniques. Basically, we survey the existing variants from two dimensions, i.e., performance and generalization. To improve the performance, dozens of variants devote themselves to reducing the false positives and implementation costs. Besides, tens of variants generalize the BF framework in more scenarios by diversifying the input sets and enriching the output functionalities. To summarize the existing efforts, we conduct an in-depth study of the existing literature on BF optimization, covering more than 60 variants. We unearth the design philosophy of these variants and elaborate how the employed optimization techniques improve BF. Furthermore, comprehensive analysis and qualitative comparison are conducted from the perspectives of BF components. Lastly, we highlight the future trends of designing BFs. This is, to the best of our knowledge, the first survey that accomplishes such goals.

cs.DS↗

arXiv2018

PPtaxi: Non-stop Package Delivery via Multi-hop Ridesharing

City-wide package delivery becomes popular due to the dramatic rise of online shopping. It places a tremendous burden on the traditional logistics industry, which relies on dedicated couriers and is labor-intensive. Leveraging the ridesharing systems is a promising alternative, yet existing solutions are limited to one-hop ridesharing or need consignment warehouses as relays. In this paper, we propose a new package delivery scheme which takes advantage of multi-hop ridesharing and is entirely consignment free. Specifically, a package is assigned to a taxi which is guided to deliver the package all along to its destination while transporting successive passengers. We tackle it with a two-phase solution, named \textbf{PPtaxi}. In the first phase, we use the Multivariate Gauss distribution and Bayesian inference to predict the passenger orders. In the second phase, both the computation efficiency and solution effectiveness are considered to plan package delivery routes. We evaluate \textbf{PPtaxi} with a real-world dataset from an online taxi-taking platform and compare it with multiple benchmarks. The results show that the successful delivery rate of packages with our solution can reach $95\%$ on average during the daytime, and is at most $46.9\%$ higher than those of the benchmarks.

cs.DC↗