Show simple item record

Files in this item

Thumbnail

Item metadata

dc.contributor.advisorKirby, Graham N. C.
dc.contributor.advisorDearle, Alan
dc.contributor.authorHajiarabderkani, Masih
dc.coverage.spatialxxii, 142 p.en_US
dc.date.accessioned2015-06-05T11:52:09Z
dc.date.available2015-06-05T11:52:09Z
dc.date.issued2015-06-24
dc.identifier.urihttp://hdl.handle.net/10023/6761
dc.description.abstractOne of the fundamental challenges in building Peer-to-Peer (P2P) applications is to locate resources across a dynamic set of nodes without centralised servers. Structured overlay networks solve this challenge by proving a key-based routing (KBR) layer that maps keys to nodes. The performance of KBR is strongly influenced by the dynamic and unpredictable conditions of P2P environments. To cope with such conditions a node must maintain its routing state. Routing state maintenance directly influences both lookup latency and bandwidth consumption. The more vigorously that state information is disseminated between nodes, the greater the accuracy and completeness of the routing state and the lower the lookup latency, but the more bandwidth that is consumed. Existing structured P2P overlays provide a set of configuration parameters that can be used to tune the trade-off between lookup latency and bandwidth consumption. However, the scale and complexity of the configuration space makes the overlays difficult to optimise. Further, it is increasingly difficult to design adaptive overlays that can cope with the ever increasing complexity of P2P environments. This thesis is motivated by the vision that adaptive P2P systems of tomorrow, would not only optimise their own parameters, but also generate and adapt their own design. This thesis studies the effects of using an adaptive technique to automatically adapt state dissemination cost and lookup latency in structured overlays under churn. In contrast to previous adaptive approaches, this work investigates the algorithmic adaptation of the fundamental data dissemination protocol rather than tuning the parameter values of a protocol with fixed design. This work illustrates that such a technique can be used to design parameter-free structured overlays that outperform other structured overlays with fixed design such as Chord in terms of lookup latency, bandwidth consumption and lookup correctness. A large amount of experimentation was performed, more than the space allows to report. This thesis presents a set of key findings. The full set of experiments and data is available online at: http://trombone.cs.st-andrews.ac.uk/thesis/analysis.en_US
dc.language.isoenen_US
dc.publisherUniversity of St Andrews
dc.rightsAn error occurred on the license name.*
dc.rights.uriAn error occurred getting the license - uri.*
dc.subjectInformation disseminationen_US
dc.subjectAdaptive maintenanceen_US
dc.subjectOverlay networken_US
dc.subject.lccTK5105.525H2
dc.subject.lcshPeer-to-peer architecture (Computer networks)en_US
dc.subject.lcshAdaptive routing (Computer network management)en_US
dc.titleAdaptive dissemination of network state knowledge in structured peer-to-peer networksen_US
dc.typeThesisen_US
dc.contributor.sponsorScottish Informatics and Computer Science Alliance (SICSA)en_US
dc.type.qualificationlevelDoctoralen_US
dc.type.qualificationnamePhD Doctor of Philosophyen_US
dc.publisher.institutionThe University of St Andrewsen_US


The following license files are associated with this item:

  • Creative Commons

This item appears in the following Collection(s)

Show simple item record