G-networks are novel product form queuing networks that, in addition to ordinary customers, contain unusual entities such as “negative customers” which eliminate normal customers, and “triggers” that move other customers from some queue to another. Recently we introduced one more special type of customer, a “reset”, which may be sent out by any server at the end of a service epoch, and that wil...

Queues with Markovian arrival and service processes, i.e., MAP/MAP/1 queues, have been useful in the analysis of computer and communication systems and di erent representations for their stationary sojourn time and queue length distribution have been derived. More speci cally, the class of MAP/MAP/1 queues lies at the intersection of the class of QBD queues and the class of semi-Markovian queue...

New deterministic algorithms for routing permutations on an n n MIMD mesh are presented. They are very eecient in terms of the size of auxiliary memory at each processor, measured as the maximum number of packets that need to be queued. One algorithm runs in the optimal time 2 n ? 2 with a maximum queue length of 33. Another runs in the near-optimal time 2 n + O(1) with a maximum queue length o...

a single server queue with bernoulli vacation has been considered. in addition the admission to queue is based on a bernoulli process and the server gives two type of services. for this model the probability generating function for the number of customers in the queue at different server's state are obtained using supplementary variable technique. some performance measures are calculated. ...

We show that the Longest Queue Drop algorithm is 1.5-competitive for shared-memory switches with three output ports. This improves upon the previous best upper bound of (2− 1 M ·bM/3c− 3 M ) for the competitive ratio of the Longest Queue Drop algorithm, for 3-port shared-memory switches, where M denotes the shared-memory size.

Internet routers generally see packets from a fast flow more often than a slow flow. This suggests that network fairness may be improved without per-flow information. In this paper, we propose a scheme using Most Recently Used List (MRUL)-a list storing statistics of limited active flows that sorted in most recently seen first mode-to improve the fairness of RED. Based on the list, our proposed...

This paper proposes an adaptive variant of Random Early Detection (RED) gateway queue management for packet-switched networks via a discrete state analog of the non-stationary Master Equation i.e. Markov process. The computation of average queue size, which appeared in the original RED algorithm, is altered by introducing a probability P (l, t), which defines the probability of having l number ...

A finite-buffer M/G/1-type queueing model is considered in which the level of saturation of the buffer is controlled by a dropping function. A direct analytical method to the study of the transient queue-size distribution is proposed. Applying the embedded Markov chain paradigm and the formula of total probability, a specific-type system of integral equations for the transient queue-size distri...