Lectures notes for 2010 - KTH

Active networks
A
C
F,d
C
F(d)
A B C
m
F,d
B
m
F(d)
F(d)
m
C
C
F,d
C
f(d)
A B C
G(e)
A
A
C
G,F,d
G,e
A
B
C
Multicast F(d)
F(d)
m
D
E
Routing: G(F,d) ⇒ E
Data: F(d) or F(G,d)
B acts as an intermediary between A and x:
(1) operates on the data as it passes through using the “program” F and/or
(2) routes based on the computed address using a “program” G
Packets carry the program that each node on the path is to execute.
{Even the program(s) can be transformed as the packet propagates.}
F(d)
E
D
E
Maguire Active networks 13: 38 of 91
maguire@kth.se 2010.03.21 Internetworking/Internetteknik