Skip to main content

Table 1 Routing concept

From: Efficient network coding solutions for limiting the effect of packet loss

(a) Coding at node n i

Updates at node n i+1

 

Unicast:

False

Unicast:

True

 

Addr1:

A

Addr1:

A

 

Addr2:

B

Addr2:

B

 

Coming from:

n i

Coming from:

n i+1

 

Nb. of packets:

2

Nb. of packets:

2

 

ID:

123

ID:

123

 

Source:

A

Source:

A

 

Exist at dest.:

False

Exist at dest.:

False

 

Next hop:

n i+1

Next hop:

n i+2

 

ID:

124

ID:

124

 

Source:

B

Source:

B

 

Exist at dest.:

False

Exist at dest.:

True

 

Next hop:

n i−1

Next hop:

n i