发布求助
文献互助 智能选刊 最新文献

Proceedings of the 12th EAI International Conference on Performance Evaluation Methodologies and Tools最新文献

筛选
英文 中文
Adversarial Multi-armed Bandit for mmWave Beam Alignment with One-Bit Feedback 一比特反馈毫米波波束对准的对抗多臂强盗
Proceedings of the 12th EAI International Conference on Performance Evaluation Methodologies and Tools Pub Date : 2019-03-12 DOI: 10.1145/3306309.3306315
Irched Chafaa, E. Belmega, M. Debbah
{"title":"Adversarial Multi-armed Bandit for mmWave Beam Alignment with One-Bit Feedback","authors":"Irched Chafaa, E. Belmega, M. Debbah","doi":"10.1145/3306309.3306315","DOIUrl":"https://doi.org/10.1145/3306309.3306315","url":null,"abstract":"To exploit the large bandwidth available in the millimeter wave spectrum, highly directional beams need to be employed to compensate for the severe pathloss incurred at high frequencies. As a result, the beams of both the transmitter and the receiver must be constantly aligned. In this paper, the beam alignment (BA) problem is formulated as an adversarial multi-armed bandit (MAB) problem, yielding to a distributed BA search between the transmitter and receiver. First, we analyze the optimal codebook size for the BA that reduces the search space while insuring good performance levels. Then, we propose to use the exponential weights algorithm at both the transmitter and the receiver to match their beams. Our distributed algorithm relies on a single bit of feedback information and its performance is demonstrated via numerical results and compared with existing schemes.","PeriodicalId":113198,"journal":{"name":"Proceedings of the 12th EAI International Conference on Performance Evaluation Methodologies and Tools","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129480041","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}
引用次数: 15
Dependability Modeling and Analysis of 5G Based Monitoring System in Distribution Grids 基于5G的配电网监控系统可靠性建模与分析
Proceedings of the 12th EAI International Conference on Performance Evaluation Methodologies and Tools Pub Date : 2019-03-12 DOI: 10.1145/3306309.3306334
Tesfaye Amare, M. Garau, B. Helvik
{"title":"Dependability Modeling and Analysis of 5G Based Monitoring System in Distribution Grids","authors":"Tesfaye Amare, M. Garau, B. Helvik","doi":"10.1145/3306309.3306334","DOIUrl":"https://doi.org/10.1145/3306309.3306334","url":null,"abstract":"Due to large scale introduction of Distributed Energy Resources (DERs) in the next generation distribution grid, real time monitoring and control is increasingly needed to maintain a stable operation. In such scenario, monitoring systems and state estimation are key tools for getting reliable and accurate knowledge of the grid. These real time applications have strong requirements on communication latency, reliability and security. This paper presents a method, based on Stochastic Activity Network modeling, for analyzing the performance and dependability of advanced communication technologies, such as LTE and 5G, for supporting monitoring system applications. A novel software tool, based on Möbius linked to external libraries, is developed and employed to analyze the impact of communication failures on the state estimation of a distribution grid. The application of the tool and its capabilities are demonstrated through a case study. The approach is promising both with respect to strength as a modelling tool and the kind of results obtained.","PeriodicalId":113198,"journal":{"name":"Proceedings of the 12th EAI International Conference on Performance Evaluation Methodologies and Tools","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129995270","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
Simulation of Evacuation Route Guidance in MANET-based Building Evacuation System 基于manet的建筑物疏散系统中疏散路径引导的仿真
Proceedings of the 12th EAI International Conference on Performance Evaluation Methodologies and Tools Pub Date : 2019-03-12 DOI: 10.1145/3306309.3306345
T. Ohta, J. Dunkel
{"title":"Simulation of Evacuation Route Guidance in MANET-based Building Evacuation System","authors":"T. Ohta, J. Dunkel","doi":"10.1145/3306309.3306345","DOIUrl":"https://doi.org/10.1145/3306309.3306345","url":null,"abstract":"A MANET (Mobile Ad Hoc NETwork) is a network that consists of mobile terminals such as smart phones. In MANETs, information messages can be exchanged directly among mobile terminals using wireless networks so that no centralized server or network infrastructure is required. Therefore, MANETs are very well suited as network technology in emergency situations. For providing the users with adequate evacuation routes, the location and behavior of users must be taken into account. This paper presents a MANET-based building evacuation system to derive evacuation routes. In particular, we discuss the influence of different user behavior based on simulation experiments.","PeriodicalId":113198,"journal":{"name":"Proceedings of the 12th EAI International Conference on Performance Evaluation Methodologies and Tools","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123923253","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}
引用次数: 8
Effect of payload size on mean response time when message segmentations occur: Case of burst packet arrival 当消息分段发生时，有效负载大小对平均响应时间的影响:突发数据包到达的情况
Proceedings of the 12th EAI International Conference on Performance Evaluation Methodologies and Tools Pub Date : 2019-03-12 DOI: 10.1145/3306309.3306313
T. Ikegawa
{"title":"Effect of payload size on mean response time when message segmentations occur: Case of burst packet arrival","authors":"T. Ikegawa","doi":"10.1145/3306309.3306313","DOIUrl":"https://doi.org/10.1145/3306309.3306313","url":null,"abstract":"This paper investigates the effect of payload size on mean response time for communication networks where message segmentations occur and segmented packets within a message arrival over a physical link in bursts. To achieve this, we develop an MX/G/1 queue that represents multiple segmented packets per arrival and a correlated packet size sequence within a message, given a payload size and a message-size distribution. From numerical results, we show that the curves of the mean response time for a packet in the case of low offered load conditions are concave in payload sizes for an actual scenario where Web objects are delivered over a physical link. In addition, we derive the analytical form of a payload size yielding the minimum response time in the case of no offered load conditions when message sizes are exponentially distributed, which is approximately given by √2 ℓ(m) ℓ(h)/3 where ℓ(m) is the mean message size and ℓ(h) is the header/trailer size.","PeriodicalId":113198,"journal":{"name":"Proceedings of the 12th EAI International Conference on Performance Evaluation Methodologies and Tools","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122400281","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
A semi-product-form for the equilibrium state probabilities in a pair of queues with finite batches 有限批对队列均衡状态概率的半积形式
Proceedings of the 12th EAI International Conference on Performance Evaluation Methodologies and Tools Pub Date : 2019-03-12 DOI: 10.1145/3306309.3306316
P. Harrison
{"title":"A semi-product-form for the equilibrium state probabilities in a pair of queues with finite batches","authors":"P. Harrison","doi":"10.1145/3306309.3306316","DOIUrl":"https://doi.org/10.1145/3306309.3306316","url":null,"abstract":"A Markovian network of two queues, with finite size batch Poisson arrivals and departures, is solved approximately, but to arbitrary accuracy, for its equilibrium state probabilities. Below a pair of thresholds on the queue lengths, a modification of the Spectral Expansion Method is used to construct a semi-product-form at all lengths of one queue in a finite lattice strip defined by the threshold of the other queue. No additional special arrival streams are required, for example at empty queues, from which it is already known that a product-form can be constructed. Hence the first exact closed form solution for the equilibrium probabilities in an unmodified Markovian queueing network with batches is obtained, the only constraint being finiteness of the batches. The method is illustrated numerically, first in a tandem network and then in a two-node network with feedback. Simulation results confirm convincingly the precision of the method. Partial batch forwarding and discarding are thereby compared quantitatively.","PeriodicalId":113198,"journal":{"name":"Proceedings of the 12th EAI International Conference on Performance Evaluation Methodologies and Tools","volume":"40 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132969380","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
GOSPAL GOSPAL
Proceedings of the 12th EAI International Conference on Performance Evaluation Methodologies and Tools Pub Date : 2019-03-12 DOI: 10.1145/3306309.3306340
Indu Yadav, P. Chaporkar, A. Karandikar
{"title":"GOSPAL","authors":"Indu Yadav, P. Chaporkar, A. Karandikar","doi":"10.1145/3306309.3306340","DOIUrl":"https://doi.org/10.1145/3306309.3306340","url":null,"abstract":"We consider allocation of a resource to multiple interested users with a constraint that if the resource is allocated to user i, then it cannot be allocated simultaneously to a predefined set of users si. This scenario arises in many practical systems that include wireless networks and constrained queuing systems. It is known that the socially optimal strategy-proof mechanism is not only NP-hard, but it is also hard to approximate. This renders optimal mechanism computationally infeasible to use in practice. Here, we propose a computationally efficient mechanism and prove it to be strategy-proof. Using Monte Carlo simulations, we show that the social utility of the proposed scheme is close to that of the optimal. Further, we demonstrate how the proposed mechanism can be used for fair and efficient short-term spectrum allocation in resource-constrained large wireless networks.","PeriodicalId":113198,"journal":{"name":"Proceedings of the 12th EAI International Conference on Performance Evaluation Methodologies and Tools","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121351134","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
Indexability of an opportunistic scheduling problem with partial channel information 具有部分信道信息的机会调度问题的可索引性
Proceedings of the 12th EAI International Conference on Performance Evaluation Methodologies and Tools Pub Date : 2019-03-12 DOI: 10.1145/3306309.3306324
S. Aalto, P. Lassila, Ianire Taboada
{"title":"Indexability of an opportunistic scheduling problem with partial channel information","authors":"S. Aalto, P. Lassila, Ianire Taboada","doi":"10.1145/3306309.3306324","DOIUrl":"https://doi.org/10.1145/3306309.3306324","url":null,"abstract":"Opportunistic scheduling in wireless cellular systems utilizes random channel quality variations in time by favoring the users with good channel conditions. However, the success of such schedulers is heavily depending on the accuracy of the available information on the channel states of users. In this paper, we consider the opportunistic scheduling problem of downlink data traffic with partial channel information, where the target is to minimize the flow-level holding costs. In earlier works, the Whittle index approach has successfully been utilized to develop near-optimal scheduling policies for the corresponding problems. Using the same approach, we complement and extend the results found thus far. More specifically said, our novel contributions are (i) finding sufficient conditions under which the problem with partial channel information is provably indexable, and (ii) deriving an explicit formula for the corresponding Whittle index. In addition, we evaluate the performance of the derived Whittle index policies and compare them with some greedy policies by numerical simulations.","PeriodicalId":113198,"journal":{"name":"Proceedings of the 12th EAI International Conference on Performance Evaluation Methodologies and Tools","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125357582","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
Revenue maximization with access and information pricing schemes in a partially-observable queueing game 部分可观察排队博弈中具有访问和信息定价方案的收益最大化
Proceedings of the 12th EAI International Conference on Performance Evaluation Methodologies and Tools Pub Date : 2019-01-10 DOI: 10.1145/3306309.3306331
Tesnim Naceur, Y. Hayel
{"title":"Revenue maximization with access and information pricing schemes in a partially-observable queueing game","authors":"Tesnim Naceur, Y. Hayel","doi":"10.1145/3306309.3306331","DOIUrl":"https://doi.org/10.1145/3306309.3306331","url":null,"abstract":"Today's queueing network systems are more rapidly evolving and more complex than those of even a few years ago. The goal of this paper is to study customers' behavior in an unobservable Markovian M/M/1 queue where consumers have to choose between two strategic decisions about information acquisition before joining or not the queue. According to their decision, customers decide to give up the service (balk the system) or to join the queue. We study the Nash equilibrium strategies and we consider the problem of revenue maximization where the provider has to choose between two charging mechanisms: to charge the access to the system or to charge the queue length information to new incoming customers and we show that, depending on the sensitivity of customers to their waiting time, the provider will change the pricing policy used.","PeriodicalId":113198,"journal":{"name":"Proceedings of the 12th EAI International Conference on Performance Evaluation Methodologies and Tools","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-01-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114152229","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
Performance modelling of access control mechanisms for local and vehicular wireless networks 本地和车载无线网络访问控制机制的性能建模
Proceedings of the 12th EAI International Conference on Performance Evaluation Methodologies and Tools Pub Date : 2018-12-30 DOI: 10.1145/3306309.3306326
Paolo Ballarini, Benoît Barbot, Nicolas Vasselin
{"title":"Performance modelling of access control mechanisms for local and vehicular wireless networks","authors":"Paolo Ballarini, Benoît Barbot, Nicolas Vasselin","doi":"10.1145/3306309.3306326","DOIUrl":"https://doi.org/10.1145/3306309.3306326","url":null,"abstract":"Carrier sense multiple access collision avoidance (CSMA/CA) is the basic scheme upon which access to the shared medium is regulated in many wireless networks. With CSMA/CA a station willing to start a transmission has first to find the channel free for a given duration otherwise it will go into backoff, i.e. refraining for transmitting for a randomly chosen delay. Performance analysis of a wireless network employing CSMA/CA regulation is not an easy task: except for simple network configuration analytical solution of key performance indicators (KPI) cannot be obtained hence one has to resort to formal modelling tools. In this paper we present a performance modelling study targeting different kind of CSMA/CA based wireless networks, namely: the IEEE 802.11 Wireless Local Area Networks (WLANs) and the 802.11p Vehicular Ad Hoc Networks (VANETs), which extends 802.11 with priorities over packets. The modelling framework we introduce allows for considering: i) an arbitrarily large number of stations, ii) different traffic conditions (saturated/non-saturated), iii) different hypothesis concerning the shared channel (ideal/non-ideal). We apply statistical model checking to assess KPI of different network configurations.","PeriodicalId":113198,"journal":{"name":"Proceedings of the 12th EAI International Conference on Performance Evaluation Methodologies and Tools","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124383143","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
Computing the k-coverage of a wireless network 计算无线网络的k覆盖
Proceedings of the 12th EAI International Conference on Performance Evaluation Methodologies and Tools Pub Date : 2018-12-29 DOI: 10.1145/3306309.3306337
A. Vergne, L. Decreusefond, P. Martins
{"title":"Computing the k-coverage of a wireless network","authors":"A. Vergne, L. Decreusefond, P. Martins","doi":"10.1145/3306309.3306337","DOIUrl":"https://doi.org/10.1145/3306309.3306337","url":null,"abstract":"Coverage is one of the main quality of service of a wireless network. k-coverage, that is to be covered simultaneously by k network nodes, is synonym of reliability and numerous applications such as multiple site MIMO features, or handovers. We introduce here a new algorithm for computing the k-coverage of a wireless network. Our method is based on the observation that k-coverage can be interpreted as k layers of 1-coverage, or simply coverage. We use simplicial homology to compute the network's topology and a reduction algorithm to indentify the layers of 1-coverage. We provide figures and simulation results to illustrate our algorithm.","PeriodicalId":113198,"journal":{"name":"Proceedings of the 12th EAI International Conference on Performance Evaluation Methodologies and Tools","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124719401","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
首页 上一页 下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信