国产bbaaaaa片,成年美女黄网站色视频免费,成年黄大片,а天堂中文最新一区二区三区,成人精品视频一区二区三区尤物

首頁(yè)> 外文學(xué)位 >Resource management for virtualized networks.
【24h】

Resource management for virtualized networks.

機(jī)譯：虛擬網(wǎng)絡(luò)的資源管理。

獲取原文
獲取原文并翻譯 | 示例
  • 摘要
  • 著錄項(xiàng)
  • 相似文獻(xiàn)
  • 相關(guān)主題

摘要

Network Virtualization has emerged as a promising approach that can be employed to efficiently enhance the resource management technologies. In this work, the goal is to study how to automate the bandwidth resource management, while deploying a virtual partitioning scheme for the network bandwidth resources. Works that addressed the resource management in Virtual Networks are many, however, each has some limitations. Resource overwhelming, poor bandwidth utilization, low profits, exaggeration, and collusion are types of such sort of limitations. Indeed, the lack of adequate bandwidth allocation schemes encourages resource overwhelming, where one customer may overwhelm the resources that supposed to serve others. Static resource partitioning can resist overwhelming but at the same time it may result in poor bandwidth utilization, which means less profit rates for the Internet Service Providers (ISPs). However, deploying the technology of autonomic management can enhance the resource utilization, and maximize the customers' satisfaction rates. It also provides the customers with a kind of privilege that should be somehow controlled as customers, always eager to maximize their payoffs, can use such a privilege to cheat. Hence, cheating actions like exaggeration and collusion can be expected. Solving the aforementioned limitations is addressed in this work.;In the first part, the work deals with overcoming the problems of low profits, poor utilization, and high blocking ratios of the traditional First Ask First Allocate (FAFA) algorithm. The proposed solution is based on an Autonomic Resource Management Mechanism (ARMM). This solution deploys a smarter allocation algorithm based on the auction mechanism. At this level, to reduce the tendency of exaggeration, the Vickrey-Clarke-Groves (VCG) is proposed to provide a threat model that penalizes the exaggerating customers, based on the inconvenience they cause to others in the system. To resist the collusion, the state-dependent shadow price is calculated, based on the Markov decision theory, to represent a selling price threshold for the bandwidth units at a given state.;Part two of the work solves an expanded version of the bandwidth allocation problem, but through a different methodology. In this part, the bandwidth allocation problem is expanded to a bandwidth partitioning problem. Such expansion allows dividing the link's bandwidth resources based on the provided Quality of Service (QoS) classes, which provides better bandwidth utilization. In order to find the optimal management metrics, the problem is solved through Linear Programming (LP). A dynamic bandwidth partitioning scheme is also proposed to overcome the problems related to the static partitioning schemes, such as the poor bandwidth utilization, which can result in having under-utilized partitions. This dynamic partitioning model is deployed in a periodic manner. Periodic partitioning provides a new way to reduce the reasoning of exaggeration, when compared to the threat model, and eliminates the need of the further computational overhead.;The third part of this work proposes a decentralized management scheme to solve aforementioned problems in the context of networks that are managed by Virtual Network Operators (VNOs). Such decentralization allows deploying a higher level of autonomic management, through which, the management responsibilities are distributed over the network nodes, each responsible for managing its outgoing links. Compared to the centralized schemes, such distribution provides higher reliability and easier bandwidth dimensioning. Moreover, it creates a form of two-sided competition framework that allows a double-auction environment among the network players, both customers and node controllers. Such competing environment provides a new way to reduce the exaggeration beside the periodic and threat models mentioned before. More important, it can deliver better utilization rates, lower blocking, and consequently higher profits.;Finally, numerical experiments and empirical results are presented to support the proposed solutions, and to provide a comparison with other works from the literature.;Keywords: Virtualized Networks, Autonomic Management, Virtual Partitioning, Bandwidth Resource Management, Game Theory, Mechanism Design, Markov Decision Theory, and Linear Programming.
機(jī)譯：網(wǎng)絡(luò)虛擬化已經(jīng)成為一種有前途的方法，可以用來(lái)有效地增強(qiáng)資源管理技術(shù)。在這項(xiàng)工作中，目標(biāo)是研究如何自動(dòng)化帶寬資源管理，同時(shí)為網(wǎng)絡(luò)帶寬資源部署虛擬分區(qū)方案。解決虛擬網(wǎng)絡(luò)中資源管理的工作很多，但是每一項(xiàng)都有一些局限性。資源不堪重負(fù)，帶寬利用率差，利潤(rùn)低，夸張和串通都是這類限制的類型。確實(shí)，缺乏適當(dāng)?shù)膸挿峙浞桨笗?huì)導(dǎo)致資源不堪重負(fù)，一個(gè)客戶可能會(huì)壓倒本應(yīng)為其他客戶服務(wù)的資源。靜態(tài)資源分區(qū)可以抵御不堪重負(fù)，但同時(shí)可能導(dǎo)致帶寬利用率低下，這意味著Internet服務(wù)提供商（ISP）的利潤(rùn)率較低。但是，部署自主管理技術(shù)可以提高資源利用率，并最大程度地提高客戶滿意度。它還向客戶提供一種特權(quán)，應(yīng)該以某種方式對(duì)其進(jìn)行控制，因?yàn)槭冀K渴望最大化其收益的客戶可以使用這種特權(quán)進(jìn)行欺騙。因此，可以預(yù)期諸如夸大和串通之類的作弊行為。在本工作中解決了上述限制。在第一部分中，該工作解決了傳統(tǒng)的先問(wèn)先分配（FAFA）算法的低利潤(rùn)，利用率低和阻塞率高的問(wèn)題。提出的解決方案基于自主資源管理機(jī)制（ARMM）。該解決方案基于拍賣機(jī)制部署了更智能的分配算法。在此級(jí)別上，為了減少夸大的趨勢(shì)，Vickrey-Clarke-Groves（VCG）被提議提供一種威脅模型，該模型基于夸大客戶對(duì)系統(tǒng)中其他人造成的不便之處進(jìn)行懲罰。為了抵制串通，基于馬爾可夫決策理論，計(jì)算了與狀態(tài)有關(guān)的影子價(jià)格，以表示給定狀態(tài)下帶寬單位的售價(jià)閾值。第二部分工作解決了帶寬分配的擴(kuò)展版本問(wèn)題，但通過(guò)不同的方法。在這一部分中，帶寬分配問(wèn)題擴(kuò)展為帶寬分區(qū)問(wèn)題。這種擴(kuò)展允許根據(jù)提供的服務(wù)質(zhì)量（QoS）類劃分鏈路的帶寬資源，從而提供更好的帶寬利用率。為了找到最佳管理指標(biāo)，可通過(guò)線性規(guī)劃（LP）解決該問(wèn)題。還提出了動(dòng)態(tài)帶寬劃分方案來(lái)克服與靜態(tài)劃分方案有關(guān)的問(wèn)題，例如不良的帶寬利用，這可能導(dǎo)致利用不足。該動(dòng)態(tài)分區(qū)模型是定期部署的。與威脅模型相比，定期分區(qū)提供了一種減少夸張推理的新方法，并且消除了進(jìn)一步的計(jì)算開(kāi)銷的需要。這項(xiàng)工作的第三部分提出了一種分散式管理方案，以解決上述問(wèn)題。虛擬網(wǎng)絡(luò)運(yùn)營(yíng)商（VNO）管理的網(wǎng)絡(luò)。這種分散性允許部署更高級(jí)別的自治管理，通過(guò)該自治管理，管理職責(zé)分布在網(wǎng)絡(luò)節(jié)點(diǎn)上，每個(gè)網(wǎng)絡(luò)節(jié)點(diǎn)負(fù)責(zé)管理其出站鏈接。與集中式方案相比，這種分布提供了更高的可靠性和更容易的帶寬確定。而且，它創(chuàng)建了一種雙向競(jìng)爭(zhēng)框架，允許在網(wǎng)絡(luò)參與者，客戶和節(jié)點(diǎn)控制器之間建立雙重拍賣環(huán)境。除了前面提到的周期性模型和威脅模型之外，這種競(jìng)爭(zhēng)環(huán)境還提供了一種減少夸張的新方法。更重要的是，它可以提供更高的利用率，更低的阻塞率，從而帶來(lái)更高的利潤(rùn)。最后，通過(guò)數(shù)值實(shí)驗(yàn)和經(jīng)驗(yàn)結(jié)果來(lái)支持所提出的解決方案，并與文獻(xiàn)中的其他作品進(jìn)行比較。網(wǎng)絡(luò)，自治管理，虛擬分區(qū)，帶寬資源管理，博弈論，機(jī)制設(shè)計(jì)，馬爾可夫決策論和線性規(guī)劃。

著錄項(xiàng)

  • 作者

    Quttoum, Ahmad.;

  • 作者單位

    Ecole de Technologie Superieure (Canada).;

  • 授予單位 Ecole de Technologie Superieure (Canada).;
  • 學(xué)科 Computer Science.;Engineering Electronics and Electrical.
  • 學(xué)位 D.Eng.
  • 年度 2011
  • 頁(yè)碼 167 p.
  • 總頁(yè)數(shù) 167
  • 原文格式 PDF
  • 正文語(yǔ)種 eng
  • 中圖分類
  • 關(guān)鍵詞

相似文獻(xiàn)

  • 外文文獻(xiàn)
  • 中文文獻(xiàn)
  • 專利
獲取原文

客服郵箱：kefu@zhangqiaokeyan.com

京公網(wǎng)安備：11010802029741號(hào) ICP備案號(hào)：京ICP備15016152號(hào)-6 六維聯(lián)合信息科技 (北京) 有限公司?版權(quán)所有

  • 客服微信

  • 服務(wù)號(hào)