2022 20th International Symposium on Modeling and Optimization in Mobile, Ad hoc, and Wireless Networks (WiOpt)最新文献

筛选
英文 中文
Regret-Optimal Learning for Minimizing Edge Caching Service Costs 最小化边缘缓存服务成本的后悔最优学习
Guocong Quan, A. Eryilmaz, N. Shroff
{"title":"Regret-Optimal Learning for Minimizing Edge Caching Service Costs","authors":"Guocong Quan, A. Eryilmaz, N. Shroff","doi":"10.23919/WiOpt56218.2022.9930560","DOIUrl":"https://doi.org/10.23919/WiOpt56218.2022.9930560","url":null,"abstract":"Edge caching has been widely implemented to efficiently serve data requests from end users. Numerous edge caching policies have been proposed to adaptively update cache content based on various statistics including data popularities and miss costs. Nevertheless, these policies typically assume that the miss cost for each data item is known, which is not true in real systems. A promising approach would be to use online learning to estimate these unknown miss costs. However, existing techniques cannot be directly applied, because the caching problem has additional cache capacity and cache update constraints that are not covered in traditional learning settings. In this work, we resolve these issues by developing a novel edge caching policy that learns uncertainty miss costs efficiently, and is shown to be asymptotically optimal. We first derive an asymptotic lower bound on the achievable regret. We then design a Kullback-Leibler lower confidence bound (KL-LCB) based edge caching policy, which adaptively learns the random miss costs by following the “optimism in the face of uncertainty” principle. By employing a novel analysis that accounts for the new constraints and the dynamics of the setting, we prove that the regret of the proposed policy matches the regret lower bound, thus showing asymptotic optimality. Further, via numerical experiments we demonstrate the performance improvements of our policy over natural benchmarks.","PeriodicalId":228040,"journal":{"name":"2022 20th International Symposium on Modeling and Optimization in Mobile, Ad hoc, and Wireless Networks (WiOpt)","volume":"223 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121100501","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Optimal Load Balancing in Heterogeneous Server Systems 异构服务器系统的最优负载均衡
Sanidhay Bhambay, Arpan Mukhopadhyay
{"title":"Optimal Load Balancing in Heterogeneous Server Systems","authors":"Sanidhay Bhambay, Arpan Mukhopadhyay","doi":"10.23919/WiOpt56218.2022.9930523","DOIUrl":"https://doi.org/10.23919/WiOpt56218.2022.9930523","url":null,"abstract":"A fundamental problem in large-scale data centers is to reduce the average response time of jobs. The Join-the-Shortest-Queue (JSQ) load balancing scheme is known to minimise the average response time of jobs for homogeneous systems consisting of identical servers. However, heterogeneous systems consisting of servers with different speeds, JSQ performs poorly. Furthermore, JSQ suffers from high communication overhead as it requires knowledge of the queue length of all servers while assigning incoming jobs to one of the destination servers. Therefore, the Join-the-Idle-Queue (JIQ) scheme was introduced which not only reduces the communication overhead but also minimises the average response time of jobs under homogeneous systems. Despite these advantages, JIQ is still known to be inefficient in minimising the average response time of jobs under heterogeneous systems. In this paper, we consider a speed-aware version of JIQ for heterogeneous systems and show that it achieves delay optimality in the fluid limit. One of the technical challenges to establishing this optimality is to show the tightness of the sequence of steady-state distributions indexed by system size. We show this tightness result by evaluating the drift of appropriate Lyapunov functions. This approach to proving tightness is different from the usual coupling approach used for homogeneous systems. Another important challenge in proving the optimality result is to establish the fluid limit which is done using the time-scale separation technique. Finally, using the monotonicity of the fluid process we have shown that the fluid limit has a unique and globally attractive fixed point.","PeriodicalId":228040,"journal":{"name":"2022 20th International Symposium on Modeling and Optimization in Mobile, Ad hoc, and Wireless Networks (WiOpt)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123572877","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Towards 6G-enabled Sustainable and Smart Mobility – A Vision and Roadmap 迈向支持6g的可持续和智能移动-愿景和路线图
T. Ojanperä, S. Boumard, M. Lasanen, Stephan Mehnert, A. Anttonen
{"title":"Towards 6G-enabled Sustainable and Smart Mobility – A Vision and Roadmap","authors":"T. Ojanperä, S. Boumard, M. Lasanen, Stephan Mehnert, A. Anttonen","doi":"10.23919/WiOpt56218.2022.9930604","DOIUrl":"https://doi.org/10.23919/WiOpt56218.2022.9930604","url":null,"abstract":"ICT and digitalization play a key role in the transition needed to fulfil the United Nations’ sustainable development goals. In the case of the mobility and transport sector, sustainability challenges include not only reducing greenhouse gas emissions but also improving safety, accessibility, and resiliency of the transport systems. In this paper, we study how ICT, especially, the next generation 6G mobile communication technology can enable sustainable and smart mobility in the future. Our study focuses on three selected areas of mobility and transport, namely cars, ships, and drones. Unlike the existing works, we bundle up these three domains more comprehensively with that of 6G technologies and sustainability perspectives. We also provide a visionary roadmap on the most prominent technologies for 6G research to serve the future communication technology needs of sustainable and smart mobility.","PeriodicalId":228040,"journal":{"name":"2022 20th International Symposium on Modeling and Optimization in Mobile, Ad hoc, and Wireless Networks (WiOpt)","volume":"153 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122289803","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The Impact of Network State AoI on Throughput in a Wireless SDN 网络状态AoI对无线SDN吞吐量的影响
C. Kam, S. Kompella, A. Ephremides
{"title":"The Impact of Network State AoI on Throughput in a Wireless SDN","authors":"C. Kam, S. Kompella, A. Ephremides","doi":"10.23919/WiOpt56218.2022.9930616","DOIUrl":"https://doi.org/10.23919/WiOpt56218.2022.9930616","url":null,"abstract":"This work studies the role of Age of Information (AoI) in the network state updating process for wireless software defined networks (SDN). The SDN routers must routinely update their knowledge of the network state, which is used as a basis for making routing and scheduling decisions. However, the network updates require communication resources, so there is a tradeoff between the frequency of updates and maximum network throughput. We assume the network state is Markovian and no new observations are received in between updates, so the AoI of the network state information impacts the ability of the network to optimize its performance. We formulate the problem as a finite-horizon Partially Observable Markov Decision Process (POMDP) for each period. For a symmetric fading model of the network, we derive the limiting performance and an upper bound. To generate policies for a range of fixed time horizons, we use Monte Carlo planning-based POMDP solvers. Simulation of these policies show that there is a finite optimal update period that maximizes network throughput. In addition, we study non-uniform update intervals, which can yield even higher throughput if the interval is chosen based on the state observed. We conclude that AoI itself is not sufficient to characterize performance, but what matters is the AoI for the specific network state information.","PeriodicalId":228040,"journal":{"name":"2022 20th International Symposium on Modeling and Optimization in Mobile, Ad hoc, and Wireless Networks (WiOpt)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116828891","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Monte Carlo Tree Search Bidding Strategy for Simultaneous Ascending Auctions 同时上升拍卖的蒙特卡洛树搜索竞价策略
Alexandre Pacaud, M. Coupechoux, Aurélien Bechler
{"title":"Monte Carlo Tree Search Bidding Strategy for Simultaneous Ascending Auctions","authors":"Alexandre Pacaud, M. Coupechoux, Aurélien Bechler","doi":"10.23919/WiOpt56218.2022.9930539","DOIUrl":"https://doi.org/10.23919/WiOpt56218.2022.9930539","url":null,"abstract":"We tackle in this work the problem for a player to efficiently bid in Simultaneous Ascending Auctions (SAA). Although the success of SAA partially comes from its relative simplicity, bidding efficiently in such an auction is complicated as it presents a number of complex strategical problems. No generic algorithm or analytical solution has yet been able to compute the optimal bidding strategy in face of such complexities. By modelling the auction as a turn-based deterministic game with complete information, we propose the first algorithm which tackles simultaneously two of its main issues: exposure and own price effect. Our bidding strategy is computed by Monte Carlo Tree Search (MCTS) which relies on a new method for the prediction of closing prices. We show that our algorithm significantly outperforms state-of-the-art existing bidding methods. More precisely, our algorithm achieves a higher expected utility by taking lower risks than existing strategies.","PeriodicalId":228040,"journal":{"name":"2022 20th International Symposium on Modeling and Optimization in Mobile, Ad hoc, and Wireless Networks (WiOpt)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114202505","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Personalized Pricing via Strategic Learning of Buyers’ Social Interactions 基于买家社交互动策略学习的个性化定价
Qinqi Lin, Lingjie Duan, Jianwei Huang
{"title":"Personalized Pricing via Strategic Learning of Buyers’ Social Interactions","authors":"Qinqi Lin, Lingjie Duan, Jianwei Huang","doi":"10.23919/WiOpt56218.2022.9930565","DOIUrl":"https://doi.org/10.23919/WiOpt56218.2022.9930565","url":null,"abstract":"As the sociological theory of homophily suggests, people tend to interact with those of similar preferences. This motivates product sellers to learn buyers’ product preferences from the buyers’ friends’ purchase records. Although such learning allows sellers to enable personalized pricing to improve profits, buyers are also increasingly aware of such practices and may alter their behaviors accordingly. This paper presents the first study regarding how buyers may strategically manipulate their social interaction signals considering their preference correlations, and how an informed seller can take buyers’ strategic social behaviors into consideration when designing the pricing schemes. Our analytical results show that only high-preference buyers tend to manipulate their social interactions to hurdle the seller’s personalized pricing. Surprisingly, these high-preference buyers’ payoff may become worse after their strategic manipulation. Furthermore, we show that the seller can greatly benefit from the learning practice, no matter whether the buyers are aware of such learning or not. In fact, buyers’ learning-aware strategic manipulation only slightly reduces the seller’s revenue. Considering the increasingly stricter policies on data access by authorities, it is thus advisable for sellers to make buyers aware of their access and learning based on social interaction data. This justifies well with current regulatory policies and industry practices regarding informed consent for data sharing.","PeriodicalId":228040,"journal":{"name":"2022 20th International Symposium on Modeling and Optimization in Mobile, Ad hoc, and Wireless Networks (WiOpt)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115978382","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Stochastic Muting with Short-range Relay Analysis 随机噪声与近程继电器分析
Christian Vitale, Vincenzo Sciancalepore, V. Mancuso
{"title":"Stochastic Muting with Short-range Relay Analysis","authors":"Christian Vitale, Vincenzo Sciancalepore, V. Mancuso","doi":"10.23919/WiOpt56218.2022.9930544","DOIUrl":"https://doi.org/10.23919/WiOpt56218.2022.9930544","url":null,"abstract":"Resource muting in the time-frequency domain is a tool for controlling co-channel interference in cellular networks. However, coordinated resource of multiple cells implies nontrivial complexity to be effective. Moreover, resource muting does not guarantee fair resource allocation to users. However, we analytically show that stochastic resource muting jointly with opportunistic short-range relay operated by neighbor mobile devices permits to abate the complexity of muting coordination and boosts throughput fairness among users. We therefore formulate a convex proportional fairness optimization problem and leverage our analysis to design VSM-PF, a practical optimization scheme that significantly outperforms legacy systems.","PeriodicalId":228040,"journal":{"name":"2022 20th International Symposium on Modeling and Optimization in Mobile, Ad hoc, and Wireless Networks (WiOpt)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131001064","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Research Issues for Sustainable Wireless Networks: A Stakeholder Approach 可持续无线网络的研究问题:利益相关者方法
Marja Matinmikko-Blue
{"title":"Research Issues for Sustainable Wireless Networks: A Stakeholder Approach","authors":"Marja Matinmikko-Blue","doi":"10.23919/WiOpt56218.2022.9930610","DOIUrl":"https://doi.org/10.23919/WiOpt56218.2022.9930610","url":null,"abstract":"Sustainability and sustainable development are topics that are increasingly addressed in the ICT sector including wireless networks. Yet, their interpretations vary a great deal depending on the person without a commonly agreed approach. This paper presents an overview of sustainability and sustainable development in the context of ICTs and wireless networks highlighting the urgency of introducing sustainability principles at all levels and stages of ICT technology development. The paper presents a way forward to adopt sustainability principles into future technology design considering the triple bottom line of economic, social and environmental sustainability perspectives. A change in mindset is urgently needed and all stakeholders need to act in their own capacity as well as collaboratively to make the wireless networks and their use truly sustainable without green-washing. New metrics need to be defined and measured to respond to growing concerns as today’s metrics, such as total consumed mobile data are far from sustainable. Time to act is now as the design criteria for the future sustainable 6G are defined in the next years.","PeriodicalId":228040,"journal":{"name":"2022 20th International Symposium on Modeling and Optimization in Mobile, Ad hoc, and Wireless Networks (WiOpt)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124395228","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Online Convex Optimization with Switching Costs: Algorithms and Performance 具有切换代价的在线凸优化:算法和性能
Qingsong Liu, Zhuoran Li, Zhixuan Fang
{"title":"Online Convex Optimization with Switching Costs: Algorithms and Performance","authors":"Qingsong Liu, Zhuoran Li, Zhixuan Fang","doi":"10.23919/WiOpt56218.2022.9930570","DOIUrl":"https://doi.org/10.23919/WiOpt56218.2022.9930570","url":null,"abstract":"In this paper, we study the problem of online convex optimization with switching costs (SOCO) that appears in diverse scenarios including power management, video streaming, resource allocation, etc. SOCO refers to online decision problems when the agent incurs both hitting cost and an additional switching cost of changing decisions. We adopt the universal dynamic regret as the performance metric, and consider the case when loss functions are unknown when making decisions. Previous results rely on the assumptions on loss function, e.g., linearity and smoothness, or prior knowledge of regularity measures, e.g., path length of the comparator sequence. In this paper, we propose an algorithm IOMD-SOCO that applies to general convex loss function, and show that the algorithm achieves an order-optimal universal dynamic regret bound. We also propose its parameter-free versions, i.e., without requiring the prior knowledge of path length of the comparator sequence, and achieve the same-order regret bound. We are the first to provide dynamic regret bounds for SOCO with general convex loss functions via parameter-free algorithm. Our numerical experiments show that IOMD-SOCO indeed achieves a substantial performance improvement.","PeriodicalId":228040,"journal":{"name":"2022 20th International Symposium on Modeling and Optimization in Mobile, Ad hoc, and Wireless Networks (WiOpt)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114548666","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Jointly Learning Optimal Task Offloading and Scheduling Policies for Mobile Edge Computing 联合学习移动边缘计算的最优任务卸载和调度策略
L. Chatzieleftheriou, I. Koutsopoulos
{"title":"Jointly Learning Optimal Task Offloading and Scheduling Policies for Mobile Edge Computing","authors":"L. Chatzieleftheriou, I. Koutsopoulos","doi":"10.23919/WiOpt56218.2022.9930542","DOIUrl":"https://doi.org/10.23919/WiOpt56218.2022.9930542","url":null,"abstract":"This work contributes towards optimizing edge analytics in Mobile Edge Computing (MEC) systems. We consider requests for computing tasks that are generated from users and can be satisfied either locally at their devices, or they can be offloaded to an edge server in their proximity for remote execution. We study a multi-user MEC system with limited energy autonomy for the mobile devices and with limitations on the computing capability of both mobile devices and at an edge server, where users can offload part of their computation load. We define a utility over “resource residuals”, that capture the difference between the resources assigned through our decisions, and those needed in practice, and we aim at the minimization of regret, i.e., of the difference between the utility obtained by an optimal offline benchmark that knows the system evolution in hindsight, and our online decision policy. We design an algorithm that jointly learns policies for offloading computations and scheduling them for execution at the shared MEC server. We prove that our algorithm is asymptotically optimal, i.e., it has no regret over the optimal static offline benchmark, and that its performance is independent of the number of devices in the system. From our numerical evaluation we conclude that our algorithm adapts to unpredictable demand changes, it learns to identify resource-limited devices, and it learns to share the server’s resources.","PeriodicalId":228040,"journal":{"name":"2022 20th International Symposium on Modeling and Optimization in Mobile, Ad hoc, and Wireless Networks (WiOpt)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125345514","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信