We consider the M/M/m preemptive last-come, first-served queue without customer's priority classes. We focus on the analysis of the time interval from the arrival to either service completion or to abandonment of an arbitrary customer. We formulate the problem as a one-dimensional birth-and-death process with two absorbing states and consider the first passage times in this process. We give explicit expressions for the probabilities of service completion and abandonment. We also show sets of recursive computational formulas for calculating the mean and second moment of the times to service completion and abandonment. We present some numerical examples in order to demonstrate the computation of theoretical formulas.
{"title":"Times to Service Completion and Abandonment in the M/M/m Preemptive LCFS Queue with Impatient Customers","authors":"H. Takagi","doi":"10.1145/3016032.3016036","DOIUrl":"https://doi.org/10.1145/3016032.3016036","url":null,"abstract":"We consider the M/M/m preemptive last-come, first-served queue without customer's priority classes. We focus on the analysis of the time interval from the arrival to either service completion or to abandonment of an arbitrary customer. We formulate the problem as a one-dimensional birth-and-death process with two absorbing states and consider the first passage times in this process. We give explicit expressions for the probabilities of service completion and abandonment. We also show sets of recursive computational formulas for calculating the mean and second moment of the times to service completion and abandonment. We present some numerical examples in order to demonstrate the computation of theoretical formulas.","PeriodicalId":269685,"journal":{"name":"Proceedings of the 11th International Conference on Queueing Theory and Network Applications","volume":"7 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":"126871362","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}
We consider a Markovian single-server retrial queueing system. Customers in orbit retry after an exponentially distributed amount of time, the retrial rate depending on the number of times the customer has retried before. Moreover, the number of retrials by a single customer is bounded by K, customers abandoning after the kth retrial with probability pk. As this queueing system is not amenable for exact analysis, we focus on its performance in light traffic. In particular, we describe a fast algorithm for calculating the terms in the Maclaurin series expansion of various performance measures, the arrival rate being the independent parameter of the expansion. We illustrate our approach by various numerical examples and verify the accuracy of the light traffic approximation by means of simulation.
{"title":"Light-traffic analysis of queues with limited heterogenous retrials","authors":"D. Fiems, Tuan Phung-Duc","doi":"10.1145/3016032.3016056","DOIUrl":"https://doi.org/10.1145/3016032.3016056","url":null,"abstract":"We consider a Markovian single-server retrial queueing system. Customers in orbit retry after an exponentially distributed amount of time, the retrial rate depending on the number of times the customer has retried before. Moreover, the number of retrials by a single customer is bounded by K, customers abandoning after the kth retrial with probability pk. As this queueing system is not amenable for exact analysis, we focus on its performance in light traffic. In particular, we describe a fast algorithm for calculating the terms in the Maclaurin series expansion of various performance measures, the arrival rate being the independent parameter of the expansion. We illustrate our approach by various numerical examples and verify the accuracy of the light traffic approximation by means of simulation.","PeriodicalId":269685,"journal":{"name":"Proceedings of the 11th International Conference on Queueing Theory and Network Applications","volume":"53 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":"114571475","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}
Different wireless Peer-to-Peer (P2P) routing protocols rely on cooperative protocols of interaction among peers, yet, most of the surveyed provide little detail on how the peers can take into consideration the peers' reliability for improving routing efficiency in collaborative networks. Previous research has shown that in most of the trust and reputation evaluation schemes, the peers' rating behaviour can be improved to include the peers' attributes for understanding peers' reliability. This paper proposes a reliability based trust model for dynamic trust evaluation between the peers in P2P networks for collaborative routing. Since the peers' routing attributes vary dynamically, our proposed model must also accommodate the dynamic changes of peers' attributes and behaviour. We introduce peers' buffers as a scaling factor for peers' trust evaluation in the trust and reputation routing protocols. The comparison between reliability and non-reliability based trust models using simulation shows the improved performance of our proposed model in terms of delivery ratio and average message latency.
{"title":"A Reliability-Based Trust Model for Efficient Collaborative Routing in Wireless Networks","authors":"A. Usman, Jairo Gutiérrez","doi":"10.1145/3016032.3016057","DOIUrl":"https://doi.org/10.1145/3016032.3016057","url":null,"abstract":"Different wireless Peer-to-Peer (P2P) routing protocols rely on cooperative protocols of interaction among peers, yet, most of the surveyed provide little detail on how the peers can take into consideration the peers' reliability for improving routing efficiency in collaborative networks. Previous research has shown that in most of the trust and reputation evaluation schemes, the peers' rating behaviour can be improved to include the peers' attributes for understanding peers' reliability. This paper proposes a reliability based trust model for dynamic trust evaluation between the peers in P2P networks for collaborative routing. Since the peers' routing attributes vary dynamically, our proposed model must also accommodate the dynamic changes of peers' attributes and behaviour. We introduce peers' buffers as a scaling factor for peers' trust evaluation in the trust and reputation routing protocols. The comparison between reliability and non-reliability based trust models using simulation shows the improved performance of our proposed model in terms of delivery ratio and average message latency.","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":"131249400","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}
The role of optical fibres as a medium for information transfer has found many applications. One of these is in environmental sensing, where slight perturbations in the surrounding environment can be remotely detected through modulation of light at selected points along the optical fibre. These perturbations exist in the form of variations in refractive index (RI), temperature or strain. This paper reviews our recent work on optical fibre-based RI sensors, in particular long period fibre gratings (LPFGs), integrated with carbon nano-materials. These carbon nano-materials with their unique properties modified the sensing scheme of the conventional fibre sensors, allowing them to gain immunity from certain free spectral range limitations, extend their operation range and also present the potential for efficient real-time environmental monitoring applications.
{"title":"Functionalized Optical Fibre Sensors for Real-Time Environmental Monitoring Applications","authors":"K. Chow","doi":"10.1145/3016032.3016059","DOIUrl":"https://doi.org/10.1145/3016032.3016059","url":null,"abstract":"The role of optical fibres as a medium for information transfer has found many applications. One of these is in environmental sensing, where slight perturbations in the surrounding environment can be remotely detected through modulation of light at selected points along the optical fibre. These perturbations exist in the form of variations in refractive index (RI), temperature or strain. This paper reviews our recent work on optical fibre-based RI sensors, in particular long period fibre gratings (LPFGs), integrated with carbon nano-materials. These carbon nano-materials with their unique properties modified the sensing scheme of the conventional fibre sensors, allowing them to gain immunity from certain free spectral range limitations, extend their operation range and also present the potential for efficient real-time environmental monitoring applications.","PeriodicalId":269685,"journal":{"name":"Proceedings of the 11th International Conference on Queueing Theory and Network Applications","volume":"92 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":"133047668","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}
This paper considers the QBD approximation of a special class of two-dimensional reflecting random walks (2D-RRWs). A typical example of the 2D-RRWs is a two-node Jackson network with cooperative servers. The main contribution of this paper is to provide simple upper bounds for the relative absolute difference between the time-averaged functionals of the original 2D-RRW and its QBD approximation.
{"title":"Simple error bounds for the QBD approximation of a special class of two dimensional reflecting random walks","authors":"H. Masuyama, Y. Sakuma, Masahiro Kobayashi","doi":"10.1145/3016032.3016048","DOIUrl":"https://doi.org/10.1145/3016032.3016048","url":null,"abstract":"This paper considers the QBD approximation of a special class of two-dimensional reflecting random walks (2D-RRWs). A typical example of the 2D-RRWs is a two-node Jackson network with cooperative servers. The main contribution of this paper is to provide simple upper bounds for the relative absolute difference between the time-averaged functionals of the original 2D-RRW and its QBD approximation.","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-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115464004","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}
The 6th International Conference on Queueing Theory and Network Applications (QTNA2011) will be held in Seoul, Korea on Aug. 23-26, 2011. The conference is a continuation of the series of successful conferences - QTNA2006 (Korea), QTNA2007 (Japan), QTNA2008 (Taiwan), QTNA2009 (Singapore), and QTNA2010 (China). QTNA2011 is a conference for the dissemination of leading-edge research on queueing theory and its applications in networks and related issues. The aim of the conference is to bring together researchers, scientists and practitioners around the world to identify important and challenging problems and issues in the area of queueing theory and network applications, and to work together to discover feasible solutions for these problems. The conference will cover all the key topics in queueing theory, communication networks and other related areas. It will provide an in-depth representation of theory and practice in these areas. Each submission should promote queueing theory or related techniques, and demonstrate a relationship between theory and its application; any topic that satisfies these requirements would be of interest. The conference will cover all the key topics in queueing theory, telecommunication networks and other related topics. It will provide an in-depth representation of theory and practice in these areas.
{"title":"Proceedings of the 11th International Conference on Queueing Theory and Network Applications","authors":"Bara Kim, Ho Woo Lee, G. Hwang, Y. Shin","doi":"10.1145/3016032","DOIUrl":"https://doi.org/10.1145/3016032","url":null,"abstract":"The 6th International Conference on Queueing Theory and Network Applications (QTNA2011) will be held in Seoul, Korea on Aug. 23-26, 2011. The conference is a continuation of the series of successful conferences - QTNA2006 (Korea), QTNA2007 (Japan), QTNA2008 (Taiwan), QTNA2009 (Singapore), and QTNA2010 (China). \u0000 \u0000QTNA2011 is a conference for the dissemination of leading-edge research on queueing theory and its applications in networks and related issues. The aim of the conference is to bring together researchers, scientists and practitioners around the world to identify important and challenging problems and issues in the area of queueing theory and network applications, and to work together to discover feasible solutions for these problems. The conference will cover all the key topics in queueing theory, communication networks and other related areas. It will provide an in-depth representation of theory and practice in these areas. Each submission should promote queueing theory or related techniques, and demonstrate a relationship between theory and its application; any topic that satisfies these requirements would be of interest. \u0000 \u0000The conference will cover all the key topics in queueing theory, telecommunication networks and other related topics. It will provide an in-depth representation of theory and practice in these areas.","PeriodicalId":269685,"journal":{"name":"Proceedings of the 11th International Conference on Queueing Theory and Network Applications","volume":"48 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":"123613590","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：