This paper analyzes a discrete-time $Geo/Geo/c$ queueing system with multiple working vacations and reneging in which customers arrive according to a geometric process. As soon as the system gets empty, the servers go to a working vacations all together. The service times during regular busy period, working vacation period and vacation times are assumed to be geometrically distributed. Customer...

This thesis presents a methodology of decision-making for the design variables, embedded I/O buffer sizes, in a single-bus shared-memory system. The decision is made with the aid of a queueing model, simulation, and an optimization algorithm. A queueing model is used to simulate the system behavior and to obtain the system response. The generalized queueing model is simulated to cover two cases...

This paper deals with the optimal control of a finite capacity G/M/1 queueing system combined the F-policy and an exponential startup time before start allowing customers in the system. The F-policy queueing problem investigates the most common issue of controlling arrival to a queueing system. We provide a recursive method, using the supplementary variable technique and treating the supplement...

 Customer impatience (reneging) has negative impact on the performance of queueing systems. If we talk from business point of view, firms lose their potential customers due to customer impatience which affects their business as a whole. It is envisaged that if the firms employ certain customer retention strategies then there are chances that a certain fraction of impatient customers can be ret...

This paper considers a discrete-time retrial queueing system with displacements. The arriving customers can opt to go directly to the server obtaining immediately its service or to join the orbit. In the first case, the displaced customer goes directly to the orbit. The arrivals follow a geometrical law and the service times are general. We study the Markov chain underlying the considered queue...

this paper proposes a bi-objective model for the facility location problem under a congestion system. the idea of the model is motivated by applications of locating servers in bank automated teller machines (atms), communication networks, and so on. this model can be specifically considered for situations in which fixed service facilities are congested by stochastic demand within queueing frame...

In this paper, we analyze the queueing behaviour of wavelength division multiplexing (WDM) Internet router employing partial buffer sharing (PBS) mechanism with self-similar traffic input. In view of WDM technology in networking, each output port of the router is modelled as multi-server queueing system. To guarantee the quality of service (QoS) in Broadband integrated services digital network ...

The paper shows that the theory of generalised invariant subspace and matrix sign function can be applied to computing steady state distribution of QBD-M queueing system. This queueing system is an appropriate and useful modeling tool for system analysis and performance evaluation in computer and telecommunications network field. Moreover, this computational method is evaluated in comparison wi...

In this paper, we study the strong stability in the M/G/1 queueing system with breakdowns and repairs after perturbation of the breakdown’s parameter. Using the approximation conditions in the classical M/G/1 system, we obtain stability inequalities with exact computation of the constants. Thus, we can approximate the characteristics of the M/G/1 queueing system with breakdowns and repairs by t...

Fair queueing is a well-studied problem in modern computer networks. There are two classes of queueing algorithms. One focuses on bounded delay and good fairness properties. The other focuses on the performance of the scheduling algorithm itself. However in embedded networks working under real time constraints, equally important is the deadline imposed by the application. Modern queueing algori...