基于QoS感知的虚拟网络嵌入周期拍卖

A. Jarray, A. Karmouch
{"title":"基于QoS感知的虚拟网络嵌入周期拍卖","authors":"A. Jarray, A. Karmouch","doi":"10.1109/IWQoS.2012.6245970","DOIUrl":null,"url":null,"abstract":"In this paper, our focus is on the embedding problem which consists on the mapping of VN resources onto physical infrastructure network. More specifically, we consider the problem of optimizing the Physical Infrastructure Provider's (PIP) profit while minimizing the dissatisfaction of VN customers. We propose to dynamically partition the PIP resources over VN requests belonging to different Quality of Service (QoS) classes using periodical auction mechanism. We formulate the dynamic embedding problem as an Integer Linear Program (ILP) that allows us to: (i) maximize the PIP profit, and (ii) calculate the optimal embedding scheme of VN requests without disruption of those previously accepted in order to uphold QoS guarantees.","PeriodicalId":178333,"journal":{"name":"2012 IEEE 20th International Workshop on Quality of Service","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"20","resultStr":"{\"title\":\"Periodical auctioning for QoS aware virtual network embedding\",\"authors\":\"A. Jarray, A. Karmouch\",\"doi\":\"10.1109/IWQoS.2012.6245970\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, our focus is on the embedding problem which consists on the mapping of VN resources onto physical infrastructure network. More specifically, we consider the problem of optimizing the Physical Infrastructure Provider's (PIP) profit while minimizing the dissatisfaction of VN customers. We propose to dynamically partition the PIP resources over VN requests belonging to different Quality of Service (QoS) classes using periodical auction mechanism. We formulate the dynamic embedding problem as an Integer Linear Program (ILP) that allows us to: (i) maximize the PIP profit, and (ii) calculate the optimal embedding scheme of VN requests without disruption of those previously accepted in order to uphold QoS guarantees.\",\"PeriodicalId\":178333,\"journal\":{\"name\":\"2012 IEEE 20th International Workshop on Quality of Service\",\"volume\":\"12 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-06-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"20\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 IEEE 20th International Workshop on Quality of Service\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IWQoS.2012.6245970\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE 20th International Workshop on Quality of Service","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IWQoS.2012.6245970","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 20

摘要

在本文中,我们的重点是嵌入问题,包括映射的虚拟网络资源到物理基础设施网络。更具体地说,我们考虑的问题是优化物理基础设施提供商(PIP)的利润,同时尽量减少VN客户的不满。我们建议使用周期性拍卖机制对属于不同服务质量(QoS)类的VN请求动态划分PIP资源。我们将动态嵌入问题表述为一个整数线性规划(ILP),它允许我们:(i)最大化PIP利润,(ii)计算VN请求的最佳嵌入方案,而不会中断先前接受的请求,以维护QoS保证。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Periodical auctioning for QoS aware virtual network embedding
In this paper, our focus is on the embedding problem which consists on the mapping of VN resources onto physical infrastructure network. More specifically, we consider the problem of optimizing the Physical Infrastructure Provider's (PIP) profit while minimizing the dissatisfaction of VN customers. We propose to dynamically partition the PIP resources over VN requests belonging to different Quality of Service (QoS) classes using periodical auction mechanism. We formulate the dynamic embedding problem as an Integer Linear Program (ILP) that allows us to: (i) maximize the PIP profit, and (ii) calculate the optimal embedding scheme of VN requests without disruption of those previously accepted in order to uphold QoS guarantees.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信