Hongbin Liang, L. Cai, Hangguan Shan, Xuemin Shen, D. Peng
{"title":"基于半马尔可夫决策过程的媒体服务自适应资源分配","authors":"Hongbin Liang, L. Cai, Hangguan Shan, Xuemin Shen, D. Peng","doi":"10.1109/ICTC.2010.5674663","DOIUrl":null,"url":null,"abstract":"In this paper, we study adaptive resource allocation for elastic media services in service-oriented network. We form ulate the resource allocation problem as a semi-Markov decision process (SMDP) to capture the dynamics of user arrivals and departures. Based on the network resources, an optimal decision is made to maximize the overall system rewards by striking the balance between the network utilities and costs of network resources. We further analyze the network performance in terms of the service blocking probability, and the probability of different decisions or actions of resource allocation. Extensive simulations demonstrate that our proposed scheme can achieve much higher network utility and lower service blocking probability compared with a greedy resource allocation.","PeriodicalId":149198,"journal":{"name":"2010 International Conference on Information and Communication Technology Convergence (ICTC)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"Adaptive resource allocation for media services based on semi-Markov decision process\",\"authors\":\"Hongbin Liang, L. Cai, Hangguan Shan, Xuemin Shen, D. Peng\",\"doi\":\"10.1109/ICTC.2010.5674663\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we study adaptive resource allocation for elastic media services in service-oriented network. We form ulate the resource allocation problem as a semi-Markov decision process (SMDP) to capture the dynamics of user arrivals and departures. Based on the network resources, an optimal decision is made to maximize the overall system rewards by striking the balance between the network utilities and costs of network resources. We further analyze the network performance in terms of the service blocking probability, and the probability of different decisions or actions of resource allocation. Extensive simulations demonstrate that our proposed scheme can achieve much higher network utility and lower service blocking probability compared with a greedy resource allocation.\",\"PeriodicalId\":149198,\"journal\":{\"name\":\"2010 International Conference on Information and Communication Technology Convergence (ICTC)\",\"volume\":\"28 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-12-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 International Conference on Information and Communication Technology Convergence (ICTC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICTC.2010.5674663\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 International Conference on Information and Communication Technology Convergence (ICTC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICTC.2010.5674663","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Adaptive resource allocation for media services based on semi-Markov decision process
In this paper, we study adaptive resource allocation for elastic media services in service-oriented network. We form ulate the resource allocation problem as a semi-Markov decision process (SMDP) to capture the dynamics of user arrivals and departures. Based on the network resources, an optimal decision is made to maximize the overall system rewards by striking the balance between the network utilities and costs of network resources. We further analyze the network performance in terms of the service blocking probability, and the probability of different decisions or actions of resource allocation. Extensive simulations demonstrate that our proposed scheme can achieve much higher network utility and lower service blocking probability compared with a greedy resource allocation.