TreeP: A Tree-Based P2P Network Architecture
B. Hudzia, M-T. Kechadi, A. Ottewill
Abstract
In this paper we proposed a hierarchical P2P network based on a dynamic partitioning on a 1-D space. This hierarchy is created and maintained dynamically and provides a gridmiddleware (like DGET) a P2P basic functionality for resource discovery and load-balancing.This network architecture is called TreeP (Tree based P2P network architecture) and is based on atessellation of a 1-D space. We show that this topology exploits in an efficient way theheterogeneity feature of the network while limiting the overhead introduced by the overlaymaintenance. Experimental results show that this topology is highly resilient to a large number ofnetwork failures.
Create a lesson
Related papers
Scheduling in Cloud,Fog, and Edge Computing: A Comparative Analysis and Decision Framework for Technique Selection
Rana Ghazali, Douglas G. Down
GPU-resident Execution for Timing-predictable Sensor Processing Systems
Soham Sinha, Rahul Choudhury, Shekhar Dwivedi et al.
CompileMask: Bridging the Gap Between Expressiveness and Efficiency in Attention Masking
Hongzheng Li, Jiacheng Wan, Zhaolong Xing et al.
ShoreKeeper: Accelerating Iterative Data Analytics in the Cloud via Distributed Recovery-Cost-Aware Caching
Jongseop Lee, Minsu Sun, Xinyue Ma et al.
Stacked Intelligent Metasurface-Based MultiModal Feature Fusion for Collaborative Inference in Edge Networks
Yushi Wang, Zhengxin Yu, Guhan Zheng et al.
Taking Tokenization off the Host for Agentic LLM Serving
Mohammad Siavashi, Pascal Schwinte, Ali Banaei et al.