2008.12.12 |
| Date | Thu Dec 18 |
| Time | 14:15 — 15:00 |
| Location | Turing T-014 |
Title: Deterministic Structures over P2P Networks
Speakers: Kostas Tsichlas, Aristotle University of Thessaloniki & Spyros Sioutas, Ionian University
Abstract:
We design a new P2P data structure, called the Deterministic Distributed tree (DDtree). The DDtree compares favourably to other designs for the following reasons: a) it divides the overlay structure of the P2P environment from the actual elements stored in it and b) it provides better complexities (which are deterministic) compared to all previous solutions. Additionally, the division between elementsand nodes results in a load balancing problem in which we have provided an innovative and very efficient solution.This load-balancing scheme can also be applied to any other tree structure in a P2P environment. Finally, a small discussion on models of P2P Networks is initiated.
Host: GerthStølting Brodal