Scalable Constant-Degree Peer-to-Peer Overlay Networks

This thesis examines the performance for multimedia distribution and information sharing of social-networking web sites, with a focus on user networks in Facebook. We used real user network data from Facebook together with a synthetic Facebook network in the performance-testing experiments. We tested performance for multimedia distribution and information sharing using three different types of overlay networks: Facebook; structured peer-to-peer (ring topology); and unstructured peer-to-peer (mesh topology). The experiments used Network Simulator 2 (Ns-2) to simulate the network topologies. The results show that structured Peer-to-Peer has the best performance in terms of information transfer, and Facebook has the best performance in regards to average throughput. This thesis shows the strengths and weaknesses of online social networking while sharing information and multimedia content.

Download Full-text

Resource-Aware Cooperative Caching on Mobile Ad-hoc Peer to Peer Networks

10.32920/ryerson.14655603.v1 ◽

2021 ◽

Author(s):

Hoda R.K. Nejad

Keyword(s):

Ad Hoc Networks ◽

Overlay Networks ◽

Ad Hoc ◽

Data Access ◽

Peer To Peer ◽

Data Availability ◽

Cooperative Caching ◽

P2p Systems ◽

Hoc Networks ◽

Resource Aware

With the emergence of wireless devices, service delivery for ad-hoc networks has started to attract a lot of attention recently. Ad-hoc networks provide an attractive solution for networking in the situations where network infrastructure or service subscription is not available. We believe that overlay networks, particularly peer-to-peer (P2P) systems, is a good abstraction for application design and deployment over ad-hoc networks. The principal benefit of this approach is that application states are only maintained by the nodes involved in the application execution and all other nodes only perform networking related functions. On the other hand, data access applications in Ad-hoc networks suffer from restricted resources. In this thesis, we explore how to use Cooperative Caching to improve data access efficiency in Ad-hoc network. We propose a Resource-Aware Cooperative Caching P2P system (RACC) for data access applications in Ad-hoc networks. The objective is to improve data availability by considering energy of each node, demand and supply of network. We evaluated and compared the performance of RACC with Simple Cache, CachePath and CacheData schemes. Our simulation results show that RACC improves the lay of query as well as energy usage of the network as compared to Simple Cache, CachePath and CacheData.

Download Full-text