►
From YouTube: IETF100-6TISCH-20171113-1550
Description
6TISCH meeting session at IETF100
2017/11/13 1550
https://datatracker.ietf.org/meeting/100/proceedings/
A
Okay,
propose
that
we
get
started
we're
a
little
bit
in
weird
configuration.
Most
of
the
presenters
are
remote,
so
we'll
see
many
many
people
on
the
screen
and
under
here
clear
her
conflicted
against
above.
So
it's
a
bit
bit
of
a
strange
situation,
but
it
doesn't
matter
I'm.
Sorry.
Could
you
get
first
slides.
B
A
Okay,
so
welcome
to
the
sixth
issue
group
meeting
this
meeting,
so
I
need
to
remind
you
of
the
note
well
develop
I
do
this
as
it
applies
to
any
ITF
meeting
if
you're
discussing
and
the
IPR,
whether
it's
yours
or
not,
you
need
to
disclose
it.
You
have
any
questions
read
this
note
well
go
through
different
references
in
this
note.
Well,
and
that's
your
favorite
group
chair,
oh
or
ad
reminder
we're
taking
minutes
where's
arm.
Where
are
many
takers
Dominique
should
be
somewhere
because
here,
thank
you.
So.
A
If
you
could
take
the
lead
and
then
Dominical
will
jump
in
and
and
and
fill
in,
recording
and
all
of
this
will
be
sent
to
the
mailing
list.
After
the
meeting
we
will
circulate
some
blue
blue
sheets
as
well
so
trivial
stuff
minutes
are
here:
remote
participation,
meeting
materials
or
online
etcetera,
etc.
We're
going
one
set
of
size
per
presentation
makes
it
much
simpler
for
us.
This
is
the
agenda
of
today.
A
So
as
I
as
I
told
you,
most
of
the
presenters
will
be
remote,
which
is
a
kind
of
a
weird
situation.
But
we'll
start
by
doing
some
intro
and
status
agenda,
mashing
milestones
and
sate.
We
didn't
go
into
first
half,
which
will
be
about
chartered
items.
Java
will
present
the
six.
Our
protocol
militia
will
present
a
minimal
security
solution.
Michael
will
present
the
zero
touch
showing
and
then
Diego
SFX,
then
we'll
go
if
time
permits
into
the
Uncharted
items
we
have
about
half
pound.
A
For
that
we
think
Fay
and
minimal
scheduling
function
will
have
sf1
with
me
here
and
then
Michael
again,
oops,
ok,
Michael
with
a
joint
priority
and
then
at
the
end
we
have
ten
minutes
of
non
scheduled
space
for
any
other
business.
If
there's
any
updates,
this
is
where
we
want
them.
So
before
we
get
started,
is
there
any
any
comments
about
this
agenda?
Anything
we
want
to
add.
We
want
to
remove.
We
want
to
discuss,
we
don't
want
to
discuss.
If
you
have
any
issues,
please
raise
them
now.
A
Ok,
I
hear
nothing.
So
let
me
give
you
a
quick
status,
the
milestones
so
while
I'm
speaking
charlie
you'll
be
the
first
presenter.
So
I
don't
know
how
what
do
you
need
to
click
on
some
magic
but
but
you'll
be
speaking?
Will
he
show
up
in
the
queue?
Is
that
how
it
works?
Ok,
I
think
I
think
meet
echo
somehow
magically
scheduled
him
Lucy.
A
I
wanted
to
take
a
minute,
or
so
too.
This
is
a
rather
dense
slide.
I
had
14-hour
flight
just
now
so
this
is
this
is
what
14
I
was
a
flight,
gives
you
lots
of
colors
and
arrows
and
stuff
what
I?
What
I
want
to
show?
You
is
a
state
of
the
of
the
workgroup
and
and
and
bear
with
me,
I'll
try
and
read
this
with
you.
So
in
the
upper
left
hand
corner,
we
have
completed
a
minimal
sixish
solution,
which
is
a
fantastic
news.
A
A
And
then
ripple
six,
five,
five,
zero
and
6lowpan.
So
that's
that's!
That's
great!
It's
the
first
time
that
I
mean
we're
there.
Now
we
have
everything
we
have
a
solution
of
minimal
solution
that
works
and
I.
Think
as
a
workgroup,
we
have
two
different
elements
to
work
on
something
internal
within
the
ITF
and
something
external.
Let
me
start
with
the
external.
A
Questions
like
is
six
stage
the
right
technology,
for
my
application
is
what
what
what
implementers
are
asking
themselves
and
so
all
of
these
open
source
of
limitation
of
support,
six
dish,
Kentucky
and
G,
which
is
like
three
days
old,
is
the
last
one
that
was
that
was
that
was
announced
as
great
and
there's
a
bunch
of
activity
going
on
and
performance
evaluation,
benchmarking,
which
is
exactly
what
we
need.
We
need
to
be
able
to
tell
you
know:
company,
XY
and
z
weather
for
this
particle
application.
A
Six
ish
will
work
and
there's
also
tools
that
have
been
built
around
conformers
and
drop
testing
short
drop.
So
it's
a
good
thing
now,
internally
to
the
to
the
to
the
working
group
internally
to
the
ITF
there's
based
on
this
minimum
six
dish,
there's
further
the
concha
developments
in
three
areas.
The
first
area
is
additional
scheduling
function,
so
there's
three
ongoing
works,
sfx,
a
SF
and
SF
one,
the
ones
that
I
have
a
star
the
ones
that
are
presented
today.
A
A
second
focus
point
is
security,
with
the
zero
touch
join
security,
so
taking
the
one
touch,
solution
of
minimal
security
and
turn
that
into
a
zero
touch,
solution.
Michael
will
present
this
and
then
a
number
of
optimizations
regarding
ripple
regarding
Evie's
joint
priority
elements
that
you
put
in
the
iOS
elements
that
you
could
NDB
to
make
John
faster,
more
flexible
things
like,
and
so
these
are.
This
is
ongoing
work
right
now
in
the
work
group.
A
How
much
better
will
the
network
work
compared
to
minimal
security,
minimal
of
six
dish
and
then-
and
then
you
know,
if
you
pull
in
a
bunch
of
RFC's
and
how
much
bigger
will
the
footprint
be
of
your
implementation,
because
that's
something
we
we
cannot
forget
as
well.
So
this
concludes
I
think
this.
C
B
B
A
D
B
B
D
E
B
D
D
So
this
first
one
is
relocation
and
there
was
a
thread
in
the
mailing
list
as
well
discussing
that
the
second
one
is
how
we
handle
inconsistencies
and
the
third
one
is
the
error
codes
and
we
try
to
clarify
at
least
the
error
codes
on
how
they
are
used,
and
this
draft
was
submitted
submitted
to
the
IG
since
the
31st
of
October,
so
now
I
think
isn't
review
Estados
next
slide.
Please.
F
D
D
One
thing
that
was
not
clear
is
that
the
cells
in
the
candidate
list
are
all
them
equivalent.
This
means
that
any
of-
and
you
will
see
it
in
these
examples,
but
it
means
that
any
cell
can
be
relocated
to
any
of
the
candidate
cells,
and
if
we
look,
for
example,
at
the
case,
a
where
we
have
here
an
example
where
all
the
cells
are
relocated,
we
will
see
that
there
are
two
proposed
cells
and
the
first
one
is
much.
It
can
be
relocated
to
the
last
one
in
the
candidate
cell
is
well.
D
The
second
one
that
needs
to
be
relocated
is
relocated
to
the
first
one
in
the
cell
list,
and
this
is
just
decision
on
the
implementation,
because
all
of
them
are
equivalent.
We
have
other
examples
like
case
B,
where
only
one
cell,
from
the
from
the
two
that
want
to
be
relocated,
is
relocated
or
in
the
case
C,
when
none
of
them
can
be
relocated.
Here
we
can
see
how
how
the
protocol
works
and
what
is
the
the
signaling
we
have
next
slide.
Please.
F
D
The
the
first
one
is
when
we
have
a
transaction
ongoing
and
the
node
P.
Let's
say
in
this
in
this
figure
for
some
reason
for
some
reason:
resets
or
power
cycles,
and
then
it
restarts.
If
this
happens,
the
inconsistency
will
be
detected
because
of
the
sequence
number
of
the
node.
That
resets
turns
to
zero,
and
then
this
will
be
detected
in
the
response
message,
while
the
another
another
case
is
when
we
have
a
transaction
and
for
some
reason,
the
the
last
the
last
link
layer
acknowledgement
fails.
D
Then,
in
the
text
we
clarify
how
these
inconsistencies
are
addressed
and
we
we
just
outline
recommendations
or
we.
We
just
indicate
what
can
be
done,
because
we
think
that
the
scheduling
function
has
to
take
the
decision
on
what
exactly
do.
One
option,
of
course,
is
to
reset
the
schedules,
and
other
options
are
like
rollback.
The
transaction
next
slide.
G
D
Yeah
we.
Finally,
we
clarified
the
error
codes.
We've
gone
through
all
the
document.
We
tried
to
identify
all
the
cases
when
an
error
code
is
returned
it
and
we
try
to
make
the
text
as
clear
as
possible,
and
then
we
sorted
them
in
this
table
also
considering
whether
the
Argent's
response
codes
without
meaning
that
there's
an
error
or
if
they
are
of
the
of
or
if
they
have
to
be
considered
an
error.
So
this
is
the
list
of
error
codes
that
we
have
identified
next
slide.
Please.
D
A
Thank
you.
Sorry,
so
I
think
this.
This
also
reflects
well
what
we
discussed
in
Prague
and
a
little
change
that
we
have
done
after
the
blood
test.
There
I
know
of
at
least
two
implementations
that
implement
this
version.
Although
it's
yeah
I
think
yeah,
yes,
can
you
say
say
something
about
mg?
Is
it
is
it?
This
version
is
the
previous
version
that
dissolute
the
previous
verse
that
supplement?
Okay,
so
we're
waiting
on
one
more
implementation
and
to
update
to
this
one?
Thank
you.
H
H
G
H
She
asked
me,
like
you
know,
should
I
tell
six
Louis
like
yeah.
You
should
write
like
a
as
long.
More
reviews
are
better
than
any
point
of
fun
so,
like
she
said
like
she'll,
just
like
fan
it
out
and
see
how
things
go
like
I
took
a
quick
look
and
things
look
okay
to
me
right,
but
I'll
late
for
like
thank.
A
A
I
Can
you
hear
me
now
yeah,
alright,
sorry
about
that
I
forgot
to
join
the
queue
and
enable
the
buttons,
so
the
sound
is
good.
Yeah
perfect!
Thank
you.
Alright,
great,
so
hello,
everyone,
my
name,
is
Melissa
I
will
be
presenting
the
status
of
minimal
security
draft,
which
is
our
one
touch
solution
to
secure
enrollment
in
sixties
networks.
So
on
October
30th
we
publish
this
do
four
version
of
minimal
security,
and
the
biggest
change
is
that
we
now
completely
rely
on
pre-shared
keys.
That
said,
we
we
had
to
remove
the
dependency
on
the
ad-hoc
draft.
I
What
we
did,
what
we
do
now
is
that
we
use
let
us
identify
as
master
salt
during
key
derivation
process,
and
then
we
transport
this
identifier
eui-64
as
a
context
hint
during
as
part
of
the
join
request.
I
will
present
some
more
details,
I'll
just
in
a
minute,
and
we
use
the
different
identifiers,
of
course,
for
the
pledge
and
that
they
are
see-
and
this
is
plain
simple
in
c00-
for
pledge
and
0
1
4
for
the
jrc
I
made
some
slides
to
reflect
some
schematics
to
look
like
this.
I
Yes,
so
this
is
what
the
key
derivation
process
looks
like,
and
this
is
basically
standardized
in
our
score
and
we
instantiate
this
in
minimal
security
and,
as
you
can
see,
the
first
input
to
the
key
derivation
function
is
the
pre
shared
key,
which
is
kept
secret.
Of
course,
then,
as
master
salt,
we
use
pledges
identifier
eui-64,
then
a
string
key
to
differentiate
between
a
key
and
the
m.div
that
is
subsequently
being
drive,
and
also
there
is
the
sender
identifier.
When
this
all
is
passed
through
a
key
derivation
function.
I
I
This
is,
the
output
gives
a
static
IV
that
is
kept
on
both
sides
and
then
to
construct
the
nonce
for
each
request.
That
comes
order
response.
What
happens
is
that
common
IV
is
exhort
with
the
sequence
number,
together
with
the
center
identifier
of
the
entity,
initiating
the
requested
next
slide,
please.
I
This
was
the
case
because
in
case
the
pre
shared
key
is
not
present
at
the
jrc
or
that
the
pledge
is
not
authorized
to
join
the
network.
The
error
handling
that
we
used
previously
would
return
an
unprotected
error
code
back
to
the
pledge.
Now,
of
course,
as
this
error
code
cannot
be
protected
because
the
jrc
end,
the
pledge
do
not
share
a
common
context
or
the
pre
shared
key
the
blood.
I
It
would
be
possible
to
prove
the
error
response
and
make
the
pledge
join
the
next
advertised
network,
and
what
we
didn't
know
for
is
that
we
went
for
a
completely
forced,
silent,
silent
drop
of
any
error
code
and
to
do
that,
we
use
non
confirmable
co-op
message
for
join
requests,
which
makes
oscar
at
JRC
silently
dropped.
The
request
in
case
of
failure,
which
may
happen
or
fail
the
decryption
replay
attack
or
sim
I'm,
not
right
pledge
joining.
I
So
what
we
meant
there
it
now
in
minimal
security
is
that
the
pledge
must
silently
discard
any
response
not
protected
with
the
score,
including
error
codes,
and
this
is
to
ensure
that
the
client
will
basically,
the
pledge
does
not
accept
any
unprotected
messages
coming
its
way.
This.
This
is
also
good
from
the
point
of
view
of
intermediary
state
that
the
drawing
proxy
keeps
when
it
forwards
the
drawing
requests,
because
it
minimizes
this
state
the
proxy
needs
to
keep
in
terms
of
quad
in
terms
of
the
coop
implementation.
I
So
it
fits
very
well
with
what
we
wanted
to
have.
Basically,
the
stateless,
stateless
forwarding
at
the
drawing
proxy,
but
it
forces
the
pledge
to
implement
a
retransmission
mechanism
at
the
application
layer
which
basically
duplicate
co-op,
confirmable
message,
functionality
and
next
fight.
With
these.
A
Militia,
yes,
yes,
this
is
the
most
clarifying
question.
Sorry
I
didn't
quite
understand.
So
you,
the
pledge,
sends
a
request
to
the
jrc
that
used
to
be
confirmable.
Now
it's
non
confirmable.
Yes,
that's
correct,
because
the
reason
is,
if
I'm
a
pledge-
and
I
sent
a
drone
request
and
some
attacker
sends
me
a
drone
reply
telling
me:
hey,
you're,
not
authorized
I'll,
believe
it
because
it's
not
encrypted
I
didn't
get
the
keys
yet
right.
Yes,
that's
correct
yeah,
and
so
so
we
say:
okay,
non
confirmable.
So
there's
not
nothing!
G
A
A
B
I
Okay,
so
I
see
what
you're
saying
basically
right
now
as
it
is
in
the
draft,
the
pledge
would
need
to
detect
this
and
we
say
that
upon
a
certain
number
of
retries,
the
pledge
should
signal
to
the
user
by
an
out-of-band
mechanism,
the
presence
of
an
error
condition
which
this
is
the
statement
that
we
have
in
minimal
security.
But
your
point
is
good
that,
basically,
at
the
jrc
side,
if
there
are
many
attempts
that
fail,
there
should
be
a
this
could
be
a
sign
of
an
attack
or
a
miss
configuration
of
some
pledge
so
yeah.
A
B
I
Thank
you
yeah
yeah,
so
this
brings
me
to
the
show
what
we
discussed
and
rest
now
forced
us
to
implement.
Basically,
the
join
request
retransmission,
which
details
a
bit,
this
discussion
that
we
just
had
and
right
now,
what
we
do
in
minimal
security
that
we,
we
mandate
a
binary
exponential
backup
mechanism
to
be
implemented,
the
funded
by
the
pledge
at
the
application
layer
that
kind
of
duplicates
the
co-op
confirmable
functionality.
I
But
we
found
no
better
way
of
doing
this,
and
so
one
one
reason
why
we
had
to
use
the
non
confirmable
co-op
is
because
of
security,
and
the
second
reason
is
that
it
minimizes
state
at
the
proxy
that
is
in
the
middle
and
it
relieves
the
proxy
from
keeping
state
from
many
potential
from
many
untrusted
cadres.
Basically,
and
the
mechanism
that
we
specified
is
very
simple.
I
I
So,
basically,
for
the
initial
timeout
value
is
10
seconds,
which
gives
us
on
the
first
and
10
timeout
in
10
to
15
seconds
and
at
the
very
last
attempt
by
the
default
by
default.
It
gives
us
a
timeout
in
80
to
120
seconds,
so
I
will
be
playing
also
with
the
simulator
to
further
confirm
these
values
for
a
wide
range
of
networks.
A
K
I
A
I
Other
than
that,
we
added
some
recommendations
to
store
untrusted
neighbor
entries
in
a
separate
cache,
as
there
would
be
a
possibility
to
flood
the
drawing
proxy
with
malicious
pledges
and
basically
do
not
do
a
denial
of
service
on
the
joint
proxy.
If
the
drawing
proxy
would
keep
the
entries
from
the
network
and
from
the
untrusted
pledges
in
the
same
neighbor
tape,
we
switched
the
drawing
request
from
get
to
post
in
order
to
be
more
flexible
with
payload
in
the
join
request
down
the
road.
I
At
the
moment,
we
do
not
specify
any
payload
in
the
drawing
request,
but
it
could
be
useful
down
the
road
further.
We
clarified
some
text
on
the
persistency
of
mutable
oscar
context,
parameters
which
ensures
that
there
is
no
nonce,
reuse
and
replay
attacks
across
reboots,
and
we
also
did
an
extensive
editorial
pass,
rewrote
introduction
clarifications
from
the
pre
shared
key
and
others
next
slide.
Please.
I
I
There
is
an
ongoing
thread
on
the
mailing
list
about
the
about
tagging
join
traffic,
which
unfortunately,
I
kind
of
I
didn't
have
much
time.
I
had
to
context
which
the
minimal
scheduling
function,
so
I
didn't
have
time
to
follow
through.
So
you
guys
are
probably
more
advanced
than
me
on
this,
but
I
will
be.
I
will
be
going
through
this
thread
in
the
next
days
and
I.
I
B
I
mean
there
will
be
a
default
value
that
you
don't
need
to
indicate.
So
in
the
data
package,
you
would
not
see
it
for
most
normal
detail
packet,
but
actually
this
is
a
new
weapon
we
have
to
to
improve.
The
ESF
is
if
we
have
a
different
number
of
CS
or
classes
that
the
SF
recognizes,
then
it
would
have
different
treatments
and
maybe
I'll
get
more
allocate
less
or
in
this
case,
allocate
nothing
depending
on
on
the
class
of
the
packets.
So
if
you
use
a
default
class,
you
zero
byte.
I
D
F
D
L
G
F
Some
going
on
in
awake
specifically
to
handle
this
particular
case.
It
not
only
considered
this
case,
but
it
gives
an
example
of
AP
Panna,
but
the
same
applies
there,
and
so
we
would
like
to
have.
We
would
like
to
have
you
check
that
particular
draft
to
check
if
this
makes
sense
again,
so
the
first
point
recommendation
to
store
understate
neighbor.
G
F
B
As
chance,
we
we
care
about.
You
know
when
this
document
will
be
ready
for
Lesko
mm-hmm
yeah,
and
we
wondered
if
you
think
that,
considering
my
new
additions
that
are
discussed
now,
your
next
version
would
be
from
your
standpoint
ready
for
workgroup.
Let's
go.
Could
we
expect
to
do
well
Klesko
soon?
Oh,
yes,
yes,.
I
K
H
I
think
it's
gonna
be
very
challenging
to
like
synchronize
these
two
drafts.
So
if
you
think
you
want
a
score
to
be
done
before
you
ship
this
off,
just
wait
in
it
in
the
working
group
right
like
so
I
cannot
do
Crosse
area
synchronization
of
rats.
If
it's
like
multiple
things
that
are
my
groups,
then
I
can
manage
to
do
it
right,
but
I
would
say
if
you're
worried
about
like
any
changes
in
our
scores,
just
wait
for
it
to
get
through.
H
B
H
Right
so
I'm
pretty
sure,
there's
gonna
be
some
changes
after
it
leaves
the
working
group
right
like
this
idea
of
last
call
on
iesg,
I'm
sure,
there's
something
so
it's
gonna
happen.
So
if
you
want
like
it
to
be
big,
then
I
suggest
you
wait
for
that
to
get
big
or
just
send
it
off,
and
we
can
probably
sync
again
I'd
like
it
once
they
both
go
through
the
iesc
process.
If
something
breaks
like
I
can
probably
tell
you
like
what
has
changed
and
then
we
can
go
from
there.
H
So
there's
different
ways
forward
and
another
question
I
had
is
like.
What's
the
status
of
like
you
know,
they'd
Hawk
and
OS
coop,
like
stuff
I
thought
this
was
like
for
minimal
security
right
like
so
I,
don't
see
anything
in
the
draft,
so
I'm
just
trying
to
figure
out
like
is
that
dependency
still
there.
I
H
That's
good
for
me
to
know
right
like
because
this
is
like
really
three
area
across
the
area
stuff
right
like
and
if
that's
not
a
dependency,
that's
like
very,
like
useful
input
from
me,
so
that's
I,
don't
mind
like
just
like
the
looking
of
shipping
it
off
to
me
and
then
I'll
take
it
out,
like
you
know
how
to
get
back.
Ok
goes,
but
I
think
that
was
like
the
big
thing
that
that
was
like.
We
haven't
figured
out
yet
like
because
there's
like
a
dependency
on
s
as
well.
H
I
Yes,
so
we
removed
the
dependency,
but
as
part
of
six
dish,
I
I
mean
I'm.
Speaking
on
on
my
personal
as
my
personal
behalf,
we
would
want
probably
to
have
a
secure
enrollment
that
support
certificates
and
we
would
need
something
similar
to
ad-hoc
down
the
road,
so
I
mean
we
still
want
to
do
that
at
some
point
in
time.
A
B
You
need
to
indicate
which
class
you're
going
to
use
and
that's
that's
about
it
and
for
the
rest
has
to
be
somewhere
else.
But
you
need
to
indicate
that
you're
using
a
class
and
that
must
be
in
the
packet
and
and
you
also
need
to
indicate
that
it
goes
into
the.
If
there
is
IP
in
IP,
then
it
goes
into
the
inner
the
one
which
is
compressed
by
sixty
to
eighty
two,
as
opposed
to
six
garage,
because
exploration
cannot
transport
the
the
class.
N
N
So
the
o1
version
was
posted
on
October
30th
on
the
last
date
there
the
OO
version
had
synchronized
with
the
anima
bruce
keogh
7:00
draft
that
was
at
IETF
99.
So
the
approach
that
I
took
was
essentially
to
with
we
discussed
the
renaming
last
time
was
to
essentially
wipe
out
the
entire
draft
wholly
table
of
contents
in
from
the
brewski
document
and
then
essentially
make
this
a
sort
of
delta
draft,
so
that
the
document,
so
it
says,
unless
there's
a
specific
something
specific
things
in
sixish
joying,
that's
different
than
brewski.
N
It
will
be
identical,
but
that
the
table
of
contents
is
one
for
one
so
that
you
can
go
back
and
forth
and
say
you
know
what
how
is
it
different?
The
document
is
intended
to
be
read.
You
know
more
or
less
stand
alone,
but
you
are
intended
to
have
read
brewski
so
with
oh
nine
bruce
keogh
nine
document.
We
there
were
some
changes
to
the
document
and
so
the
zero
touch
document
there
you
synchronize
the
table
of
contents
fleshed
out
a
great
number
of
text.
N
It
includes
a
yang
module
which
is
translated
by
the
core
Yangtze
bore
mechanism
into
ownership,
vouchers
that
we
need
to
establish
ownership.
The
this
has
been
done
manually.
If
you
were
in
the
core
session
a
couple
hours
ago,
then
I
guess
there's
no
new,
complicated,
automated
mechanisms
to
do
this,
and
that
will
be
great
as
soon
as
they
become
stable.
N
N
We
had
this
big
lunch:
lat
IETF
99
in
Prague
to
try
and
sort
out
at
hawk
and
OS
core
and
DTLS,
and
all
this
stuff,
I
I,
don't
think
it
was
particularly
successful
in
the
end
and
I.
Don't
think
we
really
have
a
really
good
idea
of
of
what
will
happen
to
ed
Hawk,
if
anything.
So
at
this
point,
I'm
writing
the
document
and
the
assumption
that
it
may
live
on
top
of
DTLS
or
ed
Hawk
or
some
other
security.
If
someone
came
up
with
a
new
thing,
you
have
a
question:
oh
hi,.
N
H
N
K
Yeah,
it's
going
to
be
two
concrete
proposals
which
we
care,
one
is
with
which
we
compare
1:1,
which
is
based
on
a
jealous
handshake
and
one
which
is
based
on
their
talk
and
then
we're
gonna
match
that
and
have
a
discussion
based
on
on
your
requirements
and
number
of
messages
and
so
on.
Thank
you.
That's
that's.
N
Wonderful,
so
so,
but
just
just
as
a
little
aside,
one
of
the
things
that
I
realized
in
implementing
is
that
DTLS,
if
you
know,
has
a
actually
can
distributed
denial
of
service
attack
mitigation
thing
that
involves
an
extra
round
trip,
and
so
that
would
be
one
of
the
things,
for
instance,
that
we
would
have
to
decide
if
we're
going
to
turn
on
all
the
time
or
turn
or
disable
or
exactly
what.
So.
N
Our
last
point
is
that
I
I
saw
that
the
tire
update
says
that
we're
gonna
dot
do
this
by
October,
2018
and
I'm.
Pretty
sure
that
we
can
we
can
beat.
That
is
my
feeling
is
that,
although
this
is
sat
in
the
wings
for
a
long
time,
it
now
has
the
rights
team
to
advance
quickly,
assuming
that
that
we
figure
out
what
security
belongs.
Underneath
it
next
slide,
please
there
are
a
bunch
of
other
dependencies
and
other
works.
N
L
A
C
Well,
then
gave
them
and
I'm
the
editor
of
draft
IDI,
TF
66
top
SFX,
and
then
you
move
next,
please,
okay,
thank
you.
So
the
idea
is
that
we
are.
This
is
the
work
that
continues
and
I.
Don't
work
that
we
have
started
on
the
under
fly,
scheduling
and
skilled
in
function;
zero,
as
if
zero-
and
this
was
the
original
one-
has
a
full
experimental
results.
Okay,
meaning
that
we
had
a
paper
on
this
okay,
and
then
we
had
some
determinations
that
then
the
last
version.
C
We
have
changed
for
the
fundamental
algorithm
that
adds
or
or
releases
the
responsible.
So
the
relation
where
first
to
resubmit
SFC
arises
experimenta,
so
we
changed
name
to
SFX
and
then
to
provide
a
list
of
repair
requests
to
experimental
results
so
to
establish
a
range
of
values
or
the
values
of
which
of
the
constants
you
have
used
within
the
the
draft.
Next,
please.
C
C
C
C
Sorry,
yes,
so
yes,
yes,
we
are
just
using
as
a
zero,
because
this
is
the
only
experimental
version
of
it.
C
Then,
within
the
idea
request
is
the
defined
values
of
or
over
provisions
as
it's
your
threshold
on
the
other
ranges.
Okay,
so
the
ideal
it'll
be
under
the
on
the
agent
policy,
and
then
we
want
to
analyze
this
title
instability
oscillation,
because
that's
the
main
issue
when,
when
you're
trying
to
define
how
many
cells
you
are
going
to
define,
to
try
to
delete
on
one
side
of
the
other
about
a
factor
and
that's
one
of
the
features
that
sfx
has
and
next
please.
C
To
define
a
the
PDR
value
below
the
average,
which
is
not
effective,
in
fact,
for
black
lifting
cells
and
also
divide
with
them
and
then
to
analyze
the
stability
because
of
the
we
have
already
been
working
mostly
on
the
idea
that
there's
a
percentage
of
them
that
it
should
be
added
or
D.
But
we
want
you
to
understand
how
many
should
be
allowed
and
then
the
measure,
the
distribution
of
of
cell
scheduling,
delay
and
that
way
and
meaning
that,
if
you,
we
are
going
to
add
more
delay.
C
C
A
It
does
stayed
in
sample
some
some
places:
SF,
0,
F,
0,
F,
0,
so
I
think
just
source
the
type
of
typos
that
need
to
be
a
tiny
to
be
fixed
and
also
I
mean
it's
probably
entirely
our
fault.
But
at
the
beginning
we
started
talking
about
SS
by
their
number
and
sub
0
F
1
I
I
mean
we're
changing
our
minds
because
it's
we
get
stuck
with
those
numbers
and
we're
kind
of
assigning
it.
I
I
an
enum
Burres
before
before
anything
has
happened.
A
G
A
Need
to
who
who
follow
the
process
to
do?
I
you
let
a
Ana
assign
this
is
silly
but,
for
example,
verse
f1.
It
deploys
as
well.
Okay,
but
I
propose
that
we
we
work
together,
you
and
me
Diego
and
and
and
York
authors.
Yeah
I
can
Shepherd.
If
you
want
and
then
we
you
just
get
that
get
this
out,
and
we
have
to
work
for
that.
We
I'm
sorry.
We
have
to
wait
for
that
editorial
update
before
we
can
consider
work,
group
blast
coli,
I
believe
hi.
C
We
are,
we
are
we
asking
for
okay,
they
on
this
effects
test,
which
is
why
it
is
experimental
we
had
already
really
the
original
ones.
Okay,
the
partnership
published
for
the
former
Russian,
but
it's
not
for
the
new
version.
It
had
changed
the
the
main,
locating
algorithm,
okay,
we
don't
have
it
them.
Yet,
if
you
have
them,
we
are
grateful
with
you.
You
have
tested
it.
A
A
O
O
Okay,
so,
first
because
the
admin
MSF
is
trying
to
using
the
minimal
cell
phone
in
the
minimum
RFC,
so
we
define
some
way
to
leverage
a
traffic
on
the
minimal
cell.
First,
we
defined
the
different
types
to
allow
standing
on
the
minimal
cell,
which
is
in
hands,
begins
videos
and
the
turn
to
Christ
and
respond
message
between
the
plug
and
drone
proxy
and
also
the
60
transaction.
It's
before
to
now
they
have
a
dedicated
cell
installed
and
also
we
limited
the
traffic
on
minimal
cell
for
the
enhance,
beacon
or
videos
is
only
allowed
transmitter.
A
O
So
first
the
the
behavior
for
note
when,
after
is
food,
there
are
three
states
and
further
star
states.
The
note
has
a
pre-shared
key
and
it
will
go
through
the
drum
process.
We
should
define
e
that
mean
more
security
and
then
it
go
to
the
same
steps
to
join
and
at
the
end
of
state
and
note,
should
synchronize
the
network,
and
it
is
also
using
the
link
layer.
O
So
after
that,
the
note
is
allowed
to
sending
the
deals
and
enhance
beacon
for
serving
as
a
router
of
the
other
nodes
and
also
the
drove
proxy
for
the
new
joining
knows
next
slice,
please,
okay,
so
for
the
step
to
be
from
start
to
the
end
state,
it
has
some
steps.
First
and
after
an
output,
it's
a
random
through
the
frequency
delays
in
the
EBS
and
step
to
the
node
will
listen
for
multiple
neighbors
and
chose
one
as
the
drone
proxy
and
step.
O
Third,
it
will,
of
those
through
the
mean
to
drone
proxy
drone
process
according
to
the
secure,
secure
drone
process
and
after
the
node
John,
and
he
will
release
in
for
deals
to
require
a
a
idea
rank
to
select
a
paper
parents
and
then
step
5.
The
6p
will
use
to
adding
a
single
cell
with
the
step
to
sell
option
where
the
beat
TX,
Rx
and
shared
beats.
O
That
and
0
LT
uses
6p
a
package
sent
to
their
parents
to
reserve
one
debt
against
self
and
after
the
node
has
a
one
that
itself
and
the
know
start
sending
the
hand,
beacon
and
deals
and
man
Wow.
The
note
should
send
the
cable
life
to
their
neighbors,
everything
second,
to
see
if
the
neighbor
still
active
active
active.
So
if
not,
we
remove
the
cell
to
death.
Neighbors
next
records.
O
O
Yeah
so,
first
first
a
reason
for
adapting
the
traffic.
First
of
all,
a
note
always
has
at
least
one
cell
to
their
parents,
which
means
there
will
be
two
y's
one
delegate
cell
reserved
by
a
function
and
one
minimal,
SAP
and
and
also
we
keep
two
counters
to
the
paper
parents
numbered
cell
past,
which
we
were
counting,
how
many
dadiba
cell
has
passed
them
and
also
the
number
of
cell
used.
So
this
is
well
counting
when
there's
a
decade
I
need
to
transmit
around
the
dedicate
cell.
O
It
doesn't
matter
that
the
transmission
successful
were
not
equal,
plus
one.
When
there's
a
packet
need
to
send
and
the
decision
is
made
when
the
number
cells
is
Pastor
Rick,
that's
our
pastor
reaches
16,
so
when
numbers
are
used
is
greater
than
12
the
Addison,
and
if
it's
less
than
four
you
remove
cell.
A
O
O
Take
that
thank
you
next
slide,
please
yeah!
So
when
I
noticed
switched
its
parents,
you
would
do
three
thing.
First,
it
counts
a
number
of
with
the
previous
parents
and
schedule
the
same
number,
the
new
parents,
and
then
it's
remove
yourself
from
the
older
parents
and
for
handling
the
collegian.
Next,
with
slightly
yeah.
O
O
A
M
M
O
M
O
O
So
we
should
go
to
the
other
detail.
Mr.
nice,
yeah
yeah,
so
there's
other
details
of
defining
the
MSF.
So
the
signal
signal
command
MS
we
didn't
use
it
and
rule
for
sale
list
cell
are
randomly
chosen
and
the
sixty
timeout
value
is,
depending
on
the
PDR
of
the
link
from
note
to
their
parents
and
also
a
factory
and
to
the
rule.
For
ordering
cell.
We
ordered
the
cell
in
southeast
of
either
throughout
upset
and
there's
no.
O
Further
metadata,
fair
that
we
didn't
use
it
and
we
also
defined
for
actions
to
handle
in
different
68
error
code
and
inconsistent
handling.
We
already
described
it,
so
this
is
the
whole
MSF
dropped
generally
about,
and
we
proposes
the
two
weeks
ago
and
with
Delia
and
simulation
and
experimentation
to
to
see
the
very
first
result
for
the
MS
MSF
next
Oh.
B
Before
we
we
go
into
the
simulation
things
like
if
I
may
so
you've
seen
that
we
have
been
discussing
for
the
joint
process
that
will
will
put.
We
use
the
class
field
of
the
IGC
setter
to
tag
at
least
the
joint
process,
and-
and
it
has
to
be
consistent
with
what
this
yes
f
does.
So
there
will
be
a
need
to
add
some
text
in
MSF
to
say
for
this
class.
B
The
number
are
475
for
12
and
16,
and
you
increment
by
one
or
different
by
one,
but
that's
for
class
blah
and
for
for
hello,
maybe
you
don't
say
for
a
particle
class
before
a
range
of
classes
right
then
we
can
work
that
out
on
meaningless,
but
there
will
be
an
addition.
It
will
be
needed
there,
yeah.
O
O
Yeah,
so
this
is
a
similar
mutation
done
by
militia,
and
the
source.
Coder
is
a
indicated
by
the
link
under
this
title,
and
the
big
figure
in
in
the
middle
is
what
it
looks
like
words
when
the
similar
isn't
running
and
for
one
Henry.
Southern
storm
cycles
and
15
owns
our
children
and
randomly
deployed
in
a
two
by
two
kilometer
area,
and
each
node
has
at
least
three
neighbors.
O
O
E
Shiva,
hello
template
so
in
your
address
and
when
you
see
the
case,
Oh,
switching
parent
and
you
have
to
adjust
your
schedule
so,
for
example,
if
a
node
has,
for
example,
20
child
notes
and
then
that
note
switches
parents,
as
your
scheduling
algorithm
still
like
really,
you
know,
remove
sales
one
by
one
and
then
in
other
case
you
will
add
sales
one
by
one
I
its
slide.
8.
O
D
O
G
O
And
also
we
do
we
did
a
Department
on
IOT
lab
implemented
in
the
two
with
the
MS
app
for
Sprint
and
deployed
a
study.
Pam
knows
exactly
how
to
my
website
and
we
have
some
preliminary
it's
out
on
the
bottom
left.
First,
one
is
showing
how
the
rank
is
involved
here
in
time.
You
can
see
the
non
ranking
very
still
stay
stable.
After
joining
and
in
the
middle
we
calculate
the
end-to-end
reliability
on
most
known,
so
all
most
of
them
reached
100%
and
the
duty
cycle.
All
the
nodes
are
averaging
below
one
person.
O
O
So
it
is
so
it
is
a
results
running
in
Excel.
We
had
some
closure
and
32.
It
works
and
also
simple
to
implement,
and
we
have
the
broadcaster
strategy
on
the
minister
and
it's
a
indeed
to
leverage
the
traffic
on
helps
for
also
have
60.
Actually,
there's
something
we
figure
out
is
how
to
function
know.
So
we
have
some
knowledge.
You
learn
from
the
imitation
the
one
is
gathering
inconsistencies
detected,
the
safety,
clear
request
and
the
response
should
exchange
and
min
himself,
because
they're
scheduled
in
consistent
consistency
there.
O
O
G
O
A
O
O
A
L
J
Hello
Remy
here
what
is
so
I
said.
One
is
scheduling,
function
to
reserve
a
track
to
our
destination.
Multipole
helps
our
way
in
order
to
fulfill
the
bandwidth
and
the
queues
requirements
of
the
sender,
and
the
tracker
reservation
is
conducted
how
backup
in
a
distributed
manner
and
basically
as
if
Y
is
a
combination
of
rsvp-te
and
the
6p
in
which
rsvp-te
is
used
for
end-to-end
resource
reservation
and
6p
is
used
for
the
sound
negotiation
between
two
neighbors
and
sfy
is
triggered
in
two
situations.
J
The
first
one
is
when
the
sender
has
a
new
instance
to
transmit
the
data
to
the
receiver.
The
second
wise,
when
the
sender
has
new
requirements
for
an
existing
instance
and
in
the
end
to
end
the
perspective
Wi-Fi
is
triggered.
The
sender
should
send
a
pass
message:
how
backup
downstream
to
the
receiver
and
the
and
upon
receiving
the
the
past
message.
The
receiver
shoe
verify
should
initiate
6p
transaction
to
verify
if
the
INF
cells
to
fulfill
their
requirements
and
if
so
the
the
receiver
should
have
sent
back
sure.
J
Since
the
restore
message
to
reserve
the
cells
and
for
an
intermediate
note
upon
receiving
the
reservation
message,
the
the
note
should
reserve
the
sales
in
Wahab
in
the
same
way
as
in
step
2.
And
finally,
when
there
is
reservation,
a
message
arrives
at
their
cinder
before
the
end.
The
to
in
a
time-out,
attract
from
the
sender
to
the
receiver
is
built
successfully
and
the
press
and
the
reserve
message
is
defining
in
our
RSVP.
J
We
have
done
manner
extensions
to
this
message
formats
and
the
past
message
includes
the
sender
to
spec
objects
to
describe
the
flow
and
the
aspect
objects
to
collect
and
past
properties,
and
we
use
shreya
request
object
to
verify.
If
the
note
along
the
road
I've
had
request
the
capabilities
that
that
is
the
time,
switching
capability
and
the
SF
1
the
6p
capabilities
and
for
the
return
message.
G
J
J
The
one-half
of
reservation
is
triggered
by
the
arrival
of
past
message.
If
BB
is
the
receiver
all
by
the
arrival
of
reserved
reservation
message,
if
note
B
is
an
intermediate
note
and
as
then
nobody
should
map
the
banner
waste
to
a
number
of
cells
and
occurs
to
a
constraints
on
sales,
for
example
the
start
frame
and
starts
off
site,
Citra
and
and
then
note
of
issue
the
initiates
the
6p
front
section,
with
no
way
to
verify.
J
If
there
are
some
qualified
ourselves,
if
the
answer
is
positive,
not
be
sure
to
transmitted
the
reserved
message
to
to
another
a
once.
The
reservation
message
arrives
at
node.
A
the
cells
between
these
two
nodes
are
reserved
and
the
label
is
also
signed
and
more
details
can
be
found
in
this
state
transition,
diagram
and
and
no
they
and
the
one-half
cell
reservation
is
triggered
by
the
aforementioned
conditions
and
then
not
be
sure
to
contact
the
carbon
mapping
to
find
some
qualified
salt
frames.
J
So
the
track
ID
currently
is
16
bits
in
Denver.
Yes,
sir
San
by
the
by
the
better
sender
and
the
track,
ID
is
mapped
from
the
tuple
source
and
destination.
Ip
addresses
repo
instance
and
the
track
ID
is
encapsulated
in
the
cinder
templates,
object,
I'll,
pass
message
and
the
filter
spec
of
reserved
message
and
the
label
is
32
bits.
It
is
mapped
from
the
commander
of
sales
between
two
neighbor
nodes
and
it
is
encapsulated
in
the
label
object
of
reserved
message.
It
is
local,
invalidate
between
universe
and
they're,
assigned
by
the
dance
room
note.
J
So
for
the
next
step
we'll
we
will
complete
the
definition
of
6pn
of
SF
1
and
to
cover
some
objects
and
and
message
formats
and,
of
course,
this.
There
is
a
gap
to
be
covered,
which
is
how
to
map
the
traffic
requirements
to
to
number
of
cells
and
the
constraints
ourselves,
and
we
will
also
cover
the
atoms.
J
A
Thank
you
we're
running
out
of
time,
so
I
propose
that
we
take
I,
have
a
bunch
of
comments
and
bunch
of
clarifying
questions,
but
I
I
propose
that
we
do
the
discussion
remaining
list
right
now.
Okay,
okay,
thank
you.
Thank
you
very
much,
and
with
this
we
are
at
the
not
the
top
of
the
hour,
but
that,
like
at
the
end
of
the
reading
any
other
business
before
we
close
the
meeting,
okay
hurry,
nothing.
Thank
you
very
much.
Thank
you.