TRANS-Net: an Efficient Peer-to-Peer Overlay Network Based on a Full Transposition Graph
| dc.creator | Kontopoulos, Stavros | |
| dc.creator | Tsakalidis, Athanasios K. | |
| dc.date | 2008-06-19 | |
| dc.date | 2008-08-30 | |
| dc.date.accessioned | 2026-07-07T09:59:12Z | |
| dc.date.available | 2026-07-07T09:59:12Z | |
| dc.description | 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. | |
| dc.identifier | https://arxiv.org/abs/0806.3152 | |
| dc.identifier | http://arxiv.org/abs/0806.3152 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/167940 | |
| dc.subject | Distributed, Parallel, and Cluster Computing | |
| dc.title | TRANS-Net: an Efficient Peer-to-Peer Overlay Network Based on a Full Transposition Graph | |
| dc.type | text |