Proceedings of the 11th International Conference on Queueing Theory and Network Applications最新文献

筛选
英文 中文
Optimal Throughput Analysis of Random Access Policies for Cognitive Radio Networks with Multiple Channel Access 多信道接入认知无线网络随机接入策略的最优吞吐量分析
Sangdon Park, G. Hwang, J. Choi
{"title":"Optimal Throughput Analysis of Random Access Policies for Cognitive Radio Networks with Multiple Channel Access","authors":"Sangdon Park, G. Hwang, J. Choi","doi":"10.1145/3016032.3016035","DOIUrl":"https://doi.org/10.1145/3016032.3016035","url":null,"abstract":"In this paper we consider a time slotted cognitive radio (CR) network with N wireless channels and M secondary users (SUs). We focus on a random access policy where each SU stochastically decides whether to access idle channels or not based on the given access probability (AP) that is adapted to the channel state information (CSI), if possible. The AP plays an important role in the random access policy because it can control the number of SUs who can access idle channels in a simple manner and hence alleviate packet collisions among SUs. We assume that each SU can access at most L idle channels simultaneously at a time slot whenever possible. We consider two extreme cases - a) where all SUs have full CSI and b) where all SUs have no CSI. We analyze the throughput of an arbitrary SU for the two extreme cases, and rigorously derive a closed-form expression of the optimal AP values that maximize the throughput of an arbitrary SU for the two extreme cases. In the analysis, we also show the impact of multiple channel access and the acquisition of CSI on throughput performance.","PeriodicalId":269685,"journal":{"name":"Proceedings of the 11th International Conference on Queueing Theory and Network Applications","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124211402","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
Multiple Sleep Mode Analysis for Energy Conservation in Green Cognitive Radio Networks 绿色认知无线网络的多睡眠模式节能分析
Jianping Liu, Shunfu Jin, Wuyi Yue
{"title":"Multiple Sleep Mode Analysis for Energy Conservation in Green Cognitive Radio Networks","authors":"Jianping Liu, Shunfu Jin, Wuyi Yue","doi":"10.1145/3016032.3016039","DOIUrl":"https://doi.org/10.1145/3016032.3016039","url":null,"abstract":"In this paper, we examine the key issue of how to conserve the energy of base stations (BSs) in \"green\" Cognitive Radio Networks (CRNs). In order to meet the demand for more sustainable green communication, we introduce a multiple sleep mode for licensed channels in CRNs. Based on a dynamic spectrum access strategy with a proposed multiple sleep mode, we establish a continuous-time Markov Chain model to capture the stochastic behavior of secondary user (SU) and primary user (PU) packets. By using the matrix geometric solution method, we obtain the steady-state probability distribution for the system model. This document also presents analysis for performance evaluation in terms of the average latency of SU packets and the energy saving rate of the system.","PeriodicalId":269685,"journal":{"name":"Proceedings of the 11th International Conference on Queueing Theory and Network Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130102954","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
Performance Analysis of Server Operation with Block Hiring Policy in Cloud Services 云服务中采用块租用策略的服务器运行性能分析
H. Morii, Yutaka Takahashi
{"title":"Performance Analysis of Server Operation with Block Hiring Policy in Cloud Services","authors":"H. Morii, Yutaka Takahashi","doi":"10.1145/3016032.3016050","DOIUrl":"https://doi.org/10.1145/3016032.3016050","url":null,"abstract":"In server-hosting service with cloud computing, servers are hired and released depending on the number of jobs in the system. Considering setup cost which is incurred each time new servers are hired, it may save the total cost if one keeps idle servers for shortly-coming future demand instead of returning them once getting idle. In this paper, we consider an operation policy to hire a group of servers instead of hiring one by one. Firstly we present a queuing model to examine the effect of the number of servers handled simultaneously, called block size, on the system performance to consider the optimal server hiring policy. Through numerical experiments, it is found that with the increase in the block size, charging of setup cost gets less frequent as expected but running cost piles up due to more idle servers. It is also observed that mean waiting time and blocking probability get slightly worse with the block size. The performance analysis presented in the paper will be useful to consider the trade-off relationship between performance and cost of cloud services.","PeriodicalId":269685,"journal":{"name":"Proceedings of the 11th International Conference on Queueing Theory and Network Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122538738","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
Performance Analysis of Advanced Metering Infrastructure with Multihop Hybrid Communication System 基于多跳混合通信系统的高级计量基础设施性能分析
Shunsuke Matsuzawa, Yutaka Takahashi
{"title":"Performance Analysis of Advanced Metering Infrastructure with Multihop Hybrid Communication System","authors":"Shunsuke Matsuzawa, Yutaka Takahashi","doi":"10.1145/3016032.3016038","DOIUrl":"https://doi.org/10.1145/3016032.3016038","url":null,"abstract":"Advanced Metering Infrastructure (AMI) has been attracting considerable attention for effective use of energy. In the system, smart meters installed in houses, factories, and other buildings automatically and periodically measure power consumption data and transmit them to electric power companies, which enables real-time monitoring and power demand control. If the transmission bandwidth allocated to AMI is more than the necessary capacity for periodical collection of power consumption data, other types of communication such as gas and water consumption data collection, demand response for electricity, and inquiries to electric power companies can be conducted by using surplus bandwidth. Multihop wireless networks will be adopted as an FAN (Field Area Network) for communication via smart meters, and it is important to discuss the optimal network topology in order to improve communication performance. In this paper, we propose a mathematical model of AMI taking multihop topology into consideration, and investigate the impact of the configuration of network topology on performance measures.","PeriodicalId":269685,"journal":{"name":"Proceedings of the 11th International Conference on Queueing Theory and Network Applications","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124028999","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
Performance Analysis of Tag Identification Time in Passive RFID Systems 无源RFID系统中标签识别时间的性能分析
Koya Mizuno, Yutaka Takahashi
{"title":"Performance Analysis of Tag Identification Time in Passive RFID Systems","authors":"Koya Mizuno, Yutaka Takahashi","doi":"10.1145/3016032.3016051","DOIUrl":"https://doi.org/10.1145/3016032.3016051","url":null,"abstract":"RFID systems are getting popular for management of things. In this paper, we consider BFSA (Basic Framed Slotted ALOHA) and DFSA (Dynamic Framed Slotted ALOHA) protocols for identification of passive RFID tags, and focus on the tag identification time necessary for a reader to collect IDs from all the tags. We propose a mathematical model and analyze it to evaluate the tag identification time. We also extend the model to include the case that slot length is cut off either when a slot is idle without any transmission or when a collision occurs. Numerical examples show that average tag identification time is drastically decreased by using DFSA protocol and adjusting slot length depending on its usage.","PeriodicalId":269685,"journal":{"name":"Proceedings of the 11th International Conference on Queueing Theory and Network Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123716003","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 stability condition of BMAP/M/∞ queues BMAP/M/∞队列的稳定性条件
Moeko Yajima, Tuan Phung-Duc, H. Masuyama
{"title":"The stability condition of BMAP/M/∞ queues","authors":"Moeko Yajima, Tuan Phung-Duc, H. Masuyama","doi":"10.1145/3016032.3016046","DOIUrl":"https://doi.org/10.1145/3016032.3016046","url":null,"abstract":"This paper considers a BMAP/M/∞ queue with a batch Markovian arrival process (BMAP) and an exponential service time distribution. We first prove that the BMAP/M/∞ queue is stable if and only if the expectation of the logarithm of the batch-size distribution is finite. Using this result, we also present the stability condition for an infinite-server queue with a multiclass batch Markovian arrival process and class-dependent exponential service times.","PeriodicalId":269685,"journal":{"name":"Proceedings of the 11th International Conference on Queueing Theory and Network Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126187984","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}
引用次数: 6
Dynamic Task Scheduling for Energy Harvesting Nodes in Wireless Sensor Networks 无线传感器网络能量收集节点的动态任务调度
Akifumi Maeda, S. Kasahara, Yutaka Takahashi
{"title":"Dynamic Task Scheduling for Energy Harvesting Nodes in Wireless Sensor Networks","authors":"Akifumi Maeda, S. Kasahara, Yutaka Takahashi","doi":"10.1145/3016032.3016054","DOIUrl":"https://doi.org/10.1145/3016032.3016054","url":null,"abstract":"The energy harvesting wireless sensor networks are explored in order to enable environmental monitoring without maintenance for a long term. In this paper, we propose a task scheduling algorithm which performs fair and periodic data collection from all energy harvesting sensor nodes. The goal of the proposed algorithm is to collect data effectively in the situation where the prediction accuracy of recharging profiles is low. In the proposed algorithm, tasks of sensing, reception and transmission for a sensor node are prioritized and scheduled according to the amount of harvested energy of the node. We evaluate the proposed algorithm by computer simulation. As for performance measures, we consider the average number of packets sent to the sink node per cycle for a node, the fairness index in terms of the node position. and the average transmission delay. Numerical examples show that the proposed algorithm increases the average number of packets sent to the sink node while it never degrades fairness index and the average transmission delay as compared with a conventional scheme especially when the amount of harvested energy is large.","PeriodicalId":269685,"journal":{"name":"Proceedings of the 11th International Conference on Queueing Theory and Network Applications","volume":"96 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116502743","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
Analysis of a Multi-server Queueing-inventory System with Non-homogeneous Poisson Arrivals 非齐次泊松到达的多服务器排队-库存系统分析
Dequan Yue, Guoxi Zhao, Wuyi Yue
{"title":"Analysis of a Multi-server Queueing-inventory System with Non-homogeneous Poisson Arrivals","authors":"Dequan Yue, Guoxi Zhao, Wuyi Yue","doi":"10.1145/3016032.3016037","DOIUrl":"https://doi.org/10.1145/3016032.3016037","url":null,"abstract":"In this paper, we consider a multi-server queueing-inventory system with non-homogeneous Poisson arrivals, where the service times and lead times are exponentially distributed. The arrival process of the customers depends on the inventory level. When the on-hand inventory level decreases to zero, one item is replenished immediately with zero lead time. We formulated the system as a quasi-birth-and-death (QBD) process and obtain a stability condition of the system. Then, we compute the stationary distribution of the system and some main performance measures which are used to derive the total cost function. Finally, the computation of optimal (s, S) policy are illustrated by numerical examples.","PeriodicalId":269685,"journal":{"name":"Proceedings of the 11th International Conference on Queueing Theory and Network Applications","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128806629","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}
引用次数: 5
Stochastic Decomposition in Retrial Queueing Inventory System 重试排队库存系统的随机分解
A. Krishnamoorthy, D. Shajin
{"title":"Stochastic Decomposition in Retrial Queueing Inventory System","authors":"A. Krishnamoorthy, D. Shajin","doi":"10.1145/3016032.3016043","DOIUrl":"https://doi.org/10.1145/3016032.3016043","url":null,"abstract":"The purpose of this paper is to obtain product form solution for retrial - queueing - inventory system. We study an M/M/1 retrial queue with a storage system driven by an (s, S) policy. When server is idle, external arrivals enter directly to an orbit. Inventory replenishment lead time is exponentially distributed. The interval between two successive repeat attempts is exponentially distributed and only the customer at the head of the orbit is permitted to access the server. No customer is allowed to join the orbit when the storage system is empty and also when the serer is busy. We first derive the stationary joint distribution of the queue length and the on-hand inventory in explicit product form. Using the joint distribution, we investigate long-run performance measures and a cost function. The optimal pair (s, S) is numerically investigated.","PeriodicalId":269685,"journal":{"name":"Proceedings of the 11th International Conference on Queueing Theory and Network Applications","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126416547","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}
引用次数: 12
Delay Analysis of a Queue with Reservation-Based Scheduling and Class-Dependent Service Times 基于预约调度和类依赖服务时间的队列延迟分析
S. Wittevrongel, B. Feyaerts, H. Bruneel, S. D. Vuyst
{"title":"Delay Analysis of a Queue with Reservation-Based Scheduling and Class-Dependent Service Times","authors":"S. Wittevrongel, B. Feyaerts, H. Bruneel, S. D. Vuyst","doi":"10.1145/3016032.3016042","DOIUrl":"https://doi.org/10.1145/3016032.3016042","url":null,"abstract":"In this paper, we study the delay characteristics of a discrete-time queue with a reservation-based scheduling mechanism. The objective is to provide a better quality of service to delay-sensitive packets at the cost of allowing higher delays for the best-effort packets. We consider a single-server infinite-capacity queue with general independent packet arrivals of class 1 (delay-sensitive) and class 2 (best-effort). The service times of the packets are independent and have a general distribution that depends on the class of the packet. The scheduling mechanism makes use of an in-queue reserved place for future class-1 packet arrivals. A class-1 arrival takes the place of the reservation in the queue, after which a new reservation is created at the tail of the queue. Class-2 arrivals always take place at the tail of the queue. Closed-form expressions are obtained for the probability generating functions and the mean values of the packet delays of both classes.","PeriodicalId":269685,"journal":{"name":"Proceedings of the 11th International Conference on Queueing Theory and Network Applications","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125815152","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学术官方微信