National Technical University of Athens (NTUA)
Μια ομότιμη αρχιτεκτονική για ανταλλαγή περιεχομένου σε υπερκείμενα δίκτυα
Abstract
dc:descriptionIn this thesis a novel peer-to-peer architecture is presented, which provides users the capability to exchange content. Through an analytical theoretical and bibliographical study in peer-to-peer networks, and more specifically in architectures for systems based on Distributed Hash Tables (DHT) on top of Overlay Networks, it firstly describes the technological background of the study. The system follows the basic principals of DHT systems and more specifically those introduced by the Kademlia network, differentiating itself through the use of a K-ary tree structure for the production of a well defined and organized network with constrained number of neighboring nodes, which allows routing in logarithmic steps. The use of K-ary trees provides the system with the capability of both efficient routing and tolerance to network errors (due to node departure or communication failure). The architecture presented is based on the use of a neighborhood table which allows both the horizontal and vertical movement in the tree structure. Through this study the structure of the original architecture is analyzed and analytically presented for all of the basic functions that the system provides, namely those of insertion, publication, searching, departure and repair. It is then proven, through the results of a number of simulations that have been performed, the validity of the proposed design. More specifically, by extending the neurogrid simulator with the analytic model, it is initially proven that the system is able to route in logarithmic steps while retaining both a constant number of neighbors and a low total of network traffic (messages). A number of extensions is then present in addition to the basic algorithms that increases the system's tolerance to errors and its efficiency. The effect of these changes becomes even more evident through the results of another series of simulations, where the functionality of the system in environments with massive node failures (without the use of a repair mechanism) is presented. In order to further better the performance of the network, a repair algorithm is introduced, which is able to change the system's behavior during massive node failures and reduce the drop of successful inquires from logarithmic to linear, with respect to node failure percentage. This improvement becomes even more apparent with the inclusion of two additional extensions, those of replication schemas and virtual networks. The first one allows the publication and retrieval of content through the use of additional hash functions, while the second one introduces the concept of virtual networks, where each node belongs to more than one overlay network. The use of these two extension combined with the repair algorithm allows the network to successfully route even when the percentage of failing nodes surpasses that of 80% of the total node population. Once the effect of all these changes has been analyzed, a more general architecture is introduced, which provides the capability of varying the network's structure and behavior according to its performance and distribution of network load. In this architecture the capability of changing both the size of the K-ary tree and the routing behavior (from purely distributed to hybrid or pure hierarchical) is provided. This change offers the capability of using the network for different application domains, depending on the requirements with regards to work load distribution (across all levels of the K-ary tree) and optimal routing. Once the new system and all of its basic functionalities are presented in full detail, the results of a number of simulations are provided as means of assessing its performance and validating the variability it provides. Finally, once the new system has been thoroughly analyzed, a number of conclusions and open research issues are provided.
Degree
thesis:*- Grantor dc:publisher
- National Technical University of Athens (NTUA)
- Year dc:date
- 2008
Author and committee
dc:creator, dc:contributor.*- Authors dc:creator
-
- Sotiriou, Athanasios-Dimitrios
- Σωτηρίου, Αθανάσιος-Δημήτριος
Subjects
dc:subject × 26- Ομότιμη αρχιτεκτονική
- Υπερκείμενα δίκτυα
- Ανταλλαγή περιεχομένου
- Κατανεμημένος πίνακας κατακερματισμού
- Εξομοιώσεις
- Κ-δέντρα
- Αλγόριθμος δρομολόγησης
- Ανεκτικότητα σε σφάλματα
- Σχήματα αντιγράφων
- Εικονικά δίκτυα
- Παραμετροποίηση
- Peer-to-peer architecture
- Overlay networks
- Content exchange
- Distributed Hash tables
- Simulations
- K-ary trees
- Routing algorithms
- Tolerance to errors
- Replication schemas
- Virtual networks
- Parameterization
- Επιστήμες Μηχανικού και Τεχνολογία
- Επιστήμη Ηλεκτρολόγου Μηχανικού, Ηλεκτρονικού Μηχανικού, Μηχανικού Η/Υ
- Engineering and Technology
- Electrical Engineering, Electronic Engineering, Information Engineering
Rights
- Language dc:language
- gre
Identifiers
dc:identifier.*- Identifier
- 10.12681/eadd/16477