Download - Bottleneck Routing Games on Grids
![Page 1: Bottleneck Routing Games on Grids](https://reader035.vdocuments.net/reader035/viewer/2022062222/56816666550346895dd9fc8e/html5/thumbnails/1.jpg)
1
Bottleneck Routing Games on Grids
Costas BuschRajgopal KannanAlfred Samman
Department of Computer ScienceLouisiana State University
![Page 2: Bottleneck Routing Games on Grids](https://reader035.vdocuments.net/reader035/viewer/2022062222/56816666550346895dd9fc8e/html5/thumbnails/2.jpg)
2
Talk Outline
Introduction
Basic Game
Channel Game
Extensions
![Page 3: Bottleneck Routing Games on Grids](https://reader035.vdocuments.net/reader035/viewer/2022062222/56816666550346895dd9fc8e/html5/thumbnails/3.jpg)
3
2-d Grid:
Used in:• Multiprocessor architectures• Wireless mesh networks• can be extended to d-dimensions
n
n
nnnodes
![Page 4: Bottleneck Routing Games on Grids](https://reader035.vdocuments.net/reader035/viewer/2022062222/56816666550346895dd9fc8e/html5/thumbnails/4.jpg)
4
Each player corresponds to a pair of source-destination
EdgeCongestion
3)( 1 eC
2)( 2 eC
Bottleneck Congestion: 3)(max
eCCEe
![Page 5: Bottleneck Routing Games on Grids](https://reader035.vdocuments.net/reader035/viewer/2022062222/56816666550346895dd9fc8e/html5/thumbnails/5.jpg)
5
A player may selfishly choose an alternativepath with better congestion
ii CC 31
PlayerCongestion
i
3iC
1iC
Player Congestion: Maximum edge congestion along its path
![Page 6: Bottleneck Routing Games on Grids](https://reader035.vdocuments.net/reader035/viewer/2022062222/56816666550346895dd9fc8e/html5/thumbnails/6.jpg)
6
Routing is a collection of paths, one path for each player
Utility function for player :i
ii Cppc )(
p
congestionof selected path
Social cost for routing :
CpSC )(p
bottleneck congestion
![Page 7: Bottleneck Routing Games on Grids](https://reader035.vdocuments.net/reader035/viewer/2022062222/56816666550346895dd9fc8e/html5/thumbnails/7.jpg)
We are interested in Nash Equilibriumswhere every player is locally optimal
Metrics of equilibrium quality:
p
Price of Stability
)()(min *pSCpSC
p
Price of Anarchy
)()(max *pSCpSC
p
*p is optimal coordinated routing with smallest social cost
![Page 8: Bottleneck Routing Games on Grids](https://reader035.vdocuments.net/reader035/viewer/2022062222/56816666550346895dd9fc8e/html5/thumbnails/8.jpg)
8
Bends :number of dimension changes plus source and destination
6
![Page 9: Bottleneck Routing Games on Grids](https://reader035.vdocuments.net/reader035/viewer/2022062222/56816666550346895dd9fc8e/html5/thumbnails/9.jpg)
9
Price of Stability:
Price of Anarchy:
)1(O
)(n
even with constant bends )1(O
Basic congestion games on grids
![Page 10: Bottleneck Routing Games on Grids](https://reader035.vdocuments.net/reader035/viewer/2022062222/56816666550346895dd9fc8e/html5/thumbnails/10.jpg)
10
Better bounds with bends
Price of anarchy: nO log
Channel games:
Optimal solution uses at most bends
Path segments are separated accordingto length range
![Page 11: Bottleneck Routing Games on Grids](https://reader035.vdocuments.net/reader035/viewer/2022062222/56816666550346895dd9fc8e/html5/thumbnails/11.jpg)
11
There is a (non-game) routing algorithmwith bends and approximation ratio
nO log nO log
Optimal solution uses arbitrary number of bends
Final price of anarchy: nO 3log
![Page 12: Bottleneck Routing Games on Grids](https://reader035.vdocuments.net/reader035/viewer/2022062222/56816666550346895dd9fc8e/html5/thumbnails/12.jpg)
12
Solution without channels: Split Gameschannels are implemented implicitly in space
Similar poly-log price of anarchy bounds
![Page 13: Bottleneck Routing Games on Grids](https://reader035.vdocuments.net/reader035/viewer/2022062222/56816666550346895dd9fc8e/html5/thumbnails/13.jpg)
13
Some related work:
Arbitrary Bottleneck games [INFOCOM’06], [TCS’09]:
Price of AnarchyNP-hardness
Price of Anarchy DefinitionKoutsoupias, Papadimitriou [STACS’99]
Price of Anarchy for sum of congestion utilities [JACM’02]
1O
|| EO
![Page 14: Bottleneck Routing Games on Grids](https://reader035.vdocuments.net/reader035/viewer/2022062222/56816666550346895dd9fc8e/html5/thumbnails/14.jpg)
14
Talk Outline
Introduction
Basic Game
Channel Game
Extensions
![Page 15: Bottleneck Routing Games on Grids](https://reader035.vdocuments.net/reader035/viewer/2022062222/56816666550346895dd9fc8e/html5/thumbnails/15.jpg)
15
],,,,,[)( 21 Nk mmmmpM
number of players with congestion kCi
Stability is proven through a potential functiondefined over routing vectors:
![Page 16: Bottleneck Routing Games on Grids](https://reader035.vdocuments.net/reader035/viewer/2022062222/56816666550346895dd9fc8e/html5/thumbnails/16.jpg)
16
PlayerCongestion
3iC
1iC
In best response dynamics a player move improves lexicographically the routing vector
)()( pMpM ]0,...,0,0,3,1,0[]0,...,0,0,0,2,2[
![Page 17: Bottleneck Routing Games on Grids](https://reader035.vdocuments.net/reader035/viewer/2022062222/56816666550346895dd9fc8e/html5/thumbnails/17.jpg)
17
],,,,,,,[)( 11 Nkkk mmmmmpM
Before greedy move kCi
],,,,,,,[)( 11 Nkkk mmmmmpM
After greedy move
ii CkkC
)()( pMpM
![Page 18: Bottleneck Routing Games on Grids](https://reader035.vdocuments.net/reader035/viewer/2022062222/56816666550346895dd9fc8e/html5/thumbnails/18.jpg)
18
Existence of Nash Equilibriums
Greedy moves give lower order routings
Eventually a local minimum for every playeris reached which is a Nash Equilibrium
![Page 19: Bottleneck Routing Games on Grids](https://reader035.vdocuments.net/reader035/viewer/2022062222/56816666550346895dd9fc8e/html5/thumbnails/19.jpg)
19
minp
Price of Stability
Lowest order routing :
)()( *min pSCpSC
• Is a Nash Equilibrium
• Achieves optimal social cost
1)()(Stability of Price *
min pSCpSC
![Page 20: Bottleneck Routing Games on Grids](https://reader035.vdocuments.net/reader035/viewer/2022062222/56816666550346895dd9fc8e/html5/thumbnails/20.jpg)
20
Price of AnarchyOptimal solution Nash Equilibrium
1* C 2/nC
)(2/* nnCC
Price of anarchy: High!
![Page 21: Bottleneck Routing Games on Grids](https://reader035.vdocuments.net/reader035/viewer/2022062222/56816666550346895dd9fc8e/html5/thumbnails/21.jpg)
21
Talk Outline
Introduction
Basic Game
Channel Game
Extensions
![Page 22: Bottleneck Routing Games on Grids](https://reader035.vdocuments.net/reader035/viewer/2022062222/56816666550346895dd9fc8e/html5/thumbnails/22.jpg)
22
Row:
channelsnlog
Channel holds path segments of length in range:
jA]12,2[ 1 jj
0A1A2A3A
]1,1[]3,2[
]7,4[]15,8[
![Page 23: Bottleneck Routing Games on Grids](https://reader035.vdocuments.net/reader035/viewer/2022062222/56816666550346895dd9fc8e/html5/thumbnails/23.jpg)
23
1eC
2eC
different channels
same channel
Congestion occurs only with path segmentsin same channel
![Page 24: Bottleneck Routing Games on Grids](https://reader035.vdocuments.net/reader035/viewer/2022062222/56816666550346895dd9fc8e/html5/thumbnails/24.jpg)
24
Path of player
Consider an arbitrary Nash Equilibriump
i
iCmaximum congestionin path
![Page 25: Bottleneck Routing Games on Grids](https://reader035.vdocuments.net/reader035/viewer/2022062222/56816666550346895dd9fc8e/html5/thumbnails/25.jpg)
25
must have a special edge with congestion
Optimal path of player
In optimal routing :*p
i
iC1 iCC
)(111*)( ppcCCCppc iiii
**)( CpSC
Since otherwise:
![Page 26: Bottleneck Routing Games on Grids](https://reader035.vdocuments.net/reader035/viewer/2022062222/56816666550346895dd9fc8e/html5/thumbnails/26.jpg)
26
C
00
0
edges use that Players: Congestion of Edges :ECE
In Nash Equilibrium social cost is: CpSC )(
0 0
![Page 27: Bottleneck Routing Games on Grids](https://reader035.vdocuments.net/reader035/viewer/2022062222/56816666550346895dd9fc8e/html5/thumbnails/27.jpg)
27
C 1C1C
0 0
Special Edges in optimal paths of 0
First expansion
![Page 28: Bottleneck Routing Games on Grids](https://reader035.vdocuments.net/reader035/viewer/2022062222/56816666550346895dd9fc8e/html5/thumbnails/28.jpg)
28
C 1C1C
0 01 1
11
1
edges use that Players:1least at Congestion of Edges Special :
ECE
First expansion
![Page 29: Bottleneck Routing Games on Grids](https://reader035.vdocuments.net/reader035/viewer/2022062222/56816666550346895dd9fc8e/html5/thumbnails/29.jpg)
29
C 1C1C 2C 2C2C2C
0 01 1
Special Edges in optimal paths of 1
Second expansion
![Page 30: Bottleneck Routing Games on Grids](https://reader035.vdocuments.net/reader035/viewer/2022062222/56816666550346895dd9fc8e/html5/thumbnails/30.jpg)
30
C 1C1C 2C 2C2C
0 01 1
2C
2 2
22
2
edges use that Players:2least at Congestion of Edges Special :
ECE
Second expansion
![Page 31: Bottleneck Routing Games on Grids](https://reader035.vdocuments.net/reader035/viewer/2022062222/56816666550346895dd9fc8e/html5/thumbnails/31.jpg)
31
In a similar way we can define:
jj
j
E
jCE
edges use that Players:
least at Congestion of Edges Special :
,,,,
,,,,
3210
3210
EEEE
We obtain expansion sequences:
![Page 32: Bottleneck Routing Games on Grids](https://reader035.vdocuments.net/reader035/viewer/2022062222/56816666550346895dd9fc8e/html5/thumbnails/32.jpg)
32
jj
j
E
jCE
edges use that Players:
12 :rin far ly sufficient are edges and
r channel somein majority thearech whi
least at Congestion of Edges Special :
1-r
Redefine expansion:
![Page 33: Bottleneck Routing Games on Grids](https://reader035.vdocuments.net/reader035/viewer/2022062222/56816666550346895dd9fc8e/html5/thumbnails/33.jpg)
33
*1
||||
aCE jj
*1
||)(||
CaE
jCE jj
||
)(|| jj
EjC
![Page 34: Bottleneck Routing Games on Grids](https://reader035.vdocuments.net/reader035/viewer/2022062222/56816666550346895dd9fc8e/html5/thumbnails/34.jpg)
34
*1
||)(||
CaE
jCE jj
If then )log( * nCC
|||| 1 jj EkE
2|| nE Contradiction
constant k
![Page 35: Bottleneck Routing Games on Grids](https://reader035.vdocuments.net/reader035/viewer/2022062222/56816666550346895dd9fc8e/html5/thumbnails/35.jpg)
35
)log( * nCOC Therefore:
Price of anarchy:)log()log(* nOnO
CC
![Page 36: Bottleneck Routing Games on Grids](https://reader035.vdocuments.net/reader035/viewer/2022062222/56816666550346895dd9fc8e/html5/thumbnails/36.jpg)
36
Optimal solutionNash Equilibrium1* C)()( 2 nC
)()( 2* nCCPrice of anarchy:
Tightness of Price of Anarchy
![Page 37: Bottleneck Routing Games on Grids](https://reader035.vdocuments.net/reader035/viewer/2022062222/56816666550346895dd9fc8e/html5/thumbnails/37.jpg)
37
Talk Outline
Introduction
Basic Game
Channel Game
Extensions
![Page 38: Bottleneck Routing Games on Grids](https://reader035.vdocuments.net/reader035/viewer/2022062222/56816666550346895dd9fc8e/html5/thumbnails/38.jpg)
38
0A
1A
2A3A
Split game
0A
1A
2A3A
Price of anarchy: )log( 2 nO
![Page 39: Bottleneck Routing Games on Grids](https://reader035.vdocuments.net/reader035/viewer/2022062222/56816666550346895dd9fc8e/html5/thumbnails/39.jpg)
39
d-dimensional grid
Price of anarchy:
nd
O logChannel game
nd
O 22 log
Price of anarchy:Split game