The topological network design of general service, finite waiting room, multi-server queueing networks is a complex optimization problem. Series, merge, and split topologies are examined using an approximation method to estimate the performance of these queueing networks and an iterative search methodology to find the optimal buffer allocation within the network. The coefficient of variation is...

In this paper we study a general stochastic fluid model with a single infinite capacity buffer, where the buffer content can change continuously as well as by instantaneous upward jumps. The continuous as well as the instantaneous change is modulated by an external environment process modelled as a finite state continuous time Markov chain. The Laplace-Stieltjes transform of the steady-state jo...

In this report we deal with the time to buffer overflow in a finite-buffer queue with MMPP (Markov-modulated Poisson process) arrivals. The results include a closed-form formula for the transform of the distribution of the time to buffer overflow. The main benefit of this formula is that, using properties of the transform, we can easily compute the average overflow time and all the moments (var...

Assorted analytical methods have been proposed for evaluating the performance of a slotted ring network. This paper proposes MGM (Matrix Geometric Method) to analyze the station buffer of a slotted ring for DT (Discrete-Time) queueing. The slotted ring is analyzed for infinite station buffer as a late arrival DT system. Utilizing the characteristics of 2-D Markov chain, various performance meas...

The performance of interconnected networks is highly depenht on the performance of the gateways. Since the finite storage capability of gateways effects the throughput it has to be considered for the analysis of interwnnected networks. Different configurations of networks are studied: i) Gateways and the channels of local area networks have no buffer capacity constraints, ii) Only gateways have...

The notion of buffered resource is useful in many problems. A buffer contains a finite set of items required by some activities, and changing the content of the buffer is costly. For instance, in instruction scheduling, the registers are a buffered resource and any switch of registers has a significant impact on the total runtime of the compiled code. We first show that sequencing activities to...

We consider a set of fluid On-Off flows that share a common server of capacity c and a finite buffer B. The server capacity is divided using Generalized Processor Sharing scheduling discipline. Each flow has a minimum service rate guarantee that exceeds its long term average demand ρi. The buffer sharing is unrestricted as long as there is available space; if the buffer is full, the necessary a...

We study distributed queue-aware beamforming in a multiple input single output (MISO) interference channel. Instead of assuming full buffer traffic, we adopt a more realistic traffic model where the data arrival rates are finite, and the beamformers are adaptive to the data in the buffer. We propose a simple dynamic beamforming strategy which significantly improves the average sum rate compared...

In this paper, a meta-heuristic method, the Bat Algorithm, based on the echolocation behavior of bats is used to determine the optimum service rate of a queue problem. A finite buffer M/M/1 queue with N policy, multiple working vacations and Bernoulli schedule vacation interruption is considered. Under the two customers' impatient situations, balking and reneging, the...

A performance model is developed and validated for a local area network (LAN) with a star topology. A collisionavoidance network access protocol, as implemented in Hubnet, is considered. The model is based on a single server queueing system with finite sources and with a single buffer. Packets arriving at a full buffer retry their access after a fixed time period. Results for an eight-node netw...