One of the most fundamental tasks in the socially aware network (SAN) paradigm is to explore the attributes and behavior of users, which helps to design more suitable and efficient protocols. Particularly, detection of shilling attackers by mining users’ behavior is a frequently discussed topic in many social scenes like recommender systems based on collaborative filtering. As the performances of collaborative filtering are entirely based on ratings provided by users, they are vulnerable to shilling attacks which perform injection of biased profiles into rating databases to alter the systems. Current shilling attack detection methods detect spam users through artificially designed features, which are neither robust nor efficient enough. This paper illustrates a novel convolutional neural network-based method named CNN-SAD, which applies transformed network structure to exploit deep-level features from users rating profiles. Since the achieved deep-level features elaborate users rating more precisely than artificially designed features, CNN-SAD can detect shilling attacks more efficiently. According to the experimental results, the proposed method is capable of detecting the vast majority of obfuscated attacks precisely and outperforms other state-of-the-art algorithms, which contributes to applications and security in SAN.
With the rapid development of the Internet, more and more devices are being connected to the Internet, making up the Internet-of-Things (IoT). The accountability and privacy are two important but contradictory factors to ensure the security of IoT networks. How to provide an accountable anonymous access to IoT networks is a challenging task. Since the IoT network is largely driven by services, in this paper we propose a new and efficient architecture to achieve accountable anonymous access to IoT networks based on services. In this architecture, a self-certifying identifier is proposed to efficiently identify a service. The efficiency and overhead of the proposed architecture are evaluated by virtue of the real trace collected from an Internet service provider. The experimental results show that the proposed architecture could efficiently balance accountability and privacy with acceptable overheads.
In-network caching is a key feature of Information-Centric Networking (ICN). However, challenges still exist in ICN caching such as how to place content replicas among cache nodes to maximize cache system benefits without introducing too much overhead. In this paper, we formulate the content placement problem and propose a distributed probabilistic caching strategy to enhance cache efficiency. Each node makes cache decision individually and caches passing content with certain probability, which is proportional to content popularity and content placement benefit. As a component of our scheme, we also propose an accurate method to predict the variations of content popularity. Besides, a global-popularity-based caching scheme is proposed to be used as a benchmark for performance evaluation. We conduct extensive simulations based on ndnSIM and evaluate our scheme on tree, intra-AS and inter-AS topologies. Results indicate it outperforms the state-of-art schemes in terms of cache hit ratio, access latency, cache operation cost and link bandwidth savings. It can achieve dramatic performance improvement, even in the case of a small cache size. In particular, the reduction of caching operation can reach up to two orders of magnitude. We also examine the impacts of various replacement policies on cache performance and perform overhead analysis. Finally, we give a simplified implementation of our scheme and validate it via simulations.
Inbound load balancing plays an important role in improving the quality of experience for enterprise networks. Traditional traffic engineering approaches fail to achieve fine-grained inbound load balancing because they have limited capability of obtaining detailed network status and lack flexibility for traffic flow scheduling. In this paper, we adopt OpenFlow to achieve effective inbound load balancing. The potential of implementing OpenFlow in an enterprise network is explored to schedule traffic among different inbound links. We also investigate how to avoid frequent scheduling and the feasibility when applying this approach in real networks. In order to evaluate the proposed approach, an emulation platform is developed based on Mininet, POX and Open vSwitch. Emulation is conducted based on an actual network topology. Emulation results verify that the proposed approach is able to achieve effective load balancing for enterprise networks and avoid unnecessary flow scheduling.