本文關(guān)鍵詞：DOA下分布式數(shù)據(jù)注冊(cè)中心高可用性研究與設(shè)計(jì)　出處：《成都理工大學(xué)》2015年碩士論文　論文類型：學(xué)位論文

  更多相關(guān)文章： 高可用性 HDFS Raft 數(shù)據(jù)一致性 數(shù)據(jù)注冊(cè)中心

【摘要】：大數(shù)據(jù)時(shí)代,使得信息技術(shù)(IT,Information Technology)時(shí)代來(lái)到了數(shù)據(jù)技術(shù)(DT,Data Technology)時(shí)代,對(duì)數(shù)據(jù)的存儲(chǔ)和管理已經(jīng)成為數(shù)據(jù)技術(shù)的核心問(wèn)題。面向數(shù)據(jù)的體系結(jié)構(gòu)——DOA(Data Oriented Architect)應(yīng)運(yùn)而生,它為傳統(tǒng)軟件設(shè)計(jì)面對(duì)海量數(shù)據(jù)的挑戰(zhàn)提供了一個(gè)很好的解決思路。數(shù)據(jù)注冊(cè)中心是DOA的核心組件,它對(duì)各種類型的數(shù)據(jù)和廣義數(shù)據(jù)進(jìn)行登記注冊(cè),形成邏輯的數(shù)據(jù)資源池,方便應(yīng)用對(duì)數(shù)據(jù)的訪問(wèn)。高頻率的數(shù)據(jù)訪問(wèn)和高速的數(shù)據(jù)傳輸,使得數(shù)據(jù)注冊(cè)中心在可靠性方面面臨著嚴(yán)峻的挑戰(zhàn)。針對(duì)分布式系統(tǒng)高可用性,目前業(yè)界有多種方案。它們的核心思想都是采用備機(jī)的方式來(lái)預(yù)防中心服務(wù)器的失效。這樣的方案雖然可以在系統(tǒng)發(fā)生單點(diǎn)失效時(shí),用備機(jī)為客戶提供讀寫(xiě)服務(wù)。然而往往需要人工的干預(yù),及存在數(shù)據(jù)丟失的可能。因此,需要一個(gè)全新的思路來(lái)解決分布式系統(tǒng)中的單點(diǎn)故障問(wèn)題。本文設(shè)計(jì)的基于一致性選舉的雙中心服務(wù)器數(shù)據(jù)注冊(cè)中心機(jī)制,有效的滿足系統(tǒng)的高可用性�；赗aft算法的多機(jī)一致性,解決多機(jī)狀況下選舉問(wèn)題,并將數(shù)據(jù)保持同步。針對(duì)如何將數(shù)據(jù)注冊(cè)中心的請(qǐng)求分發(fā)和宕機(jī)恢復(fù),設(shè)計(jì)了三機(jī)實(shí)現(xiàn)雙中心服務(wù)器數(shù)據(jù)注冊(cè)中心的方法,有效的解決單點(diǎn)障礙和多機(jī)狀態(tài)下的數(shù)據(jù)一致性問(wèn)題。具體來(lái)講,本文的主要工作如下:(1)從可靠性和可維護(hù)性兩方面分析了影響分布式系統(tǒng)高可用性的因素。并按照此思路,調(diào)研了目前比較成熟的高可用性解決方案,并通過(guò)比較它們各自的優(yōu)缺點(diǎn),提出了針對(duì)分布式數(shù)據(jù)注冊(cè)中心的高可用性方案。(2)研究了目前的分布式一致性算法,最終選用容易結(jié)合到實(shí)際中的Raft一致性算法,使用Raft一致性算法解決了三機(jī)NameNode的選主問(wèn)題。(3)為了滿足數(shù)據(jù)注冊(cè)中心的高可用性指標(biāo),本文設(shè)計(jì)了一種雙中心服務(wù)器的分布式數(shù)據(jù)注冊(cè)中心模型,并為此模型設(shè)計(jì)了相關(guān)的數(shù)據(jù)結(jié)構(gòu)和接口,最后改造了基于單NameNode的通信協(xié)議,以適用于三機(jī)NameNode的設(shè)計(jì)。(4)通過(guò)對(duì)選舉方案和高可用性兩方面的測(cè)試,驗(yàn)證了基于雙中心服務(wù)器的數(shù)據(jù)注冊(cè)中心的高可用性方案的可行性和有效性。本文為分布式數(shù)據(jù)注冊(cè)中心的高可用性提供了新的思路和參考方法,同時(shí)基于Raft算法的多機(jī)選舉和數(shù)據(jù)一致性同步方法有一定的理論和現(xiàn)實(shí)意義。主要的成果與創(chuàng)新點(diǎn)如下:(1)提出了一種基于Raft算法的多機(jī)一致性。Raft算法解決了多機(jī)狀態(tài)下的選舉問(wèn)題,通過(guò)設(shè)計(jì)一種數(shù)據(jù)注冊(cè)中心的數(shù)據(jù)一致性同步方法,有效的解決了多機(jī)狀態(tài)下的數(shù)據(jù)一致性問(wèn)題。(2)提出了一種三機(jī)實(shí)現(xiàn)雙中心服務(wù)器數(shù)據(jù)注冊(cè)中心的方法。雙中心服務(wù)器數(shù)據(jù)注冊(cè)中心主要解決了單點(diǎn)故障的瓶頸,選舉后的Leader使用分布式數(shù)據(jù)注冊(cè)中心數(shù)據(jù)一致性同步方法使每個(gè)Name Node上的數(shù)據(jù)保持一致。
[Abstract]:The big data era brought information technology to the data technology (DT) era. The Data Technology era. Data storage and management has become the core problem of data technology. The data oriented architecture (load data Oriented architect) came into being. It provides a good solution for traditional software design to face the challenge of massive data. Data registration center is the core component of DOA. It registers various types of data and generalized data. A logical data resource pool is formed to facilitate the application of data access, high-frequency data access and high-speed data transmission. It makes the data registration center face the severe challenge in the aspect of reliability, aiming at the high availability of the distributed system. At present, there are many kinds of schemes in the industry. Their core idea is to prevent the failure of the central server by the way of backup machine, although such a scheme can be used in the event of a single point of failure of the system. Using the standby machine to provide reading and writing services for customers. However, it often requires human intervention, and there is the possibility of data loss. A new way of thinking is needed to solve the single point fault problem in distributed system. This paper designs a data registration center mechanism based on consistency election. Effectively meet the high availability of the system. Based on the Raft algorithm of multi-machine consistency, to solve the multi-machine election problem. Aiming at how to distribute the request of the data registry and restore the data down, we design a method of realizing the data register center of the dual-center server on three computers. Effectively solve the problem of data consistency in single-point obstacle and multi-machine state. The main work of this paper is as follows: (1) the factors that affect the high availability of distributed systems are analyzed from the aspects of reliability and maintainability. By comparing their respective advantages and disadvantages, this paper proposes a high availability scheme for distributed data registry. Finally, the Raft consistency algorithm, which is easy to be combined into practice, is chosen. In order to meet the high availability index of the data registry, the Raft consistency algorithm is used to solve the master selection problem of the three-machine NameNode. In this paper, we design a distributed data registry model of dual central server, and design the related data structure and interface for this model. Finally, we transform the communication protocol based on single NameNode. To apply to the three-machine NameNode design. 4) to pass the election program and high availability of the two aspects of the test. Verify the feasibility and effectiveness of the high availability scheme of the data registry based on the dual central server. This paper provides a new way of thinking and reference for the high availability of the distributed data registry. At the same time, the method of multi-machine election and data consistency synchronization based on Raft algorithm has certain theoretical and practical significance. The main achievements and innovations are as follows: 1). A multi-machine consistency. Raft algorithm based on Raft algorithm is proposed to solve the election problem in multi-machine state. By designing a method of data consistency synchronization in the data registry. Effectively solve the problem of data consistency in multi-machine state. This paper presents a method to realize the data registration center of dual central server with three computers. The data register center of double center server mainly solves the bottleneck of single point fault. The elected Leader uses the distributed data registry data consistency synchronization method to keep the data on each Name Node consistent.
【學(xué)位授予單位】：成都理工大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2015
【分類號(hào)】：TP308

【參考文獻(xiàn)】

相關(guān)期刊論文 前2條

1 王意潔;孫偉東;周松;裴曉強(qiáng);李小勇;;云計(jì)算環(huán)境下的分布存儲(chǔ)關(guān)鍵技術(shù)[J];軟件學(xué)報(bào);2012年04期

2 蔡權(quán)偉;林t燂，

本文編號(hào)：1369045