The potential vulnerability of Centralized Volunteer Computing systems is the single point of failure, which can be triggered by attacks on malicious purpose, or even by the normal use which may lead to the resource exhaustion on the central server. To originally eliminate this vulnerability, a variety of decentralized architecture designs have been proposed for Volunteer Computing. These solutions widely adopted some decentralized design models, such as hierarchical design with super peers, and equal peer design in form of peer-to-peer networks. Regardless of the variation among them, certain vulnerabilities still exist due to the decentralization of the architecture, which makes the architecture less robust when network size changes fast due to volunteers’ join and leave. These proposals then also provided certain fault-tolerant mechanisms to against these vulnerabilities of the decentralized architecture, in order to improve the robustness of the system. But none of them paid attention on the locality of influence of the system changes, which should be taken into account as a key factor of the fault-tolerance design to strengthen the decentralized architecture of the system.

This thesis proposes a decentralized architecture design, which originally eliminates the single point of failure hazard, and breaks through the bottleneck of resource exhaustion. The proposed design is in form of a layered system: it uses the principle of MapRecude to construct a multi-level tree structure at the top layer. This structure is decentralized by distributing also the management and control of Volunteer Computing to volunteers. But it has a vulnerability that makes the tree structure fragile. To improve the robustness of the system, this thesis constructs a second layer – a peer-to-peer overlay network layer, coupling it with the top layer for fault-tolerance, and the construction of the second layer is guided by the consideration about the locality of influence of the system changes. A prototype has been built up where some simulations are launched to study the fault-tolerance of this decentralized system design for Volunteer Computing.

Skapa referens, olika format (klipp och klistra)

BibTeX @mastersthesis{Ning2010,author={Ning, Hao},title={Robust Overlay networks for Volunteer Computing - Decentralized Volunteer Computing Architecture with Fault-tolerance Design},abstract={The potential vulnerability of Centralized Volunteer Computing systems is the single point of failure, which can be triggered by attacks on malicious purpose, or even by the normal use which may lead to the resource exhaustion on the central server. To originally eliminate this vulnerability, a variety of decentralized architecture designs have been proposed for Volunteer Computing. These solutions widely adopted some decentralized design models, such as hierarchical design with super peers, and equal peer design in form of peer-to-peer networks. Regardless of the variation among them, certain vulnerabilities still exist due to the decentralization of the architecture, which makes the architecture less robust when network size changes fast due to volunteers’ join and leave. These proposals then also provided certain fault-tolerant mechanisms to against these vulnerabilities of the decentralized architecture, in order to improve the robustness of the system. But none of them paid attention on the locality of influence of the system changes, which should be taken into account as a key factor of the fault-tolerance design to strengthen the decentralized architecture of the system.<br><br>
This thesis proposes a decentralized architecture design, which originally eliminates the single point of failure hazard, and breaks through the bottleneck of resource exhaustion. The proposed design is in form of a layered system: it uses the principle of MapRecude to construct a multi-level tree structure at the top layer. This structure is decentralized by distributing also the management and control of Volunteer Computing to volunteers. But it has a vulnerability that makes the tree structure fragile. To improve the robustness of the system, this thesis constructs a second layer – a peer-to-peer overlay network layer, coupling it with the top layer for fault-tolerance, and the construction of the second layer is guided by the consideration about the locality of influence of the system changes. A prototype has been built up where some simulations are launched to study the fault-tolerance of this decentralized system design for Volunteer Computing. },publisher={Institutionen för data- och informationsteknik (Chalmers), Chalmers tekniska högskola},place={Göteborg},year={2010},keywords={Volunteer Computing, Desktop Grid, MapReduce, Peer-to-Peer Networks},note={114},}

RefWorks RT GenericSR ElectronicID 130677A1 Ning, HaoT1 Robust Overlay networks for Volunteer Computing - Decentralized Volunteer Computing Architecture with Fault-tolerance DesignYR 2010AB The potential vulnerability of Centralized Volunteer Computing systems is the single point of failure, which can be triggered by attacks on malicious purpose, or even by the normal use which may lead to the resource exhaustion on the central server. To originally eliminate this vulnerability, a variety of decentralized architecture designs have been proposed for Volunteer Computing. These solutions widely adopted some decentralized design models, such as hierarchical design with super peers, and equal peer design in form of peer-to-peer networks. Regardless of the variation among them, certain vulnerabilities still exist due to the decentralization of the architecture, which makes the architecture less robust when network size changes fast due to volunteers’ join and leave. These proposals then also provided certain fault-tolerant mechanisms to against these vulnerabilities of the decentralized architecture, in order to improve the robustness of the system. But none of them paid attention on the locality of influence of the system changes, which should be taken into account as a key factor of the fault-tolerance design to strengthen the decentralized architecture of the system.<br><br>
This thesis proposes a decentralized architecture design, which originally eliminates the single point of failure hazard, and breaks through the bottleneck of resource exhaustion. The proposed design is in form of a layered system: it uses the principle of MapRecude to construct a multi-level tree structure at the top layer. This structure is decentralized by distributing also the management and control of Volunteer Computing to volunteers. But it has a vulnerability that makes the tree structure fragile. To improve the robustness of the system, this thesis constructs a second layer – a peer-to-peer overlay network layer, coupling it with the top layer for fault-tolerance, and the construction of the second layer is guided by the consideration about the locality of influence of the system changes. A prototype has been built up where some simulations are launched to study the fault-tolerance of this decentralized system design for Volunteer Computing. PB Institutionen för data- och informationsteknik (Chalmers), Chalmers tekniska högskola,LA engLK http://publications.lib.chalmers.se/records/fulltext/130677.pdfOL 30