Download - Revisiting the Contract Between Layers Sachin Katti Dina Katabi, Hari Balakrishnan, Muriel Medard
![Page 1: Revisiting the Contract Between Layers Sachin Katti Dina Katabi, Hari Balakrishnan, Muriel Medard](https://reader035.vdocument.in/reader035/viewer/2022062500/56649f045503460f94c17b9a/html5/thumbnails/1.jpg)
Revisiting the Contract Between Layers
Sachin KattiDina Katabi, Hari Balakrishnan, Muriel Medard
![Page 2: Revisiting the Contract Between Layers Sachin Katti Dina Katabi, Hari Balakrishnan, Muriel Medard](https://reader035.vdocument.in/reader035/viewer/2022062500/56649f045503460f94c17b9a/html5/thumbnails/2.jpg)
Mesh Networks Borrowed the Internet Contract
Conflicts with wireless mesh characteristics
PHY + LL Deliver correct packetsNetwork Forward correct packets to destination
Current contract builds reliability on a link by link basis
Spatial diversity more naturally provides reliability across multiple links
![Page 3: Revisiting the Contract Between Layers Sachin Katti Dina Katabi, Hari Balakrishnan, Muriel Medard](https://reader035.vdocument.in/reader035/viewer/2022062500/56649f045503460f94c17b9a/html5/thumbnails/3.jpg)
S
R1
R2
D
99% (10-3
BER)
99% (10 -3 BER)
Wireless Naturally Provides Reliability Across Links
0%
0%
Even 1 bit in 1000 incorrect Packet loss of 99%
![Page 4: Revisiting the Contract Between Layers Sachin Katti Dina Katabi, Hari Balakrishnan, Muriel Medard](https://reader035.vdocument.in/reader035/viewer/2022062500/56649f045503460f94c17b9a/html5/thumbnails/4.jpg)
S
R1
R2
D
99% (10-3
BER)
99% (10 -3 BER)
Wireless Naturally Provides Reliability Across Links
0%
0%
Current contract Link by link reliability 50 transmissions
Loss
Loss
![Page 5: Revisiting the Contract Between Layers Sachin Katti Dina Katabi, Hari Balakrishnan, Muriel Medard](https://reader035.vdocument.in/reader035/viewer/2022062500/56649f045503460f94c17b9a/html5/thumbnails/5.jpg)
S
R1
R2
D
99% (10-3
BER)
99% (10 -3 BER)
Wireless Naturally Provides Reliability Across Links
0%
0%
Spatial diversity: Even if no correct packets, every bit is likely received correctly at some node
Exploit wireless characteristics 3 transmissions
Current contract 50 tx Low throughputExploit wireless characteristics 3 tx High throughput
![Page 6: Revisiting the Contract Between Layers Sachin Katti Dina Katabi, Hari Balakrishnan, Muriel Medard](https://reader035.vdocument.in/reader035/viewer/2022062500/56649f045503460f94c17b9a/html5/thumbnails/6.jpg)
Useful with High Quality Links?R1
R2
R3
R4
Sa
Pb
Db
Da
Sb
Pb
Pa
Pa
Pa
Pb
1%
2%
1%
3%
0%
0%
0%
0%
Loss
Loss
Loss
Loss
![Page 7: Revisiting the Contract Between Layers Sachin Katti Dina Katabi, Hari Balakrishnan, Muriel Medard](https://reader035.vdocument.in/reader035/viewer/2022062500/56649f045503460f94c17b9a/html5/thumbnails/7.jpg)
Useful with High Quality Links?R1
R2
R3
R4
Sa
Pb
Db
Da
Sb
Pb
Pa
Pa
Pa
Pb
1%
2%
1%
3%
0%
0%
0%
0%Current contract Inhibits concurrency
Exploit wireless characteristics Enables high concurrency
![Page 8: Revisiting the Contract Between Layers Sachin Katti Dina Katabi, Hari Balakrishnan, Muriel Medard](https://reader035.vdocument.in/reader035/viewer/2022062500/56649f045503460f94c17b9a/html5/thumbnails/8.jpg)
Current Contract
Limits throughput, inhibits concurrency
PHY + LL Deliver correct symbols to higher layerNetwork Forward correct symbols to destination
PHY + LL Deliver correct packetsNetwork Forward correct packets to destination
High throughput, high concurrency
New Contract Exploiting Wireless Characteristics
![Page 9: Revisiting the Contract Between Layers Sachin Katti Dina Katabi, Hari Balakrishnan, Muriel Medard](https://reader035.vdocument.in/reader035/viewer/2022062500/56649f045503460f94c17b9a/html5/thumbnails/9.jpg)
MIXIT• New contract between layers to harness
wireless characteristics• Novel symbol-level network code that
scalably routes correct symbols• High concurrency MAC• Implementation and evaluation• 3-4x gain over shortest path routing• 2-3x gain over packet-level opp. routing
![Page 10: Revisiting the Contract Between Layers Sachin Katti Dina Katabi, Hari Balakrishnan, Muriel Medard](https://reader035.vdocument.in/reader035/viewer/2022062500/56649f045503460f94c17b9a/html5/thumbnails/10.jpg)
How does a Router Identify Correct Symbols?• PHY already estimates a confidence for every
decoded symbol [JB07]• PHY + LL delivers high confidence symbols to
network layer
PHY Confidence
Packet
PHY + LL Deliver correct symbols to higher layerNetwork Forward correct symbols to destination
![Page 11: Revisiting the Contract Between Layers Sachin Katti Dina Katabi, Hari Balakrishnan, Muriel Medard](https://reader035.vdocument.in/reader035/viewer/2022062500/56649f045503460f94c17b9a/html5/thumbnails/11.jpg)
What Should Each Router Forward?
R1
R2
DSP1P2
P1P2
P1P2
![Page 12: Revisiting the Contract Between Layers Sachin Katti Dina Katabi, Hari Balakrishnan, Muriel Medard](https://reader035.vdocument.in/reader035/viewer/2022062500/56649f045503460f94c17b9a/html5/thumbnails/12.jpg)
What Should Each Router Forward?
R1
R2
DSP1P2
But overlap in correctly received symbols Potential solutions1)Forward everything Inefficient2)Coordinate Unscalable
P1P2
P1P2
P1P2
P1P2
![Page 13: Revisiting the Contract Between Layers Sachin Katti Dina Katabi, Hari Balakrishnan, Muriel Medard](https://reader035.vdocument.in/reader035/viewer/2022062500/56649f045503460f94c17b9a/html5/thumbnails/13.jpg)
Forward random combinations of correct symbols
R1
R2
DSP1P2
MIXIT Prevents Duplicates using Symbol Level Network Coding
P1P2
P1P2
![Page 14: Revisiting the Contract Between Layers Sachin Katti Dina Katabi, Hari Balakrishnan, Muriel Medard](https://reader035.vdocument.in/reader035/viewer/2022062500/56649f045503460f94c17b9a/html5/thumbnails/14.jpg)
1s
…
…R1
R2
D
2s2
1
7s
2s
2
7
…
1s
…
…
2s
Routers create random combinations of correct symbols
2
1
9s
5s
5
9
…
MIXIT Prevents Duplicates using Symbol Level Network Coding
![Page 15: Revisiting the Contract Between Layers Sachin Katti Dina Katabi, Hari Balakrishnan, Muriel Medard](https://reader035.vdocument.in/reader035/viewer/2022062500/56649f045503460f94c17b9a/html5/thumbnails/15.jpg)
R1
R2
D2
1
7s
2s
…
2
1
9s
5s
…
21 s,sSolve 2
equations
Destination decodes by solving linear equationsRandomness prevents duplicates without co-ordinationRandomness prevents duplicates without co-ordination
MIXIT Prevents Duplicates using Symbol Level Network Coding
![Page 16: Revisiting the Contract Between Layers Sachin Katti Dina Katabi, Hari Balakrishnan, Muriel Medard](https://reader035.vdocument.in/reader035/viewer/2022062500/56649f045503460f94c17b9a/html5/thumbnails/16.jpg)
1s
…
…R1
R2
D
2s2
1
7s
2s
2
7
…
1s
…
…
2s
Routers create random combinations of correct symbols
15s
5
0
…
MIXIT Prevents Duplicates using Symbol Level Network Coding
![Page 17: Revisiting the Contract Between Layers Sachin Katti Dina Katabi, Hari Balakrishnan, Muriel Medard](https://reader035.vdocument.in/reader035/viewer/2022062500/56649f045503460f94c17b9a/html5/thumbnails/17.jpg)
R1
R2
D2
1
7s
2s
…
15s …
21 s,sSolve 2
equations
Destination decodes by solving linear equations
Symbol Level Network Coding • No duplicates Efficient • No coordination Scalable
Symbol Level Network Coding • No duplicates Efficient • No coordination Scalable
MIXIT Prevents Duplicates using Symbol Level Network Coding
![Page 18: Revisiting the Contract Between Layers Sachin Katti Dina Katabi, Hari Balakrishnan, Muriel Medard](https://reader035.vdocument.in/reader035/viewer/2022062500/56649f045503460f94c17b9a/html5/thumbnails/18.jpg)
Destination needs to know which combinations it received
21 9s5s
21 0s5s
21 9s0s
(if both symbols were correct)
(if only s1 was correct)
(if only s2 was correct)
Nothing (if neither symbol was correct)
![Page 19: Revisiting the Contract Between Layers Sachin Katti Dina Katabi, Hari Balakrishnan, Muriel Medard](https://reader035.vdocument.in/reader035/viewer/2022062500/56649f045503460f94c17b9a/html5/thumbnails/19.jpg)
Destination needs to know which combinations it received Use run length encoding
5
9
Original Packets Coded Packet
![Page 20: Revisiting the Contract Between Layers Sachin Katti Dina Katabi, Hari Balakrishnan, Muriel Medard](https://reader035.vdocument.in/reader035/viewer/2022062500/56649f045503460f94c17b9a/html5/thumbnails/20.jpg)
0
9
Original Packets Coded Packet
Use run length encoding
Destination needs to know which combinations it received
![Page 21: Revisiting the Contract Between Layers Sachin Katti Dina Katabi, Hari Balakrishnan, Muriel Medard](https://reader035.vdocument.in/reader035/viewer/2022062500/56649f045503460f94c17b9a/html5/thumbnails/21.jpg)
9
5
Original Packets Coded Packet
Destination needs to know which combinations it received Use run length encoding
![Page 22: Revisiting the Contract Between Layers Sachin Katti Dina Katabi, Hari Balakrishnan, Muriel Medard](https://reader035.vdocument.in/reader035/viewer/2022062500/56649f045503460f94c17b9a/html5/thumbnails/22.jpg)
0
5
Original Packets Coded Packet
Destination needs to know which combinations it received Use run length encoding
![Page 23: Revisiting the Contract Between Layers Sachin Katti Dina Katabi, Hari Balakrishnan, Muriel Medard](https://reader035.vdocument.in/reader035/viewer/2022062500/56649f045503460f94c17b9a/html5/thumbnails/23.jpg)
Run length encoding efficiently expresses combinationsRun length encoding efficiently expresses combinations
Destination needs to know which combinations it received Use run length encoding
![Page 24: Revisiting the Contract Between Layers Sachin Katti Dina Katabi, Hari Balakrishnan, Muriel Medard](https://reader035.vdocument.in/reader035/viewer/2022062500/56649f045503460f94c17b9a/html5/thumbnails/24.jpg)
Routers May Forward Erroneous Bits Despite High Confidence
MIXIT has E2E error correction capability!
Symbol-LevelNetwork Coding
ECC Data
MIXIT’s Error Correcting Code (ECC)1. Routers are oblivious to ECC2. Optimal error correction capability3. Rateless
Decode ECCData
PHY + LL Deliver correct symbols to higher layerNetwork Forward correct symbols to destination
Source Destination
![Page 25: Revisiting the Contract Between Layers Sachin Katti Dina Katabi, Hari Balakrishnan, Muriel Medard](https://reader035.vdocument.in/reader035/viewer/2022062500/56649f045503460f94c17b9a/html5/thumbnails/25.jpg)
High Concurrency MAC
• Each node maintains a map of conflicting transmissions
• Map is based on empirical measurements and built in distributed, online manner
w & x NO!w & u YES!
xu w
![Page 26: Revisiting the Contract Between Layers Sachin Katti Dina Katabi, Hari Balakrishnan, Muriel Medard](https://reader035.vdocument.in/reader035/viewer/2022062500/56649f045503460f94c17b9a/html5/thumbnails/26.jpg)
Evaluation
• Implementation on GNURadio SDR and USRP• Zigbee (IEEE 802.15.4) link layer• 25 node indoor testbed, random flows• Compared to:
1. Shortest path routing based on ETX2. MORE: Packet-level opportunistic routing
![Page 27: Revisiting the Contract Between Layers Sachin Katti Dina Katabi, Hari Balakrishnan, Muriel Medard](https://reader035.vdocument.in/reader035/viewer/2022062500/56649f045503460f94c17b9a/html5/thumbnails/27.jpg)
Throughput (Kbps)
CD
F
Throughput increase: 3x over SPR, 2x over MOREThroughput increase: 3x over SPR, 2x over MORE
Throughput Comparison
2.1x3x
Shortest PathMOREMIXIT
![Page 28: Revisiting the Contract Between Layers Sachin Katti Dina Katabi, Hari Balakrishnan, Muriel Medard](https://reader035.vdocument.in/reader035/viewer/2022062500/56649f045503460f94c17b9a/html5/thumbnails/28.jpg)
Throughput (Kbps)
CD
FWhere do the gains come from?
Shortest PathMOREMIXIT
Take concurrency away from MIXIT
![Page 29: Revisiting the Contract Between Layers Sachin Katti Dina Katabi, Hari Balakrishnan, Muriel Medard](https://reader035.vdocument.in/reader035/viewer/2022062500/56649f045503460f94c17b9a/html5/thumbnails/29.jpg)
Where do the gains come from?
1.5x
Without concurrency, 1.5x gain over MOREWithout concurrency, 1.5x gain over MOREThroughput (Kbps)
CD
F
Shortest PathMORE
MIXIT withoutconcurrency
Take concurrency away from MIXIT
![Page 30: Revisiting the Contract Between Layers Sachin Katti Dina Katabi, Hari Balakrishnan, Muriel Medard](https://reader035.vdocument.in/reader035/viewer/2022062500/56649f045503460f94c17b9a/html5/thumbnails/30.jpg)
Where do the gains come from?
Throughput (Kbps)
CD
F
MIXIT
Gains come from both moving to the symbol level and high concurrency
Gains come from both moving to the symbol level and high concurrency
Shortest PathMORE
MIXIT withoutconcurrency
![Page 31: Revisiting the Contract Between Layers Sachin Katti Dina Katabi, Hari Balakrishnan, Muriel Medard](https://reader035.vdocument.in/reader035/viewer/2022062500/56649f045503460f94c17b9a/html5/thumbnails/31.jpg)
Multiple Flows
Shortest PathMOREMIXIT
No. of concurrent flows
Avg.
Net
wor
k Th
roug
hput
(Kbp
s)
MORE/SPR: Higher congestion Lower concurrencyMIXIT: Higher congestion High concurrency
MORE/SPR: Higher congestion Lower concurrencyMIXIT: Higher congestion High concurrency
![Page 32: Revisiting the Contract Between Layers Sachin Katti Dina Katabi, Hari Balakrishnan, Muriel Medard](https://reader035.vdocument.in/reader035/viewer/2022062500/56649f045503460f94c17b9a/html5/thumbnails/32.jpg)
Related Work• Opportunistic Routing• EXOR [BM05], MORE [CJKK07], Coop-diversity[LWT04]
• Soft information • SoftPHY [JB07], SOFT [WKK07], SOVA[HH89]
• Increasing wireless concurrency• CMAPS[VJB08], Conflict maps[JPPQ03], Interference
modeling [RMRWZ06]
• Network Coding• Linear codes[ACLY00], MRD [G:85, SKK:08, KK:07]
![Page 33: Revisiting the Contract Between Layers Sachin Katti Dina Katabi, Hari Balakrishnan, Muriel Medard](https://reader035.vdocument.in/reader035/viewer/2022062500/56649f045503460f94c17b9a/html5/thumbnails/33.jpg)
ConclusionMIXIT• New contract harnesses wireless characteristics• Symbol-level network coding to scalably route
correct symbols• High concurrency• Implementation and evaluation demonstrating 3-4x over shortest path, 2-3x gains over MORE