International Conference on Queueing Theory and Network Applications最新文献_第9页

A matrix decomposition approach for solving state balance equations of a phase-type queueing model with multiple servers 一种求解多服务器阶段型排队模型状态平衡方程的矩阵分解方法

International Conference on Queueing Theory and Network Applications Pub Date : 2011-08-23 DOI: 10.1145/2021216.2021244

Yuan-Heng Yen, H. Luh, Chia-Hung Wang

引用次数: 0

On some simple single server models of dynamic storage 在一些简单的单服务器动态存储模型上

International Conference on Queueing Theory and Network Applications Pub Date : 2011-08-23 DOI: 10.1145/2021216.2021240

E. Sohn, C. Knessl

{"title":"On some simple single server models of dynamic storage","authors":"E. Sohn, C. Knessl","doi":"10.1145/2021216.2021240","DOIUrl":"https://doi.org/10.1145/2021216.2021240","url":null,"abstract":"We consider models of queue storage, where items arrive accordingly to a Poisson process of rate λ and each item takes up one cell in a linear array of cells, which are numbered {1, 2, 3,...}. The arriving item is placed in the lowest numbered available cell. The total service rate provided to the items is the constant μ (with ρ = λ/μ), but service may be provided simultaneously to more than one item. If there are N items stored and each is serviced at the rate μ/N, this corresponds to processor sharing (PS). We analyze two models of this type, which have been shown to provide bounds on the PS model. We shall assume that (1) the server works only on the left-most item, or (2) on the two rightmost items. The set of occupied cells at any time is {i1, i2,...,iN} where i1 < i2 <... < iN and we are interested in the wasted space (iN − N), the maximum occupied cell (iN), and the joint distribution of the wasted space and the number of items in the system (N). We study these exactly and asymptotically, especially in the heavy traffic limit where ρ ↑ 1.","PeriodicalId":347695,"journal":{"name":"International Conference on Queueing Theory and Network Applications","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131317328","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

Analysis of optimal random access policies for cognitive radio networks under Rayleigh fading 瑞利衰落下认知无线网络最优随机接入策略分析

International Conference on Queueing Theory and Network Applications Pub Date : 2011-08-23 DOI: 10.1145/2021216.2021219

Hyeonje Cho, G. Hwang

{"title":"Analysis of optimal random access policies for cognitive radio networks under Rayleigh fading","authors":"Hyeonje Cho, G. Hwang","doi":"10.1145/2021216.2021219","DOIUrl":"https://doi.org/10.1145/2021216.2021219","url":null,"abstract":"We consider a time slotted cognitive radio network under Rayleigh fading where multiple secondary users (SUs) contend for spectrum usage over available primary users' channels. We analyze the performance of a channel access policy where each SU stochastically determines whether to access a wireless channel or not based on a given access probability. In the analysis, we focus on the queueing performance of an arbitrary SU with the channel access policy. To improve the queueing performance of SUs, the access probability in our channel access policy is adapted to the knowledge on the wireless channel information, e.g., the number of available channels and the probability of a deep fade for channels. It is then important to obtain the optimal access probabilities from the queueing performance perspective.\u0000 In this paper we consider three scenarios. In the first scenario, all SUs have full information on wireless channel status and fading channel conditions. In the second scenario, all SUs have full information on wireless channel status but do not know their fading channel conditions, and in the last scenario all SUs do not have any information on wireless channel status and conditions. For each scenario we analyze the queueing performance of an arbitrary SU and show how to obtain the optimal access probabilities with the help of the effective bandwidth theory. From our analysis we provide an insight on how to design an optimal channel access policy in each scenario. We also show how the optimal channel access policies in three scenarios are related with each other. Numerical results are provided to validate our analysis. In addition, we investigate the performance behaviors of the optimal channel access policies.","PeriodicalId":347695,"journal":{"name":"International Conference on Queueing Theory and Network Applications","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126649773","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

Optimization of a cyclic queue for mobile dentistry 移动牙科循环队列的优化

International Conference on Queueing Theory and Network Applications Pub Date : 2011-08-23 DOI: 10.1145/2021216.2021238

C. Scott, T. R. Jefferson

引用次数: 0

Elucidating the short term loss behavior of a DMAP process in random early detection queue with background DBMAP 用后台DBMAP分析随机早期检测队列中DMAP进程的短期损失行为

International Conference on Queueing Theory and Network Applications Pub Date : 2011-08-23 DOI: 10.1145/2021216.2021243

Yung-Chung Wang, Hung-Pin Lin, Fu-Hsiang Tsai, Dongzhe Cai

引用次数: 2

Markovian single server retrial queues with two way communication 具有双向通信的马尔可夫单服务器重试队列

International Conference on Queueing Theory and Network Applications Pub Date : 2011-08-23 DOI: 10.1145/2021216.2021217

J. Artalejo, Tuan Phung-Duc

引用次数: 15

Analysis of discrete-time Geo/G/1 queue under the D-policy D-policy下离散时间Geo/G/1队列的分析

International Conference on Queueing Theory and Network Applications Pub Date : 2011-08-23 DOI: 10.1145/2021216.2021232

Se Won Lee, Ho Woo Lee, Jung Woo Baek

引用次数: 7

Exact asymptotic for infinite-server queues 无限服务器队列的精确渐近

International Conference on Queueing Theory and Network Applications Pub Date : 2011-08-23 DOI: 10.1145/2021216.2021231

H. Lam

{"title":"Exact asymptotic for infinite-server queues","authors":"H. Lam","doi":"10.1145/2021216.2021231","DOIUrl":"https://doi.org/10.1145/2021216.2021231","url":null,"abstract":"Infinite-server queues are often used as a coupling tool for analyzing many-server systems that arise in telecommunications and call centers. Here we derive an exact asymptotic, up to a constant factor, for the tail probability of the number of customers in a G/G/∞ queue at a fixed time under heavy traffic. We are interested in the scenario when this exceedence is a rare event. In particular, the exceedance level for the number of customers is scaled with the arrival rate such that both of them go to infinity at a fixed ratio, and that the exceedance level is proportionately larger than the mean number of customers. Our main analytical technique is by obtaining fine estimates for the rate of convergence of the corresponding Gartner-Ellis limit via non-homogeneous renewal-theoretic bounds. Using such approach, the refined asymptotic can be seen to resemble the standard form for sum of i.i.d. random variables, as a result of the Gaussian diffusion approximation as suggested by Pang and Whitt (2010) [Two-parameter heavy-traffic limits for infinite-server queues, QUESTA, 65, 325--364]. This result extends the logarithmic asymptotic of Glynn (1995) [Large deviations for the infinite server queue in heavy traffic, IMA Vol. 71, 387--395].","PeriodicalId":347695,"journal":{"name":"International Conference on Queueing Theory and Network Applications","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122460510","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

Stability analysis of single server retrial queueing system with Erlang service 基于Erlang服务的单服务器重试排队系统稳定性分析

International Conference on Queueing Theory and Network Applications Pub Date : 2011-08-23 DOI: 10.1145/2021216.2021239

Gopal Sekar, Ayyappan Govindan, Muthu Ganapathi Subramanian

{"title":"Stability analysis of single server retrial queueing system with Erlang service","authors":"Gopal Sekar, Ayyappan Govindan, Muthu Ganapathi Subramanian","doi":"10.1145/2021216.2021239","DOIUrl":"https://doi.org/10.1145/2021216.2021239","url":null,"abstract":"The objective of this paper is to study the stability analysis of single server retrial queueing system with Erlang-k service under various constraints over the behavior of server and customers, in which customers arrive in a Poisson process with arrival rate λ. These customers are identified as primary calls. Let k be the number of phases in the service station. Further assume that the service time has Erlang-k distribution with service rate kμ for each phase. The services in all phases are independent and identically exponentially distributed and only one customer at a time is in the service mechanism. If the server is free at the time of a primary call arrival, the arriving call begins to be served in phase 1 immediately by the server then progresses through the remaining phases and must complete the last phase and leave the system before the next customer enters the first phase. If the server is busy, then the arriving customer goes to orbit and becomes a source of repeated calls. This pool of source of repeated calls may be viewed as a sort of queue. Every such source produces a Poisson process of repeated calls with intensity σ. If an incoming repeated call finds the server free, it is served in the same manner and leaves the system after service completion, while the source which produced this repeated call disappears. Otherwise, the system state does not change. In this paper, we analyse the stability of this system by introducing various concepts namely vacation policies, unreliable server and negative arrival. We assume that the access from orbit to the service facility is governed by the classical retrial policy. Stability conditions are derived by using Matrix geometric method in detailed.","PeriodicalId":347695,"journal":{"name":"International Conference on Queueing Theory and Network Applications","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117114179","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

Analysis of multi-server queue with synchronous vacations and gated discipline 具有同步休假和门控约束的多服务器队列分析

International Conference on Queueing Theory and Network Applications Pub Date : 2011-08-23 DOI: 10.1145/2021216.2021237

Zsolt Saffer, Wuyi Yue

引用次数: 3