TPII: tracking personally identifiable information via user behaviors in HTTP traffic

It is widely common that mobile applications collect non-critical personally identifiable information(PII)from users'devices to the cloud by application service providers(ASPs)in a positive manner to provide precise and recommending services.Meanwhile,Internet service providers(ISPs)or local network providers also have strong requirements to collect PIIs for finer-grained traffic control and security services.However,it is a challenge to locate PIIs accurately in the massive data of network traffic just like looking a needle in a haystack.In this paper,we address this challenge by presenting an efficient and light-weight approach,namely TPII,which can locate and track PIIs from the HTTP layer rebuilt from raw network traffics.This approach only collects three features from HTTP fields as users'behaviors and then establishes a tree-based decision model to dig PIIs efficiently and accurately.Without any priori knowledge,TPII can identify any types of PIIs from any mobile applications,which has a broad vision of applications.We evaluate the proposed approach on a real dataset collected from a campus network with more than 13k users.The experimental results show that the precision and recall of TPII are 91.72%and 94.51%respectively and a parallel implementation of TPII can achieve 213 million records digging and labelling within one hour,reaching near to support 1Gbps wirespeed inspection in practice.Our approach provides network service providers a practical way to collect PIIs for better services.     

An energy minimization algorithm based on distributed dynamic clustering for long term evolution(LTE) heterogeneous networks

Energy saving has become an important issue in wireless communications from both environment and economic considerations. In this paper, an energy minimization algorithm based on distributed dynamic clustering(DDCEM) with lower complexity, higher performance, and better adaptability for heterogeneous network(Het Net) is proposed. A Het Net could be divided into several clusters, which is defined as one group of a network node and users served by the node. A energy efficient user association, which dynamically changes according to real-time energy efficiency(EE) evaluation with traffic load and location distribution of each cluster, can be employed to save consumed energy. Then, the optimal sleeping relay is found as follows. First,the sleeping probability cost of each relay station(RS) is computed and ranked based on the user traffic and the position distribution of each cluster, and the relay with minimum sleeping probability is selected to be switched off. Hence, the sleep node is selected taking into account the traffic load and location of the Evolved Node B(e NB) and all the RSs. The complexity of the algorithm is greatly reduced because the user association operation and network load evaluation are fulfilled cluster by cluster. Simulation results show that the proposed DDCEM strategy offers EE gain with low system complexity.     

METrust: A mutual evaluation-based trust model for P2P networks

It is necessary to construct an effective trust model to build trust relationship between peers in peer-to-peer (P2P) network and enhance the security and reliability of P2P systems. The current trust models only focus on the consumers evaluation to a transaction, which may be abused by malicious peers to exaggerate or slander the provider deliberately. In this paper, we propose a novel trust model based on mutual evaluation, called METrust, to suppress the peers malicious behavior, such as dishonest evaluation and strategic attack. METrust considers the factors including mutual evaluation, similarity risk, time window, incentive, and punishment mechanism. The trust value is composed of the direct trust value and the recommendation trust value. In order to inhibit dishonest evaluation, both participants should give evaluation information based on peers own experiences about the transaction while computing the direct trust value. In view of this, the mutual evaluation consistency factor and its time decay function are proposed. Besides, to reduce the risk of computing the recommendation trust based on the recommendations of friend peers, the similarity risk is introduced to measure the uncertainty of the similarity computing, while similarity is used to measure credibility. The experimental results show that METrust is effective, and it has advantages in the inhibition of the various malicious behaviors.     

Optimization management of hybrid energy source of fuel cell truck based on model predictive control using traffic light information

Energy optimization management can make fuel cell truck (FCT) power system more efficient, so as to improve vehicle fuel economy. When the structure of power source system and the torque distribution strategy are determined, the essence is to find the reasonable distribution of electric power between the fuel cell and other energy sources. The paper simulates the assistance of the intelligent transport system (ITS) and carries out the eco-velocity planning using the traffic signal light. On this basis, in order to further improve the energy efficiency of FCT, a model predictive control (MPC)-based energy source optimization management strategy is innovatively developed, which uses Dijkstra algorithm to achieve the minimization of equivalent hydrogen consumption. Under the scenarios of signalized intersections, based on the planned eco-velocity, the off-line simulation results show that the proposed MPC-based energy source management strategy (ESMS) can reduce hydrogen consumption of fuel cell up to 7\% compared with the existing rule-based ESMS. Finally, the Hardware-in-the-Loop (HiL) simulation test is carried out to verify the effectiveness and real-time performance of the proposed MPC-based energy source optimization management strategy for the FCT based on eco-velocity planning with the assistance of traffic light information.     

A fast network partition method for large-scale urban traffic networks

In order to control the large-scale urban traffic network through hierarchical or decentralized methods, it is necessary to exploit a network partition method, which should be both effective in extracting subnetworks and fast to compute. In this paper, a new approach to calculate the correlation degree, which determines the desire for interconnection between two adjacent intersections, is first proposed. It is used as a weight of a link in an urban traffic network, which considers both the physical characteristics and the dynamic traffic information of the link. Then, a fast network division approach by optimizing the modularity, which is a criterion to distinguish the quality of the partition results, is applied to identify the subnetworks for large-scale urban traffic networks. Finally, an application to a specified urban traffic network is investigated using the proposed algorithm. The results show that it is an effective and efficient method for partitioning urban traffic networks automatically in real world.     

Communication network designing:Transmission capacity,cost and scalability

Despite the growing number of works centering around the traffic dynamics on complex networks,these researches still have some common shortcomings,e.g.,too simple traffic flow model and lack of considerations for the designing cost and scalability issues.This paper builds on a more realistic traffic flow model,and offers a holistic view on the network designing problem.In addition to the extensively studied transmission capacity,this paper takes designing cost and scalability as two other designing objectives,and presents a quantitative study of how different designing choices independently and collectively influence these objectives by the introduction of a cartesian coordinate system.It is shown that different kinds of network topologies display different shapes of achievable solution spaces and exhibit different abilities to achieve cost-effective and scalable designing.In particular,we find the philosophy underlying empirical network designing and engineering today fails to meet the cost-effective and scalable designing requirements,and propose a cost-effective and scalable designing scheme for BA-like networks,i.e.,the efficient routing combined with effective betweenness based link bandwidth allocation.In addition,when designing a thoroughly new network from the beginning,we find that ER network is a good candidate to achieve cost-effective and scalable designing in most settings.     

A load balancing multi-path routing scheme based on effective voids for optical burst switching networks

Multi-path routing in the optical burst switching(OBS) networks can reduce the burst loss probability(BLP) by distributing the data burst traffic to multiple paths, compared with single path routing. Unlike the other multi-path routing schemes without considering the carrying capability of the routes, a new multi-path routing scheme based on effective voids(MPEV) is proposed to balance the load of multi-path and reduce the BLP in the paper. MPEV scheme first obtains the information on effective voids of the bottleneck link of multipath by sending a probe packet periodically. The effective voids can accommodate data bursts and accurately represent the available channel resource that is the main determinant of the BLP for OBS networks without optical random access memory. Then MPEV scheme distributes the burst traffic between an ingress node and an egress node to multiple link-disjoint paths by the ratio of the effective voids. More traffic is distributed to the path that has more effective voids, and vice versa. And the distributed amount is proportional to the effective voids of the bottleneck link. So MPEV scheme can balance the load of multi-path routes and can effectively reduce the BLP by avoiding the high load of a single path. And it is easy to implement and agilely adapt to dynamic network traffic. The performance of MPEV scheme is analyzed by queuing theory and is evaluated by simulation. The numerical results show that the proposed scheme can effectively reduce the BLP and balance the traffic load over multiple paths at the same time.     

Survey on Anonymity in Unstructured Peer-to-Peer Systems

Although anonymizing Peer-to-Peer （P2P） networks often means extra cost in terms of transfer efficiency, many systems try to mask the identities of their users for privacy consideration. By comparison and analysis of existing approaches, we investigate the properties of unstructured P2P anonymity, and summarize current attack models on these designs. Most of these approaches are path-based, which require peers to pre-construct anonymous paths before transmission, thus suffering significant overhead and poor reliability. We also discuss the open problems in this field and propose several future research directions.     

Resource management in radio access and IP-based core networks for IMT Advanced and Beyond

The increased capacity needs, primarily driven by content distribution, and the vision of Internet-of-Things with billions of connected devices pose radically new demands on future wireless and mobile systems. In general the increased diversity and scale result in complex resource management and optimization problems in both radio access networks and the wired core network infrastructure. We summarize results in this area from a collaborative Sino-Swedish project within IMT Advanced and Beyond, covering adaptive radio resource management, energy-aware routing, OpenFlow-based network virtualization, data center networking, and access network caching for TV on demand.     

具有通信约束的网络化控制系统容错控制研究

Implementing a control system over a communication network induces inevitable time delays that may degrade performance and even cause instability. One of the most effective ways to reduce the negative effect of delays on the performance of networked control system (NCS) is to reduce network traffic. In this paper, adjustable deadbands are explored as a solution to reduce network traffic in NCS. A method of fault-tolerant control of networked control system is presented, which takes into account system response as well as network traffic. The integrity design for a kind of NCS with sensor failures and actuator failures is analyzed based on robust fault-tolerant control theory and information scheduling. After detailed theoretical analysis, the paper also provides the simulation results, which further validate the proposed scheme.     

P2P流量优化

基于peer-to-peer(P2P)技术的内容分发系统已成为互联网内容分发的重要形式,它能大幅减轻P2P内容提供商的分发代价,提高系统的可扩展性.但是,覆盖网络和底层网络的失配导致了网络资源的浪费,产生了大量的冗余流量,激化了P2P内容提供商和网络运营商(ISP)之间的矛盾.因此,如何有效利用底层网络的带宽资源,降低P2P内容分发系统对ISP网络的流量压力,是P2P系统得以良性和可持续发展的关键.本文综述了P2P内容分发系统流量优化的相关技术研究现状.从P2Pcache、位置感知技术和数据调度算法3个维度出发详细阐述了不同的技术在P2P流量优化中的作用,对各种技术进行了详细的综述和对比分析,探讨了各种技术的适用环境,指出了存在的问题和未来内容分发的发展方向.     

Optimally designing caches to reduce P2P traffic

Traffic caused by P2P services dominates a large part of traffic on the Internet and imposes significant loads on the Internet, so reducing P2P traffic within networks is an important issue for ISPs. In particular, a huge amount of traffic is transferred within backbone networks; therefore reducing P2P traffic is important for transit ISPs to improve the efficiency of network resource usage and reduce network capital cost. To reduce P2P traffic, it is effective for ISPs to implement cache devices at some router ports and reduce the hop length of P2P flows by delivering the required content from caches. However, the design problem of cache locations and capacities has not been well investigated, although the effect of caches strongly depends on the cache locations and capacities. We propose an optimum design method of cache capacity and location for minimizing the total amount of P2P traffic based on dynamic programming, assuming that transit ISPs provide caches at transit links to access ISP networks. We apply the proposed design method to 31 actual ISP backbone networks and investigate the main factors determining cache efficiency. We also analyze the property of network structure in which deploying caches are effective in reducing P2P traffic for transit ISPs. We show that transit ISPs can reduce the P2P traffic within their networks by about 50-85% by optimally designing caches at the transit links to the lower networks.     

基于P4P的CDN系统中内容分发节点选择算法

对内容分发网络(CDN)和对等网络(P2P)分别进行了分析对比,指出了它们各自的优缺点,并根据电信运营商主动参与P2P网络(P4P)技术的特点,给出了一种结合P4P、P2P与CDN技术的混合系统的设计方案,以及混合系统中协助CDN节点分发内容节点(伪CDN节点)的选择算法.该算法利用P4P技术获得运营商提供的网络信息,选择合适的边缘节点,贡献出其容量和带宽,为其他节点服务,以减少了系统边缘代理服务器的数量,增大系统容量,同时减少网络骨干网上的负载.模拟实验分析了考虑底层网络情况后,系统在链路花费、时间花费上的改进,结果表明该算法减少了跨网络运营商(ISP)流量,提高了系统性能.     

Characterization of community based-P2P systems and implications for traffic localization

In this paper, we present one of the first and most extensive characterizations of closed community-based P2P systems. Such systems are organic groups of peer-to-peer (P2P) clients, which can be joined only by users belonging to a certain network (e.g., connected to a given Internet Service Provider (ISP)). A number of factors motivate the growth of these communities, such as quality of content, anonymity of transfers, and the potential for better performance that enhances user experience. Our study is conducted in two contrasting environments—a campus network and a national ISP—located in different continents. In both cases, large-scale closed communities have been found to be the predominant P2P systems in use. We shed light both on the factors motivating the growth of such communities, and present results characterizing the extensiveness of their usage, the performance achievable by the systems, and the implications of such communities for network providers. While our findings are interesting in their own right, they also offer important lessons for ongoing research that seeks to localize traffic within ISP boundaries. In particular, our results suggest that (i) in ISPs with heterogeneous access technologies, the performance benefits to users on localizing P2P traffic is largely dependent on the degree of seed-like behavior of peers behind high-bandwidth access technologies; and (ii) while localization can reduce the traffic on Internet peering links, it has the potential to cause a significant increase in traffic on internal links of providers, potentially requiring upgrades of network links.     

一种P2P和ISPs协作的P2P节点选择机制

引入ISP跳数(IH)来衡量在自治系统(AS:Autonom ous System)拓扑中位于不同位置的AS跳数的开销,并引入了骨干链接开销(CBC)来衡量P2P应用通过的骨干网络数量.借助于IH和CBC两个参数分析了P2P应用对ISPs流量的影响.并且在此基础上设计一个新的机制,命名为ISP-DDHA.在ISP-DDHA中,针对主要参数设计了相应的路由选择算法,用来改进ISPs和P2P系统性能.实验结果表明:在某些P2P流量负载较大的网络场景中,相比[7],ISP-DDHA可以减少约7.4%的DAH开销、12.1%的IH开销和10.4%的CBC开销.     

改进的图半监督支持向量机用于P2P网络流识别

对于机器学习在P2P网络流识别中需要大量标记训练数据的问题,提出一种基于改进图半监督支持向量机的P2P流识别方法。采用自动调节的高斯核函数计算少量标识数据和大量未标识训练样本之间的相似距离以构建图模型,并在标记传播过程中嵌入训练样本局部分布信息以获取未标记样本的标识;在此基础上使用所有已标记样本对SVM训练实现P2P网络流识别。实验结果表明该方法能够兼顾整个训练样本集的信息,在提高SVM识别精度的同时,极大降低了人工标记训练样本的成本。     

A research on dynamic allocation of network resources based on P2P traffic planning

With the rapid development of P2P applications, its consumption of bandwidth resources brought increasing pressures to ISPs. How to manage P2P traffic efficiently, both to improve the efficiency of network and to protect the interests of P2P users, is widely concerned by industry and academia. Although some traffic planning scheme to the P2P apps such as P4P can alleviate the pressure on bandwidth resources to some extent, it requires deep cooperation between ISPs and P2P service providers. Therefore it has some limitations to independent DPI strategies. In addition, there is no flow planning strategies which can rapidly response to ISPs’ QOS requirements such as sudden changes of bandwidth reservation and so on. This paper analyses current mainstream P2P optimization strategies, and then put forward a network resources dynamic allocation (NRDA) technology based on the deployment of P2P traffic stand on the ISPs’ position. This technology enables ISPs to have the ability to manage the P2P traffic on the specified links independently and efficiently, especially for the rapid response of unexpected resource requirements. NRDA implements an overall planning of network resources and makes the network flexible, provides the resource planning ability to the ISPs.     

P2P技术分析与流量管理研究

随着P2P应用的日益流行,P2P流量消耗了网络的大量带宽,已经影响到了互联网传统业务的服务质量。为解决这一问题,网络运营者和研究人员在P2P流量的管理技术上进行了大量的探索研发工作,主要有P2P流量阻塞、缓存和本地化疏导等技术。首先对P2P技术做了简单概述,然后分析了影响P2P流量分布的重要技术因素,之后综述了最新的P2P流量管理技术,最后做了总结。     

基于节点连接度的P2P流量快速识别方法

为实现快速有效的P2P流量识别,提出一种基于节点连接度的识别方法。根据不同P2P流量的连接度特点,通过实验分析得到相关的流量属性,对属性进行关联,由此区分网络中的P2P流量及非P2P流量,并通过分析P2P下载与P2P流媒体的行为特性,证明P2P 下载的流量属性具有相似性,与P2P流媒体的流量属性相差较大。仿真实验结果证明,该方法具有较好的实时性和准确性。     

一种基于SVM的P2P网络流量分类方法

提出一种基于SVM的P2P网络流量分类的方法。这种方法利用网络流量的统计特征和基于统计理论的SVM方法,对不同应用类型的P2P网络流量进行分类研究。主要对文件共享中的BitTorrent,流媒体中的PPLive,网络电话中的Skype,即时通讯中的MSN4种P2P网络流量进行分类研究。介绍了基于SVM的P2P流量分类的整体框架,描述了流量样本的获取及处理方法,并对分类器的构建及实验结果进行了介绍。实验结果验证了提出方法的有效性,平均分类精确率为92.38%。