MIT1_204S10_lec24

MIT1_204S10_lec24 - Note: most of this lecture has been...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
1.204 Lecture 24 Approximate queuing analysis Queuing theory It’s hard to solve real problems with classical It s hard to solve real problems with classical queuing theory Exact solutions to real problems rarely exist We either make heroic assumptions or simulate to solve Both approaches tend to produce the wrong answer Real queues tend to be non steady state, time- dependent queues This is how real queues form and dissolve They can best be solved approximately There are no exact solutions 1 Note: most of this lecture has been removed due to copyright restrictions.
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Approximation techniques Three major forms of approximation Graphical approximation Fluid approximation Diffusion approximation Two major system types Steady flow: rush hour traffic on road or at airport Pulsed flow: traffic signals, buses/trains Two major conditions to find approximate solutions: Heavy traffic Light traffic These bound medium traffic, often well enough
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 4

MIT1_204S10_lec24 - Note: most of this lecture has been...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online