Gang Sun

TL;DR: This paper develops two solutions namely the 1-redundant scheme and the K-redundy scheme for surviving facility node failures while minimizing network resource costs and proposes efficient heuristics based on the MILP formulations.

TL;DR: This work first analyzes the current dummy-location selection (DLS) algorithman efficient location privacy preservation approach and design an attack algorithm for DLS (ADLS) for test emerging IoT security, and proposes a novel dummy location privacy-preserving (DLP) algorithm.

TL;DR: This paper first formulate the minimum-cost SVIM problem using mixed integer linear programming (MILP) and proposes an efficient heuristic solution to NSVIM, based on which two novel heuristic SVIM algorithms are proposed called Separate Optimization with Unconstrained Mapping (SOUM) and Incrementaloptimization with ConstrainedMapping (IOCM).

TL;DR: A novel theoretical model is provided to calculate the transaction latency under various network configurations such as block size, block interval, etc to help assess the effectiveness of the Fabric blockchain.

TL;DR: This paper proposes an improved serial migration strategy for migrating multiple VMs and introduces the post-copy migration scheme into it, and presents the m mixed migration strategy that is based on the improvedserial migration strategy and the parallel migration strategy.