WPI CS Colloquium 1/15

Article View: wpi.cs

Article #6

From: 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 ***

Technical Details

Message-ID: <1isldnINN8sv@bigboote.WPI.EDU>

Path: arc1-ca.pugleaf.net!sparky!uunet!noc.near.net!bigboote.WPI.EDU!sequoia.WPI.EDU!roberta

Show Full Headers

Complete Article Headers

Path: arc1-ca.pugleaf.net!sparky!uunet!noc.near.net!bigboote.WPI.EDU!sequoia.WPI.EDU!roberta
From: roberta@sequoia.WPI.EDU (Roberta Baker)
Newsgroups: wpi.cs,ne.seminars
Subject: WPI CS Colloquium 1/15
Date: 11 Jan 1993 20:30:47 GMT
Organization: Worcester Polytechnic Institute
Lines: 32
Distribution: ne
Message-ID: <1isldnINN8sv@bigboote.WPI.EDU>
NNTP-Posting-Host: sequoia.wpi.edu