本文選題：虛擬計(jì)算環(huán)境　切入點(diǎn)：信任　出處：《北京郵電大學(xué)》2014年博士論文

【摘要】：虛擬計(jì)算環(huán)境旨在通過建立在開放的互聯(lián)網(wǎng)基礎(chǔ)設(shè)施之上的公用化計(jì)算平臺(tái),為應(yīng)用提供和諧、可信、透明的一體化服務(wù)支撐。隨著虛擬計(jì)算技術(shù)的發(fā)展和應(yīng)用的深入,一方面,底層資源日趨公用化、規(guī)模化、異構(gòu)化；另一方面,上層應(yīng)用需求呈現(xiàn)出多樣化、差異化、復(fù)雜化的趨勢(shì)。如何有效解決公用環(huán)境下海量、異構(gòu)資源與多樣化、多需求目標(biāo)應(yīng)用之間的資源調(diào)度問題,實(shí)現(xiàn)在不可預(yù)知的公共運(yùn)行環(huán)境中構(gòu)造可信服務(wù)的目標(biāo),日漸成為影響與制約虛擬計(jì)算環(huán)境發(fā)展的關(guān)鍵性問題。 本文針對(duì)公用環(huán)境下的資源調(diào)度問題,結(jié)合虛擬計(jì)算環(huán)境實(shí)驗(yàn)平臺(tái)的實(shí)際情況,首先在實(shí)驗(yàn)平臺(tái)中引入了信任機(jī)制來保證公用環(huán)境下資源調(diào)度的可信問題,再通過對(duì)資源屬性和應(yīng)用需求的逐步深入分析,在現(xiàn)有資源調(diào)度技術(shù)的研究成果基礎(chǔ)上,開展了虛擬計(jì)算環(huán)境下基于信任的資源調(diào)度若干關(guān)鍵技術(shù)的研究,以實(shí)現(xiàn)資源與應(yīng)用之間的逐步精細(xì)化匹配和調(diào)度,從而提升虛擬計(jì)算環(huán)境的整體性能。本文的創(chuàng)新點(diǎn)主要包括： (1)提出了一種基于貝葉斯信任模型的冗余調(diào)度算法——TR Scheduling算法。通過對(duì)虛擬計(jì)算實(shí)驗(yàn)平臺(tái)上承載的應(yīng)用做初步分析,應(yīng)用具有單個(gè)任務(wù)小、并發(fā)量大,任務(wù)問相互獨(dú)立,任務(wù)可以以任何順序執(zhí)行,任務(wù)問不需要通信等特點(diǎn),并根據(jù)虛擬計(jì)算環(huán)境下海量資源的優(yōu)勢(shì),“以適當(dāng)?shù)馁Y源換取復(fù)雜容錯(cuò)開銷”的設(shè)計(jì)理念實(shí)現(xiàn)了基于多副本技術(shù)的冗余調(diào)度算法。同時(shí),根據(jù)貝葉斯信任模型對(duì)可調(diào)度資源節(jié)點(diǎn)的穩(wěn)定性進(jìn)行分析計(jì)算出資源信任值的排序,給出了按照信任值最大優(yōu)先(HighFit)算法和信任值最小優(yōu)先(LowFit)算法兩種策略對(duì)資源進(jìn)行動(dòng)態(tài)選擇,從而提高了系統(tǒng)的可靠性和資源利用率。 (2)提出了一種實(shí)現(xiàn)差異化服務(wù)的資源調(diào)度模型,也即基于資源預(yù)留技術(shù)的資源調(diào)度模型——RRM模型。通過對(duì)應(yīng)用的需求做初步分析,平臺(tái)所支撐的應(yīng)用的從重要程度上可以粗分為“一般應(yīng)用”和“重要應(yīng)用”兩種類型。RRM資源調(diào)度模型依據(jù)計(jì)算資源屬性將普通資源和優(yōu)質(zhì)資源分別放入“普通資源池”和“VIP資源池”,并通過動(dòng)態(tài)調(diào)整VIP資源比例、動(dòng)態(tài)交換優(yōu)質(zhì)與普通資源,合理資源預(yù)留策略,該模型在兼顧所有任務(wù)調(diào)度的基礎(chǔ)上,重點(diǎn)提升VIP任務(wù)的調(diào)度效率與執(zhí)行成功率,實(shí)現(xiàn)了“重要的資源服務(wù)于重要的任務(wù)”的差異化服務(wù),保障了重要服務(wù)等級(jí)的應(yīng)用得到及時(shí)響應(yīng),有效提升了平臺(tái)的可用性。 (3)提出了一種實(shí)現(xiàn)多條件約束的資源調(diào)度模型,也即基于“資源滑動(dòng)窗口”技術(shù)的資源調(diào)度模型——RSW模型。通過對(duì)應(yīng)用的需求做進(jìn)一步分析,平臺(tái)所支撐的應(yīng)用需求有著多樣化、差異化、復(fù)雜化的特點(diǎn),對(duì)所調(diào)用資源有多種條件的約束。該模型對(duì)資源聚合技術(shù)做初步研究,通過對(duì)資源靜態(tài)屬性和動(dòng)態(tài)屬性的預(yù)先分類,使得資源選擇的范圍逐步縮小,以初步實(shí)現(xiàn)“合適的資源服務(wù)于合適的任務(wù)”的目的,有效提升了平臺(tái)的適用性。 (4)提出了一種基于模糊聚類的資源調(diào)度模型——FCS模型。通過對(duì)資源聚合技術(shù)做進(jìn)一步研究,在對(duì)資源靜態(tài)屬性分類之后,基于模糊關(guān)聯(lián)聚類算法對(duì)資源再做聚類,進(jìn)一步縮小了資源的選擇范圍,并降低了直接對(duì)原始資源進(jìn)行聚類的空間復(fù)雜度,從而為任務(wù)與資源的精確匹配提供了條件,實(shí)現(xiàn)了“特定的資源服務(wù)于特定的任務(wù)”的資源最優(yōu)配置目的,進(jìn)一步提升了平臺(tái)的適用性
[Abstract]:The virtual computing environment through the public based on open Internet infrastructure computing platform for application to provide a harmonious, credible, transparent integration services support. With the development and application of virtual computing technology deeply, on the one hand, the underlying resources become public, scale, isomerization; on the other hand, the upper application showing diverse, differentiated, complex trend. How to effectively solve the public environment massive, heterogeneous resources and diversification, the resource scheduling problem between the needs of the target application, realize the trusted service in the public environment unpredictable in the target, become influence and restrict the development of the key virtual computing environment the problem.
Aiming at the problem of public resource scheduling environment, combined with the actual situation of the virtual computing environment of the experimental platform, in the first experiment platform, introduces the trust mechanism to ensure the credibility problem of public resource scheduling environment, through the attributes of resources and application needs gradually deep analysis, based on the existing research results on Resource Scheduling Technology Study on some key techniques, trust based resource scheduling of virtual computing environment, in order to realize resource and application of the gradual refinement of the matching and scheduling, so as to enhance the overall performance of the virtual computing environment. The main innovations of this thesis include:
(1) proposed a redundant scheduling algorithm based on trust model -- Bias TR Scheduling algorithm. Through the preliminary analysis of the application of bearing virtual computing platform, the application has a single task, with a large amount of tasks are independent of each other, the task can be executed in any order, do not need to ask task communication features. According to the massive resources in virtual computing environment advantage, "design concept to the appropriate resource for complex fault tolerance overhead" realize redundant scheduling algorithm based on multi duplicate technology. At the same time, according to the Bias trust model for scheduling resource node stability analysis to calculate the trust value of resource scheduling, given in accordance with the trust value the maximum priority (HighFit) algorithm and the trust value of the minimum priority (LowFit) algorithm two strategies for dynamic selection of resources, so as to improve the system reliability and resource utilization Rate of use.
(2) we propose a resource scheduling model to realize service differentiation, i.e. resource scheduling model RRM model based on resource reservation technology. Based on the application needs to do a preliminary analysis, application support platform from the important degree can be divided into "general application" and "application" two type.RRM resource scheduling model based on computational resources attribute common resources and high-quality resources were put into the "common resource pool" and "VIP resource pool", and through the dynamic adjustment of VIP resource ratio, dynamic quality and general exchange of resources, reasonable resource reservation strategy, the model based on the consideration of all task scheduling, scheduling and execution efficiency focus on enhancing the VIP mission success rate, to achieve the "differentiated services important resources in the important tasks, to protect the important application service level to respond in a timely manner, effective. The availability of the platform is raised.
(3) proposed a resource scheduling model with multiple constraints, namely "resource based on sliding window technology resource scheduling model -- RSW model. Through the application of the need for further analysis, the application needs to support the platform with diversification, differentiation, characteristics of the complex, a variety of conditions the call of resource constraints. The model do preliminary research on resource aggregation technology, based on the resources of the static and dynamic attributes of the pre classification range makes the resource selection gradually narrowed, with the initial realization of" appropriate resources in the appropriate task ", effectively enhance the applicability of the platform.
(4) we propose a resource scheduling model based on fuzzy clustering FCS model. Further research based on the resource aggregation technology, the static resource attribute classification, fuzzy relational clustering algorithm to do the clustering based on resources, further narrowing the scope of the selection of resources, and reduce the direct clustering of original resources the space complexity of tasks and resources so as to provide accurate matching conditions, to achieve the "objective optimal allocation of resources to specific resources in specific tasks, to further enhance the applicability of the platform

【學(xué)位授予單位】：北京郵電大學(xué)
【學(xué)位級(jí)別】：博士
【學(xué)位授予年份】：2014
【分類號(hào)】：TP393.01

【參考文獻(xiàn)】

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

1 宋瑋;;基于冗余分配的網(wǎng)格任務(wù)調(diào)度模型[J];電子技術(shù)應(yīng)用;2006年02期

2 戚博碩;;云計(jì)算研究與國內(nèi)發(fā)展綜述[J];電子技術(shù)與軟件工程;2014年05期

3 高瞻;羅四維;;基于資源-預(yù)留圖的動(dòng)態(tài)網(wǎng)格資源預(yù)留機(jī)制[J];軟件學(xué)報(bào);2011年10期

4 左利云;左利鋒;;云計(jì)算中基于預(yù)先分類的調(diào)度優(yōu)化算法[J];計(jì)算機(jī)工程與設(shè)計(jì);2012年04期

5 李文娟;張啟飛;平玲娣;潘雪增;;基于模糊聚類的云任務(wù)調(diào)度算法[J];通信學(xué)報(bào);2012年03期

6 沈晴霓;卿斯?jié)h;吳中海;張力哲;楊雅輝;;基于動(dòng)態(tài)域劃分的MapReduce安全冗余調(diào)度策略[J];通信學(xué)報(bào);2014年01期

7 徐曉斌;張光衛(wèi);王尚廣;孫其博;楊放春;;基于輕量云模型的WSN不確定性信任表示方法[J];通信學(xué)報(bào);2014年02期

8 沈時(shí)軍;劉欣然;張鴻;朱春鴿;;云計(jì)算中的服務(wù)可用性保障機(jī)制[J];通信學(xué)報(bào);2014年02期

9 林榮恒;吳步丹;趙耀;楊放春;;基于K-means的云化分布式BPEL引擎放置機(jī)制[J];通信學(xué)報(bào);2014年05期

，

本文編號(hào)：1726974