The research focus of Peer-to-Peer (P2P) network design had long been on low-complexity content mapping and efficient search mechanisms. System such as CAN, Chord, Pastry are pioneers in the area and have been cited by almost every P2P work. These systems provide an efficient substrate for sharing/distributing small files like MP3 or images, because searching time is essential to the overall pe...

In this paper we show that gossip algorithms may be effectively used to disseminate game events in Peer-to-Peer (P2P) Multiplayer Online Games (MOGs). Game events are disseminated through an overlay network. The proposed scheme exploits the typical behavior of players to tune the data dissemination. In fact, it is well known that users playing a MOG typically generate game events at a rate that...

The entertainment industry, facing a formidable threat from peer-topeer piracy networks, is exploring every possible means to attack these networks. The industry is also employing defensive strategies to protect media and media players from those who would extract and copy their content. These content protection systems depend on the computer industry’s newly announced ‘trusted computing’ techn...

In this thesis, we discuss the implementation of a reputation system called Havelaar. The aim of Havelaar is to provide incentives for contributing in a peer-to-peer network, namely the new peer-to-peer overlay network Kangoo, which is currently being developed at ETH Zürich. First some general properties and problems of designing such a reputation system are shown, and we discuss related work ...

We present an application-level implementation of anycast for highly dynamic groups. The implementation can handle group sizes varying from one to the whole Internet, and membership maintenance is efficient enough to allow members to join for the purpose of receiving a single message. Key to this efficiency is the use of a proximity-aware peer-to-peer overlay network for decentralized, lightwei...

0957-4174/$ see front matter 2012 Elsevier Ltd. A http://dx.doi.org/10.1016/j.eswa.2012.12.077 q This work is supported by Science Foundation Irel I1407. ⇑ Corresponding author. Tel.: +353 1 716 5346. E-mail addresses: ursula.redmond@ucdconnect. [email protected] (P. Cunningham). There is an increasing focus on methods for network data analysis that consider temporal aspects of the data. We pro...

Peer-to-Peer Overlay networks enabling an endend application level-multicast service have drawn enormous attention. This paper proposes a self-organized < , >-Multicast Overlay Network (< , >-MON) that enables an efficient end-end application level multicast. The < , >-MON is organized into MON-Clusters, where is the maximum physical number of hops between any two endnodes in each MON-Cluster. ...

The Kad network is a structured P2P network used for file sharing. Research has proved that Sybil and Eclipse attacks have been possible in it until recently. However, the past attacks are prohibited by newly implemented security measures in the client applications. We present a new attack concept which overcomes the countermeasures and prove its practicability. Furthermore, we analyze the effi...

This paper describes a novel approach to network management topologies where multiple customized topologies are self-configured, self-optimized, and maintained automatically by the underlying network of elements. An implementation of these self-forming management topologies as developed in the Celtic European research project Madeira is described. The self-forming topologies use peer-to-peer co...

This paper proposes an abstract and generic topological model that captures the essence of P2P architecture. Such model should in return facilitate the exploitation of the new design space for more novel P2P systems. The paper also proposes a variant of the cube-connected cycles as a P2P overlay network that achieves O(log N) path length with O(1) neighbors. The simulation result has shown that...