Cross-Layer Peer-to-Peer Track Identification and Optimization Based on Active Networking

P2P applications appear to emerge as ultimate killer applications due to their ability to construct highly dynamic overlay topologies with rapidly-varying and unpredictable traffic dynamics, which can constitute a serious challenge even for significantly over-provisioned IP networks. As a result, ISPs are facing new, severe network management problems that are not guaranteed to be addressed by statically deployed network engineering mechanisms. As a first step to a more complete solution to these problems, this paper proposes a P2P measurement, identification and optimisation architecture, designed to cope with the dynamicity and unpredictability of existing, well-known and future, unknown P2P systems. The purpose of this architecture is to provide to the ISPs an effective and scalable approach to control and optimise the traffic produced by P2P applications in their networks. This can be achieved through a combination of different application and network-level programmable techniques, leading to a crosslayer identification and optimisation process. These techniques can be applied using Active Networking platforms, which are able to quickly and easily deploy architectural components on demand. This flexibility of the optimisation architecture is essential to address the rapid development of new P2P protocols and the variation of known protocols

Controlling P2P File-Sharing Networks Traffic

Since the appearance of Peer-To-Peer (P2P) file-sharing networks some time ago, many Internet users have chosen this technology to share and search programs, videos, music, documents, etc. The total number of P2P file-sharing users has been increasing and decreasing in the last decade depending on the creation or end of some well known P2P file-sharing systems. P2P file-sharing networks traffic is currently overloading some data networks and it is a major headache for network administrators because it is difficult to control this kind of traffic (mainly because some P2P file-sharing networks encrypt their messages). This paper deals with the analysis, taxonomy and characterization of eight Public P2P file-sharing networks: Gnutella, Freeenet, Soulseek, BitTorrent, Opennap, eDonkey, MP2P and FastTrack. These eight most popular networks have been selected due to their different type of working architecture. Then, we will show the amount of users, files and the size of files inside these file-sharing networks. Finally, several network configurations are presented in order to control P2P file-sharing traffic in the network.García Pineda, M.; Hammoumi, M.; Canovas Solbes, A.; Lloret, J. (2011). Controlling P2P File-Sharing Networks Traffic. Network Protocols and Algorithms. 3(4):54-92. doi:10.5296/npa.v3i4.1365S54923

A systematic survey of online data mining technology intended for law enforcement

As an increasing amount of crime takes on a digital aspect, law enforcement bodies must tackle an online environment generating huge volumes of data. With manual inspections becoming increasingly infeasible, law enforcement bodies are optimising online investigations through data-mining technologies. Such technologies must be well designed and rigorously grounded, yet no survey of the online data-mining literature exists which examines their techniques, applications and rigour. This article remedies this gap through a systematic mapping study describing online data-mining literature which visibly targets law enforcement applications, using evidence-based practices in survey making to produce a replicable analysis which can be methodologically examined for deficiencies

Abacus: Accurate behavioral classification of P2P-TV traffic

n/

フクセイ ニ ヨル フカ ブンサン オ カノウ ニ シタ P2P プロトコル ノ テイアン

P2Pシステムに対する効率的な負荷分散は重要な問題である。BATON では、各ノードが自律的に自身の持つ値の範囲を調整し、負荷分散を実現している。しかし、システム内に人気の高いオブジェクトが存在する場合、人気オブジェクトを持つノードのオブジェクト送信負荷が高くなってしまい、BATON の負荷分散だけでは対応しきれなくなってしまう恐れがある。本稿では、BATON にSCOPE で提供されている複製の分散管理手法を組み合わせ、人気オブジェクトを持つノードのオブジェクト送信負荷を、複製を持つノードに分散するP2P プロトコルを提案、検討し、今後考えなければならない課題を明らかにする。It is important to realize efficient load balancing mechanisms in P2P systems. BATON, a P2P system, supports a mechanism in which each node changes the range of objects to be managed autonomously. However, if there are nodes managing objects with high request rates in a network, the mechanism of BATON may fail to achieve good load balance because of the high loads for serving such objects. In this paper, we propose a P2P protocol in which we integrate a method of replica management proposed by SCOPE into BATON and discuss issues for developing a system with good load balance mechanisms

Efficient algorithms for passive network measurement

Network monitoring has become a necessity to aid in the management and operation of large networks. Passive network monitoring consists of extracting metrics (or any information of interest) by analyzing the traffic that traverses one or more network links. Extracting information from a high-speed network link is challenging, given the great data volumes and short packet inter-arrival times. These difficulties can be alleviated by using extremely efficient algorithms or by sampling the incoming traffic. This work improves the state of the art in both these approaches. For one-way packet delay measurement, we propose a series of improvements over a recently appeared technique called Lossy Difference Aggregator. A main limitation of this technique is that it does not provide per-flow measurements. We propose a data structure called Lossy Difference Sketch that is capable of providing such per-flow delay measurements, and, unlike recent related works, does not rely on any model of packet delays. In the problem of collecting measurements under the sliding window model, we focus on the estimation of the number of active flows and in traffic filtering. Using a common approach, we propose one algorithm for each problem that obtains great accuracy with significant resource savings. In the traffic sampling area, the selection of the sampling rate is a crucial aspect. The most sensible approach involves dynamically adjusting sampling rates according to network traffic conditions, which is known as adaptive sampling. We propose an algorithm called Cuckoo Sampling that can operate with a fixed memory budget and perform adaptive flow-wise packet sampling. It is based on a very simple data structure and is computationally extremely lightweight. The techniques presented in this work are thoroughly evaluated through a combination of theoretical and experimental analysis.Postprint (published version

Efficiency of BitTorrent-like peer-to-peer live streaming systems

From the past few years, peer-to-peer (P2P) applications have becoming well-liked magnificently. BitTorrent (BT) has one of the most effective mechanisms for P2P content distribution among all P2P applications. In P2P applications, each node plays a role both as a client and a server simultaneously, comparing to the traditional client-server systems, where every node has only one responsibility to act as either a client or a server. Therefore, in P2P applications, the upload bandwidth of each peer can be counted as a significant resource of the network. Although BT was created for file-sharing purposes at the beginning, which is a time-insensitive distribution, after a while, it has attracted the attentions to be use for video/audio streaming purposes too, which are time-sensitive. The importance of this capability is that peers now, can be able to watch, or listen to, their favorite live streaming content concurrently. Motivated by this fact, a stochastic model for a BT-based P2P live streaming system is proposed and numerically solved and based on what we gain, it is also shown how the performance of the system can be affected by different parameters of the system (such as the number of neighbors, delay time, size of the buffer, etc.). Moreover, we also try to apply some minor changes needed in the BitTorrent's mechanisms, in order to support the video/audio streaming more efficiently

Physical World Assumptions and Software World Realities (And Why There Are More P2P Software Providers Than Ever Before)

Rights holders have been successful in every major copyright action brought against peer-to-peer (P2P) software providers. By 2005, those behind Napster, Aimster, Grokster, Morpheus and Kazaa have each been held liable for their users' infringements and effectively exited the market. But those successes did not result in any reduction in the availability of P2P file sharing software. In fact, the opposite occurred: soon after the U.S. Supreme Court ruled in favor of rights holders in Grokster, there was exponential growth in the number of P2P file sharing applications available. This Article argues that this came about because the pre-P2P and current U.S. secondary liability laws were and are based on a number of physical world assumptions that are simply not tenable in the software context. After identifying those assumptions, and contrasting them with the relevant software world realities, the Article demonstrates that the explosion in the number and availability of P2P apps can be traced directly to the Supreme Court's failure to recognize the mismatch between the two paradigms