by Deri, Luca

One problem encountered while monitoring gigabit networks, is the need to filter only those packets that are interesting for a given task while ignoring the others. Popular packet filtering technologies enable users to specify complex filters but do not usually allow multiple filters to be specified. This paper describes the design and implementation of a new dynamic packet filtering solution that allows users to specify several IP filters simultaneously with almost no packet loss even on highly-loaded gigabit links. The advantage is that modern traffic monitoring applications such as P2P, IPTV, and VoIP, monitoring and lawful interception can dynamically set packet filters to efficiently discard packets into the operating system kernel according to traffic, calls, and users being monitored.

DOI: 10.1007/s10922-007-9070-0
Online Date: 6/28/2007
Print publication date: 9/1/2007
View article on SpringerLink

by Ruffo, Giancarlo; Schifanella, Rossano

The technical impact of the Peer-to-Peer (P2P) paradigm on content distribution applications has been proved successful and efficient, when participants cooperation is achieved. Conversely, the business model is not clear: given a copy-protected object, its owner must be paid back for each transaction taking place from a provider to a receiver. The P2P paradigm assumes that a receiver turns into a provider, but it is questionable why she/he should provide properly the content, if the owner wants to be reimbursed. Actual systems introduce fairness, giving incentives (e.g., a differential service, like in BitTorrent) to altruistic peers, with the consequence that the owner of an object is economically damaged everyday. Hence, music and film industry sees P2P techniques as a hostile framework for distributing copy protected content for free: today’s answer of the industry is investing in DRM-based solutions, that are not interoperable between different devices and players. In this paper, we present FairPeers, a P2P market framework, that joins a straightforward intellectual property protection and a fair economic model by maintaining the efficiency typical of P2P file sharing systems. The study is completed with an exhaustive security analysis, and the description of a prototype implementation that shows that the P2P paradigm is mature enough to present to the broadest community new revenue models, simply using available tools and state-of-the-art techniques.

DOI: 10.1007/s10922-007-9066-9
Online Date: 6/21/2007
Print publication date: 9/1/2007
View article on SpringerLink

by Exarchakos, Georgios; Antonopoulos, Nick

Resource requirements and availability in heterogeneous networks may frequently vary over their lifetime; thus producing equally variant overloaded and under-loaded situations. Typical architectures cannot cope with the frequent availability fluctuation of reusable, non-replicable and highly dynamic resources (such as network capacity). This paper proposes an unstructured P2P overlay for sharing resources between underutilized and overloaded networks. Its aim is to satisfy the excessive resource demands of some networks by using free resources from others given the high failure rate and unstable availability of these resources in wide networks. We describe and analyze the proposed Capacity Sharing Overlay Architecture and show, with extensive simulations, its ability to provide remote underutilized capacity to underlying networks, even in the presence of high node failure rates, helping the networks to handle more user queries.

DOI: 10.1007/s10922-007-9069-6
Online Date: 6/21/2007
Print publication date: 9/1/2007
View article on SpringerLink

by Ahmed, Toufik; Mushtaq, Mubashar

Peer-to-peer (P2P) paradigm has recently gained tremendous attraction and is widely used for content distribution and sharing. The future multimedia communication applications have to support the user’s needs, the terminal capabilities, the content specification and the underlying networking technologies. They should be network-aware, topology-aware, and end-user-centric. Thus, in this paper, we use the characteristics of the object-based encoding scheme and P2P network topology to propose adaptive content delivery architecture for P2P networks. We propose an efficient mechanism for transmission of real-time content over P2P networks, called POEMS (P2P Object-based adaptivE Multimedia Streaming). This object-based audio-visual quality adaptive mechanism over P2P networks is media-aware, network-aware, and user-centric that is carried-out through (1) selection of appropriate sending peers willing to participate in the streaming mechanism, (2) organization of sending peers by constructing an overlay network to facilitate content delivery and adaptation, (3) dynamicity management of peers when some peer enters or leaves the system to maintain an acceptable level of perceived video quality, and (4) ensuring the end-to-end QoS (Quality of Services) by orchestrating the overall streaming mechanism. The obtained results demonstrate that combining content adaptation using object-based encoding and advance network-aware peers selection based on peer monitoring leads to intelligent, efficient, and large-scale support of multimedia services over complex network architectures.

DOI: 10.1007/s10922-007-9068-7
Online Date: 6/21/2007
Print publication date: 9/1/2007
View article on SpringerLink

by Leng, Xiaoxiang; Bi, Jun; Zhang, Miao; Wu, Jianping

During the transition from IPv4 to IPv6, the IPv6 islands inside the IPv4 networks need to communicate with each other and with the native IPv6 network. The drawback of existing IPv6 transition methods is that relay gateways become potential communication bottlenecks. In this paper, a new method—PS64—is presented to connect IPv6 islands together over IPv4 network and reduce the reliance on these relays by shifting the burden to edge gateways on each island. In this method, direct tunnels are set up between the IPv6 islands, and a P2P network is maintained between edge gateways of these islands to propagate information of tunnel end points. After describing the algorithm, we analyze the connectivity of the P2P network, the scalability of this algorithm, and present the prototype and experiments. The results of our analysis and experiments show that the proposed method is reliable, scalable and effective. Obviously, this technique works for all IPvX over IPvY situations.

DOI: 10.1007/s10922-007-9071-z
Online Date: 6/21/2007
Print publication date: 9/1/2007
View article on SpringerLink

by Ghamri-Doudane, Samir; Agoulmine, Nazim

Recently, Peer-to-Peer (P2P) has become a popular paradigm for building distributed systems, aiming to provide resource localization and sharing in large-scale networks. However, advanced searching for resources remains an open issue. The flooding technique used by some P2P systems is expensive in bandwidth usage, and shows a serious lack in scalability. Also, more efficient systems based on distributed hash tables (DHT) lack in query expressiveness and flexibility. This paper addresses this issue by discussing existing solutions, and proposing a novel approach to support advanced multi-keyword queries in the context of P2P systems. It extends the existing, and widely established DHT-based localization frameworks. This new approach provides an effective resource localization framework; it can substantially reduce bandwidth consumption and improve load balancing over the network. Moreover, various kinds of applications can be deployed on top of this generic framework. As a relevant use case, this paper describes a novel service discovery and management application.

DOI: 10.1007/s10922-007-9067-8
Online Date: 6/21/2007
Print publication date: 9/1/2007
View article on SpringerLink