无线蜂窝网络中新型流媒体服务资源分配策略的评价与比较

M. Karray, Yasir Khan
{"title":"无线蜂窝网络中新型流媒体服务资源分配策略的评价与比较","authors":"M. Karray, Yasir Khan","doi":"10.1109/ComNet.2012.6217734","DOIUrl":null,"url":null,"abstract":"Since a long time wireless networks have been offering two types of services: variable bit-rate such as mail and constant bit-rate such as voice. Recently they also offer service for streaming calls such as mobile television. The objective of the present paper is to study the problem of allocating (and sharing) the resources for this new type of calls and to compare the performance of different allocation strategies. The allocation strategy implemented in real networks is an iterative time-sharing strategy. We build an explicit formulation of this strategy which permits not only a faster implementation, but also an analytical evaluation of its performance. Moreover we describe an optimal allocation strategy consisting of assigning the resources in priority to the least consuming ones. A cornerstone to evaluate and compare the different allocation strategies is the so-called outage probability defined for each location as the probability that a user in this location doesn't get his required bit-rate. We compare the efficiency of different numerical methods to calculate it; and show that the inverse Laplace method is rapid and efficient. We also calculate the increase of the outage probability of the time-sharing strategy compared to the optimal one. Finally, we validate a method permitting to calculate analytically the average of the outage probabilities over the different locations.","PeriodicalId":296060,"journal":{"name":"Third International Conference on Communications and Networking","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Evaluation and comparison of resource allocation strategies for new streaming services in wireless cellular networks\",\"authors\":\"M. Karray, Yasir Khan\",\"doi\":\"10.1109/ComNet.2012.6217734\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Since a long time wireless networks have been offering two types of services: variable bit-rate such as mail and constant bit-rate such as voice. Recently they also offer service for streaming calls such as mobile television. The objective of the present paper is to study the problem of allocating (and sharing) the resources for this new type of calls and to compare the performance of different allocation strategies. The allocation strategy implemented in real networks is an iterative time-sharing strategy. We build an explicit formulation of this strategy which permits not only a faster implementation, but also an analytical evaluation of its performance. Moreover we describe an optimal allocation strategy consisting of assigning the resources in priority to the least consuming ones. A cornerstone to evaluate and compare the different allocation strategies is the so-called outage probability defined for each location as the probability that a user in this location doesn't get his required bit-rate. We compare the efficiency of different numerical methods to calculate it; and show that the inverse Laplace method is rapid and efficient. We also calculate the increase of the outage probability of the time-sharing strategy compared to the optimal one. Finally, we validate a method permitting to calculate analytically the average of the outage probabilities over the different locations.\",\"PeriodicalId\":296060,\"journal\":{\"name\":\"Third International Conference on Communications and Networking\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-06-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Third International Conference on Communications and Networking\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ComNet.2012.6217734\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Third International Conference on Communications and Networking","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ComNet.2012.6217734","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

摘要

长期以来,无线网络一直提供两种类型的服务:可变比特率(如邮件)和恒定比特率(如语音)。最近,他们还提供流媒体电话服务,如移动电视。本文的目的是研究这种新型调用的资源分配(和共享)问题,并比较不同分配策略的性能。在实际网络中实现的分配策略是一种迭代的分时策略。我们建立了这一战略的明确公式,它不仅允许更快的实施,而且允许对其性能进行分析性评估。此外,我们还描述了一种将资源优先分配给消耗最少的资源的最优分配策略。评估和比较不同分配策略的基础是所谓的中断概率,它为每个位置定义为该位置的用户未获得所需比特率的概率。比较了不同数值计算方法的效率;证明了拉普拉斯逆变换法的快速和高效。我们还计算了与最优分时策略相比,分时策略的中断概率增加。最后,我们验证了一种方法,该方法允许分析地计算不同位置的停机概率的平均值。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Evaluation and comparison of resource allocation strategies for new streaming services in wireless cellular networks
Since a long time wireless networks have been offering two types of services: variable bit-rate such as mail and constant bit-rate such as voice. Recently they also offer service for streaming calls such as mobile television. The objective of the present paper is to study the problem of allocating (and sharing) the resources for this new type of calls and to compare the performance of different allocation strategies. The allocation strategy implemented in real networks is an iterative time-sharing strategy. We build an explicit formulation of this strategy which permits not only a faster implementation, but also an analytical evaluation of its performance. Moreover we describe an optimal allocation strategy consisting of assigning the resources in priority to the least consuming ones. A cornerstone to evaluate and compare the different allocation strategies is the so-called outage probability defined for each location as the probability that a user in this location doesn't get his required bit-rate. We compare the efficiency of different numerical methods to calculate it; and show that the inverse Laplace method is rapid and efficient. We also calculate the increase of the outage probability of the time-sharing strategy compared to the optimal one. Finally, we validate a method permitting to calculate analytically the average of the outage probabilities over the different locations.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信