A Semi-structured Overlay Network for Large-Scale Peer-to-Peer Systems

2012 ◽  
pp. 83-94
Author(s):  
Kousaku Kimura ◽  
Satoshi Amamiya ◽  
Tsunenori Mine ◽  
Makoto Amamiya
Keyword(s):  
Large Scale ◽  
Overlay Network ◽  
Peer To Peer ◽  
Structured Overlay ◽  
Peer To Peer Systems

HIERARCHICAL PEER-TO-PEER SYSTEMS

2003 ◽  
Vol 13 (04) ◽  
pp. 643-657 ◽  
Author(s):  
L. GARCÉS-ERICE ◽  
E. W. BIERSACK ◽  
K. W. ROSS ◽  
P. A. FELBER ◽  
G. URVOY-KELLER
Keyword(s):  
Hash Table ◽  
Overlay Network ◽  
Peer To Peer ◽  
Distributed Hash Table ◽  
Hierarchical Design ◽  
P2p Systems ◽  
Lookup Services ◽  
Peer To Peer Systems ◽  
Responsible Group ◽  
Overlay Management

Structured peer-to-peer (P2P) lookup services organize peers into a flat overlay network and offer distributed hash table (DHT) functionality. Data is associated with keys and each peer is responsible for a subset of the keys. In hierarchical DHTs, peers are organized into groups, and each group has its autonomous intra-group overlay network and lookup service. Groups are organized in a top-level overlay network. To find a peer that is responsible for a key, the top-level overlay first determines the group responsible for the key; the responsible group then uses its intra-group overlay to determine the specific peer that is responsible for the key. We provide a general framework for hierarchical DHTs with scalable overlay management. We specifically study a two-tier hierarchy that uses Chord for the top level. Our analysis shows that by using the most reliable peers in the top level, the hierarchical design significantly reduces the expected number of hops. We also present a method to construct hierarchical DHTs that map well to the Internet topology and achieve short intra-group communication delay. The results demonstrate the feasibility of locality-based peer groups, which allow P2P systems to take full advantage of the hierarchical design.

scholarly journals Data-driven traffic and diffusion modeling in peer-to-peer networks: A real case study

2014 ◽  
Vol 2 (3) ◽  
pp. 341-366
Author(s):  
ROMAIN HOLLANDERS ◽  
DANIEL F. BERNARDES ◽  
BIVAS MITRA ◽  
RAPHAËL M. JUNGERS ◽  
JEAN-CHARLES DELVENNE ◽  
...  
Keyword(s):  
Large Scale ◽  
Synthetic Data ◽  
Real Data ◽  
Peer To Peer ◽  
Free Riders ◽  
Peer Network ◽  
Peer To Peer Networks ◽  
Peer To Peer Systems ◽  
High Level ◽  
And Control

AbstractPeer-to-peer systems have driven a lot of attention in the past decade as they have become a major source of Internet traffic. The amount of data flowing through the peer-to-peer network is huge and hence challenging both to comprehend and to control. In this work, we take advantage of a new and rich dataset recording the peer-to-peer activity at a remarkable scale to address these difficult problems. After extracting the relevant and measurable properties of the network from the data, we develop two models that aim to make the link between the low-level properties of the network, such as the proportion of peers that do not share content (i.e., free riders) or the distribution of the files among the peers, and its high-level properties, such as the Quality of Service or the diffusion of content, which are of interest for supervision and control purposes. We observe a significant agreement between the high-level properties measured on the real data and on the synthetic data generated by our models, which is encouraging for our models to be used in practice as large-scale prediction tools. Relying on them, we demonstrate that spending efforts to reduce the amount of free riders indeed helps to improve the availability of files on the network. We observe however a saturation of this phenomenon after 60% of free riders.

scholarly journals Improve the performance of peer-to-peer networks within publish/ subscribe systems by using PeerSim simulator within Eclipse Environment: تحسين أداء شبكات الند للند ضمن أنظمة النشر والاشتراك باستخدام محاكي Peersim ضمن بيئة Eclipse

2019 ◽  
Vol 3 (4) ◽  
Author(s):  
Wael Abdulkarim Habeeb, Abdulkarim Assalem
Keyword(s):  
Social Networking Sites ◽  
Large Scale ◽  
Process Management ◽  
Data Dissemination ◽  
Peer To Peer ◽  
Large Area ◽  
Original Design ◽  
User Interests ◽  
Network Bandwidth ◽  
Peer To Peer Systems

  Publish/ subscribe (pub/ sub) is a popular communication paradigm in the design of large-scale distributed systems. We are witnessing an increasingly widespread use of pub/ sub for a wide array of applications in industry, academia, financial data dissemination, business process management and does not end in social networking sites which takes a large area of user interests and used network bandwidth. Social network interactions have grown exponentially in recent years to the order of billions of notifications generated by millions of users every day. So, it has become very important to access in the field of publishing and subscription networks, especially peer-to-peer (P2P) networks in many ways like the publication speed for events And the percentage of loss in the incoming events of the participants. Peer-to-peer systems can be very large and include millions of nodes, those nodes join and leave the network continuously, and these characteristics are difficult to handle. The evaluation of a new protocol in a real environment, particularly in the early stages, was considered impractical. Hence the need for a simulator to perform such a function to facilitate the simulation of researchers and this emulator is an open source simulator running within the Eclipse environment. In this research we have adopted a new method of selecting nodes within the table of vicinity protocol. This method is concentrated in that the far node increases the probability of its inclusion in the table more than the adjacent node. and The proposed network that uses the Polder Cast protocol was modelled using PeerSim software for modelling deployment and subscription networks within the eclipse environment so that the event delivery service is a Peer-2-Peer network and the method used to register is subject-based (Topic-Based). experimental results showed noticeable improvement in the publication speed for events by 51.11% compared to the original design of the protocol. And The percentage of event loss was reduced by 20%.    

scholarly journals A Measurement Study of the Structured Overlay Network in P2P File-Sharing Systems

2007 ◽  
Vol 2007 ◽  
pp. 1-9 ◽  
Author(s):  
Mo Zhou ◽  
Yafei Dai ◽  
Xiaoming Li
Keyword(s):  
Large Scale ◽  
Single Point ◽  
Overlay Network ◽  
File Sharing ◽  
Measurement Study ◽  
P2p Systems ◽  
Ddos Attack ◽  
P2p File Sharing ◽  
Structured Overlay ◽  
Single User

The architecture of P2P file-sharing applications has been developing to meet the needs of large scale demands. The structured overlay network, also known as DHT, has been used in these applications to improve the scalability, and robustness of the system, and to make it free from single-point failure. We believe that the measurement study of the overlay network used in the real file-sharing P2P systems can provide guidance for the designing of such systems, and improve the performance of the system. In this paper, we perform the measurement in two different aspects. First, a modified client is designed to provide view to the overlay network from a single-user vision. Second, the instances of crawler programs deployed in many nodes managed to crawl the user information of the overlay network as much as possible. We also find a vulnerability in the overlay network, combined with the character of the DNS service, a more serious DDoS attack can be launched.

Sign in / Sign up

Export Citation Format

Share Document