本文選題：未來(lái)網(wǎng)絡(luò) + 服務(wù)遷移策略�。� 參考：《北京郵電大學(xué)》2014年碩士論文

【摘要】：由于目前互聯(lián)網(wǎng)的不斷擴(kuò)展和網(wǎng)絡(luò)服務(wù)的廣泛分布特性,web服務(wù)的質(zhì)量保證日益受到了挑戰(zhàn)。當(dāng)網(wǎng)絡(luò)擁塞時(shí),訪問(wèn)遠(yuǎn)端的熱門數(shù)據(jù)服務(wù)將耗費(fèi)較多網(wǎng)絡(luò)資源,并且無(wú)法保證用戶的服務(wù)質(zhì)量。而通過(guò)將服務(wù)或其副本遷移到“本地”,使用戶就近獲得服務(wù)的技術(shù)較好地解決了這個(gè)問(wèn)題。服務(wù)遷移策略在云計(jì)算、內(nèi)容分發(fā)網(wǎng)絡(luò)和移動(dòng)agent領(lǐng)域都有相關(guān)的研究并取得了較好的成果。因此,面向服務(wù)的未來(lái)互聯(lián)網(wǎng)的體系結(jié)構(gòu),面對(duì)網(wǎng)絡(luò)環(huán)境的復(fù)雜多樣,可以通過(guò)研究服務(wù)動(dòng)態(tài)遷移方法來(lái)降低網(wǎng)絡(luò)資源消耗、增強(qiáng)網(wǎng)絡(luò)擴(kuò)展性、進(jìn)一步提高用戶服務(wù)質(zhì)量。 先前文獻(xiàn)的傳統(tǒng)研究存在一些共同的隱性問(wèn)題：服務(wù)遷移策略是被動(dòng)的、沒(méi)有體現(xiàn)局部特性、計(jì)算代價(jià)較高。本論文提出了一個(gè)基于局部信息的主動(dòng)服務(wù)請(qǐng)求遷移策略以克服上述問(wèn)題,使服務(wù)遷移更有目標(biāo)性和智能性；設(shè)計(jì)了一個(gè)適合該策略的基本框架結(jié)構(gòu)和代價(jià)模型,采用最短路徑樹(shù)(SPT)局部搜索確定最終遷移位置。仿真結(jié)果表明該策略在降低通信資源消耗和減少服務(wù)響應(yīng)時(shí)延方面有較好的性能提升。 本論文分為四個(gè)部分： 第一,對(duì)國(guó)內(nèi)外未來(lái)網(wǎng)絡(luò)做了簡(jiǎn)要介紹,并闡述了服務(wù)遷移策略的研究現(xiàn)狀。 第二,闡述了傳統(tǒng)的服務(wù)遷移策略的基本結(jié)構(gòu)和方法策略,為面向服務(wù)的未來(lái)互聯(lián)網(wǎng)服務(wù)遷移策略的提出提供了啟發(fā)和理論依據(jù)。 第三,探討目前研究文獻(xiàn)中服務(wù)遷移策略不足之處,提出基于局部信息的主動(dòng)服務(wù)請(qǐng)求遷移策略,設(shè)計(jì)新的代價(jià)參考模型和請(qǐng)求節(jié)點(diǎn)與服務(wù)端節(jié)點(diǎn)的協(xié)同工作方式,最后基于SPT構(gòu)造的拓?fù)浯_定遷移位置。 最后,通過(guò)網(wǎng)絡(luò)仿真軟件NS2對(duì)論文提出的主動(dòng)服務(wù)遷移策略進(jìn)行了仿真并對(duì)仿真結(jié)果進(jìn)行了分析。
[Abstract]:Due to the continuous expansion of the Internet and the wide distribution of web services, the quality assurance of web services has been increasingly challenged. When the network is congested, accessing the hot data service of the remote end will consume more network resources and can not guarantee the user's quality of service. By migrating the service or its replica to the "local", the technology of getting the service nearby solves this problem. Service migration strategy has been studied in cloud computing, content distribution network and mobile agent. Therefore, the architecture of the future service-oriented Internet, facing the complexity and diversity of the network environment, can reduce the consumption of network resources, enhance the expansibility of the network and further improve the quality of service by studying the method of dynamic migration of services. There are some common implicit problems in the traditional research of previous literature: the service migration strategy is passive, does not reflect the local characteristics, and the computational cost is high. In this paper, an active service request migration strategy based on local information is proposed to overcome the above problems and make the service migration more targeted and intelligent. The local search of the shortest path tree (SPT) is used to determine the final migration location. Simulation results show that the proposed strategy can reduce the consumption of communication resources and reduce the delay of service response. This thesis is divided into four parts: First, the future network at home and abroad is briefly introduced, and the research status of service migration strategy is described. Secondly, the basic structure and method strategy of the traditional service migration strategy are expounded, which provides the inspiration and theoretical basis for the future service-oriented Internet service migration strategy. Thirdly, this paper discusses the shortcomings of the service migration strategy in the current literature, proposes an active service request migration strategy based on local information, designs a new cost reference model and the cooperative working mode between the request node and the server node. Finally, the migration location is determined based on the topology constructed by SPT. Finally, the active service migration strategy proposed in this paper is simulated by the network simulation software NS2 and the simulation results are analyzed.
【學(xué)位授予單位】：北京郵電大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2014
【分類號(hào)】：TP393.09

【參考文獻(xiàn)】

相關(guān)博士學(xué)位論文 前1條

1 馬駿;移動(dòng)agent遷移技術(shù)研究[D];哈爾濱工程大學(xué);2009年

，

本文編號(hào)：1782541