WPI CS Colloquium 1/15

Thread View: wpi.cs

1 messages

[T] Back to Threads [V] Tree View [G] Group Articles

1 total messages Started by Roberta Baker Mon, 11 Jan 1993 20:30

Author: Roberta Baker
Date: Mon, 11 Jan 1993 20:30

32 lines
1584 bytes


WPI Computer Science Colloquium
Friday, January 15, 1993
11:00 a.m.
Fuller Labs 311


                   A LINEAR ALGEBRAIC APPROACH
                        TO QUEUEING THEORY


                          Lester Lipsky
          Department of Computer Science and Engineering
               University of Connecticut at Storrs


A survey of the basic formulas of queueing theory is presented.  We
next describe the linear algebraic (matrix) formulation which is a
complete computational, as well as algebraic, procedure for dealing
with non-exponential servers.  We then show how to derive and compute
steady-state properties of M/G/1, G/M/1, M/G/C, and G/G/1 queues using
this formalism.  This includes consideration of departure and arrival
points.  Finally, we show how transient properties of queueing systems
can be calculated, using the same mathematical objects which were used
for analyzing their steady-state properties.  Some specific topics,
including examples, are: Busy periods; Time for queue growth and
reduction; Mean time to failure.  We will also show the connection
with Jackson Networks.


*** For directions to WPI, send email to roberta@cs.wpi.edu ***

Thread Navigation

This is a paginated view of messages in the thread with full content displayed inline.

Messages are displayed in chronological order, with the original post highlighted in green.

Use pagination controls to navigate through all messages in large threads.

Back to All Threads