2020/06/02 by Chase H. Smith, Smith, Chase, Alex Rusnak +1
Computer Science · #Caching and Content Delivery #FOS: Computer and information sciences #I.2.11 #Networking and Internet Architecture (cs.NI) #Neural and Evolutionary Computing (cs.NE) #Opportunistic and Delay-Tolerant Networks #Peer-to-Peer Network Technologies
paper · pdf · doi:10.48550/arxiv.2006.02006
openalex publication_date 2020/06/02 · openalex created_date 2022/07/26 · openalex updated_date 2026/07/28
Information dissemination is a fundamental and frequently occurring problem\nin large, dynamic, distributed systems. In order to solve this, there has been\nan increased interest in creating efficient overlay networks that can maintain\ndecentralized peer-to-peer networks. Within these overlay networks nodes take\nthe patterns of small world networks, whose connections are based on proximity.\nThese small-world systems can be incredibly useful in the dissemination and\nlookup of information within an internet network. The data can be efficiently\ntransferred and routing with minimal information loss through forward error\ncorrect (FEC) and the User Datagram Protocol (UDP). We propose a networking\nscheme that incorporates geographic location in chord for the organization of\npeers within each node's partitioned key space. When we combine this with a\nproximity-based neighborhood set based on the small world structure we can\nmimic the efficient of solutions designed to solve traditional small-world\nproblems, with the additional benefit of resilience and fault-tolerance.\nFurthermore, the routing and address book can be updated based on the\nneighborhood requirements. The flexibility of our proposed schemes enables a\nvariety of swarm models, and agents. This enables our network to as an\nunderlying networking model that can be applied to file-sharing, streaming, and\nsynchronization of networks.\n