All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 3

Displaying 41 – 56 of 56

Showing per page

Analysis of a MX/G(a,b)/1 queueing system with vacation interruption

M. Haridass, R. Arumuganathan (2012)

RAIRO - Operations Research - Recherche Opérationnelle

In this paper, a batch arrival general bulk service queueing system with interrupted vacation (secondary job) is considered. At a service completion epoch, if the server finds at least ‘a’ customers waiting for service say ξ, he serves a batch of min (ξ, b) customers, where b ≥ a. On the other hand, if the queue length is at the most ‘a-1’, the server leaves for a secondary job (vacation) of random length. It is assumed that the secondary job is interrupted abruptly and the server resumes for primary...

Analysis of a MX/G(a,b)/1 queueing system with vacation interruption

M. Haridass, R. Arumuganathan (2012)

RAIRO - Operations Research

In this paper, a batch arrival general bulk service queueing system with interrupted vacation (secondary job) is considered. At a service completion epoch, if the server finds at least ‘a’ customers waiting for service say ξ, he serves a batch of min (ξ, b) customers, where b ≥ a. On the other hand, if the queue length is at the most ‘a-1’, the server leaves for a secondary job (vacation) of random length. It is assumed that the secondary...

Analysis of multibackground memory testing techniques

Ireneusz Mrozek (2010)

International Journal of Applied Mathematics and Computer Science

March tests are widely used in the process of RAM testing. This family of tests is very efficient in the case of simple faults such as stuck-at or transition faults. In the case of a complex fault model-such as pattern sensitive faults-their efficiency is not sufficient. Therefore we have to use other techniques to increase fault coverage for complex faults. Multibackground memory testing is one of such techniques. In this case a selected March test is run many times. Each time it is run with new...

Anycasting in connection-oriented computer networks: Models, algorithms and results

Krzysztof Walkowiak (2010)

International Journal of Applied Mathematics and Computer Science

Our discussion in this article centers around various issues related to the use of anycasting in connection-oriented computer networks. Anycast is defined as a one-to-one-of-many transmission to deliver a packet to one of many hosts. Anycasting can be applied if the same content is replicated over many locations in the network. Examples of network techniques that apply anycasting are Content Delivery Networks (CDNs), Domain Name Service (DNS), Peer-to-Peer (P2P) systems. The role of anycasting is...

Aspects of Impatience in a Finite Buffer Queue

Medhi Pallabi, Amit Choudhury (2012)

RAIRO - Operations Research - Recherche Opérationnelle

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....

Aspects of Impatience in a Finite Buffer Queue

Medhi Pallabi, Amit Choudhury (2012)

RAIRO - Operations Research

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...

Currently displaying 41 – 56 of 56

Previous Page 3