priority queues have a great importance in the study of computer communication networks in which different types of traffic require different quality of service standards. the discrete-time non-preemptive priority queuing model with priority jumps is proposed in this paper. on the basis of probability generating functions mean system contents and mean queuing delay characteristics are obtained....

Regarding the fact that getting a suitable combination of the human resources and service stations is one of the important issues in the most service and manufacturing environments, In this paper, we have studied the two models of planning queuing systems and its effect on the cost of the each system by using two fuzzy queuing models of M/M/1 and M/E2/1. In the first section, we have compar...

there are some problems with estimating the time required for the manufacturing process of products, especially when there is a variable serving time, like control stage. these problems will cause overestimation of process time. layout constraints, reworking constraints and inflexible product schedule in multi product lines need a precise planning to reduce volume in particular situation of lin...

In this paper we consider a queuing system in which the service times of customers are independent and identically distributed random variables, the arrival process is stationary and has the property of orderliness, and the queue discipline is arbitrary. For this queuing system we obtain the steady state second moment of the queue size in terms of the stationary waiting time distribution of a s...

This paper presents one of the features of DS (Differentiated Services) architecture, namely the queuing or congestion management. Packets can be placed into separate buffer queues, on the basis of the DS value. Several forwarding policies can be used to favor high priority packets in different ways. The major reason for queuing is that the router must hold the packet in its memory while the ou...

This paper presents a set of simulation studies for comparing the performance of several flow-based scheduling algorithms, namely Weighted Fair Queuing, Self-Clock Fair Queuing, Start-Time Fair Queuing, Virtual Clock, Worst-case Fair Weighted Fair Queuing and Worstcase Fair Weighted Fair Queuing-plus. These algorithms are being considered for IP networks supporting Quality of Service (QoS).