Huawei

About: Huawei is a company organization based out in Shenzhen, China. It is known for research contribution in the topics: Terminal (electronics) & Signal. The organization has 41417 authors who have published 44698 publications receiving 343496 citations. The organization is also known as: Huawei Technologies & Huawei Technologies Co., Ltd..

MAGIC: A distributed MAx-Gain In-network Caching strategy in information-centric networks

Abstract: Information centric networks (ICNs) allow content objects to be cached within the network, so as to provide efficient data delivery. Existing works on in-network caches mainly focus on minimizing the redundancy of caches to improve the cache hit ratio, which may not lead to significant bandwidth saving. On the other hand, it could result in too frequent caching operations, i.e., cache placement and replacement, causing more power consumption at nodes, which shall be avoided in energy-limited data delivery environments, e.g., wireless networks. In this paper, we propose a distributed caching strategy along the data delivery path, called MAGIC (MAx-Gain In-network Caching). MAGIC aims to reduce bandwidth consumption by jointly considering the content popularity and hop reduction. We also take the cache replacement penalty into account when making cache placement decisions to reduce the number of caching operations. We compare our caching strategy with several state-of-art caching strategies in ICNs. Our results show that the MAGIC strategy can reduce up to 34.50% bandwidth consumption, save up to 17.91% server hit ratio, and reduce up to 38.84% caching operations compared with the existing best caching strategy when cache size is small, which is a significant improvement in wireless networks with limited cache size at each wireless node.

Efficient and Expressive Keyword Search Over Encrypted Data in Cloud

Abstract: Searchable encryption allows a cloud server to conduct keyword search over encrypted data on behalf of the data users without learning the underlying plaintexts. However, most existing searchable encryption schemes only support single or conjunctive keyword search, while a few other schemes that are able to perform expressive keyword search are computationally inefficient since they are built from bilinear pairings over the composite-order groups. In this paper, we propose an expressive public-key searchable encryption scheme in the prime-order groups, which allows keyword search policies (i.e., predicates, access structures) to be expressed in conjunctive, disjunctive or any monotonic Boolean formulas and achieves significant performance improvement over existing schemes. We formally define its security, and prove that it is selectively secure in the standard model. Also, we implement the proposed scheme using a rapid prototyping tool called Charm [37], and conduct several experiments to evaluate it performance. The results demonstrate that our scheme is much more efficient than the ones built over the composite-order groups.

Online flow size prediction for improved network routing

Abstract: We describe an emerging application of data mining in the context of computer networks. This application concerns the problem of predicting the size of a flow and detecting elephant flows (very large flows). Flow size is a very important statistic that can be used to improve routing, load balancing and scheduling in computer networks. Flow size prediction is particularly challenging since flow patterns continuously change and predictions must be done in real time (milliseconds) to avoid delays. We describe how to formulate the problem as an online machine learning task to continuously adjust to changes in flow traffic. We evaluate the predictive nature of a set of features and the accuracy of three online predictors based on neural networks, Gaussian process regression and online Bayesian Moment Matching on three datasets of real traffic. We also demonstrate how to use such online predictors to improve routing (i.e., reduced flow completion time) in a network simulation.

Method and system for routing control

Abstract: Embodiments of the present invention disclose a method for routing control applied to a communication system including a CS domain and an IMS and in which a Routing Policy Decision-making Point (RPDP) is set; and the method includes: initiating a routing query to the RPDP by an interrogation network unit in the communication system upon receiving a service request; making a routing decision by the RPDP according to routing decision-making related information and the routing policy information, returning the routing decision to the interrogation networking unit by the RPDP; and performing subsequent routing control by the interrogation network unit according to the routing decision. Embodiments of the present invention also disclose a system for routing control. In accordance with the embodiments of the present invention, across-domain routing control is thus realized in different network application environments according to different demands.

Outage Analysis of the Full-Duplex Decode-and-Forward Two-Way Relay System

Abstract: Contrary to the traditional theoretical analysis with perfect self-interference cancellation, this paper studies the outage performance of a full-duplex (FD) decode-and-forward two-way relay system with the consideration of the residual self-interference incurred by the FD mode. The exact closed-form outage probability expressions are derived in this paper. In addition, the asymptotic outage performance is investigated when the transmit powers increase to infinity, and the result demonstrates that the outage probabilities monotonically increase and finally converge to 1 as the transmit power exceeds a certain threshold. Furthermore, optimal power allocation schemes and optimal relay node placement strategies are then proposed to improve the outage performance. Finally, simulation results are conducted to verify the accuracy of the theoretical analysis.