We develop approximate solutions for the equilibrium queue length probability distribution of queues in open Markovian networks by considering each queue independently, constructing its arrival process as the join of each contributing queue's departing traffic. Without modulation and non-unit batches, we would only need to consider mean internal traffic rates, modelling each queue as M/M/1 to g...

We consider a bulk service G I / M / l queue with service rates depending on service batch size. If there are n customers waiting at the completion of service, min(n, I\) customers enter service. We show that the queue size and the service batch size at points of arrivals form an embedded Markov chain and the steady-state probabilities of this Markov chain have the matrix geometric form. We des...

We give improved deterministic algorithms for permutation routing and sorting on meshes with row and column buses. Among our results, we obtain a fairly simple algorithm for permutation routing on two-dimensional meshes with buses that achieves a running time of n + o(n) and a queue size of 2. We also describe an algorithm for routing on r-dimensional networks with a running time of (2? 1=r)n+ ...

In this paper, we present a randomized algorithm for the multipacket (i.e., k k) routing problem on an n x n mesh. The algorithm competes with high probability in at most kn + O(k log n) parallel communication steps, with a constant queue size of O(k). The previous best known algorithm [4] takes [5/4] kn + O([kn/f(n)]) steps with a queue size of O(k f(n)) (for any 1 ≤ f (n) ≤ n). We will also p...

Fast Congestion Notification (FN) one of the proactive queue management mechanisms that practices congestion avoidance to help avoid the beginning of congestion by marking/dropping packets before the router’s queue gets full; and exercises congestion control, when congestion avoidance fails, by increasing the rate of packet marking/dropping. Upon arrival of each packet, FN uses the instantaneou...

In this paper we consider M[X]/G(a, b)/1 queueing system with accessible service, server breakdown without interruption, multiple vacation and closedown time. The service rule is as follows: the server starts service only when a minimum number of customers ′a′ is available in the queue and the maximum service capacity is ′b′ units such that late entries are allowed to join a service batch, with...

This study considers a -policy Geo/G/1 queue with startup and closedown times. The -policy operates as follows. On completion of the vacation, if there are customers in the queue, the server is either to activate with probability p or to stay dormant in the system with probability 1-p for waiting a new arrival; and if no customer presents in the queue, the server obeys classical sin...

There are many factors that are important in the design of queue management schemes for routers in the Internet: for example, queuing delay, link utilization, packet loss, energy consumption and the impact of router buffer size. By considering a fluid model for the congestion avoidance phase of Additive Increase Multiplicative Decrease (AIMD) TCP, in a small buffer regime, we argue that stabili...

Title of Dissertation: DYNAMICS OF RANDOM EARLY DETECTION GATEWAY UNDER A LARGE NUMBER OF TCP FLOWS Peerapol Tinnakornsrisuphap, Doctor of Philosophy, 2004 Dissertation directed by: Professor Armand M. Makowski Department of Electrical and Computer Engineering While active queue management (AQM) mechanisms such as Random Early Detection (RED) are widely deployed in the Internet, they are rarely...

Increasing levels of power dissipation threaten to limit the performance gains of future high-end, out-of-order issue microprocessors. Therefore, it is imperative that designers devise techniques that significantly reduce the power dissipation of the key hardware structures on the chip without unduly compromising performance. Such a key structure in out-of-order designs is the issue queue. Alth...