L-overlay: A layered data management scheme for peer-to-peer computing

Mashayekhi, Hoda; Habibi, Jafar

doi:10.1007/s12083-013-0199-1

Cited by 2 publications

(1 citation statement)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As decentralized architecture, it avoids the drawbacks of conventional client-server model, such as the computation bottleneck on servers, and therefore greatly improved the efficiency of system computing performance [1] [2]. On receiving various requests in a P2P network, a peer faces the challenge as how to assign its data and resources [3] [4]. For instance, which peer would get service and which fragment of the shared content would be delivered.…”

Section: Introductionmentioning

confidence: 99%

Data Assignment Method Based on Probability Analysis in Peer-to-Peer Computing System

Yang¹,

Geng²

2016

Proceedings of the 6th International Conference on Information Engineering for Mechanics and Materials

View full text Add to dashboard Cite

Abstract. With greatly improved the efficiency of computing performance, Peer-to-Peer systems (P2P) have become hot research in recent years.In this paper, we analyze the probability of a peer to become a seed consisting of all sharing data and resource. Based on the modeled network, a distributed method for data processing is proposed to more efficiently assign the available resources, the data delivery traffic is more evenly distributed and fault tolerance property is well achieved.

show abstract

Section: Introductionmentioning

confidence: 99%

Data Assignment Method Based on Probability Analysis in Peer-to-Peer Computing System

Yang¹,

Geng²

2016

Proceedings of the 6th International Conference on Information Engineering for Mechanics and Materials

View full text Add to dashboard Cite

show abstract

P2P-PL: A pattern language to design efficient and robust peer-to-peer systems

Amoretti

Zanichelli

2017

Peer-to-Peer Netw. Appl.

View full text Add to dashboard Cite

To design peer-to-peer (P2P) software systems is a challenging task, because of their highly decentralized nature, which may cause unexpected emergent global behaviors. The last fifteen years have seen many P2P applications to come out and win favor with millions of users. From success histories of applications like BitTorrent, Skype, MyP2P we have learnt a number of useful design patterns. Thus, in this article we present a P2P pattern language (shortly, P2P-PL) which encompasses all the aspects that a fully effective and efficient P2P software system should provide, namely consistency of stored data, redundancy, load balancing, coping with asymmetric bandwidth, decentralized security. The patterns of the proposed P2P-PL are described in detail, and a composition strategy for designing robust, effective and efficient P2P software systems is proposed. ACM Subject Classification C.2.4 Distributed SystemsKeywords and phrases Peer-to-peer; Pattern language; Efficiency; Robustness IntroductionOver the last fifteen years, peer-to-peer (P2P) computing has become explosively popular, particularly for massive file sharing [23,32,13] and multimedia Internet streaming [19,40,42], whereas very high scalability has also been sought more recently in additional application domains, namely online gaming and location-aware services.As the P2P paradigm is gaining a forefront position in distributed computing techniques [67], it is important to recap good practices in P2P software system design and express them in terms of pattern language. Before reviewing previous P2P pattern languages and introducing our proposal for a P2P-PL, we deem necessary to illustrate the essential properties of a P2P system. A P2P network is a complex software system whose elements (peer nodes, or simply peers) cooperate by partitioning tasks and workloads, in order to ensure correctness, efficiency and robustness with invariance of scale. In the most radical view of P2P computing, peers participate in the application with equal privileges. Peers are said to form an overlay network of nodes, on top of the underlying computer (typically IP) network [69].Such a (well recognized) definition implies that peers share their resources: CPU, storage, bandwidth, cache, files, applications, services. Sharing implies that resources are discoverable. Some peers are greedy but share a minimal quantity of resources, which is why they are denoted as free riders. Usually, all peers implicitly provide basic shared resources (e.g., storage and bandwidth). We denote as consumable resources those that cannot be obtained by replication and can only be exploited upon contracting with their hosts. Usually, a limited number of peers can concurrently access the consumable resources of a peer. Services are special resources that can be grouped in two categories: distributed services, whose execution involves several peers, each one contributing with its basic shared resources, and local services, Resource sharing mechanisms in P2P software systems (P2P systems, hencefor...

show abstract

L-overlay: A layered data management scheme for peer-to-peer computing

Cited by 2 publications

References 20 publications

Data Assignment Method Based on Probability Analysis in Peer-to-Peer Computing System

Data Assignment Method Based on Probability Analysis in Peer-to-Peer Computing System

P2P-PL: A pattern language to design efficient and robust peer-to-peer systems

Contact Info

Product

Resources

About