Filters








12 Hits in 6.2 sec

Analysis of an MAP/PH/1 Queue with Flexible Group Service

Arianna Brugno, Ciro D'Apice, Alexander Dudin, Rosanna Manzo
2017 International Journal of Applied Mathematics and Computer Science  
A novel customer batch service discipline for a single server queue is introduced and analyzed. Service to customers is offered in batches of a certain size.  ...  An individual customer's service time has a phase-type distribution. The service time of a batch is defined as the maximum of the individual service times of the customers which form the batch.  ...  }, Analysis of an MAP/PH/1 queue with flexible group service 123 with (Q i,i−1 ) m,m = ⎛ ⎜ ⎜ ⎜ ⎝ O . . .  ... 
doi:10.1515/amcs-2017-0009 fatcat:af5rcdzjn5erfl3b442gb7ucyu

MAP/PH/1 systems with group service: performance analysis under different admission strategies [article]

Arianna Brugno, Universita' Degli Studi Di Salerno, Universita' Degli Studi Di Salerno
2018
Thus, in this thesis MAP/PH/1 queueing systems have been considered, with and without retrial to take into account all possible behaviours of the customers.  ...  Pertanto, in tale lavoro di tesi sono stati considerati sistemi a coda di tipo MAP/PH/1, con e senza retrial per considerare tutti i possibili comportamenti degli utenti.  ...  A MAP/PH/1 System with Flexible Group Service . A MAP/PH/1 System with Flexible Group Service . A MAP/PH/1 System with Flexible Group Service .  ... 
doi:10.14273/unisa-1023 fatcat:tzguiuntq5exvopfxmknvao724

Page 787 of The Journal of the Operational Research Society Vol. 50, Issue 8 [page]

1999 The Journal of the Operational Research Society  
New results on the single server queue with a batch Markovian arrival process. Stoch Mod 7: 1—46. Alfa AS (1995). A discrete MAP/PH/1 queue with vacations and exhaustive time-limited service.  ...  Matrix geometric solution of discrete time MAP/PH/1 priority queue. Naval Res Logist 45: 23—S0. 3 Neuts MF (1975). Computational uses of the method of phases in the theory of queues.  ... 

QBDs with marked time epochs: a framework for transient performance measures

B. Van Houdt, C. Blondia
2005 Second International Conference on the Quantitative Evaluation of Systems (QEST'05)  
The generality and flexibility of our framework is demonstrated on a set of queueing systems and applied to dimensioning a video playout buffer and studying the transient throughput of a wireless random  ...  The steady state vector of a so-called reset Markov chain is used to obtain the above-mentioned system state (either by approximation or in an exact manner).  ...  the D-MAP/PH/1 queue) was introduced in [23] .  ... 
doi:10.1109/qest.2005.30 dblp:conf/qest/HoudtB05 fatcat:ve6a7ijyrbctlly7qhhiq5m2um

Using the discrete time modelling approach to evaluate the time-dependent behaviour of queueing systems

Dave Worthington, A Wall
1999 Journal of the Operational Research Society  
New results on the single server queue with a batch Markovian arrival process. Stoch Mod 7: 1—46. Alfa AS (1995). A discrete MAP/PH/1 queue with vacations and exhaustive time-limited service.  ...  Matrix geometric solution of discrete time MAP/PH/1 priority queue. Naval Res Logist 45: 23—S0. 3 Neuts MF (1975). Computational uses of the method of phases in the theory of queues.  ... 
doi:10.1057/palgrave.jors.2600783 fatcat:xxik24h35jf55fks7abphh2kyu

Crowdsourcing and Stochastic Modeling

Srinivas R. Chakravarthy, Serife Ozkar
2016 Business and Management Research  
However, the modeling aspects of crowdsourcing in the context of stochastic and algorithmic methods have not been considered until recently.  ...  The meaning and interpretation of crowdsourcing is varied and despite its popularity among companies in many sectors it remains little understood.  ...  Acknowledgements Serife Ozkar would like to acknowledge the support of her host institution in Turkey to visit Kettering University, and also the hospitality provided to her by the Industrial and Manufacturing  ... 
doi:10.5430/bmr.v5n2p19 fatcat:jsuhsxvk4zfrlmnhpj7o4e55ni

A Priority Queuing Model for HCF Controlled Channel Access (HCCA) in Wireless LANs

Reza GHAZIZADEH, Pingzhi FAN, Yi PAN
2009 International Journal of Communications, Network and System Sciences  
This model makes use of a MAP (Markovian Arrival Process)/PH (Phase Type)/1 queue with two types of jobs which are suitable to support VBR traffic.  ...  Using a MAP for traffic arrival process and PH distribution for service process, the inclusion of vacation period makes our analysis very general and comprehensive to support various types of practical  ...  Consequently, the introduced priority queuing model is based on a MAP/ PH/1 queue with vacation and time-limited service.  ... 
doi:10.4236/ijcns.2009.21004 fatcat:67tvdobcgvhqhfascrrownykke

BuTools 2: a Rich Toolbox for Markovian Performance Evaluation

Gabor Horvath, Miklos Telek
2017 Proceedings of the 10th EAI International Conference on Performance Evaluation Methodologies and Tools  
BuTools 2 is collection of computational methods that are useful for Markovian and non-Markovian matrix analytic performance analysis. It consists of various packages.  ...  various Markovian queueing systems; and to solve block-structured Markov chains.  ...  The following queues are supported: • The MAP/MAP/1 queue (MAPMAP1). Special cases of this queue are the PH/MAP/1, the MAP/PH/1, the PH/PH/1, etc. (see [15] and [8] ). • The QBD queue (QBDQueue).  ... 
doi:10.4108/eai.25-10-2016.2266400 dblp:conf/valuetools/HorvathT16 fatcat:5f3k37wqbvb5vgbutihrvk6r3u

ETAQA truncation models for the MAP/MAP/1 departure process

A. Heindl, Q. Zhang, E. Smirni
2004 First International Conference on the Quantitative Evaluation of Systems, 2004. QEST 2004. Proceedings.  
We propose a family of finite approximations for the departure process of a MAP/MAP/1 queue.  ...  Via experimentation we show the applicability of the proposed approximation in traffic-based decomposition of queueing networks and investigate how correlation propagates through tandem queues.  ...  The truncation models proposed by Green [5, 6] work for MAP/PH/1 queues (i.e., when there is no correlation among service times).  ... 
doi:10.1109/qest.2004.1348024 dblp:conf/qest/HeindlZS04 fatcat:sseltlxnzvhv7glap5fkbkfmdy

A Perspective on the IEEE 802.11e Protocol for the Factory Floor [chapter]

Lucia Lo, Emanuele Toscano, Salvatore Vittorio
2010 Factory Automation  
of Quality of Service requirements.  ...  service categories, by introducing an Arbitration IFS (AIFS).  ...  ., 2009) , the authors presented a priority queuing model to analyse medium access in the HCCA by making use of an MAP/PH/1 queue with two types of jobs which are suitable to support a wide range of traffic  ... 
doi:10.5772/9516 fatcat:ecsnsrliijc25cyxp2aqv6zi3y

Enhancing response time and reliability via speculative replication and redundancy

Zhan Qiu, Peter Harrison
2017
In the last part, we generalize the analysis to systems that implement erasure encoding, where an object is stored by creating k fragments and storing r ≥ k encoded fragments so that the original object  ...  Next, we investigate the k = r configuration, a case known as fork-join queues, where each arriving job is split into r tasks, each of which is assigned to one of r parallel processors.  ...  More specifically, if the request arrivals are modeled as a MAP(m a , D 0 , D 1 ), and the replica service times are PH, each queue can be modeled as an independent MAP/PH/1 queue with arrivals MAP(m a  ... 
doi:10.25560/45278 fatcat:enerxbvn5nhd7g3ckxd2ts6aie

Applying neural network based algorithms in communication technology

Dávid Tisza, János Levendovszky, András Oláh
2019
in coming to baptise with water was so that he might be revealed to Israel.'  ...  God that takes away the sin of the world. 30 It was of him that I said, "Behind me comes one who has passed ahead of me because he existed before me." 31 I did not know him myself, and yet my purpose  ...  (e.g.M/G/1 [154] , GI/M/1 [122] , GI/G/1 [43] , QBD [122, 124, 123] , MAP/PH/1 [123] , MMPP/M/1 [37, 67, 97] ).  ... 
doi:10.15774/ppke.itk.2019.006 fatcat:fs4k5akncrfo5ayggrfotianem