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...

Xiaoming Zhu Joseph M. Kahn University of California Department of Electrical Engineering and Computer Sciences 307 Cory Hall Berkeley, California 94720-1772 E-mail: [email protected] Abstract. Buffering with optical delay lines (ODLs) in optical packetswitching networks is a way to mitigate network contention. We study queueing models of ODLs in synchronous and asynchronous optical packe...

In this paper, we present the time-dependent solutions of various stochastic processes associated with a nite Quasi-Birth-Death queueing system. These include the transient queueing solutions, the transient departure and loss intensity processes and certain transient cummulative measures associated with the queueing system. The focus of our study is the eeect of the arrival process correlation ...

We consider a randomized policy to control the M/G/1 queueing system with an unreliable server, second optional service and general startup times. The server is subject to breaking down according to a Poisson process, and the repair time obeys a general distribution. All arrived customers demand the first required service, and only some of the arrived customers demand the second optional servic...

This paper presents a Timed Coloured Petri Nets based programming tool that supports modeling and performance analysis of distributed World Wide Web environments. A distributed Internet system model, initially described in compliance with Queueing Theory (QT) rules, is mapped onto the Timed Coloured Petri Net (TCPN) structure by means of queueing system templates. Then, it is executed and analy...

Waiting in long queue is undesirable due to which in some practical situations customers become impatient and leave the system. In such cases providing additional servers can reduce long queue. This investigation deals with multi-server queueing system with additional servers and discouragement. The customers arrive in poisson fashion and are served exponentially by a pool of permanent and addi...

of Dissertation Presented to the Graduate School of the University of Florida in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy STOCHASTIC OPTIMIZATION AND ITS APPLICATION TO COMMUNICATION NETWORKS AND THE SMART GRID By Zongrui Ding August 2012 Chair: Dapeng Wu Major: Electrical and Computer Engineering The scheduling of some practical systems is highly affected ...

This paper presents an application of queueing model for controlling queues in clustered computer networks by incorporating multiple servers in the system using multi-server queueing algorithm for the simulation. It has been shown through theory and experiment that as arrival rate increases in clustered computer networks, single server becomes inefficient and prone to instability, irrespective ...