TRANS-Net: an Efficient Peer-to-Peer Overlay Network Based on a Full Transposition Graph
Stavros Kontopoulos, Athanasios K. Tsakalidis

TL;DR
TRANS-Net is a new P2P overlay network based on full transposition graphs, offering high fault-tolerance, low congestion, and efficient multi-dimensional query support with logarithmic lookup complexity.
Contribution
It introduces a practical P2P system utilizing full transposition network topology, achieving improved fault-tolerance and lookup efficiency over existing transposition network designs.
Findings
Lookup service with Theta(log n m) hops achieved
High fault-tolerance and low congestion demonstrated
Supports efficient multi-dimensional queries
Abstract
In this paper we propose a new practical P2P system based on a full transposition network topology named TRANS-Net. Full transposition networks achieve higher fault-tolerance and lower congestion among the class of transposition networks. TRANS-Net provides an efficient lookup service i.e. k hops with high probability, where k satisfies Theta(log_n m) less than k less than Theta(log_2 m), where m denotes the number of system nodes and n is a system parameter related to the maximum number that m can take (up to n!). Experiments show that the look-up performance achieves the lower limit of the complexity relation. TRANS-Net also preserves data locality and provides efficient look-up performance for complex queries such as multi-dimensional queries.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPeer-to-Peer Network Technologies · Caching and Content Delivery · Distributed and Parallel Computing Systems
