Temporal Reachability Graphs John Whitbeck, Marcelo Dias de Amorim, - - PowerPoint PPT Presentation

▶
temporal reachability graphs
SMART_READER_LITE
LIVE PREVIEW

Temporal Reachability Graphs John Whitbeck, Marcelo Dias de Amorim, - - PowerPoint PPT Presentation

Sep 13, 2022 476 likes •744 views

t h a l e s & u p m c s o r b o n n e u n i v e r s i t e s - l i p 6 Temporal Reachability Graphs John Whitbeck, Marcelo Dias de Amorim, Vania Conan and Jean-Loup Guillaume August 25th, 2012 t h a l e s & u p m c s o r b o n n e u

slide-1
SLIDE 1

t h a l e s & u p m c s o r b o n n e u n i v e r s i t ´ e s - l i p 6

Temporal Reachability Graphs

John Whitbeck, Marcelo Dias de Amorim, Vania Conan and Jean-Loup Guillaume

August 25th, 2012

slide-2
SLIDE 2

t h a l e s & u p m c s o r b o n n e u n i v e r s i t ´ e s - l i p 6

Intro : Contact Traces

Whitbeck et al. — Temporal Reachability Graphs — August 25th, 2012 2/16

slide-3
SLIDE 3

t h a l e s & u p m c s o r b o n n e u n i v e r s i t ´ e s - l i p 6

Intro : Contact Traces

Whitbeck et al. — Temporal Reachability Graphs — August 25th, 2012 2/16

slide-4
SLIDE 4

t h a l e s & u p m c s o r b o n n e u n i v e r s i t ´ e s - l i p 6

Intro : Contact Traces

Time Node 1 Node 2 Event a b UP d e UP c e UP 1 a b DOWN 1 d e DOWN 1 c e DOWN 1 b d UP 2 a b UP · · ·

Whitbeck et al. — Temporal Reachability Graphs — August 25th, 2012 2/16

slide-5
SLIDE 5

t h a l e s & u p m c s o r b o n n e u n i v e r s i t ´ e s - l i p 6

Intro : Contact Traces

Time Node 1 Node 2 Event a b UP d e UP c e UP 1 a b DOWN 1 d e DOWN 1 c e DOWN 1 b d UP 2 a b UP · · ·

Contact trace : symmetric single-hop information Opportunistic routing : asymmetric multi-hop connectivity over time

Whitbeck et al. — Temporal Reachability Graphs — August 25th, 2012 2/16

slide-6
SLIDE 6

t h a l e s & u p m c s o r b o n n e u n i v e r s i t ´ e s - l i p 6

Outline

1 From time-varying connectivity graphs to reachability graphs 2 Efficient calculation of reachability graphs 3 Results : bounds on communication capabilities

Whitbeck et al. — Temporal Reachability Graphs — August 25th, 2012 3/16

slide-7
SLIDE 7

From time-varying connectivity graphs to reachability graphs

slide-8
SLIDE 8

t h a l e s & u p m c s o r b o n n e u n i v e r s i t ´ e s - l i p 6

Temporal reachability graphs

TRG Definition

In a (τ, δ)-reachability graph, an arc exists from node A to B at time t if a space-time path exists from A to B leaving A at time t and arriving at B before t + δ given that each single-hop takes time τ.

Whitbeck et al. — Temporal Reachability Graphs — August 25th, 2012 5/16

slide-9
SLIDE 9

t h a l e s & u p m c s o r b o n n e u n i v e r s i t ´ e s - l i p 6

Temporal reachability graphs

TRG Definition

In a (τ, δ)-reachability graph, an arc exists from node A to B at time t if a space-time path exists from A to B leaving A at time t and arriving at B before t + δ given that each single-hop takes time τ.

a b c d e δ = 1s δ = 2s TRG at t = 0s Delay Tolerance (δ) a b c d e TRG at t = 1s TRG at t = 2s a b c d e a b c d e a b c d e a b c d e

Whitbeck et al. — Temporal Reachability Graphs — August 25th, 2012 5/16

slide-10
SLIDE 10

t h a l e s & u p m c s o r b o n n e u n i v e r s i t ´ e s - l i p 6

Time-varying dominating set

TVDS Definition

A time-varying dominating set (TVDS) of a temporal reachability graph, is a time-varying set of nodes such at at all times t, the node in the TVDS are a regular dominating set of the directed reachability graph at time t.

Whitbeck et al. — Temporal Reachability Graphs — August 25th, 2012 6/16

slide-11
SLIDE 11

t h a l e s & u p m c s o r b o n n e u n i v e r s i t ´ e s - l i p 6

Why reachability graphs ?

  • On reachability graphs, certain routing performance questions

become easy

  • Upper-bound on average delivery ratio at time t (e.g.,

point-to-point, broadcast)

  • Size of the“temporal dominating set”at time t (for offloading)
  • New analysis angles on connectivity graphs
  • Asymmetric / Symmetric connectivity phases
  • Good receivers = large incoming node degree
  • Good senders = large outgoing node degree

Whitbeck et al. — Temporal Reachability Graphs — August 25th, 2012 7/16

slide-12
SLIDE 12

t h a l e s & u p m c s o r b o n n e u n i v e r s i t ´ e s - l i p 6

Why reachability graphs ?

  • On reachability graphs, certain routing performance questions

become easy

  • Upper-bound on average delivery ratio at time t (e.g.,

point-to-point, broadcast)

  • Size of the“temporal dominating set”at time t (for offloading)
  • New analysis angles on connectivity graphs
  • Asymmetric / Symmetric connectivity phases
  • Good receivers = large incoming node degree
  • Good senders = large outgoing node degree

The real challenge is calculating a reachability graph from a regular time-varying graph !

Whitbeck et al. — Temporal Reachability Graphs — August 25th, 2012 7/16

slide-13
SLIDE 13

Efficient calculation of reachability graphs

slide-14
SLIDE 14

t h a l e s & u p m c s o r b o n n e u n i v e r s i t ´ e s - l i p 6

“Adding” reachability graphs

Whitbeck et al. — Temporal Reachability Graphs — August 25th, 2012 9/16

slide-15
SLIDE 15

t h a l e s & u p m c s o r b o n n e u n i v e r s i t ´ e s - l i p 6

“Adding” reachability graphs

“Rδ ⊕ Rµ = Rδ+µ”

Whitbeck et al. — Temporal Reachability Graphs — August 25th, 2012 9/16

slide-16
SLIDE 16

t h a l e s & u p m c s o r b o n n e u n i v e r s i t ´ e s - l i p 6

But not quite so easy...

Whitbeck et al. — Temporal Reachability Graphs — August 25th, 2012 10/16

slide-17
SLIDE 17

t h a l e s & u p m c s o r b o n n e u n i v e r s i t ´ e s - l i p 6

But not quite so easy...

Messages are created out of sync with the contact trace’s granularity (t = kη)

  • Good upper (too many arcs) and lower (a few missed arcs)

approximations

  • Bounds are equal for all t = kη

Whitbeck et al. — Temporal Reachability Graphs — August 25th, 2012 10/16

slide-18
SLIDE 18

t h a l e s & u p m c s o r b o n n e u n i v e r s i t ´ e s - l i p 6

But not quite so easy...

0.36 0.4 0.44 0.48 0.52 1350 1360 1370 1380 1390 1400 0.1 0.2 0.3 0.4 0.5 0.6 Density Dominating set size Time (s) Dominating set size from lower and upper bounds Upper bound Lower bound

Example taken from the Rollernet trace with τ = 5s and δ = 1min

Whitbeck et al. — Temporal Reachability Graphs — August 25th, 2012 10/16

slide-19
SLIDE 19

t h a l e s & u p m c s o r b o n n e u n i v e r s i t ´ e s - l i p 6

But not quite so easy...

Graph can evolve faster than the transmission time (η < τ)

  • Composition over families of TRGs with close δ values
  • Parallel computation of families

Whitbeck et al. — Temporal Reachability Graphs — August 25th, 2012 10/16

slide-20
SLIDE 20

Results : bounds on communication capabilities

slide-21
SLIDE 21

t h a l e s & u p m c s o r b o n n e u n i v e r s i t ´ e s - l i p 6

Example 1 : Rollernet (τ = 5s)

0.2 0.4 0.6 0.8 1 20 30 40 50 60 70 80 0.2 0.4 0.6 0.8 1 0.2 0.4 0.6 0.8 1 20 30 40 50 60 70 80 0.2 0.4 0.6 0.8 1 Proportion of connected pairs Dominating set size 0.2 0.4 0.6 0.8 1 20 30 40 50 60 70 80 0.2 0.4 0.6 0.8 1 Time (min) δ = 10s δ = 1min δ = 3min

Whitbeck et al. — Temporal Reachability Graphs — August 25th, 2012 12/16

slide-22
SLIDE 22

t h a l e s & u p m c s o r b o n n e u n i v e r s i t ´ e s - l i p 6

Example 2 : Stanford High (τ = 1s)

0.2 0.4 0.6 0.8 1 4 5 6 7 8 9 10 11 0.2 0.4 0.6 0.8 1 0.2 0.4 0.6 0.8 1 4 5 6 7 8 9 10 11 0.2 0.4 0.6 0.8 1 Proportion of connected pairs Dominating set size 0.2 0.4 0.6 0.8 1 4 5 6 7 8 9 10 11 0.2 0.4 0.6 0.8 1 Time (h) δ = 20min δ = 1h δ = 2h

Whitbeck et al. — Temporal Reachability Graphs — August 25th, 2012 13/16

slide-23
SLIDE 23

t h a l e s & u p m c s o r b o n n e u n i v e r s i t ´ e s - l i p 6

Bounds

0.2 0.4 0.6 0.8 1 60 120 180

  • Avg. density

Delay δ (s) 0.25 2 5 10 20

Rollernet : Average density vs. maximum delay δ for different edge traversal times τ

Whitbeck et al. — Temporal Reachability Graphs — August 25th, 2012 14/16

slide-24
SLIDE 24

t h a l e s & u p m c s o r b o n n e u n i v e r s i t ´ e s - l i p 6

Bounds

0.2 0.4 0.6 0.8 1 60 120 180

  • Avg. dom. set size

Delay δ (s) from top to bottom: τ = 20, 10, 5, 2, 0.25, 0

Rollernet : Average dominating set size vs. maximum delay δ for different values of τ (in seconds).

Whitbeck et al. — Temporal Reachability Graphs — August 25th, 2012 14/16

slide-25
SLIDE 25

t h a l e s & u p m c s o r b o n n e u n i v e r s i t ´ e s - l i p 6

Conclusions

Contributions

  • Formalization of temporal reachability graphs (TRG)
  • Fast implementation of the conversion from regular

time-varying graphs

  • Powerful tool for analyzing performance bounds in
  • pportunistic networks (e.g., asymmetry, max delivery ratio)
  • Opens up many new perspectives (modeling, community

detection)

Lessons for opportunistic networks

  • Point to point communications with acceptable delays are

very hard

  • However usually possible to reach everyone in the network

through a small dominating set (Offloading)

Whitbeck et al. — Temporal Reachability Graphs — August 25th, 2012 15/16

slide-26
SLIDE 26

Thank You !

More info at : http://www-npa.lip6.fr/~whitbeck Calculation & visualization code : http://github.com/neush/ditl