Spatial Interactions in Queueing Models: Challenges and Approaches
Q
Q
u
u
e
e
u
u
e
e
i
i
n
n
g
g
M
M
o
o
d
d
e
e
l
l
s
s
w
w
i
i
t
t
h
h
S
S
p
p
a
a
t
t
i
i
a
a
l
l
I
I
n
n
t
t
e
e
r
r
a
a
c
c
t
t
i
i
o
o
n
n
s
s
.
.
C
C
h
h
a
a
l
l
l
l
e
e
n
n
g
g
e
e
s
s
a
a
n
n
d
d
a
a
p
p
p
p
r
r
o
o
a
a
c
c
h
h
e
e
s
s
D
a
v
i
d
G
a
m
a
r
n
i
k
M
I
T
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
A
A
A
•
Renyi parking model
•
Wireless communications
•
Computer systems
•
Reservation systems (hotels)
•
Physics and chemistry
•
Harrison Network
Q
u
e
u
e
i
n
g
m
o
d
e
l
s
w
i
t
h
i
n
t
e
r
a
c
t
i
o
n
s
B
a
r
y
s
h
n
i
k
o
v
,
C
o
f
f
m
a
n
&
J
e
l
e
n
k
o
v
i
c
[
2
0
0
4
]
.
S
p
a
c
e
f
i
l
l
i
n
g
a
n
d
d
e
p
l
e
t
i
o
n
.
Jobs with length
arrive at every integer point with Poisson rate
Exp service times
At most
k
overlapping jobs can be accepted for service
L
o
s
s
m
o
d
e
l
:
j
o
b
s
n
o
t
a
c
c
e
p
t
e
d
a
r
e
d
r
o
p
p
e
d
Q
u
e
u
e
i
n
g
m
o
d
e
l
:
j
o
b
s
f
o
r
m
q
u
e
u
e
B
a
r
y
s
h
n
i
k
o
v
,
C
o
f
f
m
a
n
&
J
e
l
e
n
k
o
v
i
c
[
2
0
0
4
]
.
S
p
a
c
e
f
i
l
l
i
n
g
a
n
d
d
e
p
l
e
t
i
o
n
.
Q
u
e
s
t
i
o
n
s
:
l
o
s
s
r
a
t
e
?
S
t
a
b
i
l
i
t
y
?
Q
u
e
u
e
l
e
n
g
t
h
?
W
a
i
t
t
i
m
e
s
?
B
C
&
J
:
s
o
l
v
e
d
l
o
s
s
m
o
d
e
l
w
h
e
n
k
=
1
a
n
d
g
e
n
e
r
a
l
k
,
a
n
d
l
e
n
g
t
h
l
=
1
,
2
.
Used generating function method. But alternatively one can view it as a Markov
chain (see later).
S
t
a
b
i
l
i
t
y
q
u
e
s
t
i
o
n
i
s
w
i
d
e
o
p
e
n
e
v
e
n
i
n
t
h
e
u
n
i
f
o
r
m
c
a
s
e
.
B
a
c
c
e
l
l
i
&
F
o
s
s
[
2
0
1
1
]
.
P
o
i
s
s
o
n
H
a
i
l
o
n
a
H
o
t
G
r
o
u
n
d
Jobs have general (Borel) shape.
General interarrival and service times.
Ovelapping jobs form queues.
Q
u
e
s
t
i
o
n
:
s
t
a
b
i
l
i
t
y
.
B
a
c
c
e
l
l
i
&
F
o
s
s
[
2
0
1
1
]
.
P
o
i
s
s
o
n
H
a
i
l
o
n
a
H
o
t
G
r
o
u
n
d
T
h
e
o
r
e
m
[
B
F
]
.
T
h
e
s
y
s
t
e
m
i
s
s
t
a
b
l
e
i
f
j
o
b
s
i
z
e
s
h
a
v
e
e
x
p
o
n
e
n
t
i
a
l
t
a
i
l
s
a
n
d
t
h
e
a
r
r
i
v
a
l
r
a
t
e
i
s
s
u
f
f
i
c
i
e
n
t
l
y
s
m
a
l
l
.
Tight conditions for stability is open.
Performance analysis (queue length, space utilization) open.
W
h
e
r
e
c
a
n
w
e
s
e
a
r
c
h
f
o
r
g
e
n
e
r
a
l
p
u
r
p
o
s
e
t
o
o
l
s
?
A small detour into statistical physics
.
W
h
e
r
e
c
a
n
w
e
s
e
a
r
c
h
f
o
r
g
e
n
e
r
a
l
p
u
r
p
o
s
e
t
o
o
l
s
?
Independent set (hard-core) model
W
h
e
n
½
i
s
s
m
a
l
l
,
c
o
r
r
e
l
a
t
i
o
n
s
a
r
e
s
h
o
r
t
-
r
a
n
g
e
.
W
h
e
n
½
i
s
l
a
r
g
e
c
o
r
r
e
l
a
t
i
o
n
s
a
r
e
l
o
n
g
-
r
a
n
g
e
C
o
n
j
e
c
t
u
r
e
:
c
r
i
t
i
c
a
l
½
*
=
3
.
7
9
6
R
a
n
d
a
l
l
[
2
0
1
1
]
.
½
*
<
6
.
1
8
.
R
e
s
t
r
e
p
o
,
S
h
i
n
,
T
e
t
a
l
i
,
V
i
g
o
d
a
,
Y
a
n
g
[
2
0
1
1
]
.
½
*
>
2
.
3
8
.
S
h
a
h
e
t
a
l
.
A
p
p
l
i
c
a
t
i
o
n
s
t
o
w
i
r
e
l
e
s
s
c
o
m
m
u
n
i
c
a
t
i
o
n
s
.
C
o
r
r
e
l
a
t
i
o
n
d
e
c
a
y
(
l
o
n
g
-
r
a
n
g
e
i
n
d
e
p
e
n
d
e
n
c
e
)
m
e
t
h
o
d
The correlation decay method allows computing approximately
W
e
i
t
z
[
2
0
0
6
]
.
G
e
n
e
r
a
l
g
r
a
p
h
s
,
i
n
d
e
p
e
n
d
e
n
t
s
e
t
s
.
G
&
K
a
t
z
[
2
0
0
9
]
.
L
a
t
t
i
c
e
s
.
I
m
p
r
o
v
e
d
e
a
r
l
i
e
r
e
s
t
i
m
a
t
e
s
f
o
r
m
o
n
o
m
e
r
-
d
i
m
e
r
m
o
d
e
l
w
i
t
h
t
w
o
o
r
d
e
r
s
o
f
m
a
g
n
i
t
u
d
e
.
One-dimensional case is solved easily by reduction to a Markov chain.
0.78595
·
h(3)
·
0.78599
0.7845
·
h(3)
·
0.7862
C
h
a
l
l
e
n
g
e
s
•
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?
Q
u
e
s
t
i
o
n
s
?
Explore the complexities of queueing models with spatial interactions, delving into loss models, stability questions, and performance analyses. Researchers tackle the stability of systems based on job sizes and arrival rates in various scenarios. Discover insights from statistical physics and the quest for general-purpose tools in this intriguing field.
Download Presentation
Please find below an Image/Link to download the presentation.
The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author. Download presentation by click this link. If you encounter any issues during the download, it is possible that the publisher has removed the file from their server.
E N D
Presentation Transcript
Queueing Models with Spatial Interactions. Challenges and approaches David Gamarnik MIT Markov Lecture Discussion INFORMS 2011
Queueing models with interactions Renyi parking model Wireless communications Computer systems Reservation systems (hotels) Physics and chemistry Harrison Network
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. 0.78595 h(3) 0.78599 0.7845 h(3) 0.7862 One-dimensional case is solved easily by reduction to a Markov chain.
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?
