本文選題：網(wǎng)絡(luò)存儲(chǔ)系統(tǒng)　切入點(diǎn)：Pareto理論　出處：《西安建筑科技大學(xué)》2013年碩士論文

【摘要】：隨著“大數(shù)據(jù)”的出現(xiàn)，多元化數(shù)據(jù)在人類生活中的應(yīng)用也越來越廣泛。這促進(jìn)了存儲(chǔ)技術(shù)的不斷更新、改變，因此企業(yè)及用戶要求數(shù)據(jù)存儲(chǔ)應(yīng)用必須具有高效性以及多元性，所以網(wǎng)絡(luò)存儲(chǔ)系統(tǒng)在“大數(shù)據(jù)”時(shí)代中得到快速發(fā)展的空間。系統(tǒng)的高容錯(cuò)性、大容量存儲(chǔ)、高網(wǎng)絡(luò)帶寬以及自動(dòng)化的管理模式將會(huì)是網(wǎng)絡(luò)存儲(chǔ)系統(tǒng)的發(fā)展目標(biāo)。在大規(guī)模的網(wǎng)絡(luò)存儲(chǔ)系統(tǒng)的設(shè)計(jì)中，網(wǎng)絡(luò)資源配置以及存儲(chǔ)系統(tǒng)的數(shù)據(jù)管理策略必然是一個(gè)研究重點(diǎn)，因?yàn)閮烧邿o論在提高用戶使用資源滿意度還是對(duì)于網(wǎng)絡(luò)存儲(chǔ)系統(tǒng)性能的總體提升都會(huì)產(chǎn)生重大的影響。 在對(duì)網(wǎng)絡(luò)存儲(chǔ)系統(tǒng)的研究中，論文通過引入動(dòng)態(tài)最優(yōu)路徑機(jī)制，結(jié)合網(wǎng)絡(luò)存儲(chǔ)系統(tǒng)的體系結(jié)構(gòu)，構(gòu)建了基于Pareto理論的網(wǎng)絡(luò)存儲(chǔ)模型；同時(shí)，針對(duì)網(wǎng)絡(luò)存儲(chǔ)系統(tǒng)的數(shù)據(jù)分配進(jìn)行研究，設(shè)計(jì)了一種基于B+樹以及數(shù)據(jù)分層的數(shù)據(jù)分配策略，并對(duì)研究大規(guī)模網(wǎng)絡(luò)存儲(chǔ)系統(tǒng)數(shù)據(jù)的插入、查詢等操作提出了優(yōu)化的方法。 論文的主要內(nèi)容如下： 從用戶角度看來，盡管越來越多的網(wǎng)絡(luò)服務(wù)在需求上，基本可以達(dá)到用戶的要求，但對(duì)于網(wǎng)絡(luò)存儲(chǔ)系統(tǒng)這樣復(fù)雜的環(huán)境，就迫切需要一種最優(yōu)策略幫助用戶優(yōu)化資源配置，提高用戶對(duì)于網(wǎng)絡(luò)服務(wù)質(zhì)量QoS，其中通過Pareto最優(yōu)理論對(duì)服務(wù)資源的優(yōu)化配置，提高用戶對(duì)于網(wǎng)絡(luò)存儲(chǔ)系統(tǒng)的資源偏好，也就是確保用戶對(duì)于使用網(wǎng)絡(luò)存儲(chǔ)資源的滿意度始終保持在滿意的狀態(tài)。 雖然Pareto最優(yōu)理論在處理消費(fèi)者以及生產(chǎn)者之間的效用均衡問題上有很大的優(yōu)勢(shì)，不過對(duì)于處理多維數(shù)據(jù)上還是有不足的地方，所以論文在Pareto理論的基礎(chǔ)上通過引入粒子群算法解決出現(xiàn)的多維數(shù)據(jù)的問題，進(jìn)一步優(yōu)化網(wǎng)絡(luò)存儲(chǔ)系統(tǒng)的動(dòng)態(tài)資源配置問題。 在網(wǎng)絡(luò)存儲(chǔ)資源配置優(yōu)化基礎(chǔ)上，論文從數(shù)據(jù)分配策略這方面對(duì)網(wǎng)絡(luò)存儲(chǔ)系統(tǒng)進(jìn)行優(yōu)化，采用B+樹的數(shù)據(jù)結(jié)構(gòu)方式對(duì)網(wǎng)絡(luò)存儲(chǔ)系統(tǒng)中的文件數(shù)據(jù)進(jìn)行處理，保證數(shù)據(jù)讀寫的穩(wěn)定性，同時(shí)根據(jù)數(shù)據(jù)生命周期的不同，對(duì)數(shù)據(jù)引入了分層搜索的概念，，在滿足系統(tǒng)穩(wěn)定性的前提下，提升了系統(tǒng)對(duì)數(shù)據(jù)讀寫的速率，優(yōu)化了數(shù)據(jù)插入以及查詢路徑，減少了平均查找時(shí)間，以滿足用戶對(duì)網(wǎng)絡(luò)存儲(chǔ)系統(tǒng)的需求。
[Abstract]:With the emergence of "big data", the application of diversified data in human life is becoming more and more extensive. This has promoted the continuous updating and changing of storage technology. Therefore, enterprises and users demand that the application of data storage must be efficient and diversified. So network storage system in the "big data" era of rapid development space, the system of high fault tolerance, large capacity storage, High network bandwidth and automatic management mode will be the development goal of network storage system. In the design of large-scale network storage system, the configuration of network resources and the data management strategy of storage system will be a research focus. Both have a significant impact on the overall performance of the network storage system, both in terms of user satisfaction with the use of the resource and the overall improvement in the performance of the network storage system. In the research of network storage system, by introducing dynamic optimal path mechanism and combining the architecture of network storage system, this paper constructs a network storage model based on Pareto theory. This paper studies the data allocation of network storage system, designs a data allocation strategy based on B-tree and data stratification, and puts forward an optimized method to study the operation of data insertion and query in large-scale network storage system. The main contents of the thesis are as follows:. From the point of view of users, although more and more network services can basically meet the requirements of users, for a complex environment such as network storage system, an optimal strategy is urgently needed to help users optimize resource allocation. In order to improve the QoS of network users, the optimal allocation of service resources is based on the Pareto optimal theory, and the resource preference of users for network storage system is improved. This is to ensure that users' satisfaction with the use of network storage resources is maintained at all times. Although the Pareto optimal theory has great advantages in dealing with the utility equilibrium between consumers and producers, there are still some shortcomings in dealing with multidimensional data. Therefore, based on Pareto theory, particle swarm optimization algorithm is introduced to solve the problem of multi-dimensional data, and the dynamic resource allocation problem of network storage system is further optimized. On the basis of optimizing the configuration of network storage resources, this paper optimizes the network storage system from the aspect of data allocation strategy, and processes the file data in the network storage system by using the data structure of B-tree. At the same time, according to the difference of data life cycle, the concept of hierarchical search is introduced to the data, which improves the rate of data reading and writing under the premise of satisfying the stability of the system. The data insertion and query path are optimized to reduce the average lookup time to meet the needs of users for network storage systems.
【學(xué)位授予單位】：西安建筑科技大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2013
【分類號(hào)】：TP333

【參考文獻(xiàn)】

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

1 王英強(qiáng);石永生;;B+樹在數(shù)據(jù)庫(kù)索引中的應(yīng)用[J];長(zhǎng)江大學(xué)學(xué)報(bào)(自然科學(xué)版)理工卷;2008年01期

2 張健;;云計(jì)算概念和影響力解析[J];電信網(wǎng)技術(shù);2009年01期

3 董守斌;趙鐵柱;;面向搜索引擎的分布式文件系統(tǒng)性能分析[J];華南理工大學(xué)學(xué)報(bào)(自然科學(xué)版);2011年04期

4 高鷹,謝勝利;免疫粒子群優(yōu)化算法[J];計(jì)算機(jī)工程與應(yīng)用;2004年06期

5 劉麗,楊揚(yáng),郭文彩,施水才;基于納什均衡理論的網(wǎng)格資源調(diào)度機(jī)制[J];計(jì)算機(jī)工程與應(yīng)用;2004年29期

6 郭本俊;王鵬;陳高云;黃健;;基于MPI的云計(jì)算模型[J];計(jì)算機(jī)工程;2009年24期

7 唐文龍;;幾種典型樹形索引技術(shù)對(duì)比分析[J];百色學(xué)院學(xué)報(bào);2007年06期

8 陳康;鄭緯民;;云計(jì)算:系統(tǒng)實(shí)例與研究現(xiàn)狀[J];軟件學(xué)報(bào);2009年05期

9 耿亮;王磊;鞠時(shí)光;舒繼武;;Redbud并行文件系統(tǒng)文件布局的設(shè)計(jì)與實(shí)現(xiàn)[J];小型微型計(jì)算機(jī)系統(tǒng);2010年12期

10 吳永臻;信息資源有效配置中帕累托最優(yōu)理論的適用性問題[J];中國(guó)圖書館學(xué)報(bào);2002年05期

本文編號(hào)：1690828