Entity

Time filter

Source Type


Liu S.,Anhui University of Science and Technology | Hua B.,Suzhou Institute for Advanced Study
Proceedings - Conference on Local Computer Networks, LCN | Year: 2014

Network coding is a transmission mechanism for improving the capacity of multicast applications. Practical problems arise when applying network coding in traditional wired networks: multipath multicast routing, backward compatibility with deployed base, and adding new functions in commercial routers. SDN network naturally solves these problems via logically centralized control plane and open APIs of Openflow switches. This paper proposes NCoS, a framework for realizing network coding over SDN networks. It gives a brief introduction on how to extend Openflow protocol to include new actions, and add network coding related functions in controller and switches. © 2014 IEEE. Source


Zu Y.,Hefei University of Technology | Hua B.,Suzhou Institute for Advanced Study
Journal of Computational Information Systems | Year: 2015

The need for data compression has grown in the big data era for better utilization of network bandwidth and efficient data storage. The Deflate compression algorithm, made up of two main stages-LZSS compression and Huffman coding, is the most widely used data compression program. However, due to high computational overhead, data compression is seldom used in high-speed applications. In this paper, we focus on parallelizing Deflate algorithm on GPU with the NVIDIA CUDA framework to improve compression speed. In parallelizing LZSS, we redesign the dictionary to accelerate the locating of duplicate substring, and eliminate path divergence to accelerate the match of duplicate substring. In parallelizing Huffman coding, we utilize high efficient data structures and algorithms to optimize Huffman tree construction and variable-length encoding. As the first work on parallelizing Deflate algorithm on GPU, we compare our GPU-based Deflate with CPU-based GZIP, the most popular Deflate-based implementation. Experiments on an NVIDIA GTX 590 machine with 13 benchmark files from real world demonstrate the effectiveness of our method. © 2015, by Binary Information Press Source


He L.-B.,NHPCC | Huang L.-S.,Suzhou Institute for Advanced Study | Yang W.,Suzhou Institute for Advanced Study | Xu R.,Suzhou Institute for Advanced Study | Han D.-Q.,Suzhou Institute for Advanced Study
Quantum Information Processing | Year: 2012

We investigate the quantum sealed-bid auction protocol proposed by Zhao et al. (Opt Commun 283:1394, 2010). It uses M groups n-particle GHZ states to represent bids and a post-confirmation mechanism to guarantee the honesty of the quantum sealed-bid auction. However, in our opinion the protocol still does not complete the task of a sealed-bid auction fairly. It is shown that a large group of dishonest bidders can collude to obtain all the other one's secret bids before the opening phase of the auction with a probability polynomially close to one. Moreover, a simple feasible improvement of the protocol is proposed. © Springer Science+Business Media, LLC 2011. Source


Shi R.-h.,NHPCC | Shi R.-h.,Anhui Science and Technology University | Huang L.-s.,NHPCC | Huang L.-s.,Suzhou Institute for Advanced Study | And 3 more authors.
Optics Communications | Year: 2010

We present a multiparty quantum secret sharing scheme and analyze its security. In this scheme, the sender Alice takes EPR pairs in Bell states as quantum resources. In order to obtain the shared key, all participants only need to perform Bell measurements, not to perform any local unitary operation. The total efficiency in this scheme approaches 100% as the classical information exchanged is not necessary except for the eavesdropping checks. © 2010 Elsevier B.V. All rights reserved. Source


Shi R.-H.,NHPCC | Shi R.-H.,Anhui Science and Technology University | Huang L.-S.,NHPCC | Huang L.-S.,Suzhou Institute for Advanced Study | And 3 more authors.
Optics Communications | Year: 2010

We present an efficient scheme for sharing an arbitrary two-qubit quantum state with n agents. In this scheme, the sender Alice first prepares an n+2-particle GHZ state and introduces a Controlled-Not (CNOT) gate operation. Then, she utilizes the n+2-particle entangled state as the quantum resource. After setting up the quantum channel, she performs one Bell-state measurement and another single-particle measurement, rather than two Bell-state measurements. In addition, except that the designated recover of the quantum secret just keeps two particles, almost all agents only hold one particle in their hands respectively, and thus they only need to perform a single-particle measurement on the respective particle with the basis X. Compared with other schemes based on entanglement swapping, our scheme needs less qubits as the quantum resources and exchanges less classical information, and thus obtains higher communication efficiency. © 2010 Elsevier B.V. All rights reserved. Source

Discover hidden collaborations