An M/PH/K queue with constant impatient time

He, Qi–Ming; Hao, Zhang; Ye, Qingqing

doi:10.1007/s00186-017-0612-2

Cited by 11 publications

(8 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We can also search for the Z boson via its visible decay channels at CEPC (see e.g., [15] [24] for previous studies on this topic). We take the µ + µ − final state as the visible channel to probe the Z portal DM models in this section.…”

Section: Z Portal Dm Modelsmentioning

confidence: 99%

Probing dark matter particles at CEPC

Liu

2019

J. High Energ. Phys.

View full text Add to dashboard Cite

We investigate the capability of the future electron collider CEPC in probing the parameter space of several dark matter models, including millicharged dark matter models, Z portal dark matter models, and effective field theory dark matter models. In our analysis, the monophoton final state is used as the primary channel to detect dark matter models at CEPC. To maximize the signal to background significance, we study the energy and angular distributions of the monophoton channel arising from dark matter models and from the standard model to design a set of detector cuts. For the Z portal dark matter, we also analyze the Z boson visible decay channel which is found to be complementary to the monophoton channel in certain parameter space. The CEPC reach in the parameter space of dark matter models is also put in comparison with Xenon1T. We find that CEPC has the unprecedented sensitivity to certain parameter space for the dark matter models considered; for example, CEPC can improve the limits on millicharge by one order of magnitude than previous collider experiments for O(1) − 100 GeV dark matter.

show abstract

Section: Z Portal Dm Modelsmentioning

confidence: 99%

Probing dark matter particles at CEPC

Liu

2019

J. High Energ. Phys.

View full text Add to dashboard Cite

show abstract

“…An algorithm for the discrete time case was introduced only recently in He and Alfa (2015). For the continuous case, He et al (2017) developed an algorithm that is essentially equivalent to Ramaswami (1985).…”

Section: Literature Reviewmentioning

confidence: 99%

“…The study of queueing systems with multiple identical servers is closely related to the CSFP approach. See examples in (i) Ramaswami and Lucantoni (1985), Asmussen and O'Cinneide (1998), Asmussen and Möller (2001), and Breuer et al (2002) for some standard queueing models with multiple servers; (ii) Wagner (1997) for queues with multiple servers and service priority; (iii) Kim et al (2012) for queues with multiple servers and retrials; and (iv) He et al (2017) for queues with multiple servers and impatient customers. Finally, the idea of modeling communication traffic resulting from several sources multiplexed has been dealt with by different researchers in different ways, but mostly by approximations because of the huge Markov chains that could result.…”

Section: Literature Reviewmentioning

confidence: 99%

“…In the rest of this paper, we summarize a few basic algorithms introduced in Ramaswami (1985), He et al (2017), and He and Alfa (2015). In addition, we use the basic algorithms to construct Markov chains associated with the MAP/PH/K queue (He and Alfa 2015), the superposition of independent identical Markovian arrival processes, and order statistics of phase-type distributions.…”

Section: Literature Reviewmentioning

confidence: 99%

“…The algorithm to be introduced in this section was first introduced in Ramaswami (1985). The version presented in this section is from He et al (2017), which is essentially equivalent to that in Ramaswami (1985). An advantage of the construction process in He et al (2017) is that it is self-proving.…”

Section: Continuous Time Markov Chainsmentioning

confidence: 99%

See 2 more Smart Citations

Space Reduction for a Class of Multidimensional Markov Chains: A Summary and Some Applications

He¹,

Alfa²

2018

INFORMS Journal on Computing

Self Cite

View full text Add to dashboard Cite

In this paper, we present examples of a class of Markov chains that occur frequently, but whose associated matrices are a challenge to construct efficiently. These are Markov chains that arise as a result of several identical Markov chains running in parallel. Specifically for the cases considered, both the infinitesimal generator matrix for the continuous case, and more so the transition probability matrix for the discrete equivalent, are complex to construct effectively and efficiently. We summarize the algorithms for constructing the associated matrices and present examples of applications, ranging from special queueing problems to reliability issues and order statistics. MATLAB subroutines are provided in an online supplement for the implementation of the algorithms.

show abstract

Simulation Analysis in Cognitive Radio Networks with Unreliability and Abandonment

Nemouchi

Zaghouani

Sztrik

2021

Information Technologies and Mathematical Modelling. Queueing Theory and Applications

View full text Add to dashboard Cite

The current paper presents a Cognitive Radio Network with impatient customers and unreliable servers by the help of a finite-source retrial queueing system. We consider two types of customers (primary and secondary) assigned to two interconnected frequency bands. A first frequency band with a priority queue and a second frequency band with an orbit are reserved for Primary Users (PUs) and Secondary Users (SUs), respectively. If the servers are busy, both customers (licensed and unlicensed) enter either the queue or orbit. Before they enter orbit, the secondary customers receive a random retrial time according to the exponential distribution, i.e. the waiting time before the next retry. Unlicensed users (impatient) are obliged to leave the system as soon as their total waiting time exceeds a random maximum waiting time. It should be noted, that the secondary service unit of our system is subject to random breakdowns and repairs. The novelty of this work consists in the investigation of the abandonment and secondary server unreliability impact on various performance measures of the system (Cognitive Radio Network), such as the mean response and waiting time of users, the probability of abandonment of SU, etc. Several figures illustrate the problem in question through simulation.

show abstract

An M/PH/K queue with constant impatient time

Cited by 11 publications

References 30 publications

Probing dark matter particles at CEPC

Probing dark matter particles at CEPC

Space Reduction for a Class of Multidimensional Markov Chains: A Summary and Some Applications

Simulation Analysis in Cognitive Radio Networks with Unreliability and Abandonment

Contact Info

Product

Resources

About