本文選題：分布式緩存 + 負(fù)載均衡　； 參考：《華中科技大學(xué)》2013年碩士論文

【摘要】：在人類(lèi)對(duì)網(wǎng)絡(luò)需求越來(lái)越大的今天，簡(jiǎn)單的依賴(lài)客戶(hù)端-服務(wù)器-數(shù)據(jù)庫(kù)模式構(gòu)建網(wǎng)絡(luò)應(yīng)用已經(jīng)無(wú)法支撐日益增長(zhǎng)的網(wǎng)絡(luò)負(fù)載。網(wǎng)絡(luò)緩存是提升Web系統(tǒng)整體性能理想的解決方案之一，，分布式緩存系統(tǒng)的相關(guān)研究從上世紀(jì)90年代開(kāi)始，至今許多研究成果已經(jīng)應(yīng)用于各個(gè)大型網(wǎng)絡(luò)應(yīng)用中。分布式緩存具有良好的可擴(kuò)展性、高可用性和結(jié)構(gòu)對(duì)用戶(hù)透明的特點(diǎn)。過(guò)于集中或嚴(yán)重傾斜的負(fù)載會(huì)使分布式緩存系統(tǒng)出現(xiàn)“熱點(diǎn)”給單個(gè)節(jié)點(diǎn)造成巨大壓力。 均衡分組策略(Balanced Partition Scheme, BPS)在一致性哈希算法的基礎(chǔ)上進(jìn)行改進(jìn)，解決了由于一致性哈希算法的隨機(jī)性導(dǎo)致存儲(chǔ)空間分配不合理的問(wèn)題。該策略將哈希函數(shù)的值域空間平均分為若干子空間，并且根據(jù)節(jié)點(diǎn)的性能分配存儲(chǔ)空間，保證處理能力強(qiáng)的節(jié)點(diǎn)能夠分配到較多的請(qǐng)求負(fù)載，使系統(tǒng)在動(dòng)態(tài)條件下保持負(fù)載均衡。基于系統(tǒng)可靠性的緩存數(shù)據(jù)冗余策略，根據(jù)可靠性理論將分布式緩存系統(tǒng)抽象成并聯(lián)系統(tǒng)，在保證系統(tǒng)整體的可靠性基礎(chǔ)上測(cè)算系統(tǒng)數(shù)據(jù)需備份數(shù)，并將緩存數(shù)據(jù)冗余存儲(chǔ)在請(qǐng)求的轉(zhuǎn)發(fā)節(jié)點(diǎn)中以保證緩存系統(tǒng)在動(dòng)態(tài)情況下的命中率。本文利用分布式緩存系統(tǒng)對(duì)一個(gè)基于B/S結(jié)構(gòu)開(kāi)發(fā)的供水網(wǎng)信息管理系統(tǒng)進(jìn)行性能優(yōu)化，該系統(tǒng)為用戶(hù)提供查詢(xún)漏失率的功能。在分析系統(tǒng)用戶(hù)請(qǐng)求習(xí)慣的基礎(chǔ)上，增加數(shù)據(jù)預(yù)處理機(jī)制，將預(yù)處理結(jié)果寫(xiě)入分布式緩存系統(tǒng)中供客戶(hù)端直接查詢(xún)，并且利用Memcached分布式緩存系統(tǒng)對(duì)預(yù)處理機(jī)制進(jìn)行仿真實(shí)驗(yàn)。 仿真實(shí)驗(yàn)結(jié)果證明均衡分組策略具有較好的負(fù)載均衡效果，在忽略次要因素的情況下緩存冗余策略可以提高緩存系統(tǒng)的命中率，利用分布式緩存對(duì)信息管理系統(tǒng)進(jìn)行優(yōu)化可以有效的減少用戶(hù)請(qǐng)求數(shù)據(jù)的時(shí)間，提高了服務(wù)器處理請(qǐng)求的效率。
[Abstract]:Nowadays, with the increasing demand for network, simply relying on client-server-database schema to construct network application can no longer support the increasing network load.Network caching is one of the ideal solutions to improve the overall performance of Web system. The research on distributed cache system has been applied to various large-scale network applications since the 1990s.Distributed cache has good scalability, high availability and transparent structure to users.Over-concentrated or heavily skewed loads can cause a "hot spot" in distributed caching systems, which can put a great deal of pressure on a single node.The balanced Partition Scheme is improved on the basis of the consistent hash algorithm, which solves the problem of unreasonable storage space allocation due to the randomness of the consistent hash algorithm.In this strategy, the range space of the hash function is divided into several subspaces, and storage space is allocated according to the performance of the node, so that the node with strong processing power can be allocated more request load.Make the system maintain load balance under dynamic conditions.Based on the buffer data redundancy strategy of system reliability, the distributed cache system is abstracted into parallel system according to the reliability theory, and the backup number of system data is calculated on the basis of guaranteeing the reliability of the system as a whole.The cache data redundancy is stored in the request forwarding node to ensure the cache system hit ratio dynamically.In this paper, a distributed cache system is used to optimize the performance of a water supply network information management system based on B / S structure. The system provides users with the function of query loss rate.On the basis of analyzing the user request habits of the system, the data preprocessing mechanism is added, and the preprocessing results are written to the distributed cache system for the client to inquire directly. The simulation experiment of the preprocessing mechanism is carried out by using the Memcached distributed cache system.The simulation results show that the group balancing strategy has a better load balancing effect, and the cache redundancy strategy can improve the hit rate of the cache system, while ignoring the secondary factors.Using distributed cache to optimize the information management system can effectively reduce the time of user request data and improve the efficiency of server processing requests.
【學(xué)位授予單位】：華中科技大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2013
【分類(lèi)號(hào)】：TP333

【參考文獻(xiàn)】

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

1 周集良,彭小寧,王正華;基于集群的負(fù)載平衡調(diào)度算法研究與實(shí)現(xiàn)[J];計(jì)算機(jī)工程;2005年12期

2 趙玉偉;趙小雨;喬木;;緩存技術(shù)在B/S架構(gòu)信息系統(tǒng)中的應(yīng)用[J];計(jì)算機(jī)工程;2008年01期

3 萬(wàn)紅運(yùn);張志立;李鐘瑞;;地址映射外分類(lèi)算法的研究[J];計(jì)算機(jī)工程;2009年17期

4 陳貴海;吳帆;李宏興;邱彤慶;;基于DHT的P2P系統(tǒng)中高可用數(shù)據(jù)冗余機(jī)制[J];計(jì)算機(jī)學(xué)報(bào);2008年10期

5 肖yN;方鈺;;基于JGroups的分布式緩存的設(shè)計(jì)與實(shí)現(xiàn)[J];計(jì)算機(jī)應(yīng)用與軟件;2011年02期

6 吳基勝,葛成茂;英國(guó)供水泄漏管理及我國(guó)的現(xiàn)狀[J];給水排水;1997年11期

7 李文中;陳道蓄;陸桑璐;;分布式緩存系統(tǒng)中一種優(yōu)化緩存部署的圖算法[J];軟件學(xué)報(bào);2010年07期

本文編號(hào)：1734510