Hui Tang

Chinese Academy of Sciences, Peping, Beijing, China

Are you Hui Tang?

Claim your profile

Publications (57)16.04 Total impact

  • [Show abstract] [Hide abstract]
    ABSTRACT: Information Centric Network (ICN) is an emerging network paradigm centered around the named contents rather than the host-to-host connectivity. The common characteristic of ICN leverages in-network caching to achieve an efficient and reliable content distribution but also brings challenges. The in-network caching technique equips all ICN routers with cache storage. However, no existing works focus on the cache storage sharing mechanism among different applications to satisfy the line speed requirements and diversity of applications in ICN. In this paper, we formulate the per-application storage management problem into an optimized resource allocation problem and introduce a manifold learning method to classify the priority of applications. Dynamic programming is adopted to solve the formulated problem and an adaptive per-application storage management scheme is proposed on the basis of the optimal solutions. Extensive experiments have been performed to evaluate the proposed scheme and show that our approach is superior to static partitioning and shared storage schemes.
    Future Generation Computer Systems 01/2014; 36:170–179. · 2.64 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: Content Centric Networking (CCN) is an emerging network architecture, shifting from an end-to-end connection to a content centric communication model. Each router in CCN has a content store module to cache the chunks passed by, and is arranged in an arbitrary network topology. It is important to allocate an appropriate cache size to each router in order to both improve the network performance and reduce the economic investment. Previous works have proposed several heterogeneous cache allocation schemes, but the gain brought by these schemes is not obvious. In this paper, we introduce a data mining method into the cache size allocation. The proposed algorithm uses manifold learning to analyze the regularity of network traffic and user behaviors, and classify routers based on their roles in the content delivery. Guided by the manifold learning embedding results, a novel cache size optimization scheme is developed. Extensive experiments have been performed to evaluate the proposed scheme. Simulation results show that the proposed scheme outperforms the existing cache allocation schemes in CCN.
    Journal of Network and Computer Applications 01/2014; 37:273–281. · 1.47 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: Coverage is an importance issue in wireless sensor networks. In this work, we first propose a novel notion of information coverage, which refers to the coverage efficiency of field information covered by deployed sensor nodes. On the basis of information coverage, we consider an optimization problem of how to partition the given field into multiple parcels and to deploy sensor nodes in some selected parcels such that the field information covered by the deployed sensor nodes meets the requirement. First, we develop two effective polynomial-time algorithms to determine the deployed locations of source nodes for information 1-coverage and q-coverage of the field, respectively, without consideration of communication, where information q-coverage implies that the field information in terms of information point is covered by at least q source nodes. Also, we prove the upper bound in the theoretical for the approximate solution derived by our proposed method. Second, another polynomial-time algorithm is presented for deriving the deployed locations of relay nodes. In the theoretical, this proposed algorithm can achieve the minimized number of relay nodes. Further, the related information 1-coverage algorithms are applied in our wireless sensor network-based automatic irrigation project in precision agriculture. Experimental results show the major trade-offs of impact factors in sensor deployment and significant performance improvements achieved by our proposed method. Copyright © 2013 John Wiley & Sons, Ltd.
    Wireless Communications and Mobile Computing 10/2013; · 0.86 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: Wireless sensor networks (WSNs) are attractive for monitoring and gathering physical information (e.g. temperature) via lots of deployed sensors. For the applications in WSNs, Web service is one of the recommended frameworks to publish, invoke, and manage services. However, the standard Web service description language (WSDL), defines only the service input and output while ignoring the corresponding input-to-output mapping relationships. This presents a serious challenge in distinguishing services with similar input and output interface. In this paper, we address this challenge by embedding the service policy into the traditional WSDL2.0 schema to describe the input-to-output mapping relationships. The service policy is then transformed into a policy binary tree so that the similarity between different Web services can be quantitatively evaluated. Furthermore, a new service redundancy detection approach is proposed based on this similarity. Finally, the case study and experimental analysis illustrate the applicability and capability of the proposed service redundancy detection approach.
    Journal of Network and Systems Management 09/2013; 21(3). · 0.43 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: Network virtualization aims to provide a way to overcome ossification of the Internet. However, making efficient use of substrate resources requires effective techniques for embedding virtual networks: mapping virtual nodes and virtual edges onto substrate networks. Previous research has presented several heuristic algorithms, which fail to consider that the attributes of the substrate topology and virtual networks affect the embedding process. In this paper, for the first time, we introduce complex network centrality analysis into the virtual network embedding, and propose virtual network embedding algorithms based on closeness centrality. Due to considering of the attributes of nodes and edges in the topology, our studies are more reasonable than existing work. In addition, with the guidance of topology quantitative evaluation, the proposed network embedding approach largely improves the network utilization efficiency and decreases the embedding complexity. We also investigate our algorithms on real network topologies (e.g., AT&T, DFN) and random network topologies. Experimental results demonstrate the usability and capability of the proposed approach.
    Frontiers of Computer Science (print) 06/2013; 7(3). · 0.41 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: Network virtualization has been a promising technology for overcoming the Internet impasse. A main challenge in network virtualization is the efficient assignment of virtual resources. Existing work focused on intra-domain solutions whereas inter-domain situation is more practical in realistic setting. In this paper, we present a distributed inter-domain framework for mapping virtual networks to physical networks which can ameliorate the performance of the virtual network embedding. The distributed framework is based on a Multi-agent approach. A set of messages for information exchange is defined. We design different operations and IPTV use scenarios to validate the advantages of our framework. Use cases shows that our framework can solve the inter-domain problem efficiently.
    Proc SPIE 03/2013;
  • [Show abstract] [Hide abstract]
    ABSTRACT: The traditional cross-layer model for video streaming can achieve significant improvement to the end-to-end video quality. However, the video quality measurement in terms of sum of squared error (SSE) in the model does not always correlate well with the perception of the human visual system. In this paper, we propose a perceptual quality driven cross-layer optimization scheme based on the structural similarity (SSIM) index for wireless video streaming. The H.264/AVC encoding parameters on the application layer and the modulation and channel coding modes on the physical layer are mainly considered to optimize the end-to-end perceptual video quality. In order to decrease the computation complexity, a low complexity optimization algorithm based on the rate-quantization (R-Q) model is proposed to reduce the range of the candidate optimization parameters. Experimental results show that the proposed SSIM-based cross-layer optimization scheme achieves better perceptual quality than the SSE-based cross-layer optimization scheme, and the proposed low complexity optimization algorithm can achieve about 62% computation decrease compared to the conventional exhaustive searching algorithm with little loss in perceptual quality.
    Consumer Communications and Networking Conference (CCNC), 2013 IEEE; 01/2013
  • [Show abstract] [Hide abstract]
    ABSTRACT: The SSIM-based rate distortion optimization (R-DO) has been proved to be an effective way to promote the perceptual video coding performance, and the Lagrange multiplier decision is the key to the SSIM-based RD-optimized video coding. Through extensively analyzing the characteristics of SSIM-based and SSE-based video distortions, this paper presents a low-complexity content-adaptive Lagrange multiplier decision method. The proposed method first estimates frame-level SSIM-based Lagrange multiplier by scaling the traditional SSE-based Lagrange multiplier with the ratio of SSE-based distortion to SSIM-based distortion. Via predicting the macroblock's perceptual importance in the whole frame, the macroblock-level Lagrange multiplier is further refined to promote the accuracy of the Lagrange multiplier decision. Experimental results show that the proposed method can obtain almost the same rate-SSIM performance and subjective quality as the state-of-the-art SSIM-based RD-optimized video coding methods with lower computation overheads.
    Circuits and Systems (ISCAS), 2013 IEEE International Symposium on; 01/2013
  • [Show abstract] [Hide abstract]
    ABSTRACT: To build the service-oriented applications in a wireless sensor network (WSN), the workflow can be utilized to compose a set of atomic services and execute the corresponding pre-designed processes. In general, WSN applications rely closely on the sensor data which are usually inaccurate or even incomplete in the resource-constrained WSN. Then, the erroneous sensor data will affect the execution of atomic services and furthermore the workflows, which form an important part in the bottom-to-up dynamics of WSN applications. In order to alleviate this issue, it is necessary to manage the workflow hierarchically. However, the hierarchical workflow management remains an open and challenging problem. In this paper, by adopting the Bloom filter as an effective connection between the sensor node layer and the upper application layer, a hierarchical workflow management approach is proposed to ensure the QoS of workflow-based WSN application. The case study and experimental evaluations demonstrate the capability of the proposed approach.
    Proceedings of the 12th Pacific Rim international conference on Trends in Artificial Intelligence; 09/2012
  • [Show abstract] [Hide abstract]
    ABSTRACT: With advance in mobile 3D display, mobile 3D video is already enabled by the wireless multimedia networking, and it will be gradually popular since it can make people enjoy the natural 3D experience anywhere and anytime. In current stage, mobile 3D video is generally delivered over the heterogeneous network combined by wired and wireless channels. How to guarantee the optimal 3D visual quality of experience (QoE) for the mobile 3D video streaming is one of the important topics concerned by the service provider. In this article, we propose a QoE-oriented transcoding approach to enhance the quality of mobile 3D video service. By learning the pre-controlled QoE patterns of 3D contents, the proposed 3D visual QoE inferring model can be utilized to regulate the transcoding configurations in real-time according to the feedbacks of network and user-end device information. In the learning stage, we propose a piecewise linear mean opinion score (MOS) interpolation method to further reduce the cumbersome manual work of preparing QoE patterns. Experimental results show that the proposed transcoding approach can provide the adapted 3D stream to the heterogeneous network, and further provide superior QoE performance to the fixed quantization parameter (QP) transcoding and mean squared error (MSE) optimized transcoding for mobile 3D video streaming.
    ACM Transactions on Multimedia Computing, Communications, and Applications (TOMCCAP). 09/2012; 8(3s).
  • [Show abstract] [Hide abstract]
    ABSTRACT: With the fast-pacing deployment of wireless sen-sor network(WSN) services, service ranking becomes more and more important. However, current service ranking methods mostly ignore the physical-level quality variation, making service ranking inaccurate. To address this problem, in this paper we propose a novel QoS-based ranking approach for WSN services, which employs the physical-level context awareness to improve the WSN service ranking. We separately calculate QoS assess-ment of each candidate service from users' perspective and physical-level context perspective. Through characterizing the impact of physical quality variation on QoS performance and user QoS assessment, a new scheme of QoS performance weighting is proposed to rank WSN candidate services. Experiments results show the effectiveness of our approach.
    Journal of Networks. 06/2012; 7(6).
  • [Show abstract] [Hide abstract]
    ABSTRACT: LISP is an important development and implementation effort toward the resolution to the Internet routing table scalable issues. Although the LISP is based on the idea of the Locator/ID separation, it could not support mobility very well until now. This paper proposes a novel dynamic mobility management scheme in LISP architecture. It improves the LISP by introducing three name spaces and two mapping systems. By dynamic configuring the IDs to the mobile nodes, the proposed scheme could provide flexible mobility support with lower overhead, while maintaining the scalability and aggregatability of the global ID/locator mapping system. Furthermore, a fast location update method is presented in the proposed scheme to provide smooth handover. The proposed scheme is evaluated by comparing with the LISP Mobile Node in handover cost and handover latency.
    Communications (APCC), 2012 18th Asia-Pacific Conference on; 01/2012
  • [Show abstract] [Hide abstract]
    ABSTRACT: Network virtualization provides a powerful way to run multiple heterogeneous virtual networks (VNs) at the same time on a shared substrate network. A major challenge in network virtualization is the efficient virtual network embedding: mapping virtual nodes and virtual edges onto substrate networks. Previous researches have presented several heuristic algorithms, which fail to consider the topology attributes of substrate and virtual networks. However, the topology information affects the performance of the embedding obviously. In this paper, for the first time, we exploit the topology attributes of substrate and virtual networks, introduce network centrality analysis into the virtual network embedding, and propose virtual network embedding algorithms based on closeness centrality. Due to considering the topology information, our study is more reasonable than the existing work in coordinating node and edge embedding. In addition, with the guidance of topology quantitative evaluation, the proposed network embedding approaches largely improve the network utilization efficiency and decrease the embedding complexity. Experimental results demonstrate the usability and feasibility of the proposed approach.
    Global Communications Conference (GLOBECOM), 2012 IEEE; 01/2012
  • [Show abstract] [Hide abstract]
    ABSTRACT: The PLCS (Playback Length Changeable Segmentation) algorithm was proposed to improve the success delivery rate of chunks in some important layers including the base layer for SVC based P2P streaming systems. In this paper, we make further research and propose a corresponding chunk scheduling algorithm named PLCCS (Playback Length Changeable Chunk Scheduling). In PLCCS, there are two scheduling windows on clients, including General Window and Emergent Window. Different scheduling strategies are adopted in the two windows to ensure the efficiency of data distribution as well as the playback fluency. Moreover, an adaptive strategy is used in General Window to accommodate the change of the network state. We evaluate the performance of PLCCS through simulations. The results show that compared with two representative EPLS based chunk scheduling algorithms, PLCCS can achieve better video quality on clients by at least 40%, and it decreases the useless packet ratio on clients by at least 15 times. Moreover, the adaptive strategy used in PLCCS makes it suitable to be applied in SVC based P2P streaming systems in heterogeneous network environments.
    Global Communications Conference (GLOBECOM), 2012 IEEE; 01/2012
  • [Show abstract] [Hide abstract]
    ABSTRACT: This article addresses cooperative video summary delivery over wireless networks which inherits advantages from both cooperative communication and video summarization. In this work, a novel decode-process-and-forward (DPF) scheme is proposed for video summary transmission, where a relay node with video processing capability is involved to generate a concise version of the summary frame, called summary of summary (SoS). The SoS information is effectively consumed by the destination side to enhance its error concealment capability, leading to an improved video reconstruction quality. This article proposes a generic crosslayer optimization framework for cooperative video summary transmission, which jointly considers the source coding, relay processing parameters, power allocation, and error concealment strategy to achieve the best video quality. The problem is solved by using Lagrangian relaxation and dynamic programming. Experimental results show that the proposed scheme significantly outperforms existing cooperative and non-cooperative transmission schemes.
    IEEE Wireless Communications 01/2012; 19(2):80-87. · 3.74 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: In wireless communication systems, the combination of multiple-input multiple-output (MIMO) with orthogonal frequency division multiplexing (OFDM) is regarded as one promising techniques to support high data rate and high performance. In such a situation, wireless multimedia services have spread widely over MIMO-OFDM systems. How to provide user-satisfied multimedia services over MIMO-OFDM systems has attracted increasingly attentions. Quality of experience (QoE) is the key criteria for evaluating users' satisfaction with multimedia services in terms of mean opinion score (MOS). In this paper, we propose a QoE-driven cross-layer optimized video transmission scheme over MIMO-OFDM systems. No-reference QoE estimation model is applied to acquire the expected MOS taking account of video content type (CT), frame rate (FR), video sending bit rate (SBR) and packet error rate (PER). The aim of our proposed scheme is to achieve user-satisfied video quality by jointly optimizing video coding parameters at the application layer and modulation and coding scheme (MCS) at the physical layer. The problem is formulated to find the optimal combination of parameters to maximize expected MOS with constraint of maximum transmission delay, and solved by improved traversal algorithm. Experimental results have shown significant performance enhancement of the proposed system based on H.264/AVC and NS2.
    Networks (ICON), 2012 18th IEEE International Conference on; 01/2012
  • [Show abstract] [Hide abstract]
    ABSTRACT: Information-Centric Network (ICN) aims to achieve the shift of communication model from host-centric to information-centric. In ICN, anycast plays an important role and is even regarded as a primary network primitive in some architectures such as DONA and SCAFFOLD. However, network layer anycast based on route-by-name in these architectures may severely worsen the problem of routing scalability as IP anycast does. On the other hand, the widely used application layer anycast based on lookup-by-name in current Internet exists many flaws such as inaccuracy of server selection and weak responsiveness to dynamic network conditions. Accordingly, how to achieve efficient and flexible anycast becomes a research challenge in future internet. In this paper, a novel anycast routing scheme based on ID/LOC separation is proposed. Then, a decentralized server selection algorithm based on Ant Colony Optimization (ACO) is further investigated. Experiments show that efficient and flexible anycast can be achieved to combine the advantages of route-by-name anycast and lookup-by-name anycast.
    Communications (APCC), 2012 18th Asia-Pacific Conference on; 01/2012
  • [Show abstract] [Hide abstract]
    ABSTRACT: As a long term solution to the gradual Internet ossification problem, virtual networks can guarantee on-demand requirements of diverse end user on a global level. Clearly it is a major challenge to achieve the automation and optimization of network management like virtual resources or QoS to ensure the personalized user satisfaction. In this article, we propose a novel cognitive management architecture to meet the future needs under a heterogeneous network environment. The architecture introduces a cognitive management cycle to the virtual network resources to ensure flexibility. We also focus on the efficient virtual network resource allocation and scheduling algorithms. Based on the complex network centrality analysis, we solve the virtual network resources allocation problem with consideration of the topology structure and statistical analysis. Finally we evaluate the efficiency and effectiveness of our algorithm on common benchmarks including the acceptance, revenue and cost.
    Globecom Workshops (GC Wkshps), 2012 IEEE; 01/2012
  • Qian Tan, Yanni Han, Hui Tang, Song Ci
    [Show abstract] [Hide abstract]
    ABSTRACT: By integrating different radio technologies, the heterogeneous wireless network is excepted to support end-to-end QoS and provide the “best” user experience. However these integrated networks have different access technologies and complex designed parameters. Current researches on the uncertain relationship among those parameters in such a dynamic and complicated system made it difficult to optimize the global network performance. As their inter-dependencies of each parameter may have a nonlinear relationship on the system performance metric of interest. This paper proposes a novel approach to analyze the global optimization problem in a heterogeneous network. We adopt a non-additive model based on Choquet integral to deal with the observed data in order to determine the network parameters' significance. By adjusting the most significant parameter, we can optimize network transfer performance. A simulation platform, which is deployed two applications such as voice and video conferencing, has been developed using OPNET to support our approach. Experimental evaluation shows that the proposed method's feasibility and effectiveness.
    Networks (ICON), 2012 18th IEEE International Conference on; 01/2012
  • [Show abstract] [Hide abstract]
    ABSTRACT: How to provide user-satisfied video services must be solved in the future wireless communication systems. However, most of existing works focused on the PHY-MAC cross layer schemes do not consider the end-to-end video quality of service (QoS) and hence can only provide limited user-perceived video quality improvements. In this paper, a novel video transmission scheme with guaranteed end-to-end QoS over Multiple Input Multiple Output and Orthogonal Frequency Division Multiplexing systems is proposed. The end-to-end video quality is measured by recursive optimal pixel estimation (ROPE) algorithm. Our objective is to minimize the ROPE distortion by jointly optimizing the source encoding parameters of H.264/AVC encoder in the application layer, the adaptive modulation and coding parameters and time-frequency resource block selection in the physical layer. The experimental results demonstrate that our proposed scheme can provide good user perceived quality.
    Multimedia and Expo (ICME), 2012 IEEE International Conference on; 01/2012

Publication Stats

92 Citations
16.04 Total Impact Points

Institutions

  • 2010–2014
    • Chinese Academy of Sciences
      • High Performance Network Laboratory
      Peping, Beijing, China
  • 2011–2013
    • Northeast Institute of Geography and Agroecology
      • • Institute of Acoustics
      • • High Performance Network Laboratory
      Peping, Beijing, China
  • 2009–2012
    • University of Nebraska at Lincoln
      • Department of Computer and Electronics Engineering
      Lincoln, Nebraska, United States