Queueing Models with Spatial Interactions. Challenges and approaches David Gamarnik MIT Markov Lecture Discussion INFORMS 2011 TexPoint fonts used in EMF.

Slides:



Advertisements
Similar presentations
Spectral Analysis of Function Composition and Its Implications for Sampling in Direct Volume Visualization Steven Bergner GrUVi-Lab/SFU Torsten Möller.
Advertisements

Discussion for SAMSI Tracking session, 8 th September 2008 Simon Godsill Signal Processing and Communications Lab. University of Cambridge www-sigproc.eng.cam.ac.uk/~sjg.
Domino Tilings of the Chessboard An Introduction to Sampling and Counting Dana Randall Schools of Computer Science and Mathematics Georgia Tech.
Matroids from Lossless Expander Graphs
Introduction to Queuing Theory
Min-Max Relations, Hall’s Theorem, and Matching-Algorithms Graphs & Algorithms Lecture 5 TexPoint fonts used in EMF. Read the TexPoint manual before you.
Factor Graphs, Variable Elimination, MLEs Joseph Gonzalez TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA A AA A A.
Constrained Approximate Maximum Entropy Learning (CAMEL) Varun Ganapathi, David Vickrey, John Duchi, Daphne Koller Stanford University TexPoint fonts used.
Lab Assignment 1 COP 4600: Operating Systems Principles Dr. Sumi Helal Professor Computer & Information Science & Engineering Department University of.
The double-dimer model and skew Young diagrams Richard W. Kenyon David B. Wilson Brown University Microsoft Research TexPoint fonts used in EMF. Read the.
Complex Networks Third Lecture TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA TexPoint fonts used in EMF. Read the.
TCOM 501: Networking Theory & Fundamentals
Lecture 13 – Continuous-Time Markov Chains
1 ELEN 602 Lecture 8 Review of Last lecture –HDLC, PPP –TDM, FDM Today’s lecture –Wavelength Division Multiplexing –Statistical Multiplexing –Preliminary.
Department of Computer Science, University of Maryland, College Park, USA TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.:
Queuing Theory For Dummies
Simulation Where real stuff starts. ToC 1.What, transience, stationarity 2.How, discrete event, recurrence 3.Accuracy of output 4.Monte Carlo 5.Random.
Management of Waiting Lines
Lattices for Distributed Source Coding - Reconstruction of a Linear function of Jointly Gaussian Sources -D. Krithivasan and S. Sandeep Pradhan - University.
Queueing Theory.
7/3/2015© 2007 Raymond P. Jefferis III1 Queuing Systems.
OS Fall ’ 02 Performance Evaluation Operating Systems Fall 2002.
Queuing Networks: Burke’s Theorem, Kleinrock’s Approximation, and Jackson’s Theorem Wade Trappe.
Lecture 4 Mathematical and Statistical Models in Simulation.
1 Trends in Mathematics: How could they Change Education? László Lovász Eötvös Loránd University Budapest.
cover times, blanket times, and majorizing measures Jian Ding U. C. Berkeley James R. Lee University of Washington Yuval Peres Microsoft Research TexPoint.
CDA6530: Performance Models of Computers and Networks Examples of Stochastic Process, Markov Chain, M/M/* Queue TexPoint fonts used in EMF. Read the TexPoint.
Introduction to Queuing Theory
Planning and Verification for Stochastic Processes with Asynchronous Events Håkan L. S. Younes Carnegie Mellon University.
Management of Waiting Lines McGraw-Hill/Irwin Copyright © 2012 by The McGraw-Hill Companies, Inc. All rights reserved.
Lecture 10: Queueing Theory. Queueing Analysis Jobs serviced by the system resources Jobs wait in a queue to use a busy server queueserver.
NETE4631:Capacity Planning (2)- Lecture 10 Suronapee Phoomvuthisarn, Ph.D. /
Complex Networks First Lecture TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA TexPoint fonts used in EMF. Read the.
18 Management of Waiting Lines.
Queuing Theory Basic properties, Markovian models, Networks of queues, General service time distributions, Finite source models, Multiserver queues Chapter.
TexPoint fonts used in EMF.
Modeling and Analysis of Computer Networks
Queuing Networks Jean-Yves Le Boudec 1. Contents 1.The Class of Multi-Class Product Form Networks 2.The Elements of a Product-Form Network 3.The Product-Form.
Queuing Networks Jean-Yves Le Boudec 1. Networks of Queues Stability Queuing networks are frequently used models The stability issue may, in general,
PODC Distributed Computation of the Mode Fabian Kuhn Thomas Locher ETH Zurich, Switzerland Stefan Schmid TU Munich, Germany TexPoint fonts used in.
CDA6530: Performance Models of Computers and Networks Chapter 7: Basic Queuing Networks TexPoint fonts used in EMF. Read the TexPoint manual before you.
Chapter 61 Continuous Time Markov Chains Birth and Death Processes,Transition Probability Function, Kolmogorov Equations, Limiting Probabilities, Uniformization.
The M/M/ N / N Queue etc COMP5416 Advanced Network Technologies.
ETM 607 – Output Analysis: Estimation of Relative Performance Output comparison between two or more alternative systems Common Random Numbers (CRN) Comparison.
Winter 2004EE384x1 Poisson Process Review Session 2 EE384X.
C&O 355 Mathematical Programming Fall 2010 Lecture 5 N. Harvey TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA A A.
CDA6530: Performance Models of Computers and Networks Mid-Term Review TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.:
IMA Summer Program on Wireless Communications VoIP over a wired link Phil Fleming Network Advanced Technology Group Motorola, Inc.
CDA6530: Performance Models of Computers and Networks Chapter 8: Statistical Simulation ---- Discrete Event Simulation (DES) TexPoint fonts used in EMF.
MAIN RESULT: We assume utility exhibits strategic complementarities. We show: Membership in larger k-core implies higher actions in equilibrium Higher.
Spatial decay of correlations and efficient methods for computing partition functions. David Gamarnik Joint work with Antar Bandyopadhyay (U of Chalmers),
Management of Waiting Lines Copyright © 2015 McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written consent.
Of 17 Limits of Local Algorithms in Random Graphs Madhu Sudan MSR Joint work with David Gamarnik (MIT) 7/11/2013Local Algorithms on Random Graphs1.
1 Ardavan Asef-Vaziri Jan.-2016Basics Probability Distributions- Uniform.
CDA6530: Performance Models of Computers and Networks Mid-Term Review TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.:
McGraw-Hill/Irwin Copyright © 2009 by The McGraw-Hill Companies, Inc. All Rights Reserved. Chapter 18 Management of Waiting Lines.
Networks (3TU) Plan for today (lecture 5): Last time / Questions? Tandem network Jackson network: definition Jackson network: equilibrium distribution.
Management of Waiting Lines
Monomer-dimer model and a new deterministic approximation algorithm for computing a permanent of a 0,1 matrix David Gamarnik MIT Joint work with Dmitriy.
TexPoint fonts used in EMF.
TexPoint fonts used in EMF.
Queuing models Basic definitions, assumptions, and identities
Lecture 20: Scaling Inference with RDBMS
TexPoint fonts used in EMF.
TexPoint fonts used in EMF.
TexPoint fonts used in EMF.
Variability 8/24/04 Paul A. Jensen
CSE 321 Discrete Structures
TexPoint fonts used in EMF.
CS723 - Probability and Stochastic Processes
Presentation transcript:

Queueing Models with Spatial Interactions. Challenges and approaches David Gamarnik MIT Markov Lecture Discussion INFORMS 2011 TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: A A A A A A A A AA A

Renyi parking model Wireless communications Computer systems Reservation systems (hotels) Physics and chemistry Harrison Network Queueing models with interactions

Baryshnikov, Coffman & Jelenkovic [2004]. Space filling and depletion. Jobs with length arrive at every integer point with Poisson rate Exp service times At most k overlapping jobs can be accepted for service Loss model: jobs not accepted are dropped Queueing model: jobs form queue

Baryshnikov, Coffman & Jelenkovic [2004]. Space filling and depletion. Questions: loss rate? Stability? Queue length? Wait times? BC&J: solved loss model when k=1 and general k, and length l=1,2. Used generating function method. But alternatively one can view it as a Markov chain (see later). Stability question is wide open even in the uniform case.

Baccelli & Foss [2011]. Poisson Hail on a Hot Ground Jobs have general (Borel) shape. General interarrival and service times. Ovelapping jobs form queues. Question: stability.

Baccelli & Foss [2011]. Poisson Hail on a Hot Ground Theorem [BF]. The system is stable if job sizes have exponential tails and the arrival rate is sufficiently small. Tight conditions for stability is open. Performance analysis (queue length, space utilization) open.

Where can we search for general purpose tools? A small detour into statistical physics.

Where can we search for general purpose tools? Independent set (hard-core) model When ½ is small, correlations are short-range. When ½ is large correlations are long-range Conjecture: critical ½ *=3.796 Randall [2011]. ½ *<6.18. Restrepo, Shin, Tetali, Vigoda, Yang [2011]. ½ *>2.38. Shah et al. Applications to wireless communications.

Correlation decay (long-range independence) method The correlation decay method allows computing approximately Weitz [2006]. General graphs, independent sets. G & Katz [2009]. Lattices. Improved earlier estimates for monomer-dimer model with two orders of magnitude. One-dimensional case is solved easily by reduction to a Markov chain · h(3) · · h(3) ·

Challenges Non Poisson-Exponential models. Are even 1-dim models solvable? Short range vs long-range for non Poisson/Exp models? Interaction between stability and phase transition (long-range dependence). Which one “acts” first?

Questions?