异构类型移动用户和接入点的分配策略机制

T. Kimura, T. Murase, T. Okuda
{"title":"异构类型移动用户和接入点的分配策略机制","authors":"T. Kimura, T. Murase, T. Okuda","doi":"10.1109/CQR.2012.6267107","DOIUrl":null,"url":null,"abstract":"This paper discusses a various customer heterogeneous server (VCHS) queuing system strategy for the optimal assignment of mobile users to wireless LAN access points (APs) to optimize user quality of service (QoS). The users and APs have heterogeneous types of service requests and services, such as types of service providers, respectively. It is assumed that users arrive in a stochastic manner and that the proportions of user traffic volumes to each service request are provided. The user only connects to an AP that matches the service with the user request. Then, the user leaves after downloading a specific volume of data. A “group” assignment strategy is proposed to match the service resources to the service request demands. The strategy includes how to make a group from a number of APs proportional to the volume of user traffic to each service request. The evaluations show that the “group” assignment strategy is significantly better than a “random” assignment strategy in terms of mean waiting time. The proposed strategy reduces the mean waiting time by 25%, with more significant decreases as the number of APs with more types of services increases.","PeriodicalId":394442,"journal":{"name":"2012 IEEE International Workshop Technical Committee on Communications Quality and Reliability (CQR)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Assignment strategy mechanism for heterogeneous types of mobile users and access points\",\"authors\":\"T. Kimura, T. Murase, T. Okuda\",\"doi\":\"10.1109/CQR.2012.6267107\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper discusses a various customer heterogeneous server (VCHS) queuing system strategy for the optimal assignment of mobile users to wireless LAN access points (APs) to optimize user quality of service (QoS). The users and APs have heterogeneous types of service requests and services, such as types of service providers, respectively. It is assumed that users arrive in a stochastic manner and that the proportions of user traffic volumes to each service request are provided. The user only connects to an AP that matches the service with the user request. Then, the user leaves after downloading a specific volume of data. A “group” assignment strategy is proposed to match the service resources to the service request demands. The strategy includes how to make a group from a number of APs proportional to the volume of user traffic to each service request. The evaluations show that the “group” assignment strategy is significantly better than a “random” assignment strategy in terms of mean waiting time. The proposed strategy reduces the mean waiting time by 25%, with more significant decreases as the number of APs with more types of services increases.\",\"PeriodicalId\":394442,\"journal\":{\"name\":\"2012 IEEE International Workshop Technical Committee on Communications Quality and Reliability (CQR)\",\"volume\":\"50 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-05-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 IEEE International Workshop Technical Committee on Communications Quality and Reliability (CQR)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CQR.2012.6267107\",\"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 International Workshop Technical Committee on Communications Quality and Reliability (CQR)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CQR.2012.6267107","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

本文讨论了一种多用户异构服务器(VCHS)排队系统策略,用于移动用户到无线局域网接入点(ap)的最优分配,以优化用户服务质量(QoS)。用户和ap的服务请求和服务类型都是异构的,例如服务提供商的类型。假设用户以随机方式到达,并提供用户流量与每个服务请求的比例。用户只连接与用户请求的服务匹配的AP。然后,用户在下载特定数量的数据后离开。提出了一种“组”分配策略,使服务资源与服务请求需求相匹配。该策略包括如何使由多个ap组成的组与每个服务请求的用户流量成比例。评价结果表明,在平均等待时间方面,“分组”分配策略明显优于“随机”分配策略。所提出的策略将平均等待时间减少了25%,随着具有更多类型服务的ap数量的增加,减少的幅度更大。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Assignment strategy mechanism for heterogeneous types of mobile users and access points
This paper discusses a various customer heterogeneous server (VCHS) queuing system strategy for the optimal assignment of mobile users to wireless LAN access points (APs) to optimize user quality of service (QoS). The users and APs have heterogeneous types of service requests and services, such as types of service providers, respectively. It is assumed that users arrive in a stochastic manner and that the proportions of user traffic volumes to each service request are provided. The user only connects to an AP that matches the service with the user request. Then, the user leaves after downloading a specific volume of data. A “group” assignment strategy is proposed to match the service resources to the service request demands. The strategy includes how to make a group from a number of APs proportional to the volume of user traffic to each service request. The evaluations show that the “group” assignment strategy is significantly better than a “random” assignment strategy in terms of mean waiting time. The proposed strategy reduces the mean waiting time by 25%, with more significant decreases as the number of APs with more types of services increases.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信