2020/04/17 by Haseeb Ur Rahman, Madjid Merabti, Rahman, Haseeb Ur +7
Computer Science · #Caching and Content Delivery #Distributed #FOS: Computer and information sciences #Opportunistic and Delay-Tolerant Networks #Parallel #Peer-to-Peer Network Technologies #Social and Information Networks (cs.SI) #and Cluster Computing (cs.DC)
paper · pdf · doi:10.48550/arxiv.2004.08441
openalex publication_date 2020/04/17 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
A community is sub-network inside P2P networks that partition the network\ninto groups of similar peers to improve performance by reducing network traffic\nand high search query success rate. Large communities are common in online\nsocial networks than traditional file-sharing P2P networks because many people\ncapture huge amounts of data through their lives. This increases the number of\nhosts bearing similar data in the network and hence increases the size of\ncommunities. This article presents a Memory Thread-based Communities for our\nentity-based social P2P network that partition the network into groups of peers\nsharing data belonging to an entity - person, place, object or interest, having\nits own digital memory or be a part another memory. These connected peers\nhaving further similarities by organizing the network using linear orderings. A\nMemory-Thread is the collection of digital memories having a common reference\nkey and organized according to some form of correlation. The simulation results\nshow an increase in network performance for the proposed scheme along with a\ndecrease in network overhead and higher query success rate compared to other\nsimilar schemes. The network maintains its performance even while the network\ntraffic and size increase.\n