The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying 61 –
80 of
384
A multi-server queueing system with two types of customers and an infinite buffer operating in a random environment as a model of a contact center is investigated. The arrival flow of customers is described by a marked Markovian arrival process. Type 1 customers have a non-preemptive priority over type 2 customers and can leave the buffer due to a lack of service. The service times of different type customers have a phase-type distribution with different parameters. To facilitate the investigation...
Queueing systems in which an arriving job is blocked and lost with a probability that depends on the queue size are studied. The study is motivated by the popularity of Active Queue Management (AQM) algorithms proposed for packet queueing in Internet routers. AQM algorithms often exploit the idea of queue-size based packet dropping. The main results include analytical solutions for queue size distribution, loss ratio and throughput. The analytical results are illustrated via numerical examples that...
This paper analyzes a
discrete-time multi-server queue in which service capacity of each
server is a minimum of one and a maximum of b customers. The
interarrival- and service-times are assumed to be independent and
geometrically distributed. The queue is analyzed under the
assumptions of early arrival system and late arrival system with
delayed access. Besides, obtaining state probabilities at
arbitrary and outside observer's observation epochs, some
performance measures and waiting-time distribution...
Les distributions non paramétriques de survie trouvent, de plus en plus, des applications dans des domaines très variés, à savoir : théorie de fiabilité et analyse de survie, files d’attente, maintenance, gestion de stock, théorie de l’économie, L’objet de ce travail est d’utiliser les bornes inférieures et supérieures (en terme de la moyenne) des fonctions de fiabilité appartenant aux classes de distribution de type et , présentées par Sengupta (1994), pour l’évaluation de certaines caractéristiques....
Les distributions non paramétriques de survie trouvent, de plus en plus, des applications dans des
domaines très variés, à savoir: théorie de fiabilité et analyse de survie, files d'attente,
maintenance, gestion de stock, théorie de l'économie, ...
L'objet de ce travail est
d'utiliser les bornes inférieures et supérieures (en terme de la moyenne) des fonctions de
fiabilité appartenant aux classes de distribution de type IFR, DFR, NBU et NWU, présentées par
Sengupta (1994), pour l'évaluation de...
In a multi server queuing system, buffer size is often larger than the number of servers. This necessitates queuing and waiting for some customers. Customers become impatient while waiting for service. Additionally, they may also become impatient if service is not offered at the desired rate. This paper analyses a finite buffer multi server queuing system with the additional restriction that customers may balk as well as renege. Closed form expressions of a number of performance measures are presented....
In a multi server queuing system, buffer size is often larger than the number of servers.
This necessitates queuing and waiting for some customers. Customers become impatient while
waiting for service. Additionally, they may also become impatient if service is not
offered at the desired rate. This paper analyses a finite buffer multi server queuing
system with the additional restriction that customers may balk as well as renege. Closed
form expressions...
This article provides entropic inequalities for binomial-Poisson
distributions, derived from the two point space. They appear as local
inequalities of the M/M/∞ queue. They describe in particular the
exponential dissipation of Φ-entropies along this process. This simple
queueing process appears as a model of “constant curvature”, and plays for
the simple Poisson process the role played by the Ornstein-Uhlenbeck process
for Brownian Motion. Some of the inequalities are recovered by semi-group
...
Currently displaying 61 –
80 of
384